Escaping the Local Minima via Simulated Annealing: Optimization of
Approximately Convex Functions

Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions

28 January 2015

Hariharan Narayanan

Alexander Rakhlin

Papers citing "Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions"

11 / 11 papers shown

Title
Learning (Approximately) Equivariant Networks via Constrained Optimization Andrei Manolache Luiz F.O. Chamon Mathias Niepert 17 0 0 19 May 2025
Quantum Speedups of Optimizing Approximately Convex Functions with Applications to Logarithmic Regret Stochastic Convex Bandits Tongyang Li Ruizhe Zhang 34 14 0 26 Sep 2022
A gradient estimator via L1-randomization for online zero-order optimization with two point feedback A. Akhavan Evgenii Chzhen Massimiliano Pontil Alexandre B. Tsybakov 35 19 0 27 May 2022
Tackling benign nonconvexity with smoothing and stochastic gradients Harsh Vardhan Sebastian U. Stich 31 8 0 18 Feb 2022
Spectral risk-based learning using unbounded losses Matthew J. Holland El Mehdi Haress 24 10 0 11 May 2021
Hardness results for Multimarginal Optimal Transport problems Jason M. Altschuler Enric Boix-Adserà OT 29 30 0 10 Dec 2020
Breaking Reversibility Accelerates Langevin Dynamics for Global Non-Convex Optimization Xuefeng Gao Mert Gurbuzbalaban Lingjiong Zhu 27 30 0 19 Dec 2018
Simulated Tempering Langevin Monte Carlo II: An Improved Proof using Soft Markov Chain Decomposition Rong Ge Holden Lee Andrej Risteski 24 28 0 29 Nov 2018
On the Local Minima of the Empirical Risk Chi Jin Lydia T. Liu Rong Ge Michael I. Jordan FedML 21 56 0 25 Mar 2018
Beyond Log-concavity: Provable Guarantees for Sampling Multi-modal Distributions using Simulated Tempering Langevin Monte Carlo Rong Ge Holden Lee Andrej Risteski 41 54 0 07 Oct 2017
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization Vitaly Feldman Cristóbal Guzmán Santosh Vempala 29 89 0 30 Dec 2015