REVIEW 1 cited by
Distributionally Robust Safe Sample Elimination under Covariate Shift
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We consider a machine learning setup where one training dataset is used to train multiple models across slightly different data distributions. This occurs when customized models are needed for various deployment environments. To reduce storage and training costs, we propose the DRSSS method, which combines distributionally robust (DR) optimization and safe sample screening (SSS). The key benefit of this method is that models trained on the reduced dataset will perform the same as those trained on the full dataset for all possible different environments. In this paper, we focus on covariate shift as a type of data distribution change and demonstrate the effectiveness of our method through experiments.
Forward citations
Cited by 1 Pith paper
-
Distributionally Robust Coreset Selection under Covariate Shift
DRCS derives an upper bound on worst-case validation error under covariate shift and greedily chooses a coreset that minimizes this bound.
Discussion (0). Continue with ORCID to comment.