{"id":"https://openalex.org/W7130675518","doi":"https://doi.org/10.48550/arxiv.2602.16961","title":"Greedy Multi-Path Block Verification for Faster Decoding in Speculative Sampling","display_name":"Greedy Multi-Path Block Verification for Faster Decoding in Speculative Sampling","publication_year":2026,"publication_date":"2026-02-18","ids":{"openalex":"https://openalex.org/W7130675518","doi":"https://doi.org/10.48550/arxiv.2602.16961"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.16961","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.16961","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.16961","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126494371","display_name":"Rahul Thomas","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Thomas, Rahul","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126470292","display_name":"Arka Pal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pal, Arka","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5126494371"],"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/T11321","display_name":"Error Correcting Code Techniques","score":0.3280999958515167,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.3280999958515167,"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/T10142","display_name":"Formal Methods in Verification","score":0.12380000203847885,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.08020000159740448,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7476999759674072},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6394000053405762},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6294999718666077},{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.5360999703407288},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.37209999561309814},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.35749998688697815},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.3546000123023987},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.3472000062465668},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3375000059604645}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7476999759674072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7210000157356262},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6394000053405762},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6294999718666077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5600000023841858},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.5360999703407288},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.37209999561309814},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.35749998688697815},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.3546000123023987},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3472000062465668},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3375000059604645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32589998841285706},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.31790000200271606},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.30219998955726624},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.29670000076293945},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2842000126838684},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.2808000147342682},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C202973057","wikidata":"https://www.wikidata.org/wiki/Q7380130","display_name":"Runtime verification","level":3,"score":0.2556999921798706},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25270000100135803},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.16961","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.16961","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":"doi:10.48550/arxiv.2602.16961","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.16961","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"goal":[1],"of":[2,11,26,42,175,196],"$L$-step":[3],"speculative":[4,72,122],"decoding":[5,10,73,222,238],"is":[6,46,53,79,133,188],"to":[7,21,59,66,107,156,170,228],"accelerate":[8],"autoregressive":[9],"a":[12,17,23,31,40,56,75,87,94,172,193],"target":[13,35,68],"model":[14,20,38,162],"by":[15,143,191,217,224,245],"using":[16],"cheaper":[18],"draft":[19,37,161],"generate":[22],"candidate":[24,44,165],"path":[25],"$L$":[27],"tokens.":[28],"Based":[29],"on":[30,84,120],"verification":[32,76,92,103,112,132,137,178,209,243],"algorithm":[33,77,184],"involving":[34,97],"and":[36,48,167,220],"probabilities,":[39,118,142],"prefix":[41],"the":[43,62,67,85,157,160,182,236],"sequence":[45],"accepted,":[47],"an":[49,145,202],"additional":[50],"correction":[51],"token":[52,83],"sampled":[54,99],"from":[55],"residual":[57],"distribution":[58],"ensure":[60],"that":[61,130,139],"final":[63],"output":[64],"adheres":[65],"distribution.":[69],"While":[70,180],"standard":[71,121],"uses":[74,93],"which":[78,114],"independent":[80],"at":[81],"each":[82],"path,":[86],"recent":[88],"extension":[89],"called":[90,205],"block":[91,131,177,208,215],"joint":[95],"condition":[96],"all":[98,111],"on-path":[100,117],"probabilities.":[101],"Block":[102],"(BV)":[104],"was":[105],"shown":[106],"be":[108],"optimal":[109,134,183],"over":[110,136,218,225,240],"algorithms":[113,138],"use":[115,140,168],"only":[116],"improving":[119],"decoding.":[123],"In":[124],"this":[125,186],"work,":[126],"we":[127,151,199],"first":[128],"show":[129],"even":[135],"off-path":[141],"constructing":[144],"information-agnostic":[146],"linear":[147],"program":[148],"(LP).":[149],"Further,":[150],"can":[152,200,213,234],"extend":[153],"our":[154],"LP":[155],"setting":[158],"where":[159],"samples":[163],"multiple":[164],"paths,":[166],"it":[169],"construct":[171],"natural":[173],"class":[174,187,195],"multi-path":[176,207,242],"generalizations.":[179],"computing":[181],"in":[185],"not":[189],"tractable,":[190],"considering":[192],"stricter":[194],"greedy":[197,206],"algorithms,":[198],"formulate":[201],"efficient":[203],"method":[204],"(GBV).":[210],"Empirically,":[211],"GBV":[212,233],"improve":[214,235],"efficiency":[216],"30%":[219],"reduce":[221],"walltimes":[223],"15%":[226],"relative":[227],"BV.":[229],"On":[230],"Llama-3":[231],"70B,":[232],"end-to-end":[237],"throughput":[239],"SOTA":[241],"methods":[244],"more":[246],"than":[247],"15%.":[248]},"counts_by_year":[],"updated_date":"2026-02-21T06:16:09.471975","created_date":"2026-02-21T00:00:00"}