| { | |
| "schema_version": 2, | |
| "title": "Reproduction: Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes", | |
| "emoji": "🎯", | |
| "space_id": "amkkk/repro-randomized-feasibility-methods-for-constrained-bayesian-optimization", | |
| "paper": { | |
| "arxiv_id": "2601.20076" | |
| }, | |
| "tags": [ | |
| "icml2026-repro", | |
| "paper-1BchRVONfp" | |
| ], | |
| "updated_at": "2026-07-23T00:38:40+00:00", | |
| "root": { | |
| "slug": "index", | |
| "title": "Reproduction: Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes", | |
| "file": "pages/index.md", | |
| "children": [ | |
| { | |
| "slug": "executive-summary", | |
| "title": "Executive summary", | |
| "file": "pages/executive-summary/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-1-algorithm-2-gradient-method-with-adaptive-polyak-stepsize-linear-convergence-o-log-1-epsilon", | |
| "title": "Claim 1: Algorithm 2 gradient method with adaptive Polyak stepsize, linear convergence O(log(1/epsilon))", | |
| "file": "pages/claim-1-algorithm-2-gradient-method-with-adaptive-polyak-stepsize-linear-convergence-o-log-1-epsilon/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-2-algorithm-3-dows-with-randomized-feasibility-o-1-sqrt-t-rate", | |
| "title": "Claim 2: Algorithm 3 DoWS with randomized feasibility, O(1/sqrt(T)) rate", | |
| "file": "pages/claim-2-algorithm-3-dows-with-randomized-feasibility-o-1-sqrt-t-rate/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-3-algorithm-4-t-dows-removes-bounded-y-requirement-o-1-sqrt-t-up-to-log-factors", | |
| "title": "Claim 3: Algorithm 4 T-DoWS removes bounded Y requirement, O(1/sqrt(T)) up to log factors", | |
| "file": "pages/claim-3-algorithm-4-t-dows-removes-bounded-y-requirement-o-1-sqrt-t-up-to-log-factors/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-4-lemma-3-1-geometric-infeasibility-decay-under-randomized-feasibility-updates", | |
| "title": "Claim 4: Lemma 3.1 geometric infeasibility decay under randomized feasibility updates", | |
| "file": "pages/claim-4-lemma-3-1-geometric-infeasibility-decay-under-randomized-feasibility-updates/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-5-qcqp-simulations-confirm-theory-on-function-decay-and-infeasibility-reduction", | |
| "title": "Claim 5: QCQP simulations confirm theory on function decay and infeasibility reduction", | |
| "file": "pages/claim-5-qcqp-simulations-confirm-theory-on-function-decay-and-infeasibility-reduction/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-6-svm-classification-on-3-datasets-algorithms-3-4-vs-primal-dual-baseline", | |
| "title": "Claim 6: SVM classification on 3 datasets, Algorithms 3-4 vs primal-dual baseline", | |
| "file": "pages/claim-6-svm-classification-on-3-datasets-algorithms-3-4-vs-primal-dual-baseline/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "conclusion", | |
| "title": "Conclusion", | |
| "file": "pages/conclusion/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "methods-provenance", | |
| "title": "Methods / provenance", | |
| "file": "pages/methods-provenance/page.md", | |
| "children": [] | |
| } | |
| ] | |
| }, | |
| "traces": [], | |
| "workspace": { | |
| "file": "workspace.json", | |
| "file_count": 0, | |
| "total_size": 0, | |
| "bucket_id": null | |
| }, | |
| "agent_view_tokens": 5818, | |
| "trace_view_tokens": 10, | |
| "workspace_view_tokens": 8, | |
| "revision": "8031b1ca467e7c3b8944" | |
| } |