Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing
Zeji Yi, Chaoyi Pan, Guanya Shi, and Guannan Qu

TL;DR
This paper analyzes the convergence of sampling-based nonconvex optimization methods by viewing them as gradient descent on a smoothed landscape, introducing a new algorithm with proven convergence guarantees.
Contribution
It provides a non-asymptotic convergence analysis of SBO via smoothing, introduces the DIDA algorithm, and explores the landscape benefits and trade-offs of smoothing.
Findings
Smoothing enlarges the locally convex region around the global minimizer.
Smoothing introduces an optimality gap that trade-offs landscape benignness.
DIDA algorithm converges to the global optimum and outperforms other methods.
Abstract
Sampling-based optimization (SBO), like cross-entropy method and evolutionary algorithms, has achieved many successes in solving non-convex problems without gradients, yet its convergence is poorly understood. In this paper, we establish a non-asymptotic convergence analysis for SBO through the lens of smoothing. Specifically, we recast SBO as gradient descent on a smoothed objective, mirroring noise-conditioned score ascent in diffusion models. Our first contribution is a landscape analysis of the smoothed objective, demonstrating how smoothing helps escape local minima and uncovering a fundamental coverage-optimality trade-off: smoothing renders the landscape more benign by enlarging the locally convex region around the global minimizer, but at the cost of introducing an optimality gap. Building on this insight, we establish non-asymptotic convergence guarantees for SBO algorithms to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
