Research map / Optimization / Optimizers
Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimization
O. Deniz Akyildiz, Sotirios Sabanis
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- On the Convergence of Hamiltonian Monte Carlo with Stochastic Gradients (ICML 2021 · similarity 0.92)
- Stochastic Gradient Hamiltonian Monte Carlo Methods with Recursive Variance Reduction (NeurIPS 2019 · similarity 0.92)
- Non-asymptotic Error Bounds in $\mathcal{W}_2$-Distance with Sqrt(d) Dimension Dependence and First Order Convergence for Langevin Monte Carlo beyond Log-Concavity (ICML 2025 · similarity 0.89)
- Constrained Sampling with Primal-Dual Langevin Monte Carlo (NeurIPS 2024 · similarity 0.88)
- Hamiltonian Descent Algorithms for Optimization: Accelerated Rates via Randomized Integration Time (NeurIPS 2025 · similarity 0.88)
- Sample-and-Bound for Non-convex Optimization (AAAI 2024 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
