{"id":"https://openalex.org/W7131434869","doi":"https://doi.org/10.48550/arxiv.2602.20217","title":"KnapSpec: Self-Speculative Decoding via Adaptive Layer Selection as a Knapsack Problem","display_name":"KnapSpec: Self-Speculative Decoding via Adaptive Layer Selection as a Knapsack Problem","publication_year":2026,"publication_date":"2026-02-23","ids":{"openalex":"https://openalex.org/W7131434869","doi":"https://doi.org/10.48550/arxiv.2602.20217"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.20217","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126793249","display_name":"Seongjin Cha","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Cha, Seongjin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005867428","display_name":"Gyuwan Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim, Gyuwan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015247369","display_name":"Dongsu Han","orcid":"https://orcid.org/0000-0001-6922-7244"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Han, Dongsu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126784545","display_name":"Tao Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Tao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5075206506","display_name":"Insu Han","orcid":"https://orcid.org/0000-0002-7427-9169"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Han, Insu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5126793249"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.7714999914169312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.7714999914169312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.03750000149011612,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.02810000069439411,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6449000239372253},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6200000047683716},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5806000232696533},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5127000212669373},{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.48410001397132874},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4715999960899353},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.45249998569488525},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.40849998593330383},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.4043000042438507}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7289000153541565},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6449000239372253},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6200000047683716},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5806000232696533},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5127000212669373},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.48410001397132874},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4715999960899353},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.45249998569488525},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4049000144004822},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.4043000042438507},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4034999907016754},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.37130001187324524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3686000108718872},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3467999994754791},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3330000042915344},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C2777472644","wikidata":"https://www.wikidata.org/wiki/Q16968992","display_name":"Approximate inference","level":3,"score":0.29660001397132874},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2946999967098236},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C13655849","wikidata":"https://www.wikidata.org/wiki/Q25294","display_name":"Hammer","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C2778584072","wikidata":"https://www.wikidata.org/wiki/Q7353545","display_name":"Robustification","level":3,"score":0.2782000005245209},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2651999890804291},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.2630999982357025},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.262800008058548},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C2777615720","wikidata":"https://www.wikidata.org/wiki/Q11888847","display_name":"Prioritization","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.20217","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.20217","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.20217","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.20217","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Self-speculative":[0],"decoding":[1],"(SSD)":[2],"accelerates":[3],"LLM":[4],"inference":[5,154],"by":[6],"skipping":[7],"layers":[8,58],"to":[9,49,113,142],"create":[10],"an":[11],"efficient":[12],"draft":[13,42,73],"model,":[14],"yet":[15],"existing":[16],"methods":[17],"often":[18],"rely":[19],"on":[20,75,128],"static":[21],"heuristics":[22],"that":[23,40,133],"ignore":[24],"the":[25,76,87,104,120,164],"dynamic":[26,81],"computational":[27],"overhead":[28],"of":[29,66,123],"attention":[30],"in":[31],"long-context":[32],"scenarios.":[33],"We":[34],"propose":[35],"KnapSpec,":[36],"a":[37,46,79,99],"training-free":[38],"framework":[39],"reformulates":[41],"model":[43],"selection":[44],"as":[45,64,98],"knapsack":[47],"problem":[48],"maximize":[50],"tokens-per-time":[51],"throughput.":[52],"By":[53],"decoupling":[54],"Attention":[55],"and":[56,59,130],"MLP":[57],"modeling":[60],"their":[61],"hardware-specific":[62],"latencies":[63],"functions":[65],"context":[67],"length,":[68],"KnapSpec":[69,134],"adaptively":[70],"identifies":[71],"optimal":[72],"configurations":[74],"fly":[77],"via":[78],"parallel":[80],"programming":[82],"algorithm.":[83],"Furthermore,":[84],"we":[85],"provide":[86],"first":[88],"rigorous":[89],"theoretical":[90],"analysis":[91],"establishing":[92],"cosine":[93],"similarity":[94],"between":[95],"hidden":[96],"states":[97],"mathematically":[100],"sound":[101],"proxy":[102],"for":[103,155],"token":[105],"acceptance":[106],"rate.":[107],"This":[108],"foundation":[109],"allows":[110],"our":[111],"method":[112],"maintain":[114],"high":[115],"drafting":[116],"faithfulness":[117],"while":[118],"navigating":[119],"shifting":[121],"bottlenecks":[122],"real-world":[124],"hardware.":[125],"Our":[126,149],"experiments":[127],"Qwen3":[129],"Llama3":[131],"demonstrate":[132],"consistently":[135],"outperforms":[136],"state-of-the-art":[137],"SSD":[138],"baselines,":[139],"achieving":[140],"up":[141],"1.47x":[143],"wall-clock":[144],"speedup":[145],"across":[146],"various":[147],"benchmarks.":[148],"plug-and-play":[150],"approach":[151],"ensures":[152],"high-speed":[153],"long":[156],"sequences":[157],"without":[158],"requiring":[159],"additional":[160],"training":[161],"or":[162],"compromising":[163],"target":[165],"model's":[166],"output":[167],"distribution.":[168]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-02-26T00:00:00"}