Copertina

A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Dagréou, Mathieu, Moreau, Thomas, Vaiter, Samuel, Ablin, Pierre
Natura:	Preprint
Pubblicazione:	2023
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 framework for bilevel optimization that enables stochastic and global variance reduction algorithms
di: Dagréou, Mathieu, et al.
Pubblicazione: (2022)

Fairness-informed Pareto Optimization : An Efficient Bilevel Framework
di: Tanji, Sofiane, et al.
Pubblicazione: (2026)

A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
di: Gong, Xiaochuan, et al.
Pubblicazione: (2024)

Bilevel Optimization with Lower-Level Uniform Convexity: Theory and Algorithm
di: Wu, Yuman, et al.
Pubblicazione: (2026)

Differentially Private Bilevel Optimization: Efficient Algorithms with Near-Optimal Rates
di: Lowy, Andrew, et al.
Pubblicazione: (2025)

Derivatives of Stochastic Gradient Descent in parametric optimization
di: Iutzeler, Franck, et al.
Pubblicazione: (2024)

Proximal basin hopping: global optimization with guarantees
di: Lauga, Guillaume, et al.
Pubblicazione: (2026)

Empirical Risk Minimization with Shuffled SGD: A Primal-Dual Perspective and Improved Bounds
di: Cai, Xufeng, et al.
Pubblicazione: (2023)

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

Infeasible Deterministic, Stochastic, and Variance-Reduction Algorithms for Optimization under Orthogonality Constraints
di: Ablin, Pierre, et al.
Pubblicazione: (2023)

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

Faster Computation of Entropic Optimal Transport via Stable Low Frequency Modes
di: Chhaibi, Reda, et al.
Pubblicazione: (2025)

SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity
di: Chu, Tianshu, et al.
Pubblicazione: (2024)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
di: Kovalev, Dmitry, et al.
Pubblicazione: (2024)

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

Optimal Algorithms for Stochastic Complementary Composite Minimization
di: d'Aspremont, Alexandre, et al.
Pubblicazione: (2022)

SOREL: A Stochastic Algorithm for Spectral Risks Minimization
di: Ge, Yuze, et al.
Pubblicazione: (2024)

Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance
di: Fazla, Arda, et al.
Pubblicazione: (2026)

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

Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions
di: Besançon, Mathieu, et al.
Pubblicazione: (2019)

Specifying and Solving Robust Empirical Risk Minimization Problems Using CVXPY
di: Luxenberg, Eric, et al.
Pubblicazione: (2023)

Fully First-Order Algorithms for Online Bilevel Optimization
di: Jia, Tingkai, et al.
Pubblicazione: (2026)

An Optimal Transport Approach for Computing Adversarial Training Lower Bounds in Multiclass Classification
di: Trillos, Nicolas Garcia, et al.
Pubblicazione: (2024)

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

Exact Instance Compression for Convex Empirical Risk Minimization via Color Refinement
di: Zhu, Bryan, et al.
Pubblicazione: (2026)

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

An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
di: Gong, Xiaochuan, et al.
Pubblicazione: (2024)

Bilevel gradient methods and the Morse parametric qualification condition
di: Bolte, Jérôme, et al.
Pubblicazione: (2025)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
di: Jia, Tingkai, et al.
Pubblicazione: (2026)

Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
di: Soma, Tasuku, et al.
Pubblicazione: (2022)

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
di: Shen, Yiyang, et al.
Pubblicazione: (2026)

Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis
di: Hao, Jie, et al.
Pubblicazione: (2024)

Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization
di: Xiong, Zikai, et al.
Pubblicazione: (2022)

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

Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling
di: Li, Junyi, et al.
Pubblicazione: (2024)

On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness
di: Gong, Xiaochuan, et al.
Pubblicazione: (2025)

Muon Converges under Heavy-Tailed Noise: Nonconvex Hölder-Smooth Empirical Risk Minimization
di: Iiduka, Hideaki
Pubblicazione: (2026)

Double Momentum Method for Lower-Level Constrained Bilevel Optimization
di: Shi, Wanli, et al.
Pubblicazione: (2024)

A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation
di: Zhao, Heyang, et al.
Pubblicazione: (2023)

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
di: Crawshaw, Michael, et al.
Pubblicazione: (2025)