The sample complexity of multi-distribution learning
Not on the map. Why?
Abstract (arXiv)
Multi-distribution learning generalizes the classic PAC learning to handle data coming from multiple distributions. Given a set of k data distributions and a hypothesis class of VC dimension d, the goal is to learn a hypothesis that minimizes the maximum population loss over k distributions, up to ε additive error. In this paper, we settle the sample complexity of multi-distribution learning by giving an algorithm of sample complexity widetildeO((d+k)ε-2) · (k/ε)o(1). This matches the lower bound up to sub-polynomial factor and resolves the COLT 2023 open problem of Awasthi, Haghtalab and Zhao [AHZ23].
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 25 of its 56 references that are in the map. First posted on arXiv 7 Dec 2023.
Builds on
25 of 56 references.
References · 25
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2018Multi-Task Learning as Multi-Objective Optimizationcited by 809
- 2019Agnostic Federated Learningcited by 451
- 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 334
- 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
- 2015The Optimal Sample Complexity of PAC Learningcited by 72
- 2021Multi-group Agnostic PAC Learnabilitycited by 42
- 2019Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-Armed Banditscited by 40
- 2021One for One, or All for All: Equilibria and Optimality of Collaboration in Federated Learningcited by 39
- 2022On-Demand Sampling: Learning Optimally from Multiple Distributionscited by 39
- 2019Limits of Private Learning with Access to Public Datacited by 38
13 more
- 2022Bagging is an Optimal PAC Learnercited by 34
- 2023Optimal PAC Bounds Without Uniform Convergencecited by 33
- 2021Simple and near-optimal algorithms for hidden stratification and multi-group learningcited by 26
- 2021Adaptive Sampling for Minimax Fair Classificationcited by 24
- 2018Improved Algorithms for Collaborative PAC Learningcited by 20
- 2022Memory Bounds for Continual Learningcited by 18
- 2020Boosting Simple Learnerscited by 16
- 2022Online Prediction in Sub-linear Spacecited by 16
- 2018Tight Bounds for Collaborative PAC Learning via Multiplicative Weightscited by 15
- 2023Near Optimal Memory-Regret Tradeoff for Online Learningcited by 15
- 2015Optimal and Adaptive Algorithms for Online Boostingcited by 12
- 2020Online Agnostic Boosting via Regret Minimizationcited by 12
- 2018Do Outliers Ruin Collaboration?cited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 4; 2026: 4.
12 papers.
- 2025Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyondcited by 15
- 2023Optimal Multi-Distribution Learningcited by 13
- 2024Derandomizing Multi-Distribution Learningcited by 5
- 2024Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsitycited by 5
- 2025How Many Domains Suffice for Domain Generalization? A Tight Characterization via the Domain Shattering Dimensioncited by 3
- 2024Collaborative Learning with Different Labeling Functionscited by 2
- 2025Towards Fundamental Limits for Active Multi-distribution Learningcited by 1
- 2025Sample-Adaptivity Tradeoff in On-Demand Samplingcited by 1
- 2026Is Multi-Distribution Learning as Easy as PAC Learning: Sharp Rates with Bounded Label Noisecited by 1
- 2026Optimal Deterministic Multicalibration and Omnipredictioncited by 1
- 2026A One-Inclusion Graph Approach to Multi-Group Learningcited by 0
- 2026Learning Distributions from Multiple Data Providerscited by 0
- 2026Learning Distributions from Multiple Data Providers27 Jul 2026
- 2026Optimal Deterministic Multicalibration and Omniprediction18 Jun 2026
- 2026A One-Inclusion Graph Approach to Multi-Group Learning24 Mar 2026
- 2026Is Multi-Distribution Learning as Easy as PAC Learning: Sharp Rates with Bounded Label Noise24 Feb 2026
- 2025Sample-Adaptivity Tradeoff in On-Demand Sampling19 Nov 2025
- 2025Towards Fundamental Limits for Active Multi-distribution Learning21 Jun 2025
- 2025How Many Domains Suffice for Domain Generalization? A Tight Characterization via the Domain Shattering Dimension20 Jun 2025
- 2025Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond19 Jan 2025
- 2024Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity1 Oct 2024
- 2024Derandomizing Multi-Distribution Learning26 Sep 2024
- 2024Collaborative Learning with Different Labeling Functions16 Feb 2024
- 2023Optimal Multi-Distribution Learning8 Dec 2023