arXiv (All)
open access
Improved KKT Complexity for First-Order Bilevel Optimization under Weak Lower-Level Convexity
We study deterministic first-order bilevel optimization under weak lower-level convexity, allowing nonconvex lower-level objectives and without assuming strong convexity, the Polyak-Łojasiewicz condition, or an error-bound property. We consider a $δ$-relaxed Moreau-gap constraint, with $δ>0$, for th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Stochastic Bilevel Optimization with Heavy-Tailed Noise#1104884
- A true single-level reformulation for pessimistic bilevel optimization#1142315
- Accelerated Algorithms for Stochastic Monotone Inclusions with Fixed Queries#1130285
- Gaussian Optimality of Energy-Constrained One-Shot Communication through Single-Mode Bosonic Gaussian Channels#985215
- An Exact Algorithm for the Max-Min Covering Location Blocker Problem#1064628
Record · ID 1144903
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive