{"id":"https://openalex.org/W7154463415","doi":"https://doi.org/10.48550/arxiv.2604.12989","title":"Accelerating Speculative Decoding with Block Diffusion Draft Trees","display_name":"Accelerating Speculative Decoding with Block Diffusion Draft Trees","publication_year":2026,"publication_date":"2026-04-14","ids":{"openalex":"https://openalex.org/W7154463415","doi":"https://doi.org/10.48550/arxiv.2604.12989"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.12989","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.12989","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":null,"license_id":null,"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.2604.12989","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093854356","display_name":"Liran Ringel","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ringel, Liran","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133677783","display_name":"Yaniv Romano","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Romano, Yaniv","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5093854356"],"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/T10775","display_name":"Generative Adversarial Networks and Image Synthesis","score":0.289900004863739,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10775","display_name":"Generative Adversarial Networks and Image Synthesis","score":0.289900004863739,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.11299999803304672,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10201","display_name":"Speech Recognition and Synthesis","score":0.08709999918937683,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/decoding-methods","display_name":"Decoding methods","score":0.6291000247001648},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5799000263214111},{"id":"https://openalex.org/keywords/autoregressive-model","display_name":"Autoregressive model","score":0.5370000004768372},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5016000270843506},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.3598000109195709},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.3384999930858612}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6650000214576721},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6291000247001648},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5799000263214111},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5436000227928162},{"id":"https://openalex.org/C159877910","wikidata":"https://www.wikidata.org/wiki/Q2202883","display_name":"Autoregressive model","level":2,"score":0.5370000004768372},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5016000270843506},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3598000109195709},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.3384999930858612},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2727000117301941},{"id":"https://openalex.org/C141331961","wikidata":"https://www.wikidata.org/wiki/Q2164465","display_name":"Speculative execution","level":2,"score":0.26829999685287476}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.12989","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.12989","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.12989","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.12989","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":null,"license_id":null,"version":null,"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":{"Speculative":[0],"decoding":[1,46],"accelerates":[2],"autoregressive":[3,50],"language":[4],"models":[5],"by":[6,125],"using":[7,143],"a":[8,27,38,61,78,82,91,96,102,122,137,153],"lightweight":[9],"drafter":[10,30],"to":[11,107,115,121,168],"propose":[12],"multiple":[13],"future":[14],"tokens,":[15],"which":[16],"the":[17,87,109,117,126,165],"target":[18,118,139],"model":[19,119,140,156],"then":[20],"verifies":[21,59],"in":[22,37,136],"parallel.":[23],"DFlash":[24],"shows":[25],"that":[26,80,111],"block":[28,36,92],"diffusion":[29,93],"can":[31],"generate":[32],"an":[33,144],"entire":[34],"draft":[35,83,127,155],"single":[39,62,138],"forward":[40,141],"pass":[41,142],"and":[42],"achieve":[43],"state-of-the-art":[44],"speculative":[45,158,169],"performance,":[47],"outperforming":[48],"strong":[49],"drafters":[51],"such":[52],"as":[53],"EAGLE-3.":[54],"Vanilla":[55],"DFlash,":[56,152],"however,":[57],"still":[58],"only":[60],"drafted":[63],"trajectory":[64],"per":[65],"round,":[66],"potentially":[67],"limiting":[68],"its":[69],"acceptance":[70],"length.":[71],"We":[72],"introduce":[73],"DDTree":[74,100,149,163],"(Diffusion":[75],"Draft":[76],"Tree),":[77],"method":[79],"constructs":[81],"tree":[84,132],"directly":[85],"from":[86],"per-position":[88],"distributions":[89],"of":[90],"drafter.":[94],"Under":[95],"fixed":[97],"node":[98],"budget,":[99],"uses":[101],"simple":[103],"best-first":[104],"heap":[105],"algorithm":[106],"select":[108],"continuations":[110],"are":[112],"most":[113],"likely":[114],"match":[116],"according":[120],"surrogate":[123],"defined":[124],"model's":[128],"output.":[129],"The":[130],"resulting":[131],"is":[133],"verified":[134],"efficiently":[135],"ancestor-only":[145],"attention":[146],"mask.":[147],"Because":[148],"builds":[150],"on":[151],"leading":[154,166],"for":[157],"decoding,":[159],"these":[160],"gains":[161],"place":[162],"among":[164],"approaches":[167],"decoding.":[170]},"counts_by_year":[],"updated_date":"2026-04-16T06:09:31.884825","created_date":"2026-04-16T00:00:00"}