Cover Image

From Saddle Points Toward Global Minima: A Newton-Type Method on Wasserstein Space

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lascu, Razvan-Andrei, Suzuki, Taiji
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Linear convergence of proximal descent schemes on the Wasserstein space
by: Lascu, Razvan-Andrei, et al.
Published: (2024)

Non-convex entropic mean-field optimization via Best Response flow
by: Lascu, Razvan-Andrei, et al.
Published: (2025)

PPO in the Fisher-Rao geometry
by: Lascu, Razvan-Andrei, et al.
Published: (2025)

A Fisher-Rao gradient flow for entropic mean-field min-max games
by: Lascu, Razvan-Andrei, et al.
Published: (2024)

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

Inertial Newton Algorithms Avoiding Strict Saddle Points
by: Castera, Camille
Published: (2021)

Proximal Point Method for Online Saddle Point Problem
by: Meng, Qing-xin, et al.
Published: (2024)

Federated Composite Saddle Point Optimization
by: Bai, Site, et al.
Published: (2023)

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

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

Convergence Error Analysis of Reflected Gradient Langevin Dynamics for Globally Optimizing Non-Convex Constrained Problems
by: Sato, Kanji, et al.
Published: (2022)

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

Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees
by: Agafonov, Artem, et al.
Published: (2025)

A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees
by: Zhou, Yuhao, et al.
Published: (2025)

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

Online Learning Guided Quasi-Newton Methods with Global Non-Asymptotic Convergence
by: Jiang, Ruichen, et al.
Published: (2024)

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

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

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

Symmetric Mean-field Langevin Dynamics for Distributional Minimax Problems
by: Kim, Juno, et al.
Published: (2023)

Sharpness of Minima in Deep Matrix Factorization
by: Kamber, Anil, et al.
Published: (2025)

Quadratic Gradient: A Unified Framework Bridging Gradient Descent and Newton-Type Methods by Synthesizing Hessians and Gradients
by: Chiang, John
Published: (2022)

Entropic mean-field min-max problems via Best Response flow
by: Lascu, Razvan-Andrei, et al.
Published: (2023)

Mirror and Preconditioned Gradient Descent in Wasserstein Space
by: Bonet, Clément, et al.
Published: (2024)

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

Stochastic Newton Proximal Extragradient Method
by: Jiang, Ruichen, et al.
Published: (2024)

Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima
by: Dixit, Rishabh, et al.
Published: (2023)

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

Random Coordinate Descent on the Wasserstein Space of Probability Measures
by: Xu, Yewei, et al.
Published: (2026)

Gradient Regularized Newton Boosting Trees with Global Convergence
by: Zozoulenko, Nikita, et al.
Published: (2026)

Sketch-and-Project Meets Newton Method: Global $\mathcal O(k^{-2})$ Convergence with Low-Rank Updates
by: Hanzely, Slavomír
Published: (2023)

Online Newton Method for Bandit Convex Optimisation
by: Fokkema, Hidde, et al.
Published: (2024)

Sharpened Lazy Incremental Quasi-Newton Method
by: Lahoti, Aakash, et al.
Published: (2023)

Hidden Minima in Two-Layer ReLU Networks
by: Arjevani, Yossi
Published: (2023)

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

A Smoothing Newton Method for Rank-one Matrix Recovery
by: Maunu, Tyler, et al.
Published: (2025)

Incremental Gauss--Newton Methods with Superlinear Convergence Rates
by: Zhou, Zhiling, et al.
Published: (2024)

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

A Proximal Modified Quasi-Newton Method for Nonsmooth Regularized Optimization
by: Diouane, Youssef, et al.
Published: (2024)