REVIEW 3 cited by
Laplace Meets Moreau: Smooth Approximation to Infimal Convolutions Using Laplace's Method
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We study approximations to the Moreau envelope -- and infimal convolutions more broadly -- based on Laplace's method, a classical tool in analysis which ties certain integrals to suprema of their integrands. We believe the connection between Laplace's method and infimal convolutions is generally deserving of more attention in the study of optimization and partial differential equations, since it bears numerous potentially important applications, from proximal-type algorithms to solving Halmiton-Jacobi equations.
Forward citations
Cited by 3 Pith papers
-
Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
A penalty-based unconstrained continuous formulation of hybrid SAT preserves the satisfiability reduction, and penalty terms can be omitted exactly for constraints like OR, XOR, and NAE, which are called rounding-friendly.
-
Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
Inexact proximal point methods, with Gibbs-sampling or tensor-train estimates of the proximal operator, converge to the global minimum of nonconvex black-box functions under a gap assumption.
-
Accuracy Improvements for Convolutional and Differential Distance Function Approximations
New asymptotic blends and Taylor extrapolations improve two families of distance-to-boundary estimators, demonstrated on 2D images.
Discussion (0). Continue with ORCID to comment.