File size: 1,986 Bytes
530aeab 47d3522 530aeab f4d3acb 47d3522 530aeab | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 | {
"schema_version": 1,
"title": "Repro - KnapSpec: Self-Speculative Decoding via Adaptive Layer Selection as a Knapsack Problem",
"emoji": "🎯",
"space_id": "nickvdw/repro-knapspec-self-speculative-decoding",
"paper": {
"openreview_id": "k5nKHWp9VC",
"arxiv_id": "2602.20217"
},
"tags": [
"icml2026-repro",
"paper-k5nKHWp9VC"
],
"updated_at": "2026-07-16T16:00:31+00:00",
"root": {
"slug": "index",
"title": "Repro - KnapSpec: Self-Speculative Decoding via Adaptive Layer Selection as a Knapsack Problem",
"file": "pages/index.md",
"children": [
{
"slug": "claim-1-attention-mlp-knapsack-decoupling",
"title": "Claim 1: Attention/MLP knapsack decoupling",
"file": "pages/claim-1-attention-mlp-knapsack-decoupling/page.md",
"children": []
},
{
"slug": "claim-2-cosine-similarity-proxy",
"title": "Claim 2: Cosine similarity proxy",
"file": "pages/claim-2-cosine-similarity-proxy/page.md",
"children": []
},
{
"slug": "claim-3-tpt-and-two-stage-optimization",
"title": "Claim 3: TPT and two-stage optimization",
"file": "pages/claim-3-tpt-and-two-stage-optimization/page.md",
"children": []
},
{
"slug": "claim-4-5-reported-benchmark-speedups",
"title": "Claim 4-5: Reported benchmark speedups",
"file": "pages/claim-4-5-reported-benchmark-speedups/page.md",
"children": []
},
{
"slug": "claim-6-training-free-and-search-space-reduction",
"title": "Claim 6: Training-free and search-space reduction",
"file": "pages/claim-6-training-free-and-search-space-reduction/page.md",
"children": []
},
{
"slug": "conclusion",
"title": "Conclusion",
"file": "pages/conclusion/page.md",
"children": []
}
]
},
"agent_view_tokens": 8290,
"revision": "1784217631068056931"
} |