Copertina

Proximal Point Method for Online Saddle Point Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Meng, Qing-xin, Liu, Jian-wei
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
di: Meng, Qing-xin, et al.
Pubblicazione: (2025)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
di: Huang, Minhui, et al.
Pubblicazione: (2021)

Simultaneous Learning and Optimization via Misspecified Saddle Point Problems
di: Ahmadi, Mohammad Mahdi, et al.
Pubblicazione: (2025)

Federated Composite Saddle Point Optimization
di: Bai, Site, et al.
Pubblicazione: (2023)

Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points
di: Vyas, Abhijeet, et al.
Pubblicazione: (2026)

Quantization Avoids Saddle Points in Distributed Optimization
di: Bo, Yanan, et al.
Pubblicazione: (2024)

Stabilized Proximal-Point Methods for Federated Optimization
di: Jiang, Xiaowen, et al.
Pubblicazione: (2024)

Inertial Newton Algorithms Avoiding Strict Saddle Points
di: Castera, Camille
Pubblicazione: (2021)

From Saddle Points Toward Global Minima: A Newton-Type Method on Wasserstein Space
di: Lascu, Razvan-Andrei, et al.
Pubblicazione: (2026)

Hessian-guided Perturbed Wasserstein Gradient Flows for Escaping Saddle Points
di: Yamamoto, Naoya, et al.
Pubblicazione: (2025)

A Unified Theory of Stochastic Proximal Point Methods without Smoothness
di: Richtárik, Peter, et al.
Pubblicazione: (2024)

Exploring New Frontiers in Vertical Federated Learning: the Role of Saddle Point Reformulation
di: Beznosikov, Aleksandr, et al.
Pubblicazione: (2026)

Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity
di: Cao, Daniel Yiming, et al.
Pubblicazione: (2025)

Enhancing Stability of Physics-Informed Neural Network Training Through Saddle-Point Reformulation
di: Bylinkin, Dmitry, et al.
Pubblicazione: (2025)

Variance Reduction and Low Sample Complexity in Stochastic Optimization via Proximal Point Method
di: Liang, Jiaming
Pubblicazione: (2024)

The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications
di: Gruntkowska, Kaja, et al.
Pubblicazione: (2025)

Efficiently Escaping Saddle Points for Policy Optimization
di: Khorasani, Sadegh, et al.
Pubblicazione: (2023)

Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems
di: González, Tomás, et al.
Pubblicazione: (2024)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
di: Jiang, Ruichen, et al.
Pubblicazione: (2022)

Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms
di: Beznosikov, Aleksandr, et al.
Pubblicazione: (2020)

Bilevel Optimization over Saddle Points of Zero-Sum Markov Games
di: Zheng, Zihao, et al.
Pubblicazione: (2026)

Direct Spectral Acceleration of First-Order Methods for Saddle Point Problems with Bilinear Coupling
di: Li, Meng, et al.
Pubblicazione: (2026)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
di: Kovalev, Dmitry, et al.
Pubblicazione: (2024)

WinQ: Accelerating Quantization-Aware Training of Language Models Around Saddle Points
di: Li, Dongyue, et al.
Pubblicazione: (2026)

Private Algorithms for Stochastic Saddle Points and Variational Inequalities: Beyond Euclidean Geometry
di: Bassily, Raef, et al.
Pubblicazione: (2024)

Accelerated Primal-Dual Proximal Gradient Splitting Methods for Convex-Concave Saddle-Point Problems
di: Luo, Hao
Pubblicazione: (2024)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
di: Dahal, Hari, et al.
Pubblicazione: (2023)

Safe Online Convex Optimization with Multi-Point Feedback
di: Hutchinson, Spencer, et al.
Pubblicazione: (2024)

Faster Fixed-Point Methods for Multichain MDPs
di: Zurek, Matthew, et al.
Pubblicazione: (2025)

Proximal-Based Generative Modeling for Bayesian Inverse Problems
di: Zhang, Boyang, et al.
Pubblicazione: (2026)

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
di: Wang, Nuozhou, et al.
Pubblicazione: (2023)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
di: Hua, Youqing, et al.
Pubblicazione: (2024)

Iterative Proximal-Minimization for Computing Saddle Points with Fixed Index
di: Gu, Shuting, et al.
Pubblicazione: (2025)

Primal-dual Accelerated Mirror-Descent Method for Constrained Bilinear Saddle-Point Problems
di: Li, Weijian, et al.
Pubblicazione: (2024)

Stochastic Newton Proximal Extragradient Method
di: Jiang, Ruichen, et al.
Pubblicazione: (2024)

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity
di: Alacaoglu, Ahmet, et al.
Pubblicazione: (2024)

A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm
di: Kim, Junhyung Lyle, et al.
Pubblicazione: (2024)

SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning
di: Karagulyan, Avetik, et al.
Pubblicazione: (2024)

An Inexact Weighted Proximal Trust-Region Method
di: Maia, Leandro Farias, et al.
Pubblicazione: (2026)

Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization
di: Gruntkowska, Kaja, et al.
Pubblicazione: (2025)