:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lin, Tianyi, Cuturi, Marco, Jordan, Michael I.
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Optimization and Control
Online Access:	https://arxiv.org/abs/2310.14087
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Perseus: A Simple and Optimal High-Order Method for Variational Inequalities
by: Lin, Tianyi, et al.
Published: (2022)

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

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

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

Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback
by: Jordan, Michael I., et al.
Published: (2023)

PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
by: Wu, Di, et al.
Published: (2025)

Semismooth Newton Methods for Risk-Averse Markov Decision Processes
by: Gargiani, Matilde, et al.
Published: (2025)

A Compositional Kernel Model for Feature Learning
by: Ruan, Feng, et al.
Published: (2025)

Deterministic Nonsmooth Nonconvex Optimization
by: Jordan, Michael I., et al.
Published: (2023)

A Globalized Semismooth Newton Method for Prox-regular Optimization Problems
by: Wu, Yuqia, et al.
Published: (2025)

Sparse Quadratically Constrained Quadratic Programming via Semismooth Newton Method
by: Li, Shuai, et al.
Published: (2025)

A Truncated Newton Method for Optimal Transport
by: Kemertas, Mete, et al.
Published: (2025)

LeAP-SSN: A Semismooth Newton Method with Global Convergence Rates
by: Alphonse, Amal, et al.
Published: (2025)

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

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

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

On Unbalanced Optimal Transport: Gradient Methods, Sparsity and Approximation Error
by: Nguyen, Quang Minh, et al.
Published: (2022)

On Constraints in First-Order Optimization: A View from Non-Smooth Dynamical Systems
by: Muehlebach, Michael, et al.
Published: (2021)

Kernel-Based Optimal Control: An Infinitesimal Generator Approach
by: Bevanda, Petar, et al.
Published: (2024)

An Augmented Lagrangian Primal-Dual Semismooth Newton Method for Multi-Block Composite Optimization
by: Deng, Zhanwang, et al.
Published: (2023)

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

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

Unlocking Global Optimality in Bilevel Optimization: A Pilot Study
by: Xiao, Quan, et al.
Published: (2024)

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

ROOT-SGD: Sharp Nonasymptotics and Near-Optimal Asymptotics in a Single Algorithm
by: Li, Chris Junchi, et al.
Published: (2020)

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

A Sinkhorn-type Algorithm for Constrained Optimal Transport
by: Tang, Xun, et al.
Published: (2024)

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

The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspective
by: Muehlebach, Michael, et al.
Published: (2025)

Higher-Order Newton Methods with Polynomial Work per Iteration
by: Ahmadi, Amir Ali, et al.
Published: (2023)

Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates
by: Liu, Zhuanghua, et al.
Published: (2024)

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

Two Typical Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods
by: Chen, Liang, et al.
Published: (2024)

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

Slicing Unbalanced Optimal Transport
by: Bonet, Clément, et al.
Published: (2023)

Riemannian Neural Optimal Transport
by: Micheli, Alessandro, et al.
Published: (2026)

Decentralized and Equitable Optimal Transport
by: Lau, Ivan, et al.
Published: (2024)

Efficient Penalty-Based Bilevel Methods: Improved Analysis, Novel Updates, and Flatness Condition
by: Jiang, Liuyuan, et al.
Published: (2025)

Scalable Approximate Algorithms for Optimal Transport Linear Models
by: Kacprzak, Tomasz, et al.
Published: (2025)

Unified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methods
by: Chayti, El Mahdi, et al.
Published: (2023)