{"id":"https://openalex.org/W2996416339","doi":null,"title":"Decoding As Dynamic Programming For Recurrent Autoregressive Models","display_name":"Decoding As Dynamic Programming For Recurrent Autoregressive Models","publication_year":2020,"publication_date":"2020-04-30","ids":{"openalex":"https://openalex.org/W2996416339","mag":"2996416339"},"language":"en","primary_location":{"id":"pmh:oai:monash.edu:openaire/1da73ec6-fe27-43ef-9b73-f1c918b1bf56","doi":null,"is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/1da73ec6-fe27-43ef-9b73-f1c918b1bf56","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zaidi, N, Cohn, T & Haffari, R 2020, Decoding as dynamic programming for recurrent autoregressive models. in S Mohamed (ed.), International Conference on Learning Representations, ICLR 2020. OpenReview, Portland OR USA, International Conference on Learning Representations 2020, Addis Ababa, Ethiopia, 26/04/20. < https://iclr.cc/virtual_2020/poster_HklOo0VFDH.html >","raw_type":"contributionToPeriodical"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.monash.edu/en/publications/1da73ec6-fe27-43ef-9b73-f1c918b1bf56","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109563057","display_name":"Najam Zaidi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Najam Zaidi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078530959","display_name":"Trevor Cohn","orcid":"https://orcid.org/0000-0003-4363-1673","observed_orcids":["https://orcid.org/0000-0003-4363-1673"]},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Trevor Cohn","raw_affiliation_strings":["University of Melbourne, Melbourne, Australia"],"raw_orcid":"https://orcid.org/0000-0003-4363-1673","affiliations":[{"raw_affiliation_string":"University of Melbourne, Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081525024","display_name":"Gholamreza Haffari","orcid":"https://orcid.org/0000-0001-7326-8380","observed_orcids":["https://orcid.org/0000-0001-7326-8380"]},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Gholamreza Haffari","raw_affiliation_strings":["Monash University, Melbourne, Australia"],"raw_orcid":"https://orcid.org/0000-0001-7326-8380","affiliations":[{"raw_affiliation_string":"Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3999,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.59806898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.5634999871253967,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.5634999871253967,"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/T10028","display_name":"Topic Modeling","score":0.40529999136924744,"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.011800000444054604,"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","display_name":"decoding","score":0.781000018119812},{"id":"https://openalex.org/keywords/autoregressive-models","display_name":"autoregressive models","score":0.8999999761581421},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9139999747276306},{"id":"https://openalex.org/keywords/maximum-a-posteriori-decoding","display_name":"maximum a posteriori decoding","score":0.8650000095367432},{"id":"https://openalex.org/keywords/ensemble-decoding","display_name":"ensemble decoding","score":0.7509999871253967},{"id":"https://openalex.org/keywords/text-infilling","display_name":"text infilling","score":0.8209999799728394},{"id":"https://openalex.org/keywords/beam-search","display_name":"beam search","score":0.640999972820282},{"id":"https://openalex.org/keywords/greedy-decoding","display_name":"greedy decoding","score":0.7139999866485596},{"id":"https://openalex.org/keywords/error-propagation","display_name":"error propagation","score":0.6499999761581421}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8779898881912231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6808958053588867},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.6227810978889465},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5692209005355835},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5518966317176819},{"id":"https://openalex.org/C159877910","wikidata":"https://www.wikidata.org/wiki/Q2202883","display_name":"Autoregressive model","level":2,"score":0.5311374068260193},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.48926135897636414},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4663518965244293},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4444526731967926},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4291394352912903},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.4160325527191162},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4130699336528778},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35197746753692627},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26338082551956177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19228553771972656},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.1441139280796051},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0767413079738617},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:monash.edu:openaire/1da73ec6-fe27-43ef-9b73-f1c918b1bf56","doi":null,"is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/1da73ec6-fe27-43ef-9b73-f1c918b1bf56","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zaidi, N, Cohn, T & Haffari, R 2020, Decoding as dynamic programming for recurrent autoregressive models. in S Mohamed (ed.), International Conference on Learning Representations, ICLR 2020. OpenReview, Portland OR USA, International Conference on Learning Representations 2020, Addis Ababa, Ethiopia, 26/04/20. < https://iclr.cc/virtual_2020/poster_HklOo0VFDH.html >","raw_type":"contributionToPeriodical"},{"id":"mag:2996416339","doi":null,"is_oa":false,"landing_page_url":"https://www.openreview.net/pdf?id=HklOo0VFDH","pdf_url":null,"source":{"id":"https://openalex.org/S4306419637","display_name":"International Conference on Learning Representations","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Learning Representations","raw_type":null}],"best_oa_location":{"id":"pmh:oai:monash.edu:openaire/1da73ec6-fe27-43ef-9b73-f1c918b1bf56","doi":null,"is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/1da73ec6-fe27-43ef-9b73-f1c918b1bf56","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zaidi, N, Cohn, T & Haffari, R 2020, Decoding as dynamic programming for recurrent autoregressive models. in S Mohamed (ed.), International Conference on Learning Representations, ICLR 2020. OpenReview, Portland OR USA, International Conference on Learning Representations 2020, Addis Ababa, Ethiopia, 26/04/20. < https://iclr.cc/virtual_2020/poster_HklOo0VFDH.html >","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W179875071","https://openalex.org/W1833744030","https://openalex.org/W1991133427","https://openalex.org/W2044804339","https://openalex.org/W2079182758","https://openalex.org/W2110485445","https://openalex.org/W2124059530","https://openalex.org/W2251160069","https://openalex.org/W2346438296","https://openalex.org/W2347114283","https://openalex.org/W2353655624","https://openalex.org/W2574872930","https://openalex.org/W2604538595","https://openalex.org/W2626778328","https://openalex.org/W2745461083","https://openalex.org/W2784187071","https://openalex.org/W2784823820","https://openalex.org/W2785442381","https://openalex.org/W2798363023","https://openalex.org/W2886424491","https://openalex.org/W2946197666","https://openalex.org/W2963096510","https://openalex.org/W2963544536","https://openalex.org/W2963614567","https://openalex.org/W2964205912","https://openalex.org/W2964308564","https://openalex.org/W2965794435","https://openalex.org/W2971160449","https://openalex.org/W3029645440"],"related_works":["https://openalex.org/W4310828932","https://openalex.org/W7165666331","https://openalex.org/W4328099923","https://openalex.org/W7166824338","https://openalex.org/W4415795353","https://openalex.org/W7167793395","https://openalex.org/W2990389671","https://openalex.org/W7203456023","https://openalex.org/W4416035196","https://openalex.org/W3180913192"],"abstract_inverted_index":{"Decoding":[0],"in":[1,45,144],"autoregressive":[2],"models":[3],"(ARMs)":[4],"consists":[5],"of":[6,62,89,102,130,147,157],"searching":[7],"for":[8,42,79,159],"a":[9,54,98,107],"high":[10],"scoring":[11],"output":[12,80],"sequence":[13],"under":[14],"the":[15,46,60,71,87,90,103,131,160,167],"trained":[16],"model.":[17],"Standard":[18],"decoding":[19,56,163,180,187],"methods,":[20],"based":[21,58],"on":[22,59,166],"unidirectional":[23,162],"greedy":[24],"algorithm":[25],"or":[26],"beam":[27],"search,":[28],"are":[29],"suboptimal":[30],"due":[31],"to":[32,69,97,123,142,184],"error":[33],"propagation":[34],"and":[35,82,173],"myopic":[36],"decisions":[37],"which":[38,154],"do":[39],"not":[40],"account":[41],"future":[43],"steps":[44],"generation":[47,152],"process.":[48],"In":[49],"this":[50],"paper":[51],"we":[52],"present":[53],"novel":[55],"approach":[57,141],"method":[61,75,181],"auxiliary":[63,83,94,135],"coordinates":[64],"(Carreira-Perpinan":[65],"&":[66],"Wang,":[67],"2014)":[68],"address":[70],"aforementioned":[72],"shortcomings.":[73],"Our":[74],"introduces":[76],"discrete":[77],"variables":[78,85,95],"tokens,":[81],"continuous":[84],"representing":[86],"states":[88],"underlying":[91],"ARM.":[92],"The":[93,117],"lead":[96],"factor":[99,127],"graph":[100,128],"approximation":[101,129],"ARM,":[104],"whose":[105],"maximum":[106],"posteriori":[108],"(MAP)":[109],"solution":[110,119],"is":[111,120,155,182],"found":[112],"exactly":[113],"using":[114],"dynamic":[115],"programming.":[116],"MAP":[118],"then":[121,138],"used":[122],"recreate":[124],"an":[125,145],"improved":[126],"ARM":[132],"via":[133],"updated":[134],"variables.":[136],"We":[137],"extend":[139],"our":[140,179],"decode":[143],"ensemble":[146],"ARMs,":[148],"possibly":[149],"with":[150],"different":[151],"orders,":[153],"out":[156],"reach":[158],"standard":[161],"algorithms.":[164],"Experiments":[165],"text":[168],"infilling":[169],"task":[170],"over":[171],"SWAG":[172],"Daily":[174],"Dialogue":[175],"datasets":[176],"show":[177],"that":[178],"superior":[183],"strong":[185],"competing":[186],"methods.":[188]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2019-12-26T00:00:00"}