Copertina

Stochastic Newton Proximal Extragradient Method

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Jiang, Ruichen, Dereziński, Michał, Mokhtari, Aryan
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods
di: Jiang, Ruichen, et al.
Pubblicazione: (2024)

Stochastic Variance-Reduced Newton: Accelerating Finite-Sum Minimization with Large Batches
di: Dereziński, Michał
Pubblicazione: (2022)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
di: Jiang, Ruichen, et al.
Pubblicazione: (2024)

Krylov Cubic Regularized Newton: A Subspace Second-Order Method with Dimension-Free Convergence Rate
di: Jiang, Ruichen, et al.
Pubblicazione: (2024)

Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism
di: Patitucci, Francisco, et al.
Pubblicazione: (2025)

Online Learning-guided Learning Rate Adaptation via Gradient Alignment
di: Jiang, Ruichen, et al.
Pubblicazione: (2025)

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
di: Cao, Jincheng, et al.
Pubblicazione: (2024)

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

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

Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization
di: Jiang, Ruichen, et al.
Pubblicazione: (2026)

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
di: Cao, Jincheng, et al.
Pubblicazione: (2025)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
di: Huang, Ziyu, et al.
Pubblicazione: (2024)

Adaptive Optimization via Momentum on Variance-Normalized Gradients
di: Patitucci, Francisco, et al.
Pubblicazione: (2026)

Stochastic Extragradient with Flip-Flop Shuffling & Anchoring: Provable Improvements
di: Chae, Jiseok, et al.
Pubblicazione: (2024)

Low-Rank Extragradient Methods for Scalable Semidefinite Optimization
di: Garber, Dan, et al.
Pubblicazione: (2024)

Extragradient Type Methods for Riemannian Variational Inequality Problems
di: Hu, Zihao, et al.
Pubblicazione: (2023)

Non-asymptotic Global Convergence Rates of BFGS with Exact Line Search
di: Jin, Qiujiang, et al.
Pubblicazione: (2024)

Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search
di: Jin, Qiujiang, et al.
Pubblicazione: (2024)

Last-Iterate Convergence of Randomized Kaczmarz and SGD with Greedy Step Size
di: Dereziński, Michał, et al.
Pubblicazione: (2026)

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

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
di: Abolfazli, Nazanin, et al.
Pubblicazione: (2023)

Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
di: Garber, Dan, et al.
Pubblicazione: (2022)

Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems
di: Choudhury, Sayantan, et al.
Pubblicazione: (2025)

Efficient Graph Laplacian Estimation by Proximal Newton
di: Medvedovsky, Yakov, et al.
Pubblicazione: (2023)

The Stochastic Proximal Distance Algorithm
di: Jiang, Haoyu, et al.
Pubblicazione: (2022)

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

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

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

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

Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning
di: Ding, Kuangyu, et al.
Pubblicazione: (2023)

When is Momentum Extragradient Optimal? A Polynomial-Based Analysis
di: Kim, Junhyung Lyle, et al.
Pubblicazione: (2022)

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

Statistical and Computational Complexities of BFGS Quasi-Newton Method for Generalized Linear Models
di: Jin, Qiujiang, et al.
Pubblicazione: (2022)

On the Stochastic (Variance-Reduced) Proximal Gradient Method for Regularized Expected Reward Optimization
di: Liang, Ling, et al.
Pubblicazione: (2024)

Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities
di: Emmanouilidis, Konstantinos, et al.
Pubblicazione: (2024)

Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure
di: Dereziński, Michał, et al.
Pubblicazione: (2025)

Solving Dense Linear Systems Faster Than via Preconditioning
di: Dereziński, Michał, et al.
Pubblicazione: (2023)

Improving Stochastic Cubic Newton with Momentum
di: Chayti, El Mahdi, et al.
Pubblicazione: (2024)

A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness
di: Sun, Zhenyu, et al.
Pubblicazione: (2024)