Feature Selection from Differentially Private Correlations
Not on the map. Why?
Abstract (arXiv)
Data scientists often seek to identify the most important features in high-dimensional datasets. This can be done through L1-regularized regression, but this can become inefficient for very high-dimensional datasets. Additionally, high-dimensional regression can leak information about individual datapoints in a dataset. In this paper, we empirically evaluate the established baseline method for feature selection with differential privacy, the two-stage selection technique, and show that it is not stable under sparsity. This makes it perform poorly on real-world datasets, so we consider a different approach to private feature selection. We employ a correlations-based order statistic to choose important features from a dataset and privatize them to ensure that the results do not leak information about individual datapoints. We find that our method significantly outperforms the established baseline for private feature selection on many datasets.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 12 of its 62 references that are in the map. First posted on arXiv 20 Aug 2024.
Builds on
12 of 62 references.
References · 12
- 2016Gap Safe screening rules for sparsity enforcing penaltiescited by 39
- 2019Practical Differentially Private Top-k Selection with Pay-what-you-get Compositioncited by 39
- 2017Forward-Backward Selection with Early Droppingcited by 18
- 2021Oneshot Differentially Private Top-k Selectioncited by 16
- 2014Screening Tests for Lasso Problemscited by 15
- 2019Screening Rules for Lasso with Non-Convex Sparse Regularizerscited by 11
- 2023Scaling Up Differentially Private LASSO Regularized Logistic Regression via Faster Frank-Wolfe Iterationscited by 8
- 2023The Challenge of Differentially Private Screening Rulescited by 6
- 2015Fast and Scalable Lasso via Stochastic Frank-Wolfe Methods with a Convergence Guaranteecited by 5
- 2021Look-Ahead Screening Rules for the Lassocited by 3
- 2022Differentially Private Top-k Selection via Canonical Lipschitz Mechanismcited by 2
- 2024Provable Privacy with Non-Private Pre-Processingcited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.