Cover Image

A quantitative Robbins-Siegmund theorem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Neri, Morenikeji, Powell, Thomas
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning Logic Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An abstract effective convergence theorem for stochastic processes, with applications to stochastic approximation
by: Neri, Morenikeji, et al.
Published: (2025)

Generalized fluctuation bounds for stochastic algorithms in the presence of compactness
by: Neri, Morenikeji, et al.
Published: (2026)

Extensions of Robbins-Siegmund Theorem with Applications in Reinforcement Learning
by: Liu, Xinyu, et al.
Published: (2025)

On quantitative convergence for stochastic processes: Crossings, fluctuations and martingales
by: Neri, Morenikeji, et al.
Published: (2024)

Proof mining and probability theory
by: Neri, Morenikeji, et al.
Published: (2024)

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

A finitary Kronecker's lemma and large deviations in the Strong Law of Large numbers on Banach spaces
by: Neri, Morenikeji
Published: (2024)

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

A Distributional View of High Dimensional Optimization
by: Benning, Felix
Published: (2025)

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

A Fisher-Rao gradient flow for entropic mean-field min-max games
by: Lascu, Razvan-Andrei, et al.
Published: (2024)

When Machine Learning Meets Importance Sampling: A More Efficient Rare Event Estimation Approach
by: Zhao, Ruoning, et al.
Published: (2025)

Deep Learning as the Disciplined Construction of Tame Objects
by: Bareilles, Gilles, et al.
Published: (2025)

Policy Synthesis for Interval MDPs via Polyhedral Lyapunov Functions
by: Monir, Negar, et al.
Published: (2026)

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

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

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

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

Learning-Based Pricing and Matching for Two-Sided Queues
by: Yang, Zixian, et al.
Published: (2024)

Data-driven Multistage Distributionally Robust Linear Optimization with Nested Distance
by: Gao, Rui, et al.
Published: (2024)

Regret of exploratory policy improvement and $q$-learning
by: Tang, Wenpin, et al.
Published: (2024)

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

The generator gradient estimator is an adjoint state method for stochastic differential equations
by: Badolle, Quentin, et al.
Published: (2024)

Convergence rates for the Adam optimizer
by: Dereich, Steffen, et al.
Published: (2024)

Large Deviation Upper Bounds and Improved MSE Rates of Nonlinear SGD: Heavy-tailed Noise and Power of Symmetry
by: Armacki, Aleksandar, et al.
Published: (2024)

Linear convergence of proximal descent schemes on the Wasserstein space
by: Lascu, Razvan-Andrei, et al.
Published: (2024)

Prelimit Coupling and Steady-State Convergence of Constant-stepsize Nonsmooth Contractive SA
by: Zhang, Yixuan, et al.
Published: (2024)

Model Predictive Control is Almost Optimal for Restless Bandit
by: Gast, Nicolas, et al.
Published: (2024)

Mirror Descent-Ascent for mean-field min-max problems
by: Lascu, Razvan-Andrei, et al.
Published: (2024)

Structure Matters: Dynamic Policy Gradient
by: Klein, Sara, et al.
Published: (2024)

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

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)

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)

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

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

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)