Copertina

Convergence of Two Time-Scale Stochastic Approximation: A Martingale Approach

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Vidyasagar, Mathukumalli
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning Probability 90C26
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Stochastic Gradient Descent Revisited
di: Louzi, Azar
Pubblicazione: (2024)

Optimal Asymptotic Rates for (Stochastic) Gradient Descent under the Local PL-Condition: A Geometric Approach
di: Kassing, Sebastian, et al.
Pubblicazione: (2026)

A Generalized Version of Chung's Lemma and its Applications
di: Jiang, Li, et al.
Pubblicazione: (2024)

A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties
di: Qiu, Junwen, et al.
Pubblicazione: (2023)

Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats
di: K, Mishal Assif P, et al.
Pubblicazione: (2019)

On the Convergence of Gradient Descent for Large Learning Rates
di: Crăciun, Alexandru, et al.
Pubblicazione: (2024)

Convex Regularization and Convergence of Policy Gradient Flows under Safety Constraints
di: Malo, Pekka, et al.
Pubblicazione: (2024)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
di: Engquist, Björn, et al.
Pubblicazione: (2022)

Estimating large causal polytrees from small samples
di: Chatterjee, Sourav, et al.
Pubblicazione: (2022)

Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameters
di: Vidyasagar, Mathukumalli
Pubblicazione: (2025)

Clust-Splitter - an Efficient Nonsmooth Optimization-Based Algorithm for Clustering Large Datasets
di: Lampainen, Jenni, et al.
Pubblicazione: (2025)

Stochastic Control Methods for Optimization
di: Qiu, Jinniao
Pubblicazione: (2026)

Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
di: Xie, Yue, et al.
Pubblicazione: (2024)

Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning
di: Qiu, Junwen, et al.
Pubblicazione: (2026)

A Fisher-Rao gradient flow for entropy-regularised Markov decision processes in Polish spaces
di: Kerimkulov, Bekzhan, et al.
Pubblicazione: (2023)

Step-Size Stability in Stochastic Optimization: A Theoretical Perspective
di: Schaipp, Fabian, et al.
Pubblicazione: (2026)

Convergence of gradient descent for deep neural networks
di: Chatterjee, Sourav
Pubblicazione: (2022)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
di: Yao, Tongliang, et al.
Pubblicazione: (2024)

Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing
di: Yi, Zeji, et al.
Pubblicazione: (2026)

What is the long-run distribution of stochastic gradient descent? A large deviations analysis
di: Azizian, Waïss, et al.
Pubblicazione: (2024)

Exponential convergence rates for momentum stochastic gradient descent in the overparametrized setting
di: Gess, Benjamin, et al.
Pubblicazione: (2023)

SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning
di: Karagulyan, Avetik, et al.
Pubblicazione: (2024)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
di: Nandhan, Navil, et al.
Pubblicazione: (2026)

A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction
di: Milzarek, Andre, et al.
Pubblicazione: (2022)

Metric Entropy-Free Sample Complexity Bounds for Sample Average Approximation in Convex Stochastic Programming
di: Liu, Hongcheng, et al.
Pubblicazione: (2024)

Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2024)

Convergence of the Stochastic Heavy Ball Method With Approximate Gradients and/or Block Updating
di: Tadipatri, Uday Kiran Reddy, et al.
Pubblicazione: (2023)

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
di: Li, Luxuan, et al.
Pubblicazione: (2026)

A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization
di: Qiu, Junwen, et al.
Pubblicazione: (2023)

A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
di: Qiu, Junwen, et al.
Pubblicazione: (2024)

A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems
di: Wang, Junlin, et al.
Pubblicazione: (2024)

Uniform-in-time mean-field limit estimate for the Consensus-Based Optimization
di: Huang, Hui, et al.
Pubblicazione: (2024)

Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets
di: Li, Mengmeng, et al.
Pubblicazione: (2023)

Optimization without Retraction on the Random Generalized Stiefel Manifold
di: Vary, Simon, et al.
Pubblicazione: (2024)

Mean-Field Langevin Diffusions with Density-dependent Temperature
di: Huang, Yu-Jui, et al.
Pubblicazione: (2025)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
di: Prakhya, Karthik, et al.
Pubblicazione: (2026)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2025)

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems
di: Wang, Jun-Lin, et al.
Pubblicazione: (2024)

Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold
di: Sheng, Junda, et al.
Pubblicazione: (2022)