Linear Regression using Heterogeneous Data Batches
Not on the map. Why?
Abstract (arXiv)
In many learning applications, data are collected from multiple sources, each providing a batch of samples that by itself is insufficient to learn its input-output relationship. A common approach assumes that the sources fall in one of several unknown subgroups, each with an unknown input distribution and input-output relationship. We consider one of this setup's most fundamental and important manifestations where the output is a noisy linear combination of the inputs, and there are k subgroups, each with its own regression vector. Prior work~citekong2020meta showed that with abundant small-batches, the regression vectors can be learned with only few, tildeOmega( k3/2), batches of medium-size with tildeOmega(√ k) samples each. However, the paper requires that the input distribution for all k subgroups be isotropic Gaussian, and states that removing this assumption is an ``interesting and challenging problem". We propose a novel gradient-based algorithm that improves on the existing results in several ways. It extends the applicability of the algorithm by: (1) allowing the subgroups' underlying input distributions to be different, unknown, and heavy-tailed; (2) recovering all subgroups followed by a significant proportion of batches even for infinite k; (3) removing the separation requirement between the regression vectors; (4) reducing the number of batches and allowing smaller batch sizes.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 41 of its 60 references that are in the map. First posted on arXiv 5 Sep 2023.
Builds on
41 of 60 references.
References · 41
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2018Meta-Learning with Latent Embedding Optimizationcited by 476
- 2018TADAM: Task dependent adaptive metric for improved few-shot learningcited by 408
- 2019Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few Examplescited by 312
- 2021A Field Guide to Federated Optimizationcited by 312
- 2018Sever: A Robust Meta-Algorithm for Stochastic Optimizationcited by 123
- 2016Learning from Untrusted Datacited by 90
- 2018Robust Estimation via Robust Gradient Estimationcited by 76
- 2018Efficient Algorithms and Lower Bounds for Robust Linear Regressioncited by 76
- 2018Efficient Algorithms for Outlier-Robust Regressioncited by 72
- 2020Robust regression with covariate filtering: Heavy tails and adversarial contaminationcited by 49
- 2020Meta-learning for mixed linear regressioncited by 44
29 more
- 2019List-Decodable Linear Regressioncited by 42
- 2020Robust Meta-learning for Mixed Linear Regression with Small Batchescited by 41
- 2015Robust Regression via Hard Thresholdingcited by 39
- 2018Learning Mixtures of Linear Regressions with Nearly Optimal Complexitycited by 37
- 2019List Decodable Learning via Sum of Squarescited by 37
- 2019Outlier-robust estimation of a sparse linear model using ℓ1-penalized Huber's M-estimatorcited by 31
- 2020Optimal Robust Linear Regression in Nearly Linear Timecited by 31
- 2018High Dimensional Robust Sparse Regressioncited by 29
- 2020Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Modelscited by 28
- 2016Solving a Mixture of Many Random Linear Equations by Tensor Decomposition and Alternating Minimizationcited by 26
- 2019Learning Mixtures of Linear Regressions in Subexponential Time via Fourier Momentscited by 26
- 2021Statistical Query Lower Bounds for List-Decodable Linear Regressioncited by 25
- 2013Spectral Experts for Estimating Mixtures of Linear Regressionscited by 22
- 2017Robust Regression via Mutivariate Regression Depthcited by 20
- 2016Avoiding Imposters and Delinquents: Adversarial Crowdsourcing and Peer Predictioncited by 15
- 2020Globally-convergent Iteratively Reweighted Least Squares for Robust Regression Problemscited by 15
- 2021Robust Regression Revisited: Acceleration and Improved Estimation Ratescited by 15
- 2022Learning Mixtures of Linear Dynamical Systemscited by 15
- 2017Learning Discrete Distributions from Untrusted Batchescited by 14
- 2020On the Sample Complexity of Adversarial Multi-Source PAC Learningcited by 11
- 2019Optimal Robust Learning of Discrete Distributions from Batchescited by 10
- 2022On Learning Mixture of Linear Regressions in the Non-Realizable Settingcited by 10
- 2020Learning Structured Distributions From Untrusted Batches: Faster and Simplercited by 8
- 2020A General Method for Robust Learning from Batchescited by 8
- 2021Robust Estimation for Random Graphscited by 8
- 2018Compressed Sensing with Adversarial Sparse Noise via L1 Regressioncited by 7
- 2022Trimmed Maximum Likelihood Estimation for Robust Learning in Generalized Linear Modelscited by 6
- 2022Efficient List-Decodable Regression using Batchescited by 5
- 2023Mixed Regression via Approximate Message Passingcited by 3
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.
- 2023Transformers can optimally learn regression mixture modelscited by 15
- 2024Collaborative Learning with Different Labeling Functionscited by 2
- 2025Batch List-Decodable Linear Regression via Higher Momentscited by 0
- 2025Batch List-Decodable Linear Regression via Higher Moments12 Mar 2025
- 2024Collaborative Learning with Different Labeling Functions16 Feb 2024
- 2023Transformers can optimally learn regression mixture models14 Nov 2023