Near-Optimal Coresets for Least-Squares Regression
From MaRDI portal
Publication:5346331
DOI10.1109/TIT.2013.2272457zbMATH Open1364.62170arXiv1202.3505OpenAlexW1992065791MaRDI QIDQ5346331FDOQ5346331
Malik Magdon-Ismail, Christos Boutsidis, Petros Drineas
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We study (constrained) least-squares regression as well as multiple response least-squares regression and ask the question of whether a subset of the data, a coreset, suffices to compute a good approximate solution to the regression. We give deterministic, low order polynomial-time algorithms to construct such coresets with approximation guarantees, together with lower bounds indicating that there is not much room for improvement upon our results.
Full work available at URL: https://arxiv.org/abs/1202.3505
Linear regression; mixed models (62J05) Learning and adaptive systems in artificial intelligence (68T05) Parametric inference under constraints (62F30)
Cited In (6)
- Jointly evolving and compressing fuzzy system for feature reduction and classification
- Generating Neural Archetypes to Instruct Fast and Interpretable Decisions
- Making Sense of Economics Datasets with Evolutionary Coresets
- Title not available (Why is that?)
- Core-elements for large-scale least squares estimation
- Random projections for Bayesian regression
This page was built for publication: Near-Optimal Coresets for Least-Squares Regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346331)
