Papers › Domain Generalization Using Large Pretrained Models with Mixture-of-Adapters
Domain Generalization Using Large Pretrained Models with Mixture-of-Adapters
Gyuseong Lee, Wooseok Jang, Jinhyeon Kim, Jaewoo Jung, Seungryong Kim
Learning robust vision models that perform well in out-of-distribution (OOD) situations is an important task for model deployment in real-world settings. Despite extensive research in this field, many proposed methods have only shown minor performance improvements compared to the simplest empirical risk minimization (ERM) approach, which was evaluated on a benchmark with a limited hyperparameter search space. Our focus in this study is on leveraging the knowledge of large pretrained models to improve handling of OOD scenarios and tackle domain generalization problems. However, prior research has revealed that naively fine-tuning a large pretrained model can impair OOD robustness. Thus, we employ parameter-efficient fine-tuning (PEFT) techniques to effectively preserve OOD robustness while working with large models. Our extensive experiments and analysis confirm that the most effective approaches involve ensembling diverse models and increasing the scale of pretraining. As a result, we achieve state-of-the-art performance in domain generalization tasks. Our code and project page are available at: https://cvlab-kaist.github.io/MoA
In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_citation_path(paper_1="2310.11031", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2310.11031")
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Domain Generalization | DomainNet | MoA (OpenCLIP, ViT-B/16) | Average Accuracy | 62.7 | #5 of 38 | Archive leaderboard | report |
| Domain Generalization | Office-Home | MoA (OpenCLIP, ViT-B/16) | Average Accuracy | 90.6 | #1 of 45 | Archive leaderboard | report |
| Domain Generalization | PACS | MoA (OpenCLIP, ViT-B/16) | Average Accuracy | 97.4 | #5 of 133 | Archive leaderboard | report |
| Domain Generalization | TerraIncognita | MoA (OpenCLIP, ViT-B/16) | Average Accuracy | 52.8 | #17 of 30 | Archive leaderboard | report |
| Domain Generalization | VLCS | MoA (OpenCLIP, ViT-B/16) | Average Accuracy | 83.1 | #5 of 37 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections