Pith. sign in

REVIEW 2 cited by

Domain Generalization by Mutual-Information Regularization with Pre-trained Models

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 2203.10789 v2 pith:C3MKS6UE submitted 2022-03-21 cs.LG cs.CV

classification cs.LGcs.CV
keywords modeldomainmirodomainsoraclepre-trainedsourceexperiments
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Domain generalization (DG) aims to learn a generalized model to an unseen target domain using only limited source domains. Previous attempts to DG fail to learn domain-invariant representations only from the source domains due to the significant domain shifts between training and test domains. Instead, we re-formulate the DG objective using mutual information with the oracle model, a model generalized to any possible domain. We derive a tractable variational lower bound via approximating the oracle model by a pre-trained model, called Mutual Information Regularization with Oracle (MIRO). Our extensive experiments show that MIRO significantly improves the out-of-distribution performance. Furthermore, our scaling experiments show that the larger the scale of the pre-trained model, the greater the performance improvement of MIRO. Source code is available at https://github.com/kakaobrain/miro.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. PEER pressure: Model-to-Model Regularization for Single Source Domain Generalization

    cs.LG 2025-05 conditional novelty 7.0 of 10

    PEER trains a proxy model on augmented data under mutual information regularization, then periodically averages proxy snapshots into the task model, improving out-of-distribution accuracy and reducing mid-training flu...

  2. Seeking Consistent Flat Minima for Better Domain Generalization via Refining Loss Landscapes

    cs.CV 2024-12 conditional novelty 6.0 of 10

    A self-feedback training framework that refines loss landscapes with dynamically generated soft labels finds more consistent flat minima and improves domain generalization accuracy across five benchmarks.

Pith tools