mlsanityData to 14 Oct 2026

Efficient subsampling for high-dimensional data

arXiv 2411.06298 ↗First posted 9 Nov 2024stat.MEcited by 2

Not on the map. Why?

Abstract (arXiv)

In the field of big data analytics, the search for efficient subdata selection methods that enable robust statistical inferences with minimal computational resources is of high importance. A procedure prior to subdata selection could perform variable selection, as only a subset of a large number of variables is active. We propose an approach when both the size of the full dataset and the number of variables are large. This approach firstly identifies the active variables by applying a procedure inspired by random LASSO (Least Absolute Shrinkage and Selection Operator) and then selects subdata based on leverage scores to build a predictive model. Our proposed approach outperforms approaches that already exists in the current literature, including the usage of the full dataset, in both variable selection and prediction, while also exhibiting significant improvements in computing time. Simulation experiments as well as a real data application are provided.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Nov 2024.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.