Pith. sign in

REVIEW 2 cited by

Adaptive Risk Minimization: Learning to Adapt to Domain 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

arxiv 2007.02931 v4 pith:AR4OIDQI submitted 2020-07-06 cs.LG stat.ML

classification cs.LGstat.ML
keywords domainshifttestdomainslearningadaptmethodstraining
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A fundamental assumption of most machine learning algorithms is that the training and test data are drawn from the same underlying distribution. However, this assumption is violated in almost all practical applications: machine learning systems are regularly tested under distribution shift, due to changing temporal correlations, atypical end users, or other factors. In this work, we consider the problem setting of domain generalization, where the training data are structured into domains and there may be multiple test time shifts, corresponding to new domains or domain distributions. Most prior methods aim to learn a single robust model or invariant feature space that performs well on all domains. In contrast, we aim to learn models that adapt at test time to domain shift using unlabeled test points. Our primary contribution is to introduce the framework of adaptive risk minimization (ARM), in which models are directly optimized for effective adaptation to shift by learning to adapt on the training domains. Compared to prior methods for robustness, invariance, and adaptation, ARM methods provide performance gains of 1-4% test accuracy on a number of image classification problems exhibiting domain shift.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 28 citations worldwide. Full citation record

  1. Online Variance Reduction for Domain Adaptation on Streaming Data

    cs.LG 2026-07 conditional novelty 6.0 of 10

    ARROW is a new streaming algorithm that reduces minibatch variance for MMD and CORAL by reweighting each incoming batch to match an exponential moving average of alignment statistics.

  2. Variance-reduced Domain Adaptation using Paired Sampling

    cs.LG 2026-07 conditional novelty 5.0 of 10

    PSDA pairs source-target examples into quadruplets via linear assignment problems, reducing the variance of MMD/CORAL minibatch gradient estimates and improving target-domain accuracy on Spawrious, Office-Home, and Humpbacks.

Pith tools