arXiv (OAI Expanded)
open access
Projection-Free Multi-level Algorithms for Stochastic Constrained Compositional Optimization
This paper studies projection-free algorithms for stochastic constrained multi-level compositional optimization. In this context, the objective function is a nested composition of several smooth functions, and the decision set is closed and convex. Since projection onto the constraint set can be com
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
- MuseCritic: Learning Multi-Aspect Song Rewards through Natural-Language Aesthetic Critiques#1156446
- Procedural Music Generation Systems in Games#1122984
- Mixture-Trained Merging for Unified Multi-Objective Models#1156510
- Łojasiewicz--Simon inequalities near bubbling configurations for the Yamabe functional on bounded domains#799395
- Łojasiewicz--Simon inequalities near bubbling configurations for the Yamabe functional on bounded domains#797972
Record · ID 1109656
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