Copertina

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Cao, Jincheng, Jiang, Ruichen, Hamedani, Erfan Yazdandoost, Mokhtari, Aryan
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

Sequential QCQP for Bilevel Optimization with Line Search
di: Sharifi, Sina, et al.
Pubblicazione: (2025)

Safe Gradient Flow for Bilevel Optimization
di: Sharifi, Sina, et al.
Pubblicazione: (2025)

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

Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods
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)

Single-loop Projection-free and Projected Gradient-based Algorithms for Nonconvex-concave Saddle Point Problems with Bilevel Structure
di: Ahmadi, Mohammad Mahdi, et al.
Pubblicazione: (2024)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
di: Abolfazli, Nazanin, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

Semi-infinite Nonconvex Constrained Min-Max Optimization
di: Melcher, Cody, et al.
Pubblicazione: (2025)

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

Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
di: Melcher, Cody, et al.
Pubblicazione: (2025)

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

Online Nonconvex Bilevel Optimization with Bregman Divergences
di: Bohne, Jason, et al.
Pubblicazione: (2024)

A Randomized Block-Coordinate Primal-Dual Method for Large-scale Stochastic Saddle Point Problems
di: Hamedani, Erfan Yazdandoost, et al.
Pubblicazione: (2019)

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
di: Ji, Kaiyi
Pubblicazione: (2025)

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
di: Hollender, Alexandros, et al.
Pubblicazione: (2023)

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

Optimal Hessian/Jacobian-Free Nonconvex-PL Bilevel Optimization
di: Huang, Feihu
Pubblicazione: (2024)

Variance-reduction for Variational Inequality Problems with Bregman Distance Function
di: Alizadeh, Zeinab, et al.
Pubblicazione: (2024)

On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation
di: Kwon, Jeongyeol, 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)

On the Complexity of First-Order Methods in Stochastic Bilevel Optimization
di: Kwon, Jeongyeol, et al.
Pubblicazione: (2024)

On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization
di: Luo, Luo, et al.
Pubblicazione: (2022)

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
di: Zhou, Dongruo, et al.
Pubblicazione: (2018)

Decentralized Bilevel Optimization: A Perspective from Transient Iteration Complexity
di: Kong, Boao, et al.
Pubblicazione: (2024)

On the Analysis of Misspecified Variational Inequalities with Nonlinear Constraints
di: Dey, Novel Kumar, et al.
Pubblicazione: (2026)

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
di: Zhang, Huaqing, et al.
Pubblicazione: (2024)

Bayesian Optimization of Bilevel Problems
di: Ekmekcioglu, Omer, et al.
Pubblicazione: (2024)

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

On Stability in Optimistic Bilevel Optimization
di: Royset, Johannes O.
Pubblicazione: (2024)

Deterministic Nonsmooth Nonconvex Optimization
di: Jordan, Michael I., et al.
Pubblicazione: (2023)

Decentralized Sum-of-Nonconvex Optimization
di: Liu, Zhuanghua, et al.
Pubblicazione: (2024)