Cover Image

Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Akyildiz, Ömer Deniz, Sabanis, Sotirios
Format:	Preprint
Published:	2020
Subjects:	Optimization and Control Computation Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On diffusion-based generative models and their error bounds: The log-concave case with full convergence estimates
by: Bruno, Stefano, et al.
Published: (2023)

Wasserstein Convergence of Score-based Generative Models under Semiconvexity and Discontinuous Gradients
by: Bruno, Stefano, et al.
Published: (2025)

Flatness-Aware Stochastic Gradient Langevin Dynamics
by: Bruno, Stefano, et al.
Published: (2025)

Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networks
by: Lim, Dong-Young, et al.
Published: (2021)

The Performance Of The Unadjusted Langevin Algorithm Without Smoothness Assumptions
by: Johnston, Tim, et al.
Published: (2025)

Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson-Romberg Extrapolation
by: Sheshukova, Marina, et al.
Published: (2024)

Langevin dynamics based algorithm e-TH$\varepsilon$O POULA for stochastic optimization problems with discontinuous stochastic gradient
by: Lim, Dong-Young, et al.
Published: (2022)

Proximal Interacting Particle Langevin Algorithms
by: Encinar, Paula Cordero, et al.
Published: (2024)

Convergence of Gradient Descent for Recurrent Neural Networks: A Nonasymptotic Analysis
by: Cayci, Semih, et al.
Published: (2024)

Multi-level Monte-Carlo Gradient Methods for Stochastic Optimization with Biased Oracles
by: Hu, Yifan, et al.
Published: (2024)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
by: Lan, Guanghui, et al.
Published: (2024)

General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization
by: Ahn, Kwangjun, et al.
Published: (2024)

Stochastic Gradients under Nuisances
by: Yu, Facheng, et al.
Published: (2025)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
by: Bodard, Alexander, et al.
Published: (2024)

Adam with model exponential moving average is effective for nonconvex optimization
by: Ahn, Kwangjun, et al.
Published: (2024)

Derivatives of Stochastic Gradient Descent in parametric optimization
by: Iutzeler, Franck, et al.
Published: (2024)

Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
by: Lyu, Hanbaek, et al.
Published: (2020)

Newton-CG methods for nonconvex unconstrained optimization with Hölder continuous Hessian
by: He, Chuan, et al.
Published: (2023)

ROOT-SGD: Sharp Nonasymptotics and Near-Optimal Asymptotics in a Single Algorithm
by: Li, Chris Junchi, et al.
Published: (2020)

Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates
by: Ji, Yao, et al.
Published: (2026)

Global convergence of optimized adaptive importance samplers
by: Akyildiz, Ömer Deniz
Published: (2022)

Stochastic Gradient Variational Inference with Price's Gradient Estimator from Bures-Wasserstein to Parameter Space
by: Kim, Kyurae, et al.
Published: (2026)

Faster Convergence of Stochastic Accelerated Gradient Descent under Interpolation
by: Mishkin, Aaron, et al.
Published: (2024)

Faster Sampling without Isoperimetry via Diffusion-based Monte Carlo
by: Huang, Xunpeng, et al.
Published: (2024)

Optimizing Stochastic Gradient Push under Broadcast Communications
by: Nguyen, Tuan, et al.
Published: (2026)

AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent
by: Surjanovic, Nikola, et al.
Published: (2025)

Convergence of SGD with momentum in the nonconvex case: A time window-based analysis
by: Qiu, Junwen, et al.
Published: (2024)

Nonasymptotic Convergence Rates for Plug-and-Play Methods With MMSE Denoisers
by: Pritchard, Henry, et al.
Published: (2025)

In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise
by: Liu, Zijian
Published: (2026)

Gradient-Informed Monte Carlo Fine-Tuning of Diffusion Models for Low-Thrust Trajectory Design
by: Graebner, Jannik, et al.
Published: (2025)

Accelerated Convergence of Stochastic Heavy Ball Method under Anisotropic Gradient Noise
by: Pan, Rui, et al.
Published: (2023)

A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
by: Liu, Wei, et al.
Published: (2025)

A stochastic smoothing framework for nonconvex-nonconcave min-sum-max problems with applications to Wasserstein distributionally robust optimization
by: Liu, Wei, et al.
Published: (2025)

Reverse Diffusion Monte Carlo
by: Huang, Xunpeng, et al.
Published: (2023)

Avoiding strict saddle points of nonconvex regularized problems
by: Bai, Luwei, et al.
Published: (2024)

Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping
by: Liu, Zijian, et al.
Published: (2024)

Momentum Does Not Reduce Stochastic Noise in Stochastic Gradient Descent
by: Sato, Naoki, et al.
Published: (2024)

Gradient Descent, Stochastic Optimization, and Other Tales
by: Lu, Jun
Published: (2022)

Stochastic Gradient Methods with Preconditioned Updates
by: Sadiev, Abdurakhmon, et al.
Published: (2022)

Stochastic Gradient Descent with Adaptive Data
by: Che, Ethan, et al.
Published: (2024)