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
- 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?)
- An interior-point method for large-scale \(l_1\)-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
- 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)- De-noising analysis of noisy data under mixed graphical models
- Kernel Ordinary Differential Equations
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- Estimating time-varying networks
- Probabilistic graphical models and Markov networks
- Efficiently learning Ising models on arbitrary graphs (extended abstract)
- Nonparametric augmented probability weighting with sparsity
- Multiclass analysis and prediction with network structured covariates
- Direct Learning of Sparse Changes in Markov Networks by Density Ratio Estimation
- An oracle approach for interaction neighborhood estimation in random fields
- Combinatorial approach to exactly solve the 1D Ising model
- Nonparametric discriminant analysis with network structures in predictor
- Graphical models for zero-inflated single cell gene expression
- Region selection in Markov random fields: Gaussian case
- Robust Variable and Interaction Selection for Logistic Regression and General Index Models
- Exact recovery in the Ising blockmodel
- Robust measurement via a fused latent and graphical item response theory model
- A global approach for learning sparse Ising models
- scientific article; zbMATH DE number 7306910 (Why is no real title available?)
- Learning performance in inverse Ising problems with sparse teacher couplings
- Customer choice models vs. machine learning: finding optimal product displays on Alibaba
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
- Identifying interacting pairs of sites in Ising models on a countable set
- AMP chain graphs: minimal separators and structure learning algorithms
- Sparse directed acyclic graphs incorporating the covariates
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Unified analysis of stochastic gradient methods for composite convex and smooth optimization
- Sparse inverse covariance estimation for high-throughput microRNA sequencing data in the Poisson log-normal graphical model
- An Additive Graphical Model for Discrete Data
- Stable graphical model estimation with random forests for discrete, continuous, and mixed variables
- Non-concave penalized estimation based on the neighborhood selection method for Ising model
- Simple method for inference in inverse Ising problem using full data
- On the complexity of logistic regression models
- Structure learning of exponential family graphical model with false discovery rate control
- High-dimensional structure learning of binary pairwise Markov networks: a comparative numerical study
- Inference under Fine-Gray competing risks model with high-dimensional covariates
- FDR control and power analysis for high-dimensional logistic regression via Stabkoff
- Ising models for neural activity inferred via selective cluster expansion: structural and coding properties
- Simultaneous inference for pairwise graphical models with generalized score matching
- Time Series Source Separation Using Dynamic Mode Decomposition
- Graphical-model based high dimensional generalized linear models
- Reconstruction of recurrent synaptic connectivity of thousands of neurons from simulated spiking activity
- Bayesian model selection for high-dimensional Ising models, with applications to educational data
- SLOPE is adaptive to unknown sparsity and asymptotically minimax
- A stochastic block Ising model for multi-layer networks with inter-layer dependence
- Empirical comparison study of approximate methods for structure selection in binary graphical models
- Bayesian feature selection with strongly regularizing priors maps to the Ising model
- Asymptotic theory of \(\ell_1\)-regularized PDE identification from a single noisy trajectory
- Learning quadratic variance function (QVF) DAG models via overdispersion scoring (ODS)
- Adaptive cluster expansion for the inverse Ising problem: convergence, algorithm and tests
- Generalized score matching for non-negative data
- High-dimensional Poisson structural equation model learning via \(\ell_1\)-regularized regression
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- Transmission matrix inference via pseudolikelihood decimation
- High-dimensional Ising model selection with Bayesian information criteria
- Inference of large modified Poisson-type graphical models: application to RNA-seq data in childhood atopic asthma studies
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization
- Tensor recovery in high-dimensional Ising models
- High-dimensional undirected graphical models for arbitrary mixed data
- Structure learning of undirected graphical models for count data.
- Concentration and consistency results for canonical and curved exponential-family models of random graphs
- 1D Ising model using the Kronecker sum and Kronecker product
- On model selection consistency of regularized M-estimators
- Objective Bayesian edge screening and structure selection for Ising networks
- Almost sure convergence rates of stochastic proximal gradient descent algorithm
- Sparse estimation in Ising model via penalized Monte Carlo methods
- The Dantzig selector for a linear model of diffusion processes
- scientific article; zbMATH DE number 7370576 (Why is no real title available?)
- scientific article; zbMATH DE number 7415078 (Why is no real title available?)
- Variable screening in multivariate linear regression with high-dimensional covariates
- Tuning parameter calibration for _1-regularized logistic regression
- Honest variable selection in linear and logistic regression models via \(\ell _{1}\) and \(\ell _{1}+\ell _{2}\) penalization
- 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
- Fitting and testing log-linear subpopulation models with known support
- Statistical mechanics of the inverse Ising problem and the optimal objective function
- Estimating finite mixtures of ordinal graphical models
- Discussion to: ``Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F. C. Stingo
- Parameter inference in a probabilistic model from data: regulation of transition rate in the Monte Carlo method
- Estimation of graphical models: an overview of selected topics
- Covariance structure approximation via gLasso in high-dimensional supervised classification
- Sparse linear models and \(l_1\)-regularized 2SLS with high-dimensional endogenous regressors and instruments
- Universality of the mean-field for the Potts model
- Change-point computation for large graphical models: a scalable algorithm for Gaussian graphical models with change-points
- Sparse and low-rank matrix regularization for learning time-varying Markov networks
- Tight conditions for consistency of variable selection in the context of high dimensionality
- Network-based discriminant analysis for multiclassification
- Computational implications of reducing data to sufficient statistics
- Estimating heterogeneous graphical models for discrete data with an application to roll call voting
- Poisson dependency networks: gradient boosted models for multivariate count data
- Overview of research advance for knockoff methods
- Markov neighborhood regression for statistical inference of high-dimensional generalized linear models
- scientific article; zbMATH DE number 7370619 (Why is no real title available?)
- Estimation of high-dimensional partially-observed discrete Markov random fields
- Structure estimation of binary graphical models on stratified data: application to the description of injury tables for victims of road accidents
- Loglinear model selection and human mobility
- Cycle-based cluster variational method for direct and inverse inference
- scientific article; zbMATH DE number 7415101 (Why is no real title available?)
- Analysis of noisy survival data with graphical proportional hazards measurement error models
- Sharp oracle inequalities and slope heuristic for specification probabilities estimation in discrete random fields
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)
