mlsanityData to 14 Oct 2026

Integrated path stability selection

arXiv 2403.15877 ↗First posted 23 Mar 2024stat.ME stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Stability selection is a popular method for improving feature selection algorithms. One of its key attributes is that it provides theoretical upper bounds on the expected number of false positives, E(FP), enabling false positive control in practice. However, stability selection often selects few features because existing bounds on E(FP) are relatively loose. In this paper, we introduce a novel approach to stability selection based on integrating stability paths rather than maximizing over them. This yields upper bounds on E(FP) that are much stronger than previous bounds, leading to significantly more true positives in practice for the same target E(FP). Furthermore, our method requires no more computation than the original stability selection algorithm. We demonstrate the method on simulations and real data from two cancer studies.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 5 of its 58 references that are in the map. First posted on arXiv 23 Mar 2024.

Builds on

5 of 58 references.

References · 5

  1. 2013Confidence Intervals and Hypothesis Testing for High-Dimensional Regressioncited by 79
  2. 2022Beyond L1: Faster and Better Sparse Models with skglmcited by 16
  3. 2014Controlling false discoveries in high-dimensional situations: Boosting with stability selectioncited by 7
  4. 2018High-dimensional regression in practice: an empirical study of finite-sample prediction, variable selection and rankingcited by 3
  5. 2022Loss-guided Stability Selectioncited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.