Imagen de Portada

SDEs for Minimax Optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Compagnoni, Enea Monzio, Orvieto, Antonio, Kersting, Hans, Proske, Frank Norbert, Lucchi, Aurelien
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Unbiased and Sign Compression in Distributed Learning: Comparing Noise Resilience via SDEs
por: Compagnoni, Enea Monzio, et al.
Publicado: (2025)

Adaptive Methods through the Lens of SDEs: Theoretical Insights on the Role of Noise
por: Compagnoni, Enea Monzio, et al.
Publicado: (2024)

On the Interaction of Batch Noise, Adaptivity, and Compression, under $(L_0,L_1)$-Smoothness: An SDE Approach
por: Compagnoni, Enea Monzio, et al.
Publicado: (2025)

Enhancing Optimizer Stability: Momentum Adaptation of The NGN Step-size
por: Islamov, Rustem, et al.
Publicado: (2025)

Loss Landscape Characterization of Neural Networks without Over-Parametrization
por: Islamov, Rustem, et al.
Publicado: (2024)

Adaptive Methods Are Preferable in High Privacy Settings: An SDE Perspective
por: Compagnoni, Enea Monzio, et al.
Publicado: (2026)

Why Do We Need Warm-up? A Theoretical Perspective
por: Alimisis, Foivos, et al.
Publicado: (2025)

An Adaptive Stochastic Gradient Method with Non-negative Gauss-Newton Stepsizes
por: Orvieto, Antonio, et al.
Publicado: (2024)

Cubic regularized subspace Newton for non-convex optimization
por: Zhao, Jim, et al.
Publicado: (2024)

Is your batch size the problem? Revisiting the Adam-SGD gap in language modeling
por: Srećković, Teodora, et al.
Publicado: (2025)

Double Momentum and Error Feedback for Clipping with Fast Rates and Differential Privacy
por: Islamov, Rustem, et al.
Publicado: (2025)

On the Role of Batch Size in Stochastic Conditional Gradient Methods
por: Islamov, Rustem, et al.
Publicado: (2026)

Recurrent neural networks: vanishing and exploding gradients are not the end of the story
por: Zucchet, Nicolas, et al.
Publicado: (2024)

Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions
por: Islamov, Rustem, et al.
Publicado: (2026)

Fundamental Benefit of Alternating Updates in Minimax Optimization
por: Lee, Jaewook, et al.
Publicado: (2024)

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

Effective Bilevel Optimization via Minimax Reformulation
por: Wang, Xiaoyu, et al.
Publicado: (2023)

Stochastic Compositional Minimax Optimization with Provable Convergence Guarantees
por: Deng, Yuyang, et al.
Publicado: (2024)

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

Gradient Descent on Logistic Regression: Do Large Step-Sizes Work with Data on the Sphere?
por: Meng, Si Yi, et al.
Publicado: (2025)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
por: Tran-Dinh, Quoc, et al.
Publicado: (2024)

Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization
por: Li, Chris Junchi
Publicado: (2024)

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
por: Jiang, Ruichen, et al.
Publicado: (2024)

Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes
por: Meng, Si Yi, et al.
Publicado: (2024)

Near-Optimal Distributed Minimax Optimization under the Second-Order Similarity
por: Zhou, Qihao, et al.
Publicado: (2024)

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

Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions
por: Chen, Lesi, et al.
Publicado: (2023)

An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization
por: Chen, Lesi, et al.
Publicado: (2022)

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

TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization
por: Li, Xiang, et al.
Publicado: (2022)

Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis
por: Li, Jiajin, et al.
Publicado: (2022)

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

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
por: Shen, Yiyang, et al.
Publicado: (2026)

Integration Matters for Learning PDEs with Backward SDEs
por: Park, Sungje, et al.
Publicado: (2025)

Iterative Minimax Games with Coupled Linear Constraints
por: Zhang, Huiling, et al.
Publicado: (2022)

Two-timescale Extragradient for Finding Local Minimax Points
por: Chae, Jiseok, et al.
Publicado: (2023)

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

Regret-Optimal Federated Transfer Learning for Kernel Regression with Applications in American Option Pricing
por: Yang, Xuwei, et al.
Publicado: (2023)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
por: Shen, Wei, et al.
Publicado: (2023)

Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization
por: Huang, Feihu, et al.
Publicado: (2023)