{"id":"https://openalex.org/W7167829652","doi":"https://doi.org/10.48550/arxiv.2607.07026","title":"Constrained Decoding for Diffusion Language Models via Efficient Inference over Finite Automata","display_name":"Constrained Decoding for Diffusion Language Models via Efficient Inference over Finite Automata","publication_year":2026,"publication_date":"2026-07-08","ids":{"openalex":"https://openalex.org/W7167829652","doi":"https://doi.org/10.48550/arxiv.2607.07026"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.07026","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.07026","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.07026","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043265692","display_name":"Meihua Dang","orcid":"https://orcid.org/0000-0001-8241-1943"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dang, Meihua","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140335515","display_name":"Stefano Ermon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ermon, Stefano","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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/T12072","display_name":"Machine Learning and Algorithms","score":0.24040000140666962,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.24040000140666962,"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/T10142","display_name":"Formal Methods in Verification","score":0.2093999981880188,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.14569999277591705,"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.6499999761581421},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4487999975681305},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.42250001430511475},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4146000146865845},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4036000072956085},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.3889999985694885},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.3752000033855438},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.37049999833106995},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.36570000648498535}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6499999761581421},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.550000011920929},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4959999918937683},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4487999975681305},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4146000146865845},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4036000072956085},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.399399995803833},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3889999985694885},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.37049999833106995},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.36570000648498535},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.35370001196861267},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.35269999504089355},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.34599998593330383},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3359000086784363},{"id":"https://openalex.org/C159877910","wikidata":"https://www.wikidata.org/wiki/Q2202883","display_name":"Autoregressive model","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3287999927997589},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3174000084400177},{"id":"https://openalex.org/C137293760","wikidata":"https://www.wikidata.org/wiki/Q3621696","display_name":"Language model","level":2,"score":0.3158999979496002},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3122999966144562},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C2777472644","wikidata":"https://www.wikidata.org/wiki/Q16968992","display_name":"Approximate inference","level":3,"score":0.2840000092983246},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C98385598","wikidata":"https://www.wikidata.org/wiki/Q1339385","display_name":"Empirical distribution function","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.07026","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.07026","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.07026","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.07026","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"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":{"Constrained":[0],"decoding":[1,123,192],"is":[2,117],"essential":[3],"for":[4,24,70],"serving":[5],"LLMs,":[6],"ensuring":[7],"that":[8,99],"generated":[9],"outputs":[10],"follow":[11],"specific":[12],"structures":[13],"such":[14],"as":[15,81,88],"JSON":[16],"schema-formatted":[17],"function":[18,162],"calls.":[19],"Existing":[20],"systems":[21],"are":[22],"designed":[23],"autoregressive":[25],"models":[26],"and":[27,67,113,116,121,152,171,198],"assume":[28],"left-to-right":[29],"generation,":[30],"masking":[31],"out":[32],"invalid":[33],"next":[34],"tokens":[35],"at":[36,56],"each":[37,57],"step.":[38,59],"Diffusion":[39],"language":[40],"models,":[41,90],"however,":[42],"break":[43],"this":[44,61],"assumption:":[45],"they":[46],"sample":[47],"multiple":[48],"positions":[49],"simultaneously":[50],"from":[51,72,131,140,194,202],"a":[52,82],"fully-factorized":[53],"mean-field":[54,75],"distribution":[55,98],"denoising":[58],"In":[60],"paper,":[62],"we":[63,91,135],"present":[64],"an":[65],"exact":[66],"tractable":[68,93],"algorithm":[69],"sampling":[71,138,200],"the":[73,96,145,207],"constrained":[74,97],"posterior":[76],"under":[77,124,212],"any":[78],"constraint":[79,106],"expressible":[80],"finite":[83,86],"automaton.":[84],"Viewing":[85],"automata":[87],"graphical":[89],"obtain":[92],"representations":[94],"of":[95],"enable":[100],"efficient":[101],"inference.":[102],"The":[103],"approach":[104,188],"guarantees":[105],"satisfaction":[107],"by":[108],"construction,":[109],"supports":[110],"both":[111],"greedy":[112,191],"sampling-based":[114],"decoding,":[115],"compatible":[118],"with":[119,175,211],"parallel":[120],"block-wise":[122],"arbitrary":[125],"remasking":[126],"schedules.":[127],"Applying":[128],"depth-reduction":[129],"techniques":[130],"arithmetic":[132],"circuit":[133],"theory,":[134],"further":[136],"reduce":[137],"depth":[139],"linear":[141],"to":[142,180,196,204],"logarithmic":[143],"in":[144],"sequence":[146],"length.":[147],"Empirical":[148],"evaluations":[149],"on":[150,185],"Dream-7B":[151],"LLaDA-8B":[153],"show":[154],"substantial":[155],"accuracy":[156,193,201],"gains":[157],"across":[158],"various":[159],"tasks":[160],"including":[161],"calling":[163],"(xLAM,":[164],"BFCL),":[165],"planning":[166],"(Sudoku,":[167],"Countdown),":[168],"text-to-SQL":[169],"(Spider),":[170],"math":[172],"reasoning":[173],"(GSM-Symbolic),":[174],"little":[176],"inference":[177],"overhead":[178],"relative":[179],"unconstrained":[181,208],"decoding.":[182],"For":[183],"example,":[184],"BFCL-Live,":[186],"our":[187],"improves":[189],"Dream-7B's":[190],"63.9%":[195],"71.5%,":[197],"stochastic":[199],"22.3%":[203],"69.0%,":[205],"where":[206],"baseline":[209],"collapses,":[210],"5%":[213],"wall-clock":[214],"overhead.":[215]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-10T00:00:00"}