OOD-Chameleon: Is Algorithm Selection for OOD Generalization Learnable?
Liangze Jiang, Damien Teney

TL;DR
This paper introduces OOD-Chameleon, a method that learns to select the best out-of-distribution generalization algorithm based on dataset characteristics, enabling better algorithm choice without extensive trial and error.
Contribution
It formulates algorithm selection as a multi-label classification problem trained on diverse datasets, providing a novel approach to OOD generalization without prior model training.
Findings
The learned selector effectively ranks algorithms on unseen shifts.
It identifies high-performing algorithms across various tasks.
It uncovers non-trivial decision rules for algorithm applicability.
Abstract
Out-of-distribution (OOD) generalization is challenging because distribution shifts come in many forms. Numerous algorithms exist to address specific settings, but choosing the right training algorithm for the right dataset without trial and error is difficult. Indeed, real-world applications often involve multiple types and combinations of shifts that are hard to analyze theoretically. Method. This work explores the possibility of learning the selection of a training algorithm for OOD generalization. We propose a proof of concept (OOD-Chameleon) that formulates the selection as a multi-label classification over candidate algorithms, trained on a dataset of datasets representing a variety of shifts. We evaluate the ability of OOD-Chameleon to rank algorithms on unseen shifts and datasets based only on dataset characteristics, i.e., without training models first, unlike traditional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsNeural Networks and Applications · Industrial Vision Systems and Defect Detection
