{"id":"https://openalex.org/W2550836686","doi":"https://doi.org/10.1109/allerton.2010.5706977","title":"Scaling laws for learning high-dimensional Markov forest distributions","display_name":"Scaling laws for learning high-dimensional Markov forest distributions","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2550836686","doi":"https://doi.org/10.1109/allerton.2010.5706977","mag":"2550836686"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2010.5706977","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2010.5706977","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058345431","display_name":"Vincent Y. F. Tan","orcid":"https://orcid.org/0000-0002-5008-4527"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vincent Y. F. Tan","raw_affiliation_strings":["Stochastic Systems Group, MIT, Cambridge, USA"],"affiliations":[{"raw_affiliation_string":"Stochastic Systems Group, MIT, Cambridge, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023215207","display_name":"Animashree Anandkumar","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Animashree Anandkumar","raw_affiliation_strings":["Center for Pervasive Communications and Computing, UC Irvine"],"affiliations":[{"raw_affiliation_string":"Center for Pervasive Communications and Computing, UC Irvine","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107833743","display_name":"Alan S. Willsky","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alan S. Willsky","raw_affiliation_strings":["Stochastic Systems Group, MIT, Cambridge, USA"],"affiliations":[{"raw_affiliation_string":"Stochastic Systems Group, MIT, Cambridge, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058345431"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2925,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67458655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"712","last_page":"718"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10136","display_name":"Statistical Methods and Inference","score":0.9914000034332275,"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"}},"topics":[{"id":"https://openalex.org/T10136","display_name":"Statistical Methods and Inference","score":0.9914000034332275,"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"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9908000230789185,"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9904000163078308,"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/thresholding","display_name":"Thresholding","score":0.6733831763267517},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5612927675247192},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5555520057678223},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5461775064468384},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.542279839515686},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5256596207618713},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.49531593918800354},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4815228581428528},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47116193175315857},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.4279228746891022},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37881606817245483},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35471680760383606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34834590554237366},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3339129090309143},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.20853739976882935},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1876932680606842},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16520318388938904},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07965520024299622}],"concepts":[{"id":"https://openalex.org/C191178318","wikidata":"https://www.wikidata.org/wiki/Q2256906","display_name":"Thresholding","level":3,"score":0.6733831763267517},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5612927675247192},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5555520057678223},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5461775064468384},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.542279839515686},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5256596207618713},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.49531593918800354},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4815228581428528},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47116193175315857},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.4279228746891022},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37881606817245483},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35471680760383606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34834590554237366},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3339129090309143},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.20853739976882935},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1876932680606842},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16520318388938904},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07965520024299622},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton.2010.5706977","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2010.5706977","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.1282","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.1282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.ece.nus.edu.sg/stfpage/vtan/allerton10.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W1663973292","https://openalex.org/W1881594620","https://openalex.org/W1965680834","https://openalex.org/W1989065278","https://openalex.org/W1997864710","https://openalex.org/W2000416469","https://openalex.org/W2009086942","https://openalex.org/W2010824638","https://openalex.org/W2012575779","https://openalex.org/W2017927472","https://openalex.org/W2023933519","https://openalex.org/W2034274945","https://openalex.org/W2037570051","https://openalex.org/W2059120410","https://openalex.org/W2097182131","https://openalex.org/W2099111195","https://openalex.org/W2105342805","https://openalex.org/W2110156410","https://openalex.org/W2120340025","https://openalex.org/W2122133429","https://openalex.org/W2124988974","https://openalex.org/W2125984043","https://openalex.org/W2147071755","https://openalex.org/W2147640502","https://openalex.org/W2153699776","https://openalex.org/W2155805386","https://openalex.org/W2159245256","https://openalex.org/W2162863295","https://openalex.org/W2163166770","https://openalex.org/W2254917320","https://openalex.org/W2406983578","https://openalex.org/W2478708596","https://openalex.org/W2797333853","https://openalex.org/W2798766386","https://openalex.org/W2912522929","https://openalex.org/W2951553524","https://openalex.org/W2962869267","https://openalex.org/W3098834468","https://openalex.org/W4242209908","https://openalex.org/W4255306344","https://openalex.org/W4285719527","https://openalex.org/W4301258660","https://openalex.org/W4388323202","https://openalex.org/W6629510986","https://openalex.org/W6636955869","https://openalex.org/W6674851815","https://openalex.org/W6676245194","https://openalex.org/W6678397451","https://openalex.org/W6678450360","https://openalex.org/W6678777490","https://openalex.org/W6681688880","https://openalex.org/W6682042226","https://openalex.org/W6692059051","https://openalex.org/W6750230808","https://openalex.org/W6884737774"],"related_works":["https://openalex.org/W2953058328","https://openalex.org/W1542224353","https://openalex.org/W1661087619","https://openalex.org/W2750730210","https://openalex.org/W2116854923","https://openalex.org/W2236974868","https://openalex.org/W4312766348","https://openalex.org/W2730764323","https://openalex.org/W4233939244","https://openalex.org/W1976727107"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,18,40,51,64,71,78,126],"learning":[3,42,102],"forest-structured":[4],"discrete":[5],"graphical":[6],"models":[7],"from":[8],"i.i.d.":[9],"samples":[10,52,79],"is":[11,25,28,33,113],"considered.":[12],"An":[13],"algorithm":[14,32,91,123],"based":[15],"on":[16,83],"pruning":[17],"the":[19,37,49,58,62,65,69,76,90,98,108,114,121],"Chow-Liu":[20],"tree":[21],"through":[22],"adaptive":[23],"thresholding":[24],"proposed.":[26],"It":[27],"shown":[29],"that":[30,107],"this":[31],"structurally":[34,94],"consistent":[35],"and":[36,68],"error":[38,127],"probability":[39],"structure":[41,130],"decays":[43],"faster":[44],"than":[45],"any":[46],"polynomial":[47],"in":[48,124],"number":[50,70,77],"under":[53],"fixed":[54],"model":[55,66,112],"size.":[56],"For":[57],"high-dimensional":[59],"scenario":[60],"where":[61],"size":[63],"d":[67],"edges":[72],"k":[73],"scale":[74],"with":[75],"n,":[80],"sufficient":[81],"conditions":[82],"(n,":[84],"d,":[85],"k)":[86],"are":[87,103],"given":[88],"for":[89,101,129],"to":[92,118],"be":[93],"consistent.":[95],"In":[96],"addition,":[97],"extremal":[99],"structures":[100],"identified;":[104],"we":[105],"prove":[106],"independent":[109],"(resp.":[110,116],"tree)":[111],"hardest":[115],"easiest)":[117],"learn":[119],"using":[120],"proposed":[122],"terms":[125],"rates":[128],"learning.":[131]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}