Copertina

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Shen, Wei, Huang, Minhui, Zhang, Jiawei, Shen, Cong
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Machine Learning Information Theory Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
di: Shen, Wei, et al.
Pubblicazione: (2025)

On the Convergence Analysis of Muon
di: Shen, Wei, et al.
Pubblicazione: (2025)

MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation
di: Shen, Wei, et al.
Pubblicazione: (2025)

Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems
di: Gao, Hongchang
Pubblicazione: (2022)

A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization
di: Zhu, Yuchen, et al.
Pubblicazione: (2024)

Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
di: Lin, Tianyi, et al.
Pubblicazione: (2024)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
di: Lin, Tianyi, et al.
Pubblicazione: (2019)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
di: Zhang, Jiawei, et al.
Pubblicazione: (2020)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
di: Yu, Qian, et al.
Pubblicazione: (2024)

Shuffling Gradient Descent-Ascent with Variance Reduction for Nonconvex-Strongly Concave Smooth Minimax Problems
di: Jiang, Xia, et al.
Pubblicazione: (2024)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
di: Li, Gen, et al.
Pubblicazione: (2021)

Geometry, Computation, and Optimality in Stochastic Optimization
di: Cheng, Chen, et al.
Pubblicazione: (2019)

Multi-head Transformers Provably Learn Symbolic Multi-step Reasoning via Gradient Descent
di: Yang, Tong, et al.
Pubblicazione: (2025)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
di: Liu, Yujie, et al.
Pubblicazione: (2025)

Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization
di: Sato, Naoki, et al.
Pubblicazione: (2023)

Dissipative Gradient Descent Ascent Method: A Control Theory Inspired Algorithm for Min-max Optimization
di: Zheng, Tianqi, et al.
Pubblicazione: (2024)

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

Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
di: Huang, Ruichuan, et al.
Pubblicazione: (2025)

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

Efficient Stochastic Approximation of Minimax Excess Risk Optimization
di: Zhang, Lijun, et al.
Pubblicazione: (2023)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
di: Livni, Roi
Pubblicazione: (2024)

Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences
di: Aolaritei, Liviu, et al.
Pubblicazione: (2025)

Stochastic Adaptive Gradient Descent Without Descent
di: Aujol, Jean-François, et al.
Pubblicazione: (2025)

Federated Optimization of Smooth Loss Functions
di: Jadbabaie, Ali, et al.
Pubblicazione: (2022)

Faster Gradient Methods for Highly-Smooth Stochastic Bilevel Optimization
di: Chen, Lesi, et al.
Pubblicazione: (2025)

Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
di: Vansover-Hager, Shira, et al.
Pubblicazione: (2025)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
di: Kovalev, Dmitry
Pubblicazione: (2026)

Adaptive Federated Minimax Optimization with Lower Complexities
di: Huang, Feihu, et al.
Pubblicazione: (2022)

High-probability Convergence Bounds for Nonlinear Stochastic Gradient Descent Under Heavy-tailed Noise
di: Armacki, Aleksandar, et al.
Pubblicazione: (2023)

On Penalty-based Bilevel Gradient Descent Method
di: Shen, Han, et al.
Pubblicazione: (2023)

Sobolev Gradient Ascent for Optimal Transport: Barycenter Optimization and Convergence Analysis
di: Kim, Kaheon, et al.
Pubblicazione: (2025)

Stochastic Gradient Descent with Adaptive Data
di: Che, Ethan, et al.
Pubblicazione: (2024)

Stochastic Gradient Descent with Strategic Querying
di: Jiang, Nanfei, et al.
Pubblicazione: (2025)

Momentum Does Not Reduce Stochastic Noise in Stochastic Gradient Descent
di: Sato, Naoki, et al.
Pubblicazione: (2024)

Derivatives of Stochastic Gradient Descent in parametric optimization
di: Iutzeler, Franck, et al.
Pubblicazione: (2024)

High-probability sample complexities for policy evaluation with linear function approximation
di: Li, Gen, et al.
Pubblicazione: (2023)

Adaptive Gradient Normalization and Independent Sampling for (Stochastic) Generalized-Smooth Optimization
di: Yang, Yufeng, et al.
Pubblicazione: (2024)

A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization
di: Lu, Songtao
Pubblicazione: (2022)

On the Convergence of Stochastic Gradient Descent with Perturbed Forward-Backward Passes
di: Kong, Boao, et al.
Pubblicazione: (2026)

Mirror Descent-Ascent for mean-field min-max problems
di: Lascu, Razvan-Andrei, et al.
Pubblicazione: (2024)