{"id":"https://openalex.org/W2147284296","doi":null,"title":"A Fast and Exact Energy Minimization Algorithm for Cycle MRFs","display_name":"A Fast and Exact Energy Minimization Algorithm for Cycle MRFs","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W2147284296","mag":"2147284296"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.361.6590","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.6590","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~huayanw/icml13_cycle_mrf.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Huayan Wang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Huayan Wang","raw_affiliation_strings":["Computer Science Department, Stanford University, Palo Alto, CA 94305 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Stanford University, Palo Alto, CA 94305 USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9839000105857849,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9839000105857849,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.0010000000474974513,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0010000000474974513,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-random-fields","display_name":"Markov random fields","score":0.7900000214576721},{"id":"https://openalex.org/keywords/energy-minimization","display_name":"energy minimization","score":0.9520000219345093},{"id":"https://openalex.org/keywords/map-inference","display_name":"MAP inference","score":0.9629999995231628},{"id":"https://openalex.org/keywords/dual-decomposition","display_name":"dual decomposition","score":0.8870000243186951},{"id":"https://openalex.org/keywords/exact-inference","display_name":"exact inference","score":0.6510000228881836},{"id":"https://openalex.org/keywords/graph-cycles","display_name":"graph cycles","score":0.3370000123977661}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6826185584068298},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6599202752113342},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6520172357559204},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6493087410926819},{"id":"https://openalex.org/C14961307","wikidata":"https://www.wikidata.org/wiki/Q5377176","display_name":"Energy minimization","level":2,"score":0.5978356003761292},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5754843354225159},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5611189603805542},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.5178623199462891},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.47356927394866943},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4146236181259155},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34622734785079956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2234477400779724},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.22004127502441406},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17643049359321594},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C147597530","wikidata":"https://www.wikidata.org/wiki/Q369472","display_name":"Computational chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.361.6590","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.6590","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~huayanw/icml13_cycle_mrf.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.422.1919","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.1919","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jmlr.org/proceedings/papers/v28/wang13f.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.422.3603","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.3603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jmlr.org/proceedings/papers/v28/wang13f-supp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W54850713","https://openalex.org/W102997558","https://openalex.org/W1502653686","https://openalex.org/W1569098853","https://openalex.org/W1601035521","https://openalex.org/W1681214516","https://openalex.org/W1978493028","https://openalex.org/W2107723815","https://openalex.org/W2111291251","https://openalex.org/W2118997898","https://openalex.org/W2123534506","https://openalex.org/W2131538180","https://openalex.org/W2135414191","https://openalex.org/W2143524933","https://openalex.org/W2149474573","https://openalex.org/W2150675045","https://openalex.org/W2151103935","https://openalex.org/W2164918853","https://openalex.org/W2165555213","https://openalex.org/W2166822605","https://openalex.org/W2167091356","https://openalex.org/W2175160295","https://openalex.org/W2183116108","https://openalex.org/W2525721411","https://openalex.org/W2963967656"],"related_works":["https://openalex.org/W1502653686","https://openalex.org/W7100807568","https://openalex.org/W2086092142","https://openalex.org/W2339385381","https://openalex.org/W1681214516","https://openalex.org/W7099010668","https://openalex.org/W2937505828","https://openalex.org/W7161134292","https://openalex.org/W2111291251","https://openalex.org/W2125540103"],"abstract_inverted_index":{"The":[0,104],"presence":[1],"of":[2,31,97,111,125],"cycles":[3,15],"gives":[4],"rise":[5],"to":[6,22,40,55],"the":[7,50,57,98,109,146],"difficulty":[8],"in":[9,72,82,139],"performing":[10],"inference":[11,132],"for":[12,28,69,102,145],"MRFs.":[13,25,85],"Handling":[14],"efficiently":[16],"would":[17],"greatly":[18],"enhance":[19],"our":[20,118],"ability":[21],"tackle":[23],"general":[24,84],"In":[26,59],"particular,":[27],"dual":[29],"decomposition":[30],"energy":[32,70],"minimization":[33,71],"(MAP":[34],"inference),":[35],"using":[36,46],"cycle":[37,51,73],"subproblems":[38,52],"leads":[39],"a":[41,64,80,94,112],"much":[42],"tighter":[43],"relaxation":[44],"than":[45,122,128],"trees,":[47],"but":[48],"solving":[49],"turns":[53],"out":[54],"be":[56,77],"bottleneck.":[58],"this":[60],"paper,":[61],"we":[62],"present":[63],"fast":[65,131],"and":[66,134],"exact":[67],"algorithm":[68,119,148],"MRFs,":[74],"which":[75],"can":[76],"used":[78],"as":[79],"subroutine":[81],"tackling":[83],"Our":[86],"method":[87],"builds":[88],"on":[89],"junction-tree":[90],"message":[91,99],"passing,":[92],"with":[93],"large":[95],"portion":[96],"entries":[100],"pruned":[101],"efficiency.":[103],"pruning":[105],"conditions":[106],"fully":[107],"exploit":[108],"structure":[110],"cycle.":[113],"Experimental":[114],"results":[115],"show":[116],"that":[117],"is":[120,149],"more":[121],"an":[123],"order":[124],"magnitude":[126],"faster":[127],"other":[129],"state-of-the-art":[130],"methods,":[133],"it":[135],"performs":[136],"consistently":[137],"well":[138],"several":[140],"different":[141],"real":[142],"problems.":[143],"Code":[144],"presented":[147],"available":[150],"at":[151]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}