Mix and Match: An Optimistic Tree-Search Approach for Learning Models from Mixture Distributions
Matthew Faw, Rajat Sen, Karthikeyan Shanmugam, Constantine Caramanis, Sanjay Shakkottai
Abstract
We consider a covariate shift problem where one has access to several different training datasets for the same learning problem and a small validation set which possibly differs from all the individual training distributions. This covariate shift is caused, in part, due to unobserved features in the datasets. The objective, then, is to find the best mixture distribution over the training datasets (with only observed features) such that training a learning algorithm using this mixture has the best validation performance. Our proposed algorithm, , combines stochastic gradient descent (SGD) with optimistic tree search and model re-use (evolving partially trained models with samples from different mixture distributions) over the space of mixtures, for this task. We prove simple regret guarantees for our algorithm with respect to recovering the optimal mixture, given a total budget of SGD evaluations. Finally, we validate our algorithm on two real-world datasets.
Ask Lune
Know this paper in minutes, not an afternoon.
Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.
1 top-tier paper has cited it since. Know what they found before your reviewers do.
Lune can draw on
the full paper · the top-tier papers that cite it · related work
Free to start. No credit card required.
Lineage
Cited by top-tier papers1
Related papers
- Double-Weighting for Covariate Shift AdaptationJosé Ignacio Segovia-Martín, Santiago Mazuelas, Anqi LiuICML 2023 · 9 citations
- Mixture Weight Estimation and Model Prediction in Multi-source Multi-target Domain AdaptationYuyang Deng, Ilja Kuzborskij, Mehrdad MahdaviNeurIPS 2023 · 3 citations
- OOD-Chameleon: Is Algorithm Selection for OOD Generalization Learnable?Liangze Jiang, Damien TeneyICML 2025
- Principled Model Routing for Unknown Mixtures of Source DomainsChristoph Dann, Yishay Mansour, Teodor Vanislavov Marinov, Mehryar MohriNeurIPS 2025 · 4 citations
- Match: A Maximum-Likelihood Approach for Classification under Label ShiftZahra Donyavi, Feiyu Li, Yunrui Zhang, Diego Furtado Silva et al.KDD 2025 · 1 citation
