ProCreations's picture
Publish validated ICML reproduction from emergency reserve
9be4bfc verified
Raw
History Blame Contribute Delete
2.29 kB
{
"schema_version": 1,
"title": "Reproduction: Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation",
"emoji": "🎯",
"space_id": "ProCreations/repro-near-optimal-and-efficient-first-order-algorithm-for-multi-task-learning-with-shared-linea",
"paper": {
"arxiv_id": "2605.00473"
},
"tags": [
"icml2026-repro",
"paper-TnquAvyTtL"
],
"updated_at": "2026-07-22T20:40:00+00:00",
"root": {
"slug": "index",
"title": "Reproduction: Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation",
"file": "pages/index.md",
"children": [
{
"slug": "executive-summary",
"title": "Executive summary",
"file": "pages/executive-summary/page.md",
"children": []
},
{
"slug": "claim-1-tpgd",
"title": "Claim 1: Two-phase first-order TPGD",
"file": "pages/claim-1-tpgd/page.md",
"children": []
},
{
"slug": "claim-2-phase-split",
"title": "Claim 2: Equal warm-start and regularized phases",
"file": "pages/claim-2-phase-split/page.md",
"children": []
},
{
"slug": "claim-3-near-optimal-rate",
"title": "Claim 3: Near-optimal population rate and factor-k gain",
"file": "pages/claim-3-near-optimal-rate/page.md",
"children": []
},
{
"slug": "claim-4-iteration-complexity",
"title": "Claim 4: Dimension-independent iteration complexity",
"file": "pages/claim-4-iteration-complexity/page.md",
"children": []
},
{
"slug": "claim-5-sample-condition",
"title": "Claim 5: Per-task sample-size condition",
"file": "pages/claim-5-sample-condition/page.md",
"children": []
},
{
"slug": "claim-6-transfer-risk",
"title": "Claim 6: New-task transfer-risk decomposition",
"file": "pages/claim-6-transfer-risk/page.md",
"children": []
},
{
"slug": "conclusion",
"title": "Conclusion",
"file": "pages/conclusion/page.md",
"children": []
}
]
},
"agent_view_tokens": 1250,
"revision": "1784752800000000000"
}