{"id":"https://openalex.org/W2922007432","doi":null,"title":"Anytime Approximate Inference in Graphical Models","display_name":"Anytime Approximate Inference in Graphical Models","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2922007432","mag":"2922007432"},"language":"en","primary_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt7sc0m97f","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/7sc0m97f","pdf_url":"https://escholarship.org/uc/item/7sc0m97f","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/uc/item/7sc0m97f","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077858309","display_name":"Qi Lou","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Qi Lou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5077858309"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9984999895095825,"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.9984999895095825,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0003000000142492354,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximate-inference","display_name":"approximate inference","score":0.8420000076293945},{"id":"https://openalex.org/keywords/probabilistic-graphical-models","display_name":"probabilistic graphical models","score":0.9980000257492065},{"id":"https://openalex.org/keywords/anytime-algorithms","display_name":"anytime algorithms","score":0.8019999861717224},{"id":"https://openalex.org/keywords/partition-function","display_name":"partition function","score":0.9739999771118164},{"id":"https://openalex.org/keywords/variational-bounds","display_name":"variational bounds","score":0.6389999985694885},{"id":"https://openalex.org/keywords/best-first-search","display_name":"best-first search","score":0.8740000128746033},{"id":"https://openalex.org/keywords/importance-sampling","display_name":"importance sampling","score":0.7260000109672546},{"id":"https://openalex.org/keywords/monte-carlo-sampling","display_name":"Monte Carlo sampling","score":0.6620000004768372}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6368629932403564},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.6271438598632812},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6168950200080872},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5703526139259338},{"id":"https://openalex.org/C2777472644","wikidata":"https://www.wikidata.org/wiki/Q16968992","display_name":"Approximate inference","level":3,"score":0.5118855237960815},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.5002930164337158},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.490852415561676},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4763108491897583},{"id":"https://openalex.org/C169272836","wikidata":"https://www.wikidata.org/wiki/Q5668307","display_name":"Variable elimination","level":3,"score":0.4614850878715515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40826570987701416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2950572967529297},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2708720266819},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:escholarship.org/ark:/13030/qt7sc0m97f","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/7sc0m97f","pdf_url":"https://escholarship.org/uc/item/7sc0m97f","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},{"id":"pmh:qt7sc0m97f","doi":null,"is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/7sc0m97f","pdf_url":"http://www.escholarship.org/uc/item/7sc0m97f","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lou, Qi. (2018). Anytime Approximate Inference in Graphical Models. UC Irvine: Computer Science. Retrieved from: http://www.escholarship.org/uc/item/7sc0m97f","raw_type":"dissertation"},{"id":"mag:2922007432","doi":null,"is_oa":false,"landing_page_url":"https://escholarship.org/content/qt7sc0m97f/qt7sc0m97f.pdf?t=po8zy1","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt7sc0m97f","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/7sc0m97f","pdf_url":"https://escholarship.org/uc/item/7sc0m97f","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2922007432.pdf","grobid_xml":"https://content.openalex.org/works/W2922007432.grobid-xml"},"referenced_works_count":81,"referenced_works":["https://openalex.org/W114565888","https://openalex.org/W177438173","https://openalex.org/W223130948","https://openalex.org/W1480349804","https://openalex.org/W1489119587","https://openalex.org/W1491239593","https://openalex.org/W1505356468","https://openalex.org/W1505442699","https://openalex.org/W1510302714","https://openalex.org/W1511187233","https://openalex.org/W1518630026","https://openalex.org/W1520781524","https://openalex.org/W1535430927","https://openalex.org/W1546981760","https://openalex.org/W1550892302","https://openalex.org/W1601035521","https://openalex.org/W1697053819","https://openalex.org/W1705521864","https://openalex.org/W1748004346","https://openalex.org/W1786332878","https://openalex.org/W1934021597","https://openalex.org/W1969483458","https://openalex.org/W1982333717","https://openalex.org/W1999901857","https://openalex.org/W2006912660","https://openalex.org/W2008740515","https://openalex.org/W2022637125","https://openalex.org/W2062818807","https://openalex.org/W2071988465","https://openalex.org/W2095999997","https://openalex.org/W2096192494","https://openalex.org/W2100034662","https://openalex.org/W2101968469","https://openalex.org/W2103012681","https://openalex.org/W2106317217","https://openalex.org/W2112796928","https://openalex.org/W2114267503","https://openalex.org/W2120340025","https://openalex.org/W2121863487","https://openalex.org/W2122003883","https://openalex.org/W2125186487","https://openalex.org/W2125631472","https://openalex.org/W2126316555","https://openalex.org/W2130178369","https://openalex.org/W2130467648","https://openalex.org/W2135094946","https://openalex.org/W2135194391","https://openalex.org/W2136064009","https://openalex.org/W2137532396","https://openalex.org/W2137822088","https://openalex.org/W2150470619","https://openalex.org/W2153806142","https://openalex.org/W2154055561","https://openalex.org/W2155102572","https://openalex.org/W2163316275","https://openalex.org/W2164568295","https://openalex.org/W2171035569","https://openalex.org/W2174332830","https://openalex.org/W2182427043","https://openalex.org/W2183877918","https://openalex.org/W2253548355","https://openalex.org/W2407138673","https://openalex.org/W2408128689","https://openalex.org/W2410190751","https://openalex.org/W2531486473","https://openalex.org/W2566054401","https://openalex.org/W2572061353","https://openalex.org/W2594757924","https://openalex.org/W2605178440","https://openalex.org/W2622268367","https://openalex.org/W2751676477","https://openalex.org/W2787531831","https://openalex.org/W2808602246","https://openalex.org/W2809278324","https://openalex.org/W2904033531","https://openalex.org/W2912526555","https://openalex.org/W2913554033","https://openalex.org/W2952143373","https://openalex.org/W2963848397","https://openalex.org/W3021035068","https://openalex.org/W3023084835"],"related_works":["https://openalex.org/W7096255507","https://openalex.org/W2751676477","https://openalex.org/W1954626250","https://openalex.org/W2789134441","https://openalex.org/W2904033531","https://openalex.org/W106209650","https://openalex.org/W2563338646","https://openalex.org/W7098089828","https://openalex.org/W3042078224","https://openalex.org/W2407138673"],"abstract_inverted_index":{"Graphical":[0],"models":[1,15],"are":[2,90,119],"a":[3,29,41,46,57,149,235,264],"powerful":[4],"framework":[5,265],"for":[6,121,155,266],"modeling":[7],"interactions":[8],"within":[9],"complex":[10],"systems.":[11],"Reasoning":[12],"over":[13,56,63],"graphical":[14],"typically":[16],"involves":[17],"answering":[18],"inference":[19,153,173],"queries,":[20],"such":[21],"as":[22],"computing":[23],"the":[24,35,64,79,85,108,137,156,171,184,202,249,259,270,273,285],"most":[25],"likely":[26],"configuration":[27],"(maximum":[28],"posteriori":[30],"or":[31,33,37,128],"MAP)":[32],"evaluating":[34],"marginals":[36],"normalizing":[38],"constant":[39],"of":[40,59,67,81,88,130,140,151,186,214,272],"distribution":[42],"(the":[43],"partition":[44,157,203],"function);":[45],"task":[47],"called":[48],"marginal":[49,160,206],"MAP":[50,161],"generalizes":[51],"these":[52,68],"two":[53,286],"by":[54,165],"maximizing":[55],"subset":[58],"variables":[60],"while":[61],"marginalizing":[62],"rest.Exact":[65],"computation":[66],"queries":[69],"is":[70],"known":[71],"to":[72,78,135,178,228,257],"be":[73,113],"intractable":[74],"in":[75],"general,":[76],"leading":[77],"development":[80],"many":[82],"approximate":[83,152],"schemes,":[84],"major":[86],"categories":[87],"which":[89,240,277],"variational":[91,221,250,275],"methods,":[92,300],"search":[93,195,210,218,255],"algorithms,":[94],"and":[95,111,132,143,159,168,175,205,219],"Monte":[96],"Carlo":[97],"sampling.":[98],"Within":[99],"these,":[100],"anytime":[101,163,192,230,306],"techniques":[102,169],"that":[103,182,197,291],"provide":[104,179,198],"some":[105],"guarantees":[106],"on":[107,201],"correct":[109],"value,":[110],"can":[112,278],"improved":[114],"with":[115,125,162,252,269,304],"more":[116],"computational":[117,282],"effort,":[118],"valued":[120],"quickly":[122],"providing":[123],"users":[124,134],"confidence":[126,232,307],"intervals":[127],"certificates":[129],"accuracy":[131],"allow":[133],"decide":[136],"desired":[138],"balance":[139,280],"quality,":[141],"time":[142],"memory.In":[144],"this":[145,226],"dissertation,":[146],"we":[147,289],"develop":[148],"series":[150],"algorithms":[154,196,294],"function":[158,204],"properties":[164],"leveraging":[166],"ideas":[167],"from":[170,248],"three":[172,188],"paradigms,":[174],"integrating":[176],"them":[177],"hybrid":[180,293],"solutions":[181],"inherit":[183],"strengths":[185],"all":[187],"approaches.":[189],"We":[190,223,261],"propose":[191,263],"anyspace":[193],"best-first":[194,209,254],"deterministic":[199],"bounds":[200,233],"MAP.":[207],"These":[208],"schemes":[211],"take":[212],"advantage":[213],"both":[215],"AND/OR":[216],"tree":[217],"optimized":[220],"heuristics.":[222],"then":[224],"extend":[225],"approach":[227],"give":[229],"probabilistic":[231],"via":[234],"dynamic":[236],"importance":[237,242],"sampling":[238,243,268],"algorithm,":[239],"interleaves":[241],"(using":[244],"proposal":[245],"distributions":[246],"extracted":[247],"bound)":[251],"our":[253,292],"algorithm":[256],"refine":[258],"proposal.":[260],"also":[262],"interleaving":[267],"optimization":[271],"initial":[274],"bound,":[276],"automatically":[279],"its":[281],"effort":[283],"between":[284],"schemes.":[287],"Overall,":[288],"show":[290],"perform":[295],"significantly":[296],"better":[297],"than":[298],"existing":[299],"giving":[301],"flexible":[302],"approaches":[303],"excellent":[305],"bounds.":[308]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2019-03-22T00:00:00"}