Copertina

Beyond Scaffold: A Unified Spatio-Temporal Gradient Tracking Method

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Huang, Yan, Xu, Jinming, Chen, Jiming, Johansson, Karl Henrik
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Optimization and Control 90C06
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Pareto-optimal Trade-offs Between Communication and Computation with Flexible Gradient Tracking
di: Huang, Yan, et al.
Pubblicazione: (2025)

Fully First-Order Methods for Decentralized Bilevel Optimization
di: Wang, Xiaoyu, et al.
Pubblicazione: (2024)

Variance-Reduced Fast Operator Splitting Methods for Generalized Equations
di: Tran-Dinh, Quoc
Pubblicazione: (2025)

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

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
di: Tran-Dinh, Quoc, et al.
Pubblicazione: (2024)

Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems
di: Tran-Dinh, Quoc
Pubblicazione: (2024)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
di: Liang, Ling, et al.
Pubblicazione: (2024)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
di: Tran-Dinh, Quoc, et al.
Pubblicazione: (2025)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
di: Lin, Zhenwei, et al.
Pubblicazione: (2022)

Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients
di: Garg, Sachin, 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)

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

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

An Optimistic Gradient Tracking Method for Distributed Minimax Optimization
di: Huang, Yan, et al.
Pubblicazione: (2025)

Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction
di: Roth, Jake, et al.
Pubblicazione: (2024)

Randomized Subspace Nesterov Accelerated Gradient
di: Omiya, Gaku, et al.
Pubblicazione: (2026)

Faster Adaptive Optimization via Expected Gradient Outer Product Reparameterization
di: DePavia, Adela, et al.
Pubblicazione: (2025)

Beyond Suspension: A Two-phase Methodology for Concluding Sports Leagues
di: Hassanzadeh, Ali, et al.
Pubblicazione: (2024)

High Probability Guarantees for Random Reshuffling
di: Yu, Hengxu, et al.
Pubblicazione: (2023)

Alternating minimization for square root principal component pursuit
di: Deng, Shengxiang, et al.
Pubblicazione: (2024)

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

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
di: Chen, Kaihuang, et al.
Pubblicazione: (2025)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
di: Giang-Tran, Khanh-Hung, et al.
Pubblicazione: (2023)

Stochastic versus Deterministic in Stochastic Gradient Descent
di: Li, Runze, et al.
Pubblicazione: (2025)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
di: Hou, Di, et al.
Pubblicazione: (2023)

Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
di: Davis, Damek, et al.
Pubblicazione: (2024)

Stochastic Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations
di: Tran-Dinh, Quoc
Pubblicazione: (2024)

A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
di: Bao, Chenglong, et al.
Pubblicazione: (2025)

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

Bilevel Learning via Inexact Stochastic Gradient Descent
di: Salehi, Mohammad Sadegh, et al.
Pubblicazione: (2025)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
di: Jin, Ruinan, et al.
Pubblicazione: (2024)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
di: Yang, Lei, et al.
Pubblicazione: (2023)

Representation and Regression Problems in Neural Networks: Relaxation, Generalization, and Numerics
di: Liu, Kang, et al.
Pubblicazione: (2024)

A New Kernel Regularity Condition for Distributed Mirror Descent: Broader Coverage and Simpler Analysis
di: Qiu, Junwen, et al.
Pubblicazione: (2026)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
di: Latafat, Puya, et al.
Pubblicazione: (2023)

Tractable downfall of basis pursuit in structured sparse optimization
di: Marmary, Maya V., et al.
Pubblicazione: (2025)

Adaptive proximal gradient methods are universal without approximation
di: Oikonomidis, Konstantinos A., et al.
Pubblicazione: (2024)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
di: Latafat, Puya, et al.
Pubblicazione: (2023)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
di: Ou, Hongjia, et al.
Pubblicazione: (2024)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
di: Bao, Chenglong, et al.
Pubblicazione: (2024)