Ising Model Selection Using ℓ1-Regularized Linear Regression: A Statistical Mechanics Analysis
Not on the map. Why?
Abstract (arXiv)
We theoretically analyze the typical learning performance of ℓ1-regularized linear regression (ℓ1-LinR) for Ising model selection using the replica method from statistical mechanics. For typical random regular graphs in the paramagnetic phase, an accurate estimate of the typical sample complexity of ℓ1-LinR is obtained. Remarkably, despite the model misspecification, ℓ1-LinR is model selection consistent with the same order of sample complexity as ℓ1-regularized logistic regression (ℓ1-LogR), i.e., M=Oleft(log Nright), where N is the number of variables of the Ising model. Moreover, we provide an efficient method to accurately predict the non-asymptotic behavior of ℓ1-LinR for moderate M, N, such as precision and recall. Simulations show a fairly good agreement between theoretical predictions and experimental results, even for graphs with many loops, which supports our findings. Although this paper mainly focuses on ℓ1-LinR, our method is readily applicable for precisely characterizing the typical learning performances of a wide class of ℓ1-regularized M-estimators including ℓ1-LogR and interaction screening.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 12 of its 60 references that are in the map. First posted on arXiv 8 Feb 2021.
Builds on
12 of 60 references.
References · 12
- 2020Generalisation error in learning with random features and the hidden manifold modelcited by 126
- 2014Efficiently learning Ising models on arbitrary graphscited by 50
- 2016Interaction Screening: Efficient and Sample-Optimal Learning of Ising Modelscited by 43
- 2017Inverse statistical problems: from the inverse Ising problem to data sciencecited by 36
- 2016Optimal structure and parameter learning of Ising modelscited by 26
- 2018Sparse Logistic Regression Learns All Discrete Pairwise Graphical Modelscited by 16
- 2016Statistical Mechanics of High-Dimensional Inferencecited by 13
- 2020Asymptotic errors for convex penalized linear regression beyond Gaussian matricescited by 6
- 2017A statistical physics approach to learning curves for the Inverse Ising problemcited by 4
- 2019Learning performance in inverse Ising problems with sparse teacher couplingscited by 3
- 2020Structure Learning in Inverse Ising Problems Using ℓ2-Regularized Linear Estimatorcited by 3
- 2016Statistical mechanics of the inverse Ising problem and the optimal objective functioncited by 1
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 0; 2025: 0; 2026: 2.
4 papers.
- 2023Average case analysis of Lasso under ultra-sparse conditionscited by 5
- 2026Zero-Flow Encoderscited by 4
- 2021On Model Selection Consistency of Lasso for High-Dimensional Ising Modelscited by 1
- 2026Transfer Learning in High-dimensional Ising Modelscited by 0
- 2026Transfer Learning in High-dimensional Ising Models3 Jul 2026
- 2026Zero-Flow Encoders31 Jan 2026
- 2023Average case analysis of Lasso under ultra-sparse conditions25 Feb 2023
- 2021On Model Selection Consistency of Lasso for High-Dimensional Ising Models16 Oct 2021