Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
0905.2639
Cited By
Information-theoretic limits of selecting binary graphical models in high dimensions
16 May 2009
N. Santhanam
Martin J. Wainwright
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Information-theoretic limits of selecting binary graphical models in high dimensions"
17 / 117 papers shown
Title
Efficiently learning Ising models on arbitrary graphs
Guy Bresler
39
201
0
22 Nov 2014
On the Information Theoretic Limits of Learning Ising Models
Karthikeyan Shanmugam
Rashish Tandon
A. Dimakis
Pradeep Ravikumar
15
36
0
05 Nov 2014
Learning graphical models from the Glauber dynamics
Guy Bresler
D. Gamarnik
Devavrat Shah
37
18
0
28 Oct 2014
Learning the Conditional Independence Structure of Stationary Time Series: A Multitask Learning Approach
A. Jung
42
31
0
04 Apr 2014
High-dimensional Ising model selection with Bayesian information criteria
Rina Foygel Barber
Mathias Drton
35
118
0
13 Mar 2014
Compressive Nonparametric Graphical Model Selection For Time Series
A. Jung
Reinhard Heckel
Helmut Bölcskei
F. Hlawatsch
CML
59
18
0
13 Nov 2013
Distance-based and continuum Fano inequalities with applications to statistical estimation
John C. Duchi
Martin J. Wainwright
43
66
0
12 Nov 2013
Structure estimation for discrete graphical models: Generalized covariance matrices and their inverses
Po-Ling Loh
Martin J. Wainwright
42
180
0
03 Dec 2012
Discussion: Latent variable graphical model selection via convex optimization
Christophe Giraud
Alexandre B. Tsybakov
36
8
0
05 Nov 2012
Discussion: Latent variable graphical model selection via convex optimization
Martin J. Wainwright
48
8
0
05 Nov 2012
The Price of Privacy in Untrusted Recommendation Engines
Siddhartha Banerjee
N. Hegde
Laurent Massoulié
46
18
0
13 Jul 2012
Learning Loosely Connected Markov Random Fields
R. Wu
R. Srikant
J. Ni
45
20
0
25 Apr 2012
Greedy Learning of Markov Network Structure
Praneeth Netrapalli
Siddhartha Banerjee
Sujay Sanghavi
Sanjay Shakkottai
57
56
0
08 Feb 2012
On the trade-off between complexity and correlation decay in structural learning algorithms
José Bento
Andrea Montanari
42
3
0
08 Oct 2011
Robust estimation of latent tree graphical models: Inferring hidden states with inexact parameters
Elchanan Mossel
S. Roch
Allan Sly
28
19
0
21 Sep 2011
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates
Vincent Y. F. Tan
Anima Anandkumar
A. Willsky
65
49
0
05 May 2010
Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal Structures
Vincent Y. F. Tan
Anima Anandkumar
A. Willsky
55
57
0
28 Sep 2009
Previous
1
2
3