Active Sampling for Linear Regression Beyond the $\ell_2$ Norm
Musco, Cameron, Musco, Christopher, Woodruff, David P., Yasuda, Taisuke
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
Nov-8-2021
- Country:
- North America
- United States
- Utah > Salt Lake County
- Salt Lake City (0.04)
- Pennsylvania
- Allegheny County > Pittsburgh (0.04)
- Philadelphia County > Philadelphia (0.04)
- Massachusetts > Middlesex County
- Cambridge (0.04)
- Maryland
- Montgomery County > Bethesda (0.04)
- Baltimore (0.04)
- Hawaii > Honolulu County
- Honolulu (0.04)
- California
- San Diego County > San Diego (0.04)
- Alameda County > Berkeley (0.04)
- Santa Clara County > San Jose (0.04)
- Utah > Salt Lake County
- Canada > British Columbia
- United States
- Europe
- Spain > Canary Islands (0.04)
- United Kingdom > England
- Cambridgeshire > Cambridge (0.04)
- Netherlands > South Holland
- Dordrecht (0.04)
- Belgium > Flanders
- Flemish Brabant > Leuven (0.04)
- North America
- Genre:
- Research Report > New Finding (0.66)
- Technology: