Safe Distributionally Robust Feature Selection under Covariate Shift
Not on the map. Why?
Abstract (arXiv)
In practical machine learning, the environments encountered during the model development and deployment phases often differ, especially when a model is used by many users in diverse settings. Learning models that maintain reliable performance across plausible deployment environments is known as distributionally robust (DR) learning. In this work, we study the problem of distributionally robust feature selection (DRFS), with a particular focus on sparse sensing applications motivated by industrial needs. In practical multi-sensor systems, a shared subset of sensors is typically selected prior to deployment based on performance evaluations using many available sensors. At deployment, individual users may further adapt or fine-tune models to their specific environments. When deployment environments differ from those anticipated during development, this strategy can result in systems lacking sensors required for optimal performance. To address this issue, we propose safe-DRFS, a novel approach that extends safe screening from conventional sparse modeling settings to a DR setting under covariate shift. Our method identifies a feature subset that encompasses all subsets that may become optimal across a specified range of input distribution shifts, with finite-sample theoretical guarantees of no false feature elimination.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 33 references that are in the map. First posted on arXiv 17 Mar 2026.
Builds on
18 of 33 references.
References · 18
- 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 333
- 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
- 2020Domain Adaptive Ensemble Learningcited by 156
- 2019A review of domain adaptation without target labelscited by 154
- 2016Variance-based regularization with convex objectivescited by 153
- 2015Distributionally Robust Logistic Regressioncited by 124
- 2016Gap Safe screening rules for sparsity enforcing penaltiescited by 38
- 2015Mind the duality gap: safer rules for the Lassocited by 31
- 2019Computing Full Conformal Prediction Set with Approximate Homotopycited by 19
- 2016Simultaneous Safe Screening of Features and Samples in Doubly Sparse Modelingcited by 17
- 2015GAP Safe screening rules for sparse multi-task and multi-class modelscited by 16
- 2014Screening Tests for Lasso Problemscited by 15
6 more
- 2013A Safe Screening Rule for Sparse Logistic Regressioncited by 14
- 2016Safe Pattern Pruning: An Efficient Approach for Predictive Pattern Miningcited by 13
- 2013Safe Screening With Variational Inequalities and Its Application to LASSOcited by 11
- 2015Regularization Path of Cross-Validation Error Lower Boundscited by 4
- 2018Safe RuleFit: Learning Optimal Sparse Rule Model by Meta Safe Screeningcited by 3
- 2025Distributionally Robust Feature Selectioncited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.