default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan S. Willsky
- > Home > Persons > Alan S. Willsky
Publications
- 2012
[j122]Animashree Anandkumar, Vincent Y. F. Tan, Furong Huang, Alan S. Willsky:
High-dimensional Gaussian graphical model selection: walk summability and local separation criterion. J. Mach. Learn. Res. 13: 2293-2337 (2012)- [j117]Ying Liu, Venkat Chandrasekaran, Animashree Anandkumar, Alan S. Willsky:
Feedback Message Passing for Inference in Gaussian Graphical Models. IEEE Trans. Signal Process. 60(8): 4135-4150 (2012) - 2011
- [j116]Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates. J. Mach. Learn. Res. 12: 1617-1653 (2011) - [j115]Myung Jin Choi, Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
Learning Latent Tree Graphical Models. J. Mach. Learn. Res. 12: 1771-1812 (2011) - [j113]Vincent Y. F. Tan, Animashree Anandkumar, Lang Tong, Alan S. Willsky:
A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures. IEEE Trans. Inf. Theory 57(3): 1714-1735 (2011) - [c127]Paul Balister
, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky:
Energy-latency tradeoff for in-network function computation in random networks. INFOCOM 2011: 1575-1583 - [c126]Animashree Anandkumar, Vincent Y. F. Tan, Alan S. Willsky:
High-Dimensional Graphical Model Selection: Tractable Graph Families and Necessary Conditions. NIPS 2011: 1863-1871 - [i13]Paul N. Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky:
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks. CoRR abs/1101.0858 (2011) - [i12]Ying Liu, Venkat Chandrasekaran, Animashree Anandkumar, Alan S. Willsky:
Feedback Message Passing for Inference in Gaussian Graphical Models. CoRR abs/1105.1853 (2011) - [i11]Animashree Anandkumar, Vincent Y. F. Tan, Alan S. Willsky:
High-Dimensional Gaussian Graphical Model Selection: Tractable Graph Families. CoRR abs/1107.1270 (2011) - [i10]Animashree Anandkumar, Vincent Y. F. Tan, Furong Huang, Alan S. Willsky:
High-Dimensional Structure Estimation in Ising Models: Tractable Graph Families. CoRR abs/1107.1736 (2011) - 2010
- [j102]Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
Learning Gaussian tree models: analysis of error exponents and extremal structures. IEEE Trans. Signal Process. 58(5): 2701-2714 (2010) - [c124]Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
Scaling laws for learning high-dimensional Markov forest distributions. Allerton 2010: 712-718 - [c123]Myung Jin Choi, Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
Consistent and efficient reconstruction of latent tree models. Allerton 2010: 719-725 - [c119]Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
Error exponents for composite hypothesis testing of Markov forest distributions. ISIT 2010: 1613-1617 - [c118]Ying Liu, Venkat Chandrasekaran, Animashree Anandkumar, Alan S. Willsky:
Feedback message passing for inference in gaussian graphical models. ISIT 2010: 1683-1687 - [c117]Animashree Anandkumar, Joseph E. Yukich, Alan S. Willsky:
Limit laws for random spatial graphical models. ISIT 2010: 1728-1732 - [i8]Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates. CoRR abs/1005.0766 (2010) - [i7]Myung Jin Choi, Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
Learning Latent Tree Graphical Models. CoRR abs/1009.2722 (2010) - 2009
- [c114]Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
How do the structure and the parameters of Gaussian tree models affect structure learning? Allerton 2009: 684-691 - [c108]Vincent Y. F. Tan, Animashree Anandkumar, Lang Tong, Alan S. Willsky:
A large-deviation analysis for the maximum likelihood learning of tree structures. ISIT 2009: 1140-1144 - [c107]Animashree Anandkumar, Alan S. Willsky, Lang Tong:
Detection error exponent for spatially dependent samples in random networks. ISIT 2009: 2882-2886 - [i5]Vincent Y. F. Tan, Animashree Anandkumar, Lang Tong, Alan S. Willsky:
A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures. CoRR abs/0905.0940 (2009) - [i4]Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal Structures. CoRR abs/0909.5216 (2009)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-06 18:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
