Image de couverture de livre

Almost Sure Convergence and Non-asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Paul, Anik Kumar, Mahindrakar, Arun D, Kalaimani, Rachel K
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Robust Analysis of Almost Sure Convergence of Zeroth-Order Mirror Descent Algorithm
par: Paul, Anik Kumar, et autres
Publié: (2023)

Convergence Analysis of Stochastic Saddle Point Mirror Descent Algorithm -- A Projected Dynamical View Point
par: Paul, Anik Kumar, et autres
Publié: (2024)

Stochastic Recursive Inclusions under Biased Perturbations: An Input-to-State Stability Perspective
par: Paul, Anik Kumar, et autres
Publié: (2026)

On the Almost Sure Convergence of the Stochastic Three Points Algorithm
par: Kadi, Taha El Bakkali El, et autres
Publié: (2025)

Stochastic Mirror Descent under Iterate-Dependent Markov Noise: Analysis in the Asymptotic and Finite Time Regimes
par: Paul, Anik Kumar, et autres
Publié: (2026)

Generalized Smooth Stochastic Variational Inequalities: Almost Sure Convergence and Convergence Rates
par: Vankov, Daniil, et autres
Publié: (2024)

Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise
par: Qian, Xiaochi, et autres
Publié: (2024)

Almost Sure Convergence of Stochastic Approximation: An Interplay of Noise and Step Size
par: Nguyen, Quang Dinh Thien, et autres
Publié: (2026)

Almost Sure Convergence Analysis of Differentially Private Stochastic Gradient Methods
par: Mukherjee, Amartya, et autres
Publié: (2025)

Regret Analysis with Almost Sure Convergence for OBF-ARX Filter
par: Li, Jiayun, et autres
Publié: (2024)

Implicit Bias and Convergence of Matrix Stochastic Mirror Descent
par: Akhtiamov, Danil, et autres
Publié: (2026)

Almost-Surely Convergent Randomly Activated Monotone Operator Splitting Methods
par: Combettes, Patrick L., et autres
Publié: (2024)

Sum-of-Squares Certificates for Almost-Sure Reachability of Stochastic Polynomial Systems
par: Kordabad, Arash Bahari, et autres
Publié: (2025)

Convergence Rate Bounds for the Mirror Descent Method: IQCs, Popov Criterion and Bregman Divergence
par: Li, Mengmou, et autres
Publié: (2023)

Almost Sure Convergence Rates of Stochastic Approximation and Reinforcement Learning via a Poisson-Moreau Drift
par: Liu, Xinyu, et autres
Publié: (2026)

High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noise
par: Madden, Liam, et autres
Publié: (2020)

Almost Sure Convergence of Networked Policy Gradient over Time-Varying Networks in Markov Potential Games
par: Aydin, Sarper, et autres
Publié: (2024)

Zeroth-Order Non-smooth Non-convex Optimization via Gaussian Smoothing
par: Paul, Anik Kumar, et autres
Publié: (2025)

On the Convergence of Policy in Unregularized Policy Mirror Descent
par: Lin, Dachao, et autres
Publié: (2022)

Almost Surely $\sqrt{T}$ Regret for Adaptive LQR
par: Lu, Yiwen, et autres
Publié: (2023)

Efficient Online Mirror Descent Stochastic Approximation for Multi-Stage Stochastic Programming
par: Zhang, Junhui, et autres
Publié: (2025)

Zeroth-Order Stochastic Mirror Descent Algorithms for Minimax Excess Risk Optimization
par: Gu, Zhihao, et autres
Publié: (2024)

Distributed Stochastic Optimization under Heavy-Tailed Noise: A Federated Mirror Descent Approach with High Probability Convergence
par: Yu, Zhan, et autres
Publié: (2025)

On the Convergence of Policy Mirror Descent with Temporal Difference Evaluation
par: Liu, Jiacai, et autres
Publié: (2025)

Accelerated Mirror Descent for Non-Euclidean Star-convex Functions
par: Lezane, Clement, et autres
Publié: (2024)

Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
par: Sherman, Uri, et autres
Publié: (2025)

Non-Parametric Learning of Stochastic Differential Equations with Non-asymptotic Fast Rates of Convergence
par: Bonalli, Riccardo, et autres
Publié: (2023)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
par: Yuan, Bowen, et autres
Publié: (2025)

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
par: Alkousa, Mohammad, et autres
Publié: (2024)

Inertial Accelerated Stochastic Mirror Descent for Large-Scale Generalized Tensor CP Decomposition
par: Liu, Zehui, et autres
Publié: (2024)

Mirror Descent for Deterministic Optimal Control
par: Feng, Ye, et autres
Publié: (2026)

Mirror Descent on Reproducing Kernel Banach Spaces
par: Kumar, Akash, et autres
Publié: (2024)

Almost Bayesian: The Fractal Dynamics of Stochastic Gradient Descent
par: Hennick, Max, et autres
Publié: (2025)

Dictionary-Restricted First-Order Descent Methods: Bounds and Convergence Rates
par: Berasategui, Miguel, et autres
Publié: (2026)

Randomized Gradient Descents on Riemannian Manifolds: Almost Sure Convergence to Global Minima in and beyond Quantum Optimization
par: Malvetti, Emanuel, et autres
Publié: (2024)

Convergence of Alternating Gradient Descent for Matrix Factorization
par: Ward, Rachel, et autres
Publié: (2023)

Convergence Analysis of Stochastic Gradient Descent with MCMC Estimators
par: Li, Tianyou, et autres
Publié: (2023)

Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints
par: Alkousa, Mohammad S., et autres
Publié: (2026)

Parameter-free Mirror Descent
par: Jacobsen, Andrew, et autres
Publié: (2022)

Mirror Descent on Riemannian Manifolds
par: Jiang, Jiaxin, et autres
Publié: (2026)