arXiv CS
open access
Composite Online-to-Nonconvex Conversion with Optimal Oracle Complexity
We consider stochastic nonsmooth nonconvex composite optimization, which includes several important problems such as constrained optimization and the regularized training of neural networks. The objective is the sum of a possibly nonsmooth nonconvex Lipschitz function and a convex regularizer, and t
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
- Composite Online-to-Nonconvex Conversion with Optimal Oracle Complexity#1249752
- Universal NP-Hardness of Clustering under General Utilities#1012139
- Revisited Support Vector Machines: A Unified Joint Optimization Framework with Nyström Approximation for Scalable Adaptive Learning#1326748
- Convex Networks Remain Hard to Certify: Dimension-Accuracy Barriers for Lipschitz Constants#620563
- Convex Networks Remain Hard to Certify: Dimension-Accuracy Barriers for Lipschitz Constants#618884
Record · ID 1242753
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