Cover Image

Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lim, Dong-Young, Sabanis, Sotirios
Format:	Preprint
Published:	2021
Subjects:	Machine Learning Optimization and Control Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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)

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

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

Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimization
by: Akyildiz, Ömer Deniz, et al.
Published: (2020)

Approximation and interpolation of deep neural networks
by: Constantinescu, Vlad-Raul, et al.
Published: (2023)

kTULA: A Langevin sampling algorithm with improved KL bounds under super-linear log-gradients
by: Lytras, Iosif, et al.
Published: (2025)

Convergence Error Analysis of Reflected Gradient Langevin Dynamics for Globally Optimizing Non-Convex Constrained Problems
by: Sato, Kanji, et al.
Published: (2022)

Non-asymptotic convergence analysis of the stochastic gradient Hamiltonian Monte Carlo algorithm with discontinuous stochastic gradient with applications to training of ReLU neural networks
by: Liang, Luxu, et al.
Published: (2024)

On the SAGA algorithm with decreasing step
by: Fredes, Luis, et al.
Published: (2024)

Taming the Interacting Particle Langevin Algorithm: The Superlinear case
by: Johnston, Tim, et al.
Published: (2024)

Interacting Particle Langevin Algorithm for Maximum Marginal Likelihood Estimation
by: Akyildiz, Ö. Deniz, et al.
Published: (2023)

ODE approximation for the Adam algorithm: General and overparametrized setting
by: Dereich, Steffen, et al.
Published: (2025)

A stochastic gradient descent algorithm with random search directions
by: Gbaguidi, Eméric
Published: (2025)

Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithm
by: Eckstein, Stephan
Published: (2023)

Function approximation by neural nets in the mean-field regime: Entropic regularization and controlled McKean-Vlasov dynamics
by: Tzen, Belinda, et al.
Published: (2020)

Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective
by: Srinivasan, Vishwak, et al.
Published: (2025)

Weak Convergence Analysis of Online Neural Actor-Critic Algorithms
by: Lam, Samuel Chun-Hei, et al.
Published: (2024)

Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks
by: Hu, Jie, et al.
Published: (2024)

Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite Optimization
by: Cory-Wright, Ryan, et al.
Published: (2025)

Algorithmic Stability of Stochastic Gradient Descent with Momentum under Heavy-Tailed Noise
by: Dang, Thanh, et al.
Published: (2025)

Convergence of Unadjusted Langevin in High Dimensions: Delocalization of Bias
by: Chen, Yifan, et al.
Published: (2024)

Model Predictive Control is almost Optimal for Heterogeneous Restless Multi-armed Bandits
by: Narasimha, Dheeraj, et al.
Published: (2025)

A Generalization Result for Convergence in Learning-to-Optimize
by: Sucker, Michael, et al.
Published: (2024)

Properties of Discrete Sliced Wasserstein Losses
by: Tanguy, Eloi, et al.
Published: (2023)

Non-convex entropic mean-field optimization via Best Response flow
by: Lascu, Razvan-Andrei, et al.
Published: (2025)

Decoupled Functional Central Limit Theorems for Two-Time-Scale Stochastic Approximation
by: Han, Yuze, et al.
Published: (2024)

On propagation of chaos for the Fisher-Rao gradient flow in entropic mean-field optimization
by: Lazić, Petra, et al.
Published: (2026)

Value Mirror Descent for Reinforcement Learning
by: Jia, Zhichao, et al.
Published: (2026)

Improved sampling via learned diffusions
by: Richter, Lorenz, et al.
Published: (2023)

Asymptotic regularity of a generalised stochastic Halpern scheme
by: Pischke, Nicholas, et al.
Published: (2024)

Generalized Wasserstein Flow Matching: Transport Plans, Everywhere, All at Once
by: Piening, Moritz, et al.
Published: (2026)

Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise
by: Agrawal, Shubhada, et al.
Published: (2026)

Admission Control of Quasi-Reversible Queueing Systems: Optimization and Reinforcement Learning
by: Comte, Céline, et al.
Published: (2025)

Controlling the Flow: Stability and Convergence for Stochastic Gradient Descent with Decaying Regularization
by: Kassing, Sebastian, et al.
Published: (2025)

Representative Action Selection for Large Action Space Bandit Families
by: Zhou, Quan, et al.
Published: (2025)

Posterior Sampling Based on Gradient Flows of the MMD with Negative Distance Kernel
by: Hagemann, Paul, et al.
Published: (2023)

Convergence of SGD for Training Neural Networks with Sliced Wasserstein Losses
by: Tanguy, Eloi
Published: (2023)

Stochastic Inverse Problem: stability, regularization and Wasserstein gradient flow
by: Li, Qin, et al.
Published: (2024)