No article text was recorded for this version.
non-convex bilevel optimization (lower-level strong convexity assumption)
Version 1 of 127 papers28 conceptsfrozen 2026-10-04
Papers in this version
- Blog: SimFBO: Towards Simple, Flexible and Communication-efficient Federated Bilevel Learning
- Blog: A Fully First-Order Method for Stochastic Bilevel Optimization
- Blog: Amortized Implicit Differentiation for Stochastic Bilevel Optimization
- Blog: Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem
- Blog: A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
- Blog: Convergence Analysis of Decentralized Hessian-/Jacobian-Free Algorithm for Nonconvex Stochastic Bilevel Optimization
- Blog: Double Momentum Method for Lower-Level Constrained Bilevel Optimization
- Blog: Closing the Gap: Tighter Analysis of Alternating Stochastic Gradient Methods for Bilevel Problems
- Blog: A Fully First-Order Layer for Differentiable Optimization
- Blog: Hessian Free Efficient Single Loop Iterative Differentiation Methods for Bi-Level Optimization Problems
- Blog: On the Convergence of Proximal Gradient Methods for Convex Simple Bilevel Optimization
- Blog: First-Order Minimax Bilevel Optimization
- Blog: Second-Order Bilevel Optimization with Accelerated Convergence Rates
- Blog: An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
- Blog: Prometheus: Taming Sample and Communication Complexities in Constrained Decentralized Stochastic Bilevel Learning
- Blog: A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints
- Blog: Will Bilevel Optimizers Benefit from Loops
- Blog: A framework for bilevel optimization that enables stochastic and global variance reduction algorithms
- Blog: On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness
- Blog: First-Order Methods for Wasserstein Distributionally Robust MDP
- Blog: Nesterov Meets Optimism: Rate-Optimal Optimistic-Gradient-Based Method for Stochastic Bilinearly-Coupled Minimax Optimization
- Blog: Inducing Equilibria via Incentives: Simultaneous Design-and-Play Ensures Global Convergence
- Blog: FAB: A First-Order AB-based Gradient Algorithm for Distributed Bilevel Optimization over Time-Varying Directed Graphs
- Blog: SPARKLE: A Unified Single-Loop Primal-Dual Framework for Decentralized Bilevel Optimization
- Blog: Bilevel Learning with Inexact Stochastic Gradients
- Blog: Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
- Blog: A Stochastic Linearized Augmented Lagrangian Method for Decentralized Bilevel Optimization
History & citation
Current · Permanent link
- This direction split from single-loop bilevel optimization (56% overlap)
- This direction split from Scaling Bilevel Optimization Beyond Strong Convexity (96% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_non_convex_bilevel_optimization_lower_le_dcda2090,
title = {non-convex bilevel optimization (lower-level strong convexity assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-bilevel-optimization-lower-level-strong-convexity-assumption/rdr_dcda209091e547ce8644dab5ef4dd7db},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_non_convex_bilevel_optimization_lower_le_dcda2090_v1,
title = {non-convex bilevel optimization (lower-level strong convexity assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-bilevel-optimization-lower-level-strong-convexity-assumption/rdr_dcda209091e547ce8644dab5ef4dd7db/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}