Copertina

Grams: Gradient Descent with Adaptive Momentum Scaling

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Cao, Yang, Li, Xiaoyu, Song, Zhao
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Artificial Intelligence Data Structures and Algorithms Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Negative Stepsizes Make Gradient-Descent-Ascent Converge
di: Shugart, Henry, et al.
Pubblicazione: (2025)

Adaptive Frontier Exploration on Graphs with Applications to Network-Based Disease Testing
di: Choo, Davin, et al.
Pubblicazione: (2025)

Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing
di: Li, Shuyao, et al.
Pubblicazione: (2024)

Negative Momentum for Convex-Concave Optimization
di: Shugart, Henry, et al.
Pubblicazione: (2026)

Convergence Analysis of Two-Layer Neural Networks under Gaussian Input Masking
di: Kolomvaki, Afroditi, et al.
Pubblicazione: (2026)

A Survey on Algorithmic Developments in Optimal Transport Problem with Applications
di: Moradi, Sina
Pubblicazione: (2025)

Gradient Testing and Estimation by Comparisons
di: Tao, Xiwen, et al.
Pubblicazione: (2024)

Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems
di: Blanchard, Moise
Pubblicazione: (2024)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
di: Tarzanagh, Davoud Ataee, et al.
Pubblicazione: (2022)

Gradient-Free Method for Heavily Constrained Nonconvex Optimization
di: Shi, Wanli, et al.
Pubblicazione: (2024)

Accelerating Proximal Gradient Descent via Silver Stepsizes
di: Bok, Jinho, et al.
Pubblicazione: (2024)

Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent
di: Altschuler, Jason M., et al.
Pubblicazione: (2026)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
di: Shah, Harsh, et al.
Pubblicazione: (2025)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
di: Gu, Yuzhou, et al.
Pubblicazione: (2023)

Robust Learning of a Group DRO Neuron
di: Cao, Guyang, et al.
Pubblicazione: (2026)

Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective
di: Diakonikolas, Jelena, et al.
Pubblicazione: (2024)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
di: Grigorescu, Elena, et al.
Pubblicazione: (2024)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
di: Grigorescu, Elena, et al.
Pubblicazione: (2024)

Learning-Augmented Algorithms for the Bahncard Problem
di: Zhao, Hailiang, et al.
Pubblicazione: (2024)

Extended convexity and smoothness and their applications in deep learning
di: Qi, Binchuan, et al.
Pubblicazione: (2024)

Omnipredicting Single-Index Models with Multi-Index Models
di: Hu, Lunjia, et al.
Pubblicazione: (2024)

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
di: Cai, Yang, et al.
Pubblicazione: (2022)

Importance Sparsification for Sinkhorn Algorithm
di: Li, Mengyu, et al.
Pubblicazione: (2023)

Infrequent Resolving Algorithm for Online Linear Programming
di: Li, Guokai, et al.
Pubblicazione: (2024)

Convergence analysis of wide shallow neural operators within the framework of Neural Tangent Kernel
di: Xu, Xianliang, et al.
Pubblicazione: (2024)

Distributionally Robust Optimization with Adversarial Data Contamination
di: Li, Shuyao, et al.
Pubblicazione: (2025)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
di: Zhang, Hongyang R., et al.
Pubblicazione: (2023)

Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise
di: Li, Shuyao, et al.
Pubblicazione: (2024)

Separating Oblivious and Adaptive Models of Variable Selection
di: Chen, Ziyun, et al.
Pubblicazione: (2026)

Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
di: Song, Zhao, et al.
Pubblicazione: (2025)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
di: Jambulapati, Arun, et al.
Pubblicazione: (2024)

Optimal Decentralized Smoothed Online Convex Optimization
di: Bhuyan, Neelkamal, et al.
Pubblicazione: (2024)

Non-Euclidean High-Order Smooth Convex Optimization
di: Contreras, Juan Pablo, et al.
Pubblicazione: (2024)

Truncated Variance Reduced Value Iteration
di: Jin, Yujia, et al.
Pubblicazione: (2024)

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
di: Chae, Woojin, et al.
Pubblicazione: (2024)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
di: Kim, Jung-hun, et al.
Pubblicazione: (2021)

Constrained and Composite Sampling via Proximal Sampler
di: Dang, Thanh, et al.
Pubblicazione: (2026)

Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
di: Fountoulakis, Kimon, et al.
Pubblicazione: (2026)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
di: Ferreira, Ricardo N., et al.
Pubblicazione: (2025)

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
di: Shugart, Henry, et al.
Pubblicazione: (2025)