Core-Elements Subsampling Method

• Core-Elements Subsampling Method is a family of techniques that replaces large datasets with a much smaller, carefully chosen subset to preserve a target mathematical object or computation.
• It employs various selection mechanisms such as stratification, deterministic element-wise masking, and probabilistic reweighting to achieve precise approximation and efficient computation.
• Empirical studies show that these methods can significantly speed up processes in spatial visualization, least squares, and topological data analysis while maintaining high accuracy.

Searching arXiv for the cited papers to ground the article and confirm metadata. {"query":"(Zheng et al., 2017) Visualization of Big Spatial Data using Coresets for Kernel Density Estimates", "max_results": 5} {"query":"(Xue et al., 22 Sep 2025) Core-elements Subsampling for Alternating Least Squares", "max_results": 5} {"query":"(Li et al., 2022) Core-Elements for Large-Scale Least Squares Estimation", "max_results": 5} Core-Elements Subsampling Method denotes a family of coreset, subsampling, and subset-selection procedures that replace a large dataset by a much smaller subset while attempting to preserve a target mathematical object or downstream computation. Depending on the setting, the “core elements” may be spatial points, training examples, rows of a design matrix, individual matrix entries, convexly weighted support points of an empirical measure, frame elements, or vertices of a simplicial complex. The preserved object may be a kernel density estimate, an ordinary least-squares estimator, an alternating least-squares update, a posterior distribution, a smooth divergence, or the homotopy type of a Vietoris–Rips complex (Zheng et al., 2017, Li et al., 2022, Xue et al., 22 Sep 2025, Naik et al., 2022, Kokot et al., 28 Apr 2025, Minian, 26 Nov 2025).

1. Conceptual scope and formal definitions

The literature does not use a single universal formalization. In spatial visualization, a coreset is a subset $Q \subset P$ such that the kernel density estimate (KDE) of $Q$ approximates that of $P$ uniformly over all spatial locations: $L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$ This is a worst-case guarantee on the density field rather than a pointwise average guarantee (Zheng et al., 2017).

In supervised learning, the coreset is a subset $\mathcal{S} \subset \mathcal{T}$ of the training set

$\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$

chosen so that training on $\mathcal{S}$ is almost as good as training on $\mathcal{T}$. In HyperCore, the global coreset is assembled classwise as

$\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$

where each $\mathcal{S}_c$ contains the retained in-class samples for class $Q$0 (Moser et al., 26 Sep 2025).

In large-scale least squares, the phrase “Core-Elements” can refer either to a core subset of observations chosen by an optimal-design or robustness criterion, or to an element-wise sketch of the design matrix. The element-wise formulation constructs

$Q$1

where $Q$2 is a binary mask and only selected entries of $Q$3 are retained; the corresponding estimator is

$Q$4

This differs from row-wise subsampling because the retained information need not lie in a selected set of rows (Li et al., 2022, Li et al., 2021).

In Bayesian inference, a coreset is a sparse nonnegative weight vector $Q$5 with at most $Q$6 nonzeros, defining a coreset posterior

$Q$7

and the construction problem is posed as minimizing

$Q$8

subject to the sparsity constraint on $Q$9 (Naik et al., 2022).

In topological data analysis, the core is defined through domination in the $P$0-neighborhood graph. A point $P$1 is $P$2-dominated by $P$3 if

$P$4

and a $P$5-core is a subsample with no dominated points. At scale $P$6, this is exactly the vertex set of a core of $P$7 under strong collapses (Minian, 26 Nov 2025).

Setting	Core elements	Preserved target
Spatial KDE	$P$8	$P$9
Supervised learning	$L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$0	Training quality relative to $L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$1
Least squares	$L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$2 or subset $L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$3	OLS, design optimality, or robustness
Bayesian inference	Sparse weighted subset	$L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$4
TDA	$L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$5	Strong-collapse core of $L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$6

A broad synthesis is therefore supported by the sources: core-elements subsampling is best understood as a design principle rather than a single algorithm. The specific target of preservation determines both the definition of “core” and the admissible approximation error.

2. Selection mechanisms and algorithmic constructions

One recurrent construction is stratified selection after imposing geometric structure. For large spatial KDE visualization, the data are first ordered by a Z-order curve, then partitioned into contiguous blocks, and one point is randomly selected from each block. The method also supports a priority ordering $L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$7 such that every prefix $L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$8 is a coreset of size $L_\infty(\kde_P,\kde_Q) := \max_{x \in \mathbb{R}^d}\big|\kde_P(x) - \kde_Q(x)\big| \le \varepsilon.$9. This makes the subsample resolution-adjustable without rerunning the selection procedure (Zheng et al., 2017).

A second construction is deterministic element-wise masking. In large-scale least squares, core-elements are the largest-magnitude entries in each column of $\mathcal{S} \subset \mathcal{T}$0: for each column $\mathcal{S} \subset \mathcal{T}$1, the method keeps the $\mathcal{S} \subset \mathcal{T}$2 largest absolute values and zeros out the rest, producing $\mathcal{S} \subset \mathcal{T}$3. The same columnwise idea is transferred to alternating least squares for recommender systems: for each regression matrix $\mathcal{S} \subset \mathcal{T}$4 or $\mathcal{S} \subset \mathcal{T}$5, the method keeps only the top $\mathcal{S} \subset \mathcal{T}$6 or $\mathcal{S} \subset \mathcal{T}$7 entries per column, forming sparse sketches used inside ALS updates (Li et al., 2022, Xue et al., 22 Sep 2025).

A third construction is class-wise geometric filtering. HyperCore learns, for each class $\mathcal{S} \subset \mathcal{T}$8, a hypersphere model $\mathcal{S} \subset \mathcal{T}$9 centered at the origin. The conformity score is the embedding norm

$\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$0

and the class-specific threshold is chosen by maximizing Youden’s statistic

$\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$1

The retained core elements for class $\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$2 are precisely those in-class points with $\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$3 (Moser et al., 26 Sep 2025).

A fourth construction is probabilistic with post-selection reweighting. In fast Bayesian coresets, the subset is chosen by uniform subsampling, but the weights are refined by a quasi-Newton method based on covariance operators under the coreset posterior. In set-based stochastic subsampling, the first stage uses conditionally independent Bernoulli random variables to select candidate elements, and the second stage uses conditionally dependent autoregressive Categorical sampling with set attention to model pairwise interactions among candidates (Naik et al., 2022, Andreis et al., 2020).

A fifth construction is functional compression. CO2 derives a kernel from the second-order Hadamard expansion of a smooth divergence and then runs kernel compression through Nyström approximation and recombination. In this formulation the selected support points are convexly weighted and are chosen to minimize an MMD-like quadratic form associated with the divergence (Kokot et al., 28 Apr 2025).

A sixth construction is topological domination pruning. For $\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$4-core subsampling, one iteratively removes points $\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$5 for which $\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$6 for some $\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$7, until no dominated points remain. On Vietoris–Rips complexes, this is exactly dominated-vertex deletion in a flag complex, hence an iterative strong collapse (Minian, 26 Nov 2025).

3. Approximation guarantees and preserved structure

The strongest guarantees in the surveyed literature are target-specific rather than generic. For spatial KDEs, the Z-order coreset satisfies

$\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$8

and with probability at least $\mathcal{T} = \{(\mathbf{x}_i, y_i)\}_{i=1}^{N}$9,

$\mathcal{S}$0

A random sample also yields an $\mathcal{S}$1-KDE coreset with probability $\mathcal{S}$2, but requires

$\mathcal{S}$3

The same paper also derives a safe threshold shift $\mathcal{S}$4, ensuring that regions with $\mathcal{S}$5 are not omitted when thresholding the coreset KDE, and discusses $\mathcal{S}$6-nets as a complementary guarantee against visually broken high-density regions (Zheng et al., 2017).

For element-wise least squares, the core-elements estimator is unbiased: $\mathcal{S}$7 Its conditional error satisfies

$\mathcal{S}$8

and a Taylor expansion yields the upper bound

$\mathcal{S}$9

with $\mathcal{T}$0. The same framework proves a coreset-like finite-sample guarantee: $\mathcal{T}$1 whenever $\mathcal{T}$2 is sufficiently small relative to $\mathcal{T}$3 (Li et al., 2022).

For alternating least squares, Core-ALS provides a per-regression $\mathcal{T}$4-approximation in residual loss. For users,

$\mathcal{T}$5

with an analogous theorem for items, and the regularized loss remains monotonically non-increasing under the stated assumptions (Xue et al., 22 Sep 2025).

For Bayesian coresets, the quasi-Newton method is accompanied by a general high-probability bound on the KL divergence of the output coreset posterior, and the paper proves that in finite-dimensional span settings an exact approximation can exist with high probability once the number of sampled core points is large enough. In the asymptotic smooth setting, the minimum KL over the subsampled family is $\mathcal{T}$6 under the stated conditions (Naik et al., 2022).

For smooth divergences, CO2 proves that second-order Hadamard differentiability reduces coreset selection to MMD minimization. If the spectral tail satisfies $\mathcal{T}$7, then one can construct $\mathcal{T}$8 with

$\mathcal{T}$9

For the Sinkhorn divergence, the paper verifies the required regularity and obtains the compression theorem

$\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$0

for $\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$1 (Kokot et al., 28 Apr 2025).

For $\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$2-core subsampling in TDA, the guarantee is topological rather than statistical. If $\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$3 is a $\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$4-core, then $\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$5 is obtained from $\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$6 by strong collapses, so the two complexes are homotopy equivalent at scale $\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$7. Any two $\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$8-cores are unique up to $\mathcal{S} = \bigcup_{c=0}^{C-1} \mathcal{S}_c,$9-equivalence (Minian, 26 Nov 2025).

Finally, in finite-frame subsampling, a random reweighted subframe with only $\mathcal{S}_c$0 elements can preserve frame bounds with high probability, while deterministic BSS-style spectral sparsification reduces the number of elements to $\mathcal{S}_c$1 with controlled conditioning (Bartel et al., 2022).

4. Computational profile

Core-elements methods often trade expensive full-data algebra for cheap preprocessing plus small dense solves. In spatial KDE visualization, preprocessing is $\mathcal{S}_c$2 time and $\mathcal{S}_c$3 space; once the priority ordering is available, extracting a coreset of size $\mathcal{S}_c$4 is a prefix operation, and KDE evaluation on a grid of $\mathcal{S}_c$5 pixels costs $\mathcal{S}_c$6 rather than $\mathcal{S}_c$7 (Zheng et al., 2017).

In large-scale least squares, the element-wise estimator requires only

$\mathcal{S}_c$8

operations, where $\mathcal{S}_c$9 is the number of retained elements per column. This scaling is the central reason the method targets sparse and numerically sparse matrices (Li et al., 2022).

In Core-ALS, the full algorithm over $Q$00 iterations has complexity

$Q$01

to be compared with standard ALS complexity

$Q$02

The fast variant further reduces overhead by subsampling $Q$03 and $Q$04 only once per iteration (Xue et al., 22 Sep 2025).

In HyperCore, threshold search for each class requires sorting $Q$05, hence $Q$06 time and $Q$07 memory per class, while the classwise hypersphere models are embarrassingly parallel (Moser et al., 26 Sep 2025).

For Bayesian coresets, one iteration of the quasi-Newton refinement scales as

$Q$08

with space $Q$09. This is linear in dataset size $Q$10 and sublinear in memory compared with methods that retain per-point auxiliary objects (Naik et al., 2022).

In TDA, the direct neighborhood computation for $Q$11-cores is $Q$12 naively, while spatial data structures reduce practical cost. The motivation is the downstream reduction in the number of simplices and therefore in persistent homology runtime (Minian, 26 Nov 2025).

5. Empirical behavior across domains

The reported empirical behavior is heterogeneous but informative. In spatial KDE approximation, the Utah highway example gives the following maximal errors for equal sample size: at size $Q$13, random sampling error is $Q$14 and coreset error is $Q$15; at $Q$16, $Q$17 versus $Q$18; at $Q$19, $Q$20 versus $Q$21; and at $Q$22, $Q$23 versus $Q$24. The visual comparisons further show that random sampling can introduce spurious local peaks or holes, whereas the coreset KDE preserves the shape and intensity of density features more faithfully (Zheng et al., 2017).

In noisy supervised learning, HyperCore is evaluated on ImageNet-1K and CIFAR-10. On CIFAR-10, at retained fractions between $Q$25 and $Q$26, it achieves up to $Q$27 higher accuracy than the best baseline. Under $Q$28 label corruption, the paper reports, for example, $Q$29 accuracy at $Q$30 retained versus $Q$31 for the second-best CAL, and $Q$32 at $Q$33 retained versus $Q$34 for Forgetting. In adaptive mode, the chosen pruning ratio increases with poisoning level while accuracy on the coreset exceeds full-data training; at $Q$35 poisoning, full data gives $Q$36 and HyperCore gives $Q$37 with $Q$38 (Moser et al., 26 Sep 2025).

In recommender-system matrix factorization, Core-ALS is consistently reported as closer to full ALS than uniform or leverage-based subsampling on RMSE, PRMSE, Hit@5, and NDCG@10. On a $Q$39 rating matrix with $Q$40, full ALS takes $Q$41s, while Core-ALS takes $Q$42s at $Q$43, $Q$44s at $Q$45, $Q$46s at $Q$47, and $Q$48s at $Q$49. On Netflix-sized data, full ALS takes $Q$50s, while Core-ALS ranges from $Q$51s at $Q$52 to $Q$53s at $Q$54 (Xue et al., 22 Sep 2025).

In least squares with sparse predictors, the synthetic and scRNA-seq studies report that core-elements consistently attains the lowest MSE and PMSE among the compared subsampling methods, and on the scRNA-seq dataset CORE and MOM-CORE are described as performing essentially as well as FULL and MOM-FULL while being dramatically faster (Li et al., 2022).

At the same time, empirical evidence is not uniformly favorable for sophisticated subsampling. In logistic regression, the large benchmark in “A Coreset Learning Reality Check” finds that no method shows significant improvement over uniform subsampling for NLL or ROC, and only OSMAC variants show significant improvement over uniform for coefficient MSE, with substantial variability and heavier tails in some regimes (Lu et al., 2023).

In TDA, $Q$55-core subsampling reduces persistent-homology cost while preserving the dominant topological signatures. For the torus with $Q$56 points and $Q$57, the paper reports bottleneck distances $Q$58 and $Q$59. For a heterogeneous cube with $Q$60 points, the full computation takes about $Q$61 s, whereas a $Q$62-core with $Q$63 points gives about $Q$64 s total and a $Q$65-core with $Q$66 points gives about $Q$67 s total (Minian, 26 Nov 2025).

6. Limitations, misconceptions, and open directions

A first limitation is terminological. The least-squares review explicitly notes that the phrase “Core-Elements” does not appear verbatim there; instead, the corresponding idea is realized by deterministic optimal-design-based subsamples such as IBOSS, GKM, KYM, and robustness-oriented Lowcon. This suggests that “core-elements subsampling” is a cross-domain label imposed on a family of related but non-identical constructions (Li et al., 2021).

A second limitation is that superiority over uniform subsampling is not automatic. The logistic-regression benchmark shows that sophisticated coreset and optimal subsampling methods often do not outperform simple uniform subsampling, especially once regularization is present. This directly counters a common misconception that any non-uniform core-selection rule is necessarily better than random choice (Lu et al., 2023).

A third limitation is problem dependence. HyperCore relies on learning meaningful per-class embeddings; the paper notes reduced robustness in extremely low-data or highly imbalanced classes, overhead from separate per-class models, the symmetric treatment of false positives and false negatives in Youden’s $Q$68, and static thresholds after training (Moser et al., 26 Sep 2025). For KDE coresets, assumptions on kernel smoothness and boundedness matter, and extreme bandwidths can affect constants in the coreset size (Zheng et al., 2017). For CO2, the present guarantees are asymptotic and depend on deriving a Hadamard operator for the divergence, which is analytically nontrivial (Kokot et al., 28 Apr 2025). For $Q$69-core subsampling, the exact guarantee is at the scale $Q$70; across an entire filtration the persistence approximation is empirical rather than given by a closed-form bottleneck bound in the reported results (Minian, 26 Nov 2025).

The published extensions point in several directions. HyperCore mentions multi-label classification, imbalanced datasets, different embedding models, and continual learning; the KDE work discusses more aggressive coreset constructions, streaming data, and combinations with multi-resolution systems such as nanocubes and Gaussian cubes; Core-ALS notes compatibility with parallel ALS implementations, Sherman–Morrison-based acceleration, and improved iteration formulations; CO2 identifies finite-sample guarantees and improved MMD compression as open problems (Moser et al., 26 Sep 2025, Zheng et al., 2017, Xue et al., 22 Sep 2025, Kokot et al., 28 Apr 2025).

Taken together, the literature supports a precise but plural conclusion. A Core-Elements Subsampling Method is not a single canonical algorithm. It is a family of principled constructions that select a small surrogate—possibly weighted, classwise, element-wise, or topologically reduced—so as to preserve a specified objective, estimator, divergence, or structure. The decisive technical question is therefore not whether a method is a “coreset,” but which object it preserves, by what mechanism, and under what approximation regime.