Distributionally Robust Safe Sample Screening
<|reference_start|>Distributionally Robust Safe Sample Screening: In this study, we propose a machine learning method called Distributionally Robust Safe Sample Screening (DRSSS). DRSSS aims to identify unnecessary training samples, even when the distribution of the training samples changes in the future. To achieve this, we effectively combine the distributionally robust (DR) paradigm, which aims to enhance model robustness against variations in data distribution, with the safe sample screening (SSS), which identifies unnecessary training samples prior to model training. Since we need to consider an infinite number of scenarios regarding changes in the distribution, we applied SSS because it does not require model training after the change of the distribution. In this paper, we employed the covariate shift framework to represent the distribution of training samples and reformulated 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 existing SSS technique to accommodate this weight uncertainty, the DRSSS method is capable of reliably identifying unnecessary samples under any future distribution within a specified range. We provide a theoretical guarantee for the DRSSS method and validate its performance through numerical experiments on both synthetic and real-world datasets.<|reference_end|>
@article{hanada2024distributionally,
    title={Distributionally Robust Safe Sample Elimination under Covariate Shift},
    author={Hiroyuki Hanada, Tatsuya Aoyama, Satoshi Akahane, Tomonari Tanaka,
  Yoshito Okura, Yu Inatsu, Noriaki Hashimoto, Shion Takeno, Taro Murayama,
  Hanju Lee, Shinya Kojima, Ichiro Takeuchi},
    journal={arXiv preprint arXiv:2406.05964},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.05964},
    primaryClass={stat.ML cs.LG}
}