{"id":"https://openalex.org/W7160442779","doi":"https://doi.org/10.48550/arxiv.2605.03622","title":"Exact and Approximate Algorithms for Polytree Learning","display_name":"Exact and Approximate Algorithms for Polytree Learning","publication_year":2026,"publication_date":"2026-05-05","ids":{"openalex":"https://openalex.org/W7160442779","doi":"https://doi.org/10.48550/arxiv.2605.03622"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.03622","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03622","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2605.03622","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002420527","display_name":"Juha Harviainen","orcid":"https://orcid.org/0000-0002-4581-840X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harviainen, Juha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135455318","display_name":"Frank Sommer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sommer, Frank","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033440939","display_name":"Manuel Sorge","orcid":"https://orcid.org/0000-0001-7394-3147"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sorge, Manuel","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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.8385999798774719,"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.8385999798774719,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.04610000178217888,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.03999999910593033,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6085000038146973},{"id":"https://openalex.org/keywords/bayesian-network","display_name":"Bayesian network","score":0.6013000011444092},{"id":"https://openalex.org/keywords/probably-approximately-correct-learning","display_name":"Probably approximately correct learning","score":0.5430999994277954},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5192999839782715},{"id":"https://openalex.org/keywords/approximate-inference","display_name":"Approximate inference","score":0.4993000030517578},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.48989999294281006},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45969998836517334},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42910000681877136}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6085000038146973},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.6013000011444092},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5486000180244446},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.5430999994277954},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5192999839782715},{"id":"https://openalex.org/C2777472644","wikidata":"https://www.wikidata.org/wiki/Q16968992","display_name":"Approximate inference","level":3,"score":0.4993000030517578},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.48989999294281006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4805999994277954},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45969998836517334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4408000111579895},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42910000681877136},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.38909998536109924},{"id":"https://openalex.org/C95627357","wikidata":"https://www.wikidata.org/wiki/Q7979889","display_name":"Weighted Majority Algorithm","level":5,"score":0.3824000060558319},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3734000027179718},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3630000054836273},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3447999954223633},{"id":"https://openalex.org/C160234255","wikidata":"https://www.wikidata.org/wiki/Q812535","display_name":"Bayesian inference","level":3,"score":0.3345000147819519},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3273000121116638},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3084999918937683},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3073999881744385},{"id":"https://openalex.org/C2776194381","wikidata":"https://www.wikidata.org/wiki/Q3965271","display_name":"Subclass","level":3,"score":0.2676999866962433},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.03622","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03622","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.03622","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03622","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.46333450078964233,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Polytrees":[0],"are":[1,25,142],"a":[2,15,21,67,113,119,131],"subclass":[3],"of":[4,17,38,60,66,102,121,133,139],"Bayesian":[5],"networks":[6],"that":[7,76],"seek":[8],"to":[9],"capture":[10],"the":[11,36,40,64,78,97,124,140,151,155],"conditional":[12],"dependencies":[13],"between":[14],"set":[16],"$n$":[18],"variables":[19],"as":[20],"directed":[22],"forest":[23],"and":[24,32,69,89,130],"motivated":[26],"by":[27,53,144],"their":[28],"more":[29,51],"efficient":[30],"inference":[31],"improved":[33],"interpretability.":[34],"Since":[35],"problem":[37],"learning":[39],"best":[41],"polytree":[42,80,114],"is":[43,117],"NP-hard,":[44],"we":[45],"study":[46],"which":[47],"restrictions":[48],"make":[49],"it":[50],"tractable":[52],"considering":[54],"for":[55,84,111,127,135,149],"example":[56],"in-degree":[57,92],"bounds,":[58],"properties":[59],"score":[61,116],"functions":[62],"measuring":[63],"quality":[65],"polytree,":[68],"approximation":[70,156],"algorithms.":[71],"We":[72,106],"devise":[73],"an":[74],"algorithm":[75,101],"finds":[77],"optimal":[79,125],"in":[81],"time":[82,103,152],"$O((2+\u03b5)^n)$":[83],"arbitrarily":[85],"small":[86],"$\u03b5>":[87],"0$":[88],"any":[90],"constant":[91],"bound":[93],"$k$,":[94],"improving":[95],"over":[96],"fastest":[98],"previously":[99],"known":[100],"complexity":[104,153],"$O(3^n)$.":[105],"further":[107],"give":[108],"polynomial-time":[109],"algorithms":[110],"finding":[112],"whose":[115],"within":[118],"factor":[120,132],"$k$":[122],"from":[123],"one":[126],"arbitrary":[128],"scores":[129],"$2$":[134],"additive":[136],"ones.":[137],"Many":[138],"results":[141],"complemented":[143],"(nearly)":[145],"tight":[146],"lower":[147],"bounds":[148],"either":[150],"or":[154],"factors.":[157]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-07T00:00:00"}