Imagen de Portada

Robust Analysis of Almost Sure Convergence of Zeroth-Order Mirror Descent Algorithm

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Paul, Anik Kumar, Mahindrakar, Arun D, Kalaimani, Rachel K
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Almost Sure Convergence and Non-asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm
por: Paul, Anik Kumar, et al.
Publicado: (2024)

Convergence Analysis of Stochastic Saddle Point Mirror Descent Algorithm -- A Projected Dynamical View Point
por: Paul, Anik Kumar, et al.
Publicado: (2024)

Stochastic Recursive Inclusions under Biased Perturbations: An Input-to-State Stability Perspective
por: Paul, Anik Kumar, et al.
Publicado: (2026)

Stochastic Mirror Descent under Iterate-Dependent Markov Noise: Analysis in the Asymptotic and Finite Time Regimes
por: Paul, Anik Kumar, et al.
Publicado: (2026)

Zeroth-Order Non-smooth Non-convex Optimization via Gaussian Smoothing
por: Paul, Anik Kumar, et al.
Publicado: (2025)

On the Almost Sure Convergence of the Stochastic Three Points Algorithm
por: Kadi, Taha El Bakkali El, et al.
Publicado: (2025)

Zeroth-Order Stochastic Mirror Descent Algorithms for Minimax Excess Risk Optimization
por: Gu, Zhihao, et al.
Publicado: (2024)

Regret Analysis with Almost Sure Convergence for OBF-ARX Filter
por: Li, Jiayun, et al.
Publicado: (2024)

Generalized Smooth Stochastic Variational Inequalities: Almost Sure Convergence and Convergence Rates
por: Vankov, Daniil, et al.
Publicado: (2024)

Almost Sure Convergence Analysis of Differentially Private Stochastic Gradient Methods
por: Mukherjee, Amartya, et al.
Publicado: (2025)

Almost-Surely Convergent Randomly Activated Monotone Operator Splitting Methods
por: Combettes, Patrick L., et al.
Publicado: (2024)

Almost Sure Convergence of Stochastic Approximation: An Interplay of Noise and Step Size
por: Nguyen, Quang Dinh Thien, et al.
Publicado: (2026)

Deterministic Zeroth-Order Mirror Descent via Vector Fields with A Posteriori Certification
por: Hayashi, Masahito
Publicado: (2026)

High-Probability Guarantees for Random Zeroth-Order (Stochastic) Gradient Descent
por: Ye, Haishan
Publicado: (2026)

Almost Sure Convergence of Networked Policy Gradient over Time-Varying Networks in Markov Potential Games
por: Aydin, Sarper, et al.
Publicado: (2024)

On the Inherent Privacy of Zeroth Order Projected Gradient Descent
por: Gupta, Devansh, et al.
Publicado: (2025)

High-Probability Guarantees for Random Zeroth-Order Gradient Descent on Smooth Functions
por: Ye, Haishan
Publicado: (2026)

On the Convergence of Policy in Unregularized Policy Mirror Descent
por: Lin, Dachao, et al.
Publicado: (2022)

Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise
por: Qian, Xiaochi, et al.
Publicado: (2024)

Almost Surely $\sqrt{T}$ Regret for Adaptive LQR
por: Lu, Yiwen, et al.
Publicado: (2023)

Implicit Bias and Convergence of Matrix Stochastic Mirror Descent
por: Akhtiamov, Danil, et al.
Publicado: (2026)

On the Convergence of Policy Mirror Descent with Temporal Difference Evaluation
por: Liu, Jiacai, et al.
Publicado: (2025)

Convergence of First-Order Algorithms with Momentum from the Perspective of an Inexact Gradient Descent Method
por: Khanh, Pham Duy, et al.
Publicado: (2025)

Sum-of-Squares Certificates for Almost-Sure Reachability of Stochastic Polynomial Systems
por: Kordabad, Arash Bahari, et al.
Publicado: (2025)

Second-Order Mirror Descent: Convergence in Games Beyond Averaging and Discounting
por: Gao, Bolin, et al.
Publicado: (2021)

Compressed Zeroth-Order Algorithm for Stochastic Distributed Nonconvex Optimization
por: Wang, Haonan, et al.
Publicado: (2025)

Almost Sure Convergence Rates of Stochastic Approximation and Reinforcement Learning via a Poisson-Moreau Drift
por: Liu, Xinyu, et al.
Publicado: (2026)

Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
por: Sherman, Uri, et al.
Publicado: (2025)

Global Convergence and Rate Analysis of the Steepest Descent Method for Uncertain Multiobjective Optimization via a Robust Optimization Approach
por: Kumar, Shubham, et al.
Publicado: (2025)

Convergence Rate Bounds for the Mirror Descent Method: IQCs, Popov Criterion and Bregman Divergence
por: Li, Mengmou, et al.
Publicado: (2023)

Asynchronous Distributed Reinforcement Learning for LQR Control via Zeroth-Order Block Coordinate Descent
por: Jing, Gangshan, et al.
Publicado: (2021)

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
por: Alkousa, Mohammad, et al.
Publicado: (2024)

A Zeroth-Order Proximal Algorithm for Consensus Optimization
por: Wang, Chengan, et al.
Publicado: (2024)

VAMO: Efficient Zeroth-Order Variance Reduction for SGD with Faster Convergence
por: Chen, Jiahe, et al.
Publicado: (2025)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
por: Jin, Ruiyang, et al.
Publicado: (2025)

A Parameter-Free Zeroth-Order Algorithm for Decentralized Stochastic Convex Optimization
por: Chen, Jiawei, et al.
Publicado: (2026)

Mirror Descent for Deterministic Optimal Control
por: Feng, Ye, et al.
Publicado: (2026)

Mirror Descent on Reproducing Kernel Banach Spaces
por: Kumar, Akash, et al.
Publicado: (2024)

Optimal Zeroth-Order Bilevel Optimization
por: Aghasi, Alireza, et al.
Publicado: (2025)

Randomized Gradient Descents on Riemannian Manifolds: Almost Sure Convergence to Global Minima in and beyond Quantum Optimization
por: Malvetti, Emanuel, et al.
Publicado: (2024)