arXiv (OAI Expanded)
open access
Riemannian Bilevel Optimization with Gradient Aggregation
We study bilevel optimization on Riemannian manifolds when the lower-level solution set is a positive-dimensional submanifold, so that implicit differentiation fails. We propose Riemannian Bilevel Descent Aggregation (RBDA), which extends bilevel descent aggregation to manifolds. Its inner loop aggr
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
- A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization#160891
- S$^3$LDBO: A Snapshot Single-Loop Algorithm for Decentralized Bilevel Optimization#246538
- SGHA: A Single-Loop Fully First-Order Algorithm for Nonconvex-Strongly-Convex Bilevel Optimization#482143
- Optimal Stochastic Bilevel Optimization with First-Order Oracles#1157114
- On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis#177681
Record · ID 1084064
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