High-dimensional Ising model selection using _1-regularized logistic regression
From MaRDI portal
Publication:973867
Abstract: We consider the problem of estimating the graph associated with a binary Ising Markov random field. We describe a method based on -regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an -constraint. The method is analyzed under high-dimensional scaling in which both the number of nodes and maximum neighborhood size are allowed to grow as a function of the number of observations . Our main results provide sufficient conditions on the triple and the model parameters for the method to succeed in consistently estimating the neighborhood of every node in the graph simultaneously. With coherence conditions imposed on the population Fisher information matrix, we prove that consistent neighborhood selection can be obtained for sample sizes with exponentially decaying error. When these same conditions are imposed directly on the sample matrices, we show that a reduced sample size of suffices for the method to estimate neighborhoods consistently. Although this paper focuses on the binary graphical models, we indicate how a generalization of the method of the paper would apply to general discrete Markov random fields.
Recommendations
- High-dimensional Ising model selection with Bayesian information criteria
- Sparse estimation in Ising model via penalized Monte Carlo methods
- High-dimensional structure estimation in Ising models: local separation criterion
- High-dimensional graphs and variable selection with the Lasso
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
Cites work
- An interior-point method for large-scale l₁-regularized logistic regression
- Approximating discrete probability distributions with dependence trees
- Blockwise sparse regression
- Causation, prediction, and search
- Consistent estimation of the basic neighborhood of Markov random fields
- Convex Analysis
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Graphical models, exponential families, and variational inference
- High-dimensional graphs and variable selection with the Lasso
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 3934272 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1408945 (Why is no real title available?)
- Just relax: convex programming methods for identifying sparse signals in noise
- Learning factor graphs in polynomial time and sample complexity
- Local operator theory, random matrices and Banach spaces.
- Matrix Analysis
- Maximum likelihood bounded tree-width Markov networks
- Model Selection and Estimation in Regression with Grouped Variables
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Probability Inequalities for Sums of Bounded Random Variables
- Reconstruction of Markov random fields from samples: some observations and algorithms
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Sparse permutation invariant covariance estimation
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Support union recovery in high-dimensional multivariate regression
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The Group Lasso for Logistic Regression
Cited in
(only showing first 100 items - show all)- A general algorithm for covariance modeling of discrete data
- Kernel Knockoffs Selection for Nonparametric Additive Models
- Estimation of high-dimensional graphical models using regularized score matching
- Simple method for inference in inverse Ising problem using full data
- A joint convex penalty for inverse covariance matrix estimation
- Sparse linear models and \(l_1\)-regularized 2SLS with high-dimensional endogenous regressors and instruments
- Local conditional and marginal approach to parameter estimation in discrete graphical models
- Sparse and low-rank matrix regularization for learning time-varying Markov networks
- Reconstruction of recurrent synaptic connectivity of thousands of neurons from simulated spiking activity
- Estimating the interaction graph of stochastic neural dynamics
- Stable graphical model estimation with random forests for discrete, continuous, and mixed variables
- 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
- ROCKET: robust confidence intervals via Kendall's tau for transelliptical graphical models
- A global approach for learning sparse Ising models
- High-dimensional structure learning of binary pairwise Markov networks: a comparative numerical study
- Inference under Fine-Gray competing risks model with high-dimensional covariates
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization
- Graphical-model based high dimensional generalized linear models
- Provable training set debugging for linear regression
- Feature selection for data integration with mixed multiview data
- 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: ``Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F. C. Stingo
- Composite mixture of log-linear models with application to psychiatric studies
- Parameter inference in a probabilistic model using clustered data
- De-noising analysis of noisy data under mixed graphical models
- Concentration and consistency results for canonical and curved exponential-family models of random graphs
- Pairwise sparse + low-rank models for variables of mixed type
- Joint estimation of heterogeneous exponential Markov random fields through an approximate likelihood inference
- Learning a tree-structured Ising model in order to make predictions
- Joint estimation of parameters in Ising model
- Statistical analysis of sparse approximate factor models
- Sparse directed acyclic graphs incorporating the covariates
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
- Bayesian model selection for high-dimensional Ising models, with applications to educational data
- Inference of large modified Poisson-type graphical models: application to RNA-seq data in childhood atopic asthma studies
- The IBMAP approach for Markov network structure learning
- Sparse equisigned PCA: algorithms and performance bounds in the noisy rank-1 setting
- Exact recovery in the Ising blockmodel
- Tuning parameter calibration for _1-regularized logistic regression
- Graphical models for zero-inflated single cell gene expression
- Robust measurement via a fused latent and graphical item response theory model
- Sparse Poisson regression with penalized weighted score function
- 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
- High-dimensional Ising model selection with Bayesian information criteria
- On model selection consistency of regularized M-estimators
- Identifying interacting pairs of sites in Ising models on a countable set
- Universality of the mean-field for the Potts model
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- Network-based discriminant analysis for multiclassification
- Bayesian structure learning in sparse Gaussian graphical models
- SLOPE is adaptive to unknown sparsity and asymptotically minimax
- Efficiently learning Ising models on arbitrary graphs (extended abstract)
- Combinatorial approach to exactly solve the 1D Ising model
- Inferring network structure in non-normal and mixed discrete-continuous genomic data
- Covariance structure approximation via gLasso in high-dimensional supervised classification
- Ising models for neural activity inferred via selective cluster expansion: structural and coding properties
- Sparse model selection in the highly under-sampled regime
- Statistical mechanics of the inverse Ising problem and the optimal objective function
- Cycle-based cluster variational method for direct and inverse inference
- Structure learning in inverse Ising problems using ℓ 2-regularized linear estimator
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- A sparse Ising model with covariates
- Learning loopy graphical models with latent variables: efficient methods and guarantees
- Multivariate Bernoulli distribution
- Adaptive cluster expansion for the inverse Ising problem: convergence, algorithm and tests
- The log-linear group-lasso estimator and its asymptotic properties
- Change-point computation for large graphical models: a scalable algorithm for Gaussian graphical models with change-points
- Learning quadratic variance function (QVF) DAG models via overdispersion scoring (ODS)
- On semiparametric exponential family graphical models
- Sparse estimation in Ising model via penalized Monte Carlo methods
- Hinge-loss Markov random fields and probabilistic soft logic
- Probabilistic graphical models and Markov networks
- Estimation of high-dimensional partially-observed discrete Markov random fields
- Comment on ``Hypothesis testing by convex optimization
- A unified framework for structured graph learning via spectral constraints
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
- Simultaneous inference for pairwise graphical models with generalized score matching
- Structure learning of undirected graphical models for count data.
- Predictive learning on hidden tree-structured Ising models
- Learning a high-dimensional linear structural equation model via _1-regularized regression
- Customer choice models vs. machine learning: finding optimal product displays on Alibaba
- Efficient learning of discrete graphical models*
- 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*
- Latent binary MRF for online reconstruction of large scale systems
- 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 _1-regularized PDE identification from a single noisy trajectory
- Extended lasso-type MARS (LMARS) model in the description of biological network
- Sparse inverse covariance estimation for high-throughput microRNA sequencing data in the Poisson log-normal graphical model
This page was built for publication: High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973867)
