High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
Publication:973867
DOI10.1214/09-AOS691zbMath1189.62115arXiv1010.0311WikidataQ98839732 ScholiaQ98839732MaRDI QIDQ973867
Pradeep Ravikumar, Martin J. Wainwright, John D. Lafferty
Publication date: 26 May 2010
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.0311
model selectiongraphical modelsMarkov random fieldsstructure learning\(\ell _1\)-regularizationconvex risk minimizationhigh-dimensional asymptotics
Asymptotic properties of parametric estimators (62F12) Random fields; image analysis (62M40) Generalized linear models (logistic models) (62J12) Applications of graph theory (05C90) Artificial intelligence (68T99)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Causation, prediction, and search
- Maximum likelihood bounded tree-width Markov networks
- Sparse permutation invariant covariance estimation
- Support union recovery in high-dimensional multivariate regression
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Consistent estimation of the basic neighborhood of Markov random fields
- High-dimensional graphs and variable selection with the Lasso
- Just relax: convex programming methods for identifying sparse signals in noise
- Graphical Models, Exponential Families, and Variational Inference
- The Group Lasso for Logistic Regression
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Matrix Analysis
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Probability Inequalities for Sums of Bounded Random Variables
- Model Selection and Estimation in Regression with Grouped Variables
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Approximating discrete probability distributions with dependence trees
- Convex Analysis
- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
This page was built for publication: High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression