The DOI matches its Crossref record.
Algorithms for subset selection in linear regression
Abstract
We study the problem of selecting a subset of k random variables to observe that will yield the best linear prediction of another variable of interest, given the pairwise correlations between the observation variables and the predictor variable. Under approximation preserving reductions, this problem is equivalent to the "sparse approximation" problem of approximating signals concisely. The subset selection problem is NP-hard in general; in this paper, we propose and analyze exact and approximation algorithms for several special cases of practical interest. Specifically, we give an FPTAS when the covariance matrix has constant bandwidth, and exact algorithms when the associated covariance graph, consisting of edges for pairs of variables with non-zero correlation, forms a tree or has a large (known) independent set. Furthermore, we give an exact algorithm when the variables can be embedded into a line such that the covariance decreases exponentially in the distance, and a constant-factor approximation when the variables have no "conditional suppressor variables". Much of our reasoning is based on perturbation results for the R2 multiple correlation measure, which is frequently used as a natural measure for "goodness-of-fit statistics". It lies at the core of our FPTAS, and also allows us to extend our exact algorithms to approximation algorithms when the matrix "nearly" falls into one of the above classes. We also use our perturbation analysis to prove approximation guarantees for the widely used "Forward Regression" heuristic under the assumption that the observation variables are nearly independent.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Settles, B. (2012) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.2200/s00429ed1v01y201207aim018 · Cited by 605
Learning time-series shapelets
Grabocka, J., Schilling, N., Wistuba, M., & Schmidt-Thieme, L. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623613 · Cited by 472
Das, A., & Kempe, D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1102.3975 · Cited by 330
Self-citationGaussian graphical modeling reconstructs pathway reactions from high-throughput metabolomics data
Krumsiek, J., Suhre, K., Illig, T., Adamski, J., & Theis, F. J. (2011) · BMC Systems Biology · doi:10.1186/1752-0509-5-21 · Cited by 323
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601987570 · Cited by 273
Metadata
- Authors
- Das, A., & Kempe, D.
- Venue
- Proceedings of the fortieth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2008-05-17
- Pages
- 45-54
- OpenAlex
- W2159416808
- Cited by
- 196
- References
- 0
- FWCI
- 9.17
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Algorithms for subset selection in linear regression. https://app.cochat.ai/papers/10.1145/1374376.1374384
- The paper
- Das, A., & Kempe, D. (2008). Algorithms for subset selection in linear regression. Proceedings of the fortieth annual ACM symposium on Theory of computing. https://doi.org/10.1145/1374376.1374384
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.