arXiv (All)
open access
Dimension-Adaptive Accuracy Certificates for Convex Optimization
Many convex optimization methods use affine lower models to certify that a candidate solution is near optimal. Keeping full gradients can be costly when the informative directions occupy a small, initially unknown subspace. We develop accuracy certificates that store projected affine minorants toget
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
- Convex Envelopes for Low Rank Approximation#319027
- The Curvature of Regret in Contextual Linear Optimization#1161053
- The Curvature of Regret in Contextual Linear Optimization#1157328
- Near-Optimal Exact-Value Zeroth-Order Complexity for Smooth Strongly Convex Optimization#1012895
- The Tamed Subgradient Unadjusted Langevin Algorithm beyond Convexity#432518
Record · ID 1248728
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