High Dimensional Logistic Regression Under Network Dependence

Abstract

Logistic regression is key method for modeling the probability of a binary outcome based on a collection of covariates. However, the classical formulation of logistic regression relies on the independent sampling assumption, which is often violated when the outcomes interact through an underlying network structure, such as over a temporal/spatial domain or on a social network. This necessitates the development of models that can simultaneously handle both the network `peer-effect' and the effect of high-dimensional covariates. In this paper, we develop a framework for incorporating such dependencies in a high-dimensional logistic regression model by introducing a quadratic interaction term, as in the Ising model, designed to capture the pairwise interactions from the underlying network. The resulting model can also be viewed as an Ising model, where the node-dependent external fields linearly encode the high-dimensional covariates. We propose a penalized maximum pseudo-likelihood method for estimating the network peer-effect and the effect of the covariates (the regression coefficients), which, in addition to handling the high-dimensionality of the parameters, conveniently avoids the computational intractability of the maximum likelihood approach. Under various standard regularity conditions, we show that the corresponding estimate attains the classical high-dimensional rate of consistency. Our results imply that even under network dependence it is possible to consistently estimate the model parameters at the same rate as in classical (independent) logistic regression, when the true parameter is sparse and the underlying network is not too dense. We also develop an efficient algorithm for computing the estimates and validate our theoretical results in numerical experiments. An application to selecting genes in clustering spatial transcriptomics data is also discussed.

Major updates. 54 pages, 5 figures

References in corpus (13)

• Simultaneous analysis of Lasso and Dantzig selector
• On the conditions used to prove oracle results for the Lasso
• High-dimensional Ising model selection using ${\ell }_1$-regularized logistic regression
• A modern maximum-likelihood theory for high-dimensional logistic regression
• High-dimensional structure estimation in Ising models: Local separation criterion
• Interaction Screening: Efficient and Sample-Optimal Learning of Ising Models
• Learning Exponential Families in High-Dimensions: Strong Convexity and Sparsity
• Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications
• Demand-Aware Network Designs of Bounded Degree
• Reconstruction from anisotropic random measurements
• Optimal Single Sample Tests for Structured versus Unstructured Network Data
• Logistic-Regression with peer-group effects via inference in higher order Ising models
• Learning from weakly dependent data under Dobrushin's condition