Image de couverture de livre

Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameters

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Vidyasagar, Mathukumalli
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control Machine Learning 65K10, 68Q25, 68W20
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Convergence of the Stochastic Heavy Ball Method With Approximate Gradients and/or Block Updating
par: Tadipatri, Uday Kiran Reddy, et autres
Publié: (2023)

An Asymptotically Optimal Coordinate Descent Algorithm for Learning Bayesian Networks from Gaussian Models
par: Xu, Tong, et autres
Publié: (2024)

Stochastic Mirror Descent for Convex Optimization with Consensus Constraints
par: Borovykh, Anastasia, et autres
Publié: (2022)

A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems
par: Bergou, El Houcine, et autres
Publié: (2023)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
par: Cai, HanQin, et autres
Publié: (2023)

Where Have All the Kaczmarz Iterates Gone?
par: Bergou, El Houcine, et autres
Publié: (2025)

Randomized Matrix Sketching for Neural Network Training and Gradient Monitoring
par: Antil, Harbir, et autres
Publié: (2025)

Approximating k-Center via Farthest-First on $δ$-Covers
par: Wilson, Jason R.
Publié: (2026)

An adaptive framework for first-order gradient methods
par: Hu, Xiaozhe, et autres
Publié: (2026)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
par: Condat, Laurent, et autres
Publié: (2022)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
par: Tondji, Lionel, et autres
Publié: (2025)

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
par: Azizian, Waïss, et autres
Publié: (2022)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
par: Bauschke, Heinz H., et autres
Publié: (2025)

Fixed-Point Neural Optimal Transport without Implicit Differentiation
par: Park, Yesom, et autres
Publié: (2026)

Power Homotopy for Zeroth-Order Non-Convex Optimizations
par: Xu, Chen
Publié: (2025)

Generalized sparsity-promoting solvers for Bayesian inverse problems: Versatile sparsifying transforms and unknown noise variances
par: Lindbloom, Jonathan, et autres
Publié: (2024)

Global Optimization with A Power-Transformed Objective and Gaussian Smoothing
par: Xu, Chen
Publié: (2024)

Have ASkotch: A Neat Solution for Large-scale Kernel Ridge Regression
par: Rathore, Pratik, et autres
Publié: (2024)

Primal-Dual Coordinate Descent for Nonconvex-Nonconcave Saddle Point Problems Under the Weak MVI Assumption
par: Walwil, Iyad, et autres
Publié: (2025)

Learning nonnegative matrix factorizations from compressed data
par: Chaudhry, Abraar, et autres
Publié: (2024)

Convergence of policy gradient methods for finite-horizon exploratory linear-quadratic control problems
par: Giegrich, Michael, et autres
Publié: (2022)

Improved Convergence Factor of Windowed Anderson Acceleration for Symmetric Fixed-Point Iterations
par: Garner, Casey, et autres
Publié: (2023)

Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies
par: Roith, Tim, et autres
Publié: (2025)

On the Optimality of the Oja's Algorithm for Online PCA
par: Liang, Xin
Publié: (2021)

A Proximal-Gradient Method for Constrained Optimization
par: Dai, Yutong, et autres
Publié: (2024)

Convex optimization over a probability simplex
par: Chok, James, et autres
Publié: (2023)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
par: Curtis, Frank E., et autres
Publié: (2025)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
par: Yuan, Ya-xiang, et autres
Publié: (2024)

On the Curse of Memory in Recurrent Neural Networks: Approximation and Optimization Analysis
par: Li, Zhong, et autres
Publié: (2020)

Progressive Power Homotopy for Non-convex Optimization
par: Xu, Chen
Publié: (2026)

Hybrid hierarchical matrices with adaptive mixed precision storage
par: Khan, Ritesh, et autres
Publié: (2026)

Curvature-Aware Derivative-Free Optimization
par: Kim, Bumsu, et autres
Publié: (2021)

Deterministic computation of quantiles in a Lipschitz framework
par: Gu, Yurun, et autres
Publié: (2024)

Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
par: Lok, Jackie, et autres
Publié: (2025)

Recent Advances in Non-convex Smoothness Conditions and Applicability to Deep Linear Neural Networks
par: Patel, Vivak, et autres
Publié: (2024)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
par: Gupta, Swati, et autres
Publié: (2026)

On Maximum-a-Posteriori estimation with Plug & Play priors and stochastic gradient descent
par: Laumont, Rémi, et autres
Publié: (2022)

The average-case complexity of the Word Problem for groups of matrices over $\mathbb{Z}$ is linear
par: Bassino, Frédérique, et autres
Publié: (2025)

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
par: Rokhlin, Dmitry B., et autres
Publié: (2025)

A hierarchical Vovk-Azoury-Warmuth forecaster with discounting for online regression in RKHS
par: Rokhlin, Dmitry B.
Publié: (2025)