Distributionally Robust Safe Screening
Not on the map. Why?
Abstract (arXiv)
In this study, we propose a method Distributionally Robust Safe Screening (DRSS), for identifying unnecessary samples and features within a DR covariate shift setting. This method effectively combines DR learning, a paradigm aimed at enhancing model robustness against variations in data distribution, with safe screening (SS), a sparse optimization technique designed to identify irrelevant samples and features prior to model training. The core concept of the DRSS method involves reformulating the DR covariate-shift problem as a weighted empirical risk minimization problem, where the weights are subject to uncertainty within a predetermined range. By extending the SS technique to accommodate this weight uncertainty, the DRSS method is capable of reliably identifying unnecessary samples and features under any future distribution within a specified range. We provide a theoretical guarantee of the DRSS method and validate its performance through numerical experiments on both synthetic and real-world datasets.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 24 references that are in the map. First posted on arXiv 25 Apr 2024.
Builds on
10 of 24 references.
References · 10
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2022Memory Replay with Data Compression for Continual Learningcited by 80
- 2015Mind the duality gap: safer rules for the Lassocited by 31
- 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
- 2016Safe Pattern Pruning: An Efficient Approach for Predictive Pattern Miningcited by 13
- 2019Safe Sample Screening for Robust Support Vector Machinecited by 6
- 2015Quick sensitivity analysis for incremental data modification and its application to leave-one-out CV in linear classification problemscited by 5
- 2023Efficient Model Selection for Predictive Pattern Mining Model by Safe Pattern Pruningcited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.