High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
From MaRDI portal
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
Bayesian structure learning in sparse Gaussian graphical models, Simple method for inference in inverse Ising problem using full data, Universality of the mean-field for the Potts model, A joint convex penalty for inverse covariance matrix estimation, SLOPE is adaptive to unknown sparsity and asymptotically minimax, Covariance structure approximation via gLasso in high-dimensional supervised classification, Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models, A Unified Framework for Structured Graph Learning via Spectral Constraints, Objective Bayesian edge screening and structure selection for Ising networks, Estimating finite mixtures of ordinal graphical models, Parameter inference in a probabilistic model from data: regulation of transition rate in the Monte Carlo method, Discussion to: \textit{Bayesian graphical models for modern biological applications} by Y. Ni, V. Baladandayuthapani, M. Vannucci and F.C. Stingo, Graphical Models and Message-Passing Algorithms: Some Introductory Lectures, Cycle-based cluster variational method for direct and inverse inference, A sparse ising model with covariates, Composite mixture of log-linear models with application to psychiatric studies, Parameter inference in a probabilistic model using clustered data, Sparse linear models and \(l_1\)-regularized 2SLS with high-dimensional endogenous regressors and instruments, De-noising analysis of noisy data under mixed graphical models, Learning loopy graphical models with latent variables: efficient methods and guarantees, Unnamed Item, Multivariate Bernoulli distribution, Concentration and consistency results for canonical and curved exponential-family models of random graphs, Pairwise sparse + low-rank models for variables of mixed type, Computational implications of reducing data to sufficient statistics, Local conditional and marginal approach to parameter estimation in discrete graphical models, Joint estimation of heterogeneous exponential Markov random fields through an approximate likelihood inference, Sparse and low-rank matrix regularization for learning time-varying Markov networks, Network-based discriminant analysis for multiclassification, Combinatorial approach to exactly solve the 1D Ising model, Unnamed Item, Unnamed Item, Unnamed Item, Learning a tree-structured Ising model in order to make predictions, Joint estimation of parameters in Ising model, Adaptive cluster expansion for the inverse Ising problem: convergence, algorithm and tests, Statistical analysis of sparse approximate factor models, Reconstruction of recurrent synaptic connectivity of thousands of neurons from simulated spiking activity, Inferring multiple graphical structures, Estimating networks with jumps, Honest variable selection in linear and logistic regression models via \(\ell _{1}\) and \(\ell _{1}+\ell _{2}\) penalization, Dimension reduction and variable selection in case control studies via regularized likelihood optimization, An oracle approach for interaction neighborhood estimation in random fields, Sparse covariance estimation in heterogeneous samples, The log-linear group-lasso estimator and its asymptotic properties, Sparse directed acyclic graphs incorporating the covariates, Structure estimation for discrete graphical models: generalized covariance matrices and their inverses, Estimating the interaction graph of stochastic neural dynamics, Estimation of high-dimensional partially-observed discrete Markov random fields, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Ising models for neural activity inferred via selective cluster expansion: structural and coding properties, Comment on ``Hypothesis testing by convex optimization, Sparse model selection in the highly under-sampled regime, Statistical mechanics of the inverse Ising problem and the optimal objective function, A decomposition-based algorithm for learning the structure of multivariate regression chain graphs, Latent binary MRF for online reconstruction of large scale systems, Bayesian model selection for high-dimensional Ising models, with applications to educational data, ROCKET: robust confidence intervals via Kendall's tau for transelliptical graphical models, Inference of large modified Poisson-type graphical models: application to RNA-seq data in childhood atopic asthma studies, Probabilistic Graphical Models and Markov Networks, Bayesian graphical models for differential pathways, A global approach for learning sparse Ising models, The IBMAP approach for Markov network structure learning, High-dimensional structure estimation in Ising models: local separation criterion, Nonconcave penalized composite conditional likelihood estimation of sparse Ising models, Loglinear model selection and human mobility, High-dimensional structure learning of binary pairwise Markov networks: a comparative numerical study, Inference under Fine-Gray competing risks model with high-dimensional covariates, Estimating time-varying networks, A general algorithm for covariance modeling of discrete data, Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization, Unnamed Item, Unnamed Item, Kernel Knockoffs Selection for Nonparametric Additive Models, Estimation of high-dimensional graphical models using regularized score matching, Sparse equisigned PCA: algorithms and performance bounds in the noisy rank-1 setting, Stable graphical model estimation with random forests for discrete, continuous, and mixed variables, Graphical-model based high dimensional generalized linear models, Tight conditions for consistency of variable selection in the context of high dimensionality, Structure learning in inverse Ising problems using ℓ 2-regularized linear estimator, Estimating heterogeneous graphical models for discrete data with an application to roll call voting, Poisson dependency networks: gradient boosted models for multivariate count data, Exact recovery in the Ising blockmodel, Tuning parameter calibration for \(\ell_1\)-regularized logistic regression, Provable training set debugging for linear regression, Graphical models for zero-inflated single cell gene expression, Robust measurement via a fused latent and graphical item response theory model, Unnamed Item, Unnamed Item, Sparse Poisson regression with penalized weighted score function, Feature selection for data integration with mixed multiview data, Multiclass analysis and prediction with network structured covariates, Property testing in high-dimensional Ising models, The Dantzig selector for a linear model of diffusion processes, Inferring network structure in non-normal and mixed discrete-continuous genomic data, High-dimensional Ising model selection with Bayesian information criteria, On model selection consistency of regularized M-estimators, Unnamed Item, Identifying interacting pairs of sites in Ising models on a countable set, Customer Choice Models vs. Machine Learning: Finding Optimal Product Displays on Alibaba, Nonparametric discriminant analysis with network structures in predictor, Variable screening in multivariate linear regression with high-dimensional covariates, Efficient learning of discrete graphical models*, 1D Ising model using the Kronecker sum and Kronecker product, Long-tailed graphical model and frequentist inference of the model parameters for biological networks, Ising model selection using ℓ 1-regularized linear regression: a statistical mechanics analysis*, An expectation maximization algorithm for high-dimensional model selection for the Ising model with misclassified states*, Unnamed Item, Optimal regularizations for data generation with probabilistic graphical models, Bayesian Shrinkage for Functional Network Models, With Applications to Longitudinal Item Response Data, Asymptotic Theory of \(\boldsymbol \ell _1\) -Regularized PDE Identification from a Single Noisy Trajectory, Learning Gaussian graphical models with latent confounders, Fitting and testing log-linear subpopulation models with known support, Structure learning of exponential family graphical model with false discovery rate control, Unified analysis of stochastic gradient methods for composite convex and smooth optimization, Learning binary undirected graph in low dimensional regime, Region selection in Markov random fields: Gaussian case, Extended lasso-type MARS (LMARS) model in the description of biological network, Fluctuations in mean-field Ising models, Sparse inverse covariance estimation for high-throughput microRNA sequencing data in the Poisson log-normal graphical model, Kernel Ordinary Differential Equations, Constrained optimization for stratified treatment rules in reducing hospital readmission rates of diabetic patients, Decomposition of Covariate-Dependent Graphical Models with Categorical Data, An Additive Graphical Model for Discrete Data, The scalable birth-death MCMC algorithm for mixed graphical model learning with application to genomic data integration, Subbotin graphical models for extreme value dependencies with applications to functional neuronal connectivity, Time Series Source Separation Using Dynamic Mode Decomposition, Analysis of noisy survival data with graphical proportional hazards measurement error models, AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms, Direct Learning of Sparse Changes in Markov Networks by Density Ratio Estimation, Empirical comparison study of approximate methods for structure selection in binary graphical models, Structure Learning of Contextual Markov Networks using Marginal Pseudo‐likelihood, Sharp oracle inequalities and slope heuristic for specification probabilities estimation in discrete random fields, Sparse nonparametric graphical models, A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers, On the Complexity of Logistic Regression Models, Unnamed Item, Robust Variable and Interaction Selection for Logistic Regression and General Index Models, Unnamed Item, Log‐mean Linear Parameterization for Discrete Graphical Models of Marginal Independence and the Analysis of Dichotomizations, Learning performance in inverse Ising problems with sparse teacher couplings, Unnamed Item, Unnamed Item, Unnamed Item, Transmission matrix inference via pseudolikelihood decimation
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