arXiv (All)
open access
Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles
Stochastic nonconvex optimization is central to training deep networks and LLMs in modern machine learning. We give a black-box reduction from stochastic nonconvex optimization to ordinary static regret minimization in online convex optimization (OCO), thereby resolving the open problem posed by Che
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
- Understanding Uncertainty Sampling via Equivalent Loss#972846
- Generative Refinement for Low-Budget Black-Box Optimization#1143826
- Nonasymptotic estimates for stochastic gradient Langevin dynamics under local conditions in nonconvex optimization#474067
- Online combinatorial optimization with stochastic decision sets and adversarial losses#141510
- Compression and federated learning: an approach to frugal machine learning. (Compression et apprentissage fédéré: une approche pour l'apprentissage machine frugal).#489533
Record · ID 1011166
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