Convex Optimization Is Free When Accuracy Is Expensive JHD3TW67QT
| URI | m2://res/JHD3TW67QT |
|---|---|
| Kind | preprint |
| Creators | Arthur Paing, Arthur Jacot |
| Date | 2026-09-28 |
| MSC | 49-XX, 90-XX, 93-XX |
| Subjects | arxiv math.OC, arxiv cs.LG, arxiv stat.ML |
| Scope | in |
Expressions
e1: version, preprint
| Language | en |
|---|---|
| Date | 2026-09-28 |
| Ids | arXiv 2609.35418 |
Items in this resource
The mentions of the inventory that name this resource. Each name links to the card of its inventory row.
| Item | Kind | Where | Source |
|---|---|---|---|
| Convex | statement | proposition 9 | arxiv |
| The step size | statement | corollary 5 | arxiv |
| 5TGY8Q2REY | statement | proposition 11 | arxiv |
| Tilts are free | statement | lemma 26 | arxiv |
| One step | statement | lemma 14 | arxiv |
| Strongly convex | statement | proposition 10 | arxiv |
| Upgrading the oracle | statement | proposition 3 | arxiv |
| The iterates stay in a ball | statement | lemma 15 | arxiv |
| Every level coarser than $\delta$ is blind | statement | lemma 25 | arxiv |
| Conversion | statement | lemma 32 | arxiv |
| Noise floor | statement | lemma 16 | arxiv |
| Transfer | statement | lemma 27 | arxiv |
| Cost-weighted hierarchy oracle | definition | definition 23 | arxiv |
| No speedup at the intrinsic rate | statement | proposition 28 | arxiv |
| Optimality | statement | theorem 7 | arxiv |
| Cost of optimization | statement | theorem 4 | arxiv |
| Time-varying accuracy | statement | proposition 6 | arxiv |
| The residual is amortized | statement | lemma 33 | arxiv |
| No common approximate minimizer | statement | lemma 24 | arxiv |
Catalogue records
- arxiv: 2609.35418 (work)
- arxiv_text: 2609.35418 (work)