Active Sampling for Linear Regression Beyond the $\ell_2$ Norm

Musco, Cameron, Musco, Christopher, Woodruff, David P., Yasuda, Taisuke

arXiv.org Machine Learning 

We study active sampling algorithms for linear regression, which aim to query only a small number of entries of a target vector $b\in\mathbb{R}^n$ and output a near minimizer to $\min_{x\in\mathbb{R}^d}\|Ax-b\|$, where $A\in\mathbb{R}^{n \times d}$ is a design matrix and $\|\cdot\|$ is some loss function. For $\ell_p$ norm regression for any $0