{"id":"https://openalex.org/W2131010736","doi":"https://doi.org/10.1109/tit.2013.2259576","title":"Message-Passing Algorithms: Reparameterizations and Splittings","display_name":"Message-Passing Algorithms: Reparameterizations and Splittings","publication_year":2013,"publication_date":"2013-04-23","ids":{"openalex":"https://openalex.org/W2131010736","doi":"https://doi.org/10.1109/tit.2013.2259576","mag":"2131010736"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2013.2259576","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2259576","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1002.3239","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Nicholas Ruozzi","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Nicholas Ruozzi","raw_affiliation_strings":["Communication Theory Laboratory, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Communication Theory Laboratory, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":null,"display_name":"Sekhar Tatikonda","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sekhar Tatikonda","raw_affiliation_strings":["Department of Electrical Engineering, Yale University, New Haven, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Yale University, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0981,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.81845372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"59","issue":"9","first_page":"5860","last_page":"5881"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.3538999855518341,"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.3538999855518341,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.28119999170303345,"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"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.05469999834895134,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6187000274658203},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49810001254081726},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.3961000144481659},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.39250001311302185},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.382099986076355},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.3718000054359436}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6187000274658203},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49810001254081726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4659999907016754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44429999589920044},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4219000041484833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4108999967575073},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.3961000144481659},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.382099986076355},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.3718000054359436},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30469998717308044},{"id":"https://openalex.org/C134261354","wikidata":"https://www.wikidata.org/wiki/Q938438","display_name":"Statistical inference","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.2676999866962433},{"id":"https://openalex.org/C2777472644","wikidata":"https://www.wikidata.org/wiki/Q16968992","display_name":"Approximate inference","level":3,"score":0.2660999894142151},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2540000081062317}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.2013.2259576","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2259576","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1002.3239","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1002.3239","pdf_url":"https://arxiv.org/pdf/1002.3239","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:189289","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/189289","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1002.3239","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1002.3239","pdf_url":"https://arxiv.org/pdf/1002.3239","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1969880716","https://openalex.org/W1983289383","https://openalex.org/W2010054133","https://openalex.org/W2029782393","https://openalex.org/W2057803073","https://openalex.org/W2059284193","https://openalex.org/W2068370657","https://openalex.org/W2079937789","https://openalex.org/W2089745384","https://openalex.org/W2098387242","https://openalex.org/W2108619558","https://openalex.org/W2114741181","https://openalex.org/W2116510751","https://openalex.org/W2117038364","https://openalex.org/W2118696796","https://openalex.org/W2120444530","https://openalex.org/W2130697955","https://openalex.org/W2135414191","https://openalex.org/W2151173657","https://openalex.org/W2164918853","https://openalex.org/W2165232124","https://openalex.org/W2169134868","https://openalex.org/W2172190188","https://openalex.org/W4211092921","https://openalex.org/W6607773459","https://openalex.org/W6633434192","https://openalex.org/W6635197353","https://openalex.org/W6635752617","https://openalex.org/W6637407456","https://openalex.org/W6639344520","https://openalex.org/W6640992714","https://openalex.org/W6674862258","https://openalex.org/W6674917163","https://openalex.org/W6676628830","https://openalex.org/W6682467843","https://openalex.org/W6683068184","https://openalex.org/W6683341419","https://openalex.org/W6688169102"],"related_works":[],"abstract_inverted_index":{"The":[0],"max-product":[1,44,146],"algorithm,":[2],"a":[3,17,26,78,103,115,139,157],"local":[4,98],"message-passing":[5,66,83,120,130,136,148,175],"scheme":[6],"that":[7,85],"attempts":[8],"to":[9,49,59,71,97,153,156],"compute":[10],"the":[11,43,61,87,127,143,150],"most":[12],"probable":[13],"assignment":[14],"(MAP)":[15],"of":[16,28,81,106,126,145,171],"given":[18],"probability":[19],"distribution,":[20],"has":[21],"been":[22,69],"successfully":[23],"employed":[24],"as":[25],"method":[27],"approximate":[29],"inference":[30],"for":[31,95],"applications":[32],"arising":[33],"in":[34,142,164],"coding":[35],"theory,":[36],"computer":[37],"vision,":[38],"and":[39,51,113,118,134,167,173,182],"machine":[40],"learning.":[41],"However,":[42],"algorithm":[45,121],"is":[46,56,177],"not":[47,57],"guaranteed":[48,58],"converge,":[50],"if":[52],"it":[53,55],"does,":[54],"recover":[60],"MAP":[62],"assignment.":[63],"Alternative":[64],"convergent":[65,117,129,133,172],"schemes":[67,176],"have":[68],"proposed":[70],"overcome":[72],"these":[73,107],"difficulties.":[74],"This":[75,169],"paper":[76],"provides":[77],"systematic":[79],"study":[80],"such":[82],"algorithms":[84,137],"extends":[86],"known":[88,128],"results":[89],"by":[90,179,184],"exhibiting":[91],"new":[92,116],"sufficient":[93],"conditions":[94,151],"convergence":[96,155],"and/or":[99],"global":[100,158],"optima,":[101],"providing":[102],"combinatorial":[104],"characterization":[105],"optima":[108],"based":[109],"on":[110],"graph":[111,180],"covers,":[112],"describing":[114],"correct":[119,135,174],"whose":[122],"derivation":[123],"unifies":[124],"many":[125],"algorithms.":[131],"While":[132],"represent":[138],"step":[140],"forward":[141],"analysis":[144],"style":[147],"algorithms,":[149],"needed":[152],"guarantee":[154],"optimum":[159],"can":[160],"be":[161],"too":[162],"restrictive":[163],"both":[165],"theory":[166],"practice.":[168],"limitation":[170],"characterized":[178],"covers":[181],"illustrated":[183],"example.":[185]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2016-06-24T00:00:00"}