WorksMathematics
Kernel Regression using Persistence Diagrams
Abstract
Persistence diagrams are widely used in topological data analysis to summarize topological and geometric structure in data. We study nonparametric regression where inputs are persistence diagrams and outputs are real-valued. Using kernel-based local averaging estimators defined directly over diagram space with Wasserstein distance, we establish consistency and derive bounds on the rate of convergence under suitable assumptions in the -theory. We also present computational experiments that demonstrate strong performance of the proposed estimator, particularly in low data regimes.
Introduction
Topological data analysis (TDA) uses multiscale measurements of topology to summarize the shape of data. Persistent homology is one of the principal tools in this field, producing a finite descriptor called a persistence diagram that encodes topological and geometric information across scales [18]. Persistence diagrams have found widespread application in diverse domains including materials science, neuroscience, and computational biology, where shape information provides discriminative features for downstream statistical tasks [33].
In this paper, we study regression where the predictor variable takes values in the space of persistence diagrams and the response variable is real-valued. Given independent observations from a joint distribution, we wish to estimate the regression function . This problem arises naturally when one wishes to predict a real-valued quantity such as a physical parameter, a clinical outcome, or a geometric property from topological summaries of complex data.
A fundamental challenge in regression using persistence diagrams is that the space of persistence diagrams, equipped with natural metrics such as the bottleneck or Wasserstein distance, is not a Hilbert space. This precludes direct application of standard regression techniques that rely on vector space structure. The dominant strategy in the literature has therefore been to embed diagrams into a Hilbert space, either explicitly through finite-dimensional vectorization or implicitly through kernel methods [33].
To this end, several vectorization schemes have been studied. Persistence landscapes [6] embed diagrams into a Banach space of functions that can be discretized and Persistence images [2] discretize a weighted Gaussian representation into fixed-length vectors. Kernel methods provide an alternative route via implicit embedding into a reproducing kernel Hilbert space, with kernels such as the persistence scale-space kernel [34] and the sliced Wasserstein kernel [9] enabling kernel regression and Gaussian process regression [26]. A variety of other vectorization methods exist, surveyed in [33], though their application to regression problems (such as in [29] or [30]) has been less systematic.
Notably, all of these approaches operate by embedding persistence diagrams into a Hilbert space. However, such embeddings cannot preserve the native Wasserstein or bottleneck geometry without distortion [10]. Consequently, neighborhood relationships in diagram space
MSC2020 subject classifications: Primary 62R40, Topological data analysis; secondary 62G05, Nonparametric estimation.
Keywords and phrases: Topological data analysis, Non-parametric Regression. may not be faithfully represented in the embedded space, which is particularly relevant for statistical procedures that rely on local metric structure.
Furthermore, there are compelling reasons to operate directly within diagram space. The bottleneck and Wasserstein distances underpin much of the statistical theory for persistence diagrams. Foundational stability results [13, 14] established that small perturbations in input data induce small changes in persistence diagrams. Mileyko, Mukherjee, and Harer [27] proved that the space of persistence diagrams equipped with the -Wasserstein metric is a complete, separable metric space, enabling rigorous probability theory on diagrams. This has supported the development of Fréchet means and laws of large numbers [40], confidence sets via bootstrap methods [19], null hypothesis testing for comparing distributions of diagrams [35], and distance covariance methods for measuring dependence between persistence diagrams and response variables [41]. Hence, various statistical tools have already been developed which operate with respect to the Wasserstein or bottleneck metrics.
Despite this, to our knowledge, methods for regression from persistence diagrams to real values that operate directly in the native metric space without any Hilbert embedding have been essentially absent from the literature. We propose to address this gap by developing a regression framework directly on the space of persistence diagrams. Since there is no natural parametric model for probability distributions on this space, we adopt a non-parametric local averaging approach, which relies only on the underlying metric structure of the space of predictors.
In particular, we study kernel-based local averaging estimators, originally proposed by Nadaraya [28] and Watson [42], which constructs the estimator as an average of the known response values weighted by the proximity of the new input to the known predictors:
where is a smoothing kernel function with bandwidth and is a metric on the predictor space. In the Euclidean case, the Nadaraya–Watson estimator has been extensively studied and shown to be consistent in mean squared error [17, 36] under suitable conditions. Subsequent work extended these results to infinite-dimensional settings and more generally to regression with predictors taking values in abstract metric spaces. In these broader contexts, mean square consistency has been established under different regularity assumptions placed on the regression function or the probability distributions or the metric space itself [21, 1]. Hence, our goal of establishing consistency for our estimator on diagram space can directly leverage this theory.
Another question remains regarding the rate of convergence for such an estimator on our space. In the Euclidean case, if we assume the regression function to be in the class of functions where:
the optimal minimax rate of convergence is shown to be . That is:
where the infimum is taken over all estimators (i.e all measurable functions of the data). When , the Hölder class reduces to the class of Lipschitz continuous functions. In this case, the optimal minimax rate of convergence is
which kernel estimators have been proven to achieve [22, 38]. Notably, in the Euclidean setting the convergence rate depends on the ambient dimension in the denominator, codifying the curse of dimensionality. When predictors take values in an infinite-dimensional or general metric space, the effective “dimension” governing convergence is no longer the ambient Euclidean dimension, but an intrinsic notion of the space’s size or complexity. For instance, rates can depend on small ball probabilities or the Assouad dimension of the predictor space [20, 5, 25, 16, 24]. In this work, we similarly leverage covering number bounds on a restricted diagram space to establish a corresponding upper bound on the rate of convergence of our kernel estimator.
Our Contributions
Given the discussions above, our main contributions are as follows:
(i) Restricted Diagram Space. First, we introduce a restricted space of persistence diagrams corresponding to a finite paradigm that reflects the bounded nature of most practical applications. We establish that this space is compact under the -Wasserstein distance and derive explicit bounds on its covering numbers.
(ii) Asymptotic Results. Next, we prove consistency of the kernel regression estimator on this metric space and derive upper bounds on the rate of convergence in mean squared error. The rate we obtain is , where bounds the number of points in the persistence diagrams. This reveals that the parameter (corresponding to points with birth-death coordinates) plays the role of dimension in determining the convergence rate, providing a satisfying parallel with classical results where rates depend on the ambient dimension.
(iii) Empirical Validation. Through computational experiments, we demonstrate strong performance of the proposed estimator. We find that in low-sample regimes where training data is limited, the performance benefit of operating directly in diagram space is most apparent.
Outline
In Section 2, we provide background on persistent homology and persistence diagrams. In Section 3 we define the restricted diagram space for which we prove compactness, and establish covering number bounds. Then in Section 4, we present the general theory for kernel regression on metric spaces and apply it to obtain consistency and convergence rates for persistence diagram predictors. Finally, in Section 5, we present experimental results benchmarking our method against existing approaches.
Persistent Homology and Persistence Diagrams
Here we will provide a very brief introduction to persistent homology. A more complete coverage can be found in [18]. Although homology can be computed over any ring, to compute persistent homology we need a field. This is usually for computational purposes.
To define persistent homology, we start with a nested sequence of topological spaces,
Often this sequence arises from the sublevel sets of a function, , with for a sequence . The sequence induces linear maps on homology for any dimension
We are interested in when homology classes appear and disappear in this sequence. Let be the linear map on homology induced by the inclusion . Observe that if then . The homology class is said to be born at if it is in the cokernel of . This same class is said to die at if its image in is not in the image of , but its image in is in the image of . In the case that the spaces arose from the level sets of a function as defined above, we define say that is born at time , dies at time , and its lifetime is .
A discrete description of the persistent homology of (1) is the multiset of points in the extended plane where we include with multiplicity the dimension of the set of homology classes born at and dying at . This is the information recorded as the (th dimensional) persistence diagram.
Although we have here restricted our definition of persistent homology to that of a finite nested sequence, it can be defined more generally for nested parameterized families of topological spaces with the condition that whenever (alongside some technical finiteness conditions). We can think of this as a filtered space with filtration parameter . For “nice” filtered spaces the persistence diagram can be defined analogously to the finite case. For details see [15].
It is worth observing that although we are computing homology we are often capturing geometric information through the filtration parameter. For example, if we are considering a filtration of by the distance from a circle of radius then the 1st dimensional persistent homology will have exactly one class born at (the time the circle first appears) and dying at (the time when the circle is filled in).
Motivating Example
Consider a point cloud in the square portion of the plane as visualized in Figure 1. Our goal is to capture the overall shape information in this point cloud which we know to be roughly circular. To do this, we effectively blur our vision by placing an ball at each point in , giving us the set . The relevant information from the blurred point cloud is the overlapping of the -balls which connects or blurs the points together in the shape of a loop. This overlap information can be stored in a simplicial complex constructed on . The Čech complex is an example of such a construction:

Figure 1. The point cloud (left), the -blurred point cloud (center) and the resulting simplicial complex (right) for .
Definition 2.1 (Čech complex). Let be a finite point cloud and a scale parameter. The Čech complex at scale , denoted , is the abstract simplicial complex
That is, a subset of points forms a simplex if and only if the corresponding -balls have a non-empty intersection.
Figure 1 illustrates the process of constructing the Čech complex with , in which we can see a connected loop shape emerge.
Finally, we can leverage the tools from algebraic topology, namely calculating the simplicial homology of . For , we get a single non-trivial 1-cycle which corresponds to a single generator of the first dimensional homology group . On the other hand, if our point cloud dataset was linear, the same method would not yield any 1-cycles in the corresponding Čech complex for any value of . Hence, counting the number of generators for in quantifies the circular shape information from if the value of is well chosen. This allows us to distinguish circular and linearly shaped point clouds.
It is apparent that the correct choice of is central for the success of the above method. The key idea behind persistent homology is that instead of choosing a particular value for , we calculate the homology information at every value of . The persistence diagram stores exactly this information in a slightly different format. As the filtration parameter varies, it record the values of when a new homology feature is born (birth coordinate) and when that feature disappears from the simplicial complex (death coordinate). Hence, a persistence diagram can just be considered as a multiset of points (since multiple homology features can have the same birth-death coordinates) above the diagonal on the plane (since every homology feature must appear before disappearing). Figure 2 illustrates the persistence diagram for our point cloud and how each point reflects the birth and death of a homology feature.

Figure 2. The persistence diagram (left) displays the birth-death co-ordinates for every homological feature as varies. A dimension 1 homology feature appears for as a loop in the Čech complex (center) and disappears at when the loop is filled in with high order simplices (right)
By varying and capturing the changes in homology features, a persistence diagram captures shape information at all scales or all levels of blurring in a single object. Beyond this example, persistence diagrams can be constructed on a variety of complex data types such as images [29] or graphs [3].
While we have defined the construction of a persistence diagram from a finite nested sequence of topological spaces, it will be important to define the space of persistence diagrams independent of the process of persistent homology.
Let . This is the part of the plane above the diagonal and points lying here correspond to persistent homology classes with finite lifetimes. Since we wish to also want to consider persistent homology classes of infinite duration we will also want to include lines at infinity. Let . For tractability we will impose some finiteness conditions, namely that only finitely many classes have infinite lifetimes and that the sum of all the finite lifetimes is finite. This restriction is not onerous in applications where generally we have finite sized data as input.
Definition 2.2. A persistence diagram is a countable multi-set of such that the number of elements in is finite, and .
Remark 2.1. For full generality, we could extend this definition to also include points with as the birth time. This is rarely useful in applications and will not be needed in our examples later. We removed this extra generality for clearer exposition, but there is no theoretical impediment to include these extra kinds of points.
Let denote the space of all persistence diagrams. We will consider a family of metrics which are analogous to the -Wasserstein distances on the space of probability measures and to the distances on the space of functions on a discrete set. inherits natural distances from . For we have and .
Let denote an abstract element representing the diagonal . With a slight abuse of notation we write to denote the shortest distance from in to a point in the diagonal set in . Thus
for , and . also inherits natural distances from the metric on ; . We should think of and as disjoint parts of a larger space; the distance between any point in to any point in is infinity.
Distances between persistence diagrams are phrased as optimal transport distances where the allowable transportation plans are called matchings.
Definition 2.3. Given persistence diagrams and a matching is a triple with , and a bijection.
We define the cost of a matching as a sum of costs of moving points from to along and moving the unmatched points to the diagonal. The cost will depend on the choice of .
Definition 2.4. Given a matching between persistence diagrams and , its p-cost, is defined by
for , and
For each define
These distances may be infinite - for example if and contain a different number of points in then for all .
The Finite Paradigm
The naked space of persistence diagrams is too large to admit useful properties such as compactness, completeness or separability. Various authors as in [27], [30], [8], [40] impose different restrictions to establish different properties. In this Section, we will define the restricted metric space of persistence diagrams which represents the finite paradigm inherent in the finite nature of most input data in applications. We derive theoretical properties of this space required for establishing the asymptotic results in § 4.
For our purposes, we will restrict diagram space to the finite paradigm as defined below:
Definition 3.1 (Finite Paradigm Restricted Space). For some , let be the subset of such that for all diagrams in we have:
Condition 1: (Finite Total Multiplicity)
Condition 2: (Finite Region Bound) implies
This creates a triangular region and an interval within (depicted in Figure 3) which together we denote which contains all the finitely many points in any persistence diagram.

Figure 3. The set where the points in the persistence diagrams in are allowed to be in.
By restricting to we get a well-behaved space in which we can avoid many pathologies such as diagrams with infinitely many points accumulating away from the diagonal. We find this restriction is not limiting because persistence diagrams, in most practical settings, arise from studying processes with real world domain bounds which naturally translate into the global bounds on multiplicity and birth-death times.
For instance, consider a dataset consisting of point clouds in contained within a bounded square region. Hence, the filtration parameter is necessarily bounded above by the diameter of the square, providing a natural region bound. Moreover, if the process under study can generate only finitely many points within the square, then the number of homological features across all dimensions is finite, yielding some that bounds the number of points in the persistence diagrams. See § 5.2 for a concrete experimental example. Similar reasoning applies to persistence diagrams constructed from images (finite image size and resolution) and from graphs (finite number of vertices and edges). In such cases, the finite paradigm is a natural reflection of the underlying data constraints rather than an artificial restriction.
If persistence diagrams arise from sublevel set filtrations (or from Rips or Cech filtrations of points clouds), then the points in the persistence diagrams with infinite death (those in ) correspond to the homology classes of the domain and is generally consistent over the dataset of persistence diagrams. This implies we remain in a single connected component within the space of persistence diagrams.
Remark 3.1. The finite paradigm restriction does have its limitations. For instance, as noted in [30], persistence diagrams with infinitely many points may be necessary to encode phenomena such as fractal structures or attractors arising in dynamical systems.
Now we establish some properties for , most importantly compactness and a bound on the covering number. This bound is directly required for bounding the rate of convergence.
Theorem 3.1 (Compactness). For any choice of , the metric space is compact.
Proof. Let be a sequence of persistence diagrams in . We can represent each diagram as a vector in since we have at most points, each with a birth and death coordinate. So we can represent each diagram as the vector . Note that 0s used to fill in the vector can be interpreted as the point on the diagonal which has infinite multiplicity. Note that the ordering of points within the persistence diagram in terms of the birth-death coordinate points in the vector representation is arbitrary, but fixed for each diagram. Hence, the same argument will apply for any choice of ordering.
Note that the birth coordinate of every point in a diagram is within the range and the death coordinate is in since . Hence, the vector representation of each diagram is contained within the closed region . Hence the sequence can be represented as a sequence of vectors in the region . We can look at this sequence of vectors coordinate-wise with the following notation:
We know is compact with respect to any metric. Hence, as a finite product of compact sets, we get that is compact with respect to the product topology by Tychonoff’s theorem. We also know that the sup-norm metric induces the product topology on . Hence, for any choice of , via sequential compactness we get there exists a subsequence converging to some . That is:
We can interpret as a persistence diagram which will be our candidate limit. Note that is in since has components where each coordinate is within . Hence, it remains to show . For we have:
as is an optimal transport distance and the choice to send to defines a matching. By (2) we get:
Note that similarly follows directly from (2). Hence, for any , has a converging subsequence, so by sequential compactness is compact. □
Definition 3.2 (Covering Number). Let be a subset of the metric space . The -covering number is the smallest number of open balls of radius that cover the set :
Theorem 3.2 (Bound on Covering Number). Let . For any choice of the metric for , the covering number of as a subset of is bounded above by:
Proof. As for it is sufficient to prove the covering number bound for the case where . To get an upper bound on the covering number in the ambient metric space , we will explicitly construct a finite set such that:
where is the ball with respect to . For this, we must ensure that any diagram is within an distance of some diagram in .
First we consider the triangular region union a line segment in the extended plane, which we previously denoted . We can create a grid of points for the triangular region as depicted in Figure 4 such that balls with radius cover . This grid contains at most

Figure 4.
locations (with the "+1" to account for taking the ceiling). The line segment can be covered by balls with radius regularly spaced apart - needing at most . Let be the set of points in this grid over and the line segment at infinity. Let .
We can show that has a finite cover of the form:
Construct the set of persistence diagrams containing at most points with each of the points lying in , and repetitions are allowed. Denote this set of persistence diagrams .
Construct the function that sends each point to the closest grid point, breaking ties arbitrarily. For an arbitrary diagram consider the diagram where we snap each point to the closest option in . The resulting persistence diagram is by construction in . By considering the matching which pairs each point to the closest grid point we have
This ensures that any point in an arbitrary diagram is close to a element in .
Counting the number of elements in is the same as the number of ways of choosing at most points from the collection of points with repetitions allowed. There are way to do this, so
It remains to show that . It is trivially true for so we can assume that . Recall we have assumed that .
First observe that for any positive integers . For and we have
This implies that .
Next, if we remove the option of points with infinity as a death time, we can note that our space is included in diagram spaces constructed by other authors such as by Mileyko et al. [27] and Perea et al. [30]. The conditions imposed by these authors essentially require the number of points that are far away from the diagonal to be finite. They define spaces in analogy with function spaces as below:
Mileyko et al.:
Perea et al.:
Authors in [30] have shown the following inclusion of spaces: . Since we explicitly have a multiplicity bound , if we excluded points with infinite death times then would get that for any .
Remark 3.2. Authors in [27] use a slightly different definition for , where they fix the -norm on the plane instead of letting it vary with . Note this morally doesn’t cause issues since for any we have .
In [27], the space has been shown to be complete and separable. Again, if we excluded the points with infinite death we could use inclusion of as a compact subset in to show that is also compact and separable. Since we wish to have up to points with infinite death we will instead directly prove completeness and separability.
Finally, we can show that our space is complete and separable.
Theorem 3.3 (Completeness and Separability). For any choice of , the finite paradigm restricted space is complete and separable.
Proof. is complete because it is compact (Theorem 3.1). We can prove separability through the bounds on the covering numbers. We can construct a countable dense subset by sequentially including sets of persistence diagrams at the centers of balls that cover at radius for .
Asymptotic Guarantees
Having set up our metric space of predictors over which the local averaging kernel estimator can be defined, we will now establish the mean squared consistency of our estimator, as well as an explicit bound on the rate of convergence. We use the following regression set-up:
Definition 4.1 (Regression Setup). Suppose is a metric space and let be a Borel probability measure on with compact support . Let and be i.i.d. random elements taking values in with common distribution, satisfying the regression model , where
, , is continuous;
is random noise such that and .
Remark 4.1. Note that the assumption of having compact support may appear restrictive; however, the ambient space of interest is itself compact. Furthermore, continuity of is a mild strengthening of the Besicovitch condition, which is known to be essentially necessary for the consistency of local averaging methods (see [21, 11, 16]). Thus, these additional assumptions on the classical regression set up are natural in our context.
We can construct an estimator for the regression function via a local averaging approach
where the weight is a measurable function of . To prove consistency, we want a generalization of Stone’s theorem [37] which provides a set of conditions on the weighting functions which guarantee consistency in mean squared error. Instead of working with the already generalized work in [21] or [1], we will work with the Euclidean proof in [22] which is cleaner and more directly applicable under our assumptions and has not been generalized this way before. As the proof is very analogous, we have provided it in the Appendix B.
Theorem 4.1 (Generalized Stone’s Theorem). Under the regression set up in Definition 4.1, suppose the weight functions of the local averaging estimator satisfy the following conditions:
There is a constant such that for all :
For all :
3.
4.
Then is consistent in MSE, that is:
The kernel estimator is a type of local averaging estimator and so we can define it in terms of weight functions as below:
Definition 4.2 (Regular Kernel Function). A function which satisfies for some is referred to as a regular kernel function.
Definition 4.3 (Kernel Regression Estimator). The kernel regression estimator is defined with the weighting functions:
where for some choice of regular kernel function and choice of bandwidth parameter .
It remains to verify that the kernel weights satisfy the conditions of Theorem 4.1. This proof is a direct generalization of the proof for the Euclidean case in [22] (cf. Theorem 5.1), hence it is relegated to the Appendix B.
Theorem 4.2 (Consistency). Consider the kernel estimator in Definition 4.3 under the regression set up in Definition 4.1. Suppose is a sequence of positive numbers where as such that
where is the inner support radius of the chosen regular kernel. Then we have as in the -norm. Or equivalently:
Remark 4.2. There always exists a sequence satisfying the bandwidth condition of Theorem 4.2. Since is compact, its covering number is finite for every . Hence, one may choose sufficiently slowly so that
For example, one may choose such that
for all sufficiently large . Such a sequence exists because the covering number is finite at every positive radius, and the bandwidth can be chosen to decrease arbitrarily slowly.
Note that Theorem 4.2 can be directly applied to our metric space of interest given Remark 4.1. Hence, it remains to derive a bound on the rate of convergence for our estimator in line with our second objective. To achieve this, we adapt and extend the Euclidean proof from [22], together with the explicit covering number bound established in Theorem 3.2.
Theorem 4.3 (Explicit Bound on Rate of Convergence). Consider the kernel estimator in Definition 4.3 under the regression set up in Definition 4.1 where . Suppose:
For some , is Lipschitz continuous:
The kernel function is the naive kernel
The bandwidth sequence is chosen as:
Then for large enough :
where is some constant independent of . Thus, we obtain an upper bound of order on the rate of convergence of the kernel estimator over our restricted diagram space .
Proof. We begin by noting that:
where the integral is being taken the new input . We will first bound the inner expectation term. Note that every random variable with a finite second moment satisfies the identity:
where is a constant. We can recover the conditional bias and variance decomposition by substituting and with the expectation being taken conditionally over the random sample :
where
Now we can control each of the conditional bias and variance terms separately. For the first conditional bias term we have:
Then the second term is controlled since:
These two terms can then be used to control the -norm as follows:
Noting that is a binomial random variable as a sum of i.i.d bernoulli random variables, we can apply Lemma A.2 to upper bound the first integral as:
Since is continuous on a compact support , it attains the extremum value . Using this we can control the second integral as follows:
Hence, we get:
Now applying the small ball probability control Lemma A.1 and simplifying we get the following inequality in terms of :
Now we use the explicit upper bound on the covering number function from Theorem 3.2 to construct an explicit sequence. Substituting in the bound we get:
where is some constant independent of . Now we can choose our sequence of to be given by:
which we have picked so that we get the following simplification after substituting into the upper bound:
where is just some constant independent of .
Now there is an interesting point of comparison to be made with the Euclidean case where the optimal rate of convergence has upper bounded of order [22] for Lipschitz continuous regression functions in ambient dimension . Thus, the ambient dimension parameter is effectively replaced by in our setting where is the bound on the number of off-diagonal points in the persistence diagrams. We can interpret the value as points living in 2-dimensional space (with birth-death coordinates). Intuitively, letting each birth and death coordinate of points be a free variable, we end up in . Hence, in this context, we can see how the bound on the total multiplicity of a set of persistence diagrams fulfills a dimensionality criteria.
Experimental Results
Finally, we will test the performance of our estimator.
Implementation Outline
Given the sample data and a new input , we have implemented the following algorithm in Python:
Step 1: For each sample input and the new input , we construct the corresponding set of persistence diagram, resulting in a set of persistence diagrams . We have used the Ripser library [4] which constructs a computationally efficient Vietoris-Rips simplicial complex.
Step 2: Compute the distances between the new input persistence diagram and the sample diagrams using the metric ; where we take throughout. Distances are computed using the GUDHI library [32] to ensure computational efficiency. Note that essential classes (infinite death time) are retained and matched only to one another by default. The distances for the and persistence diagrams are evaluated separately and then summed, yielding a collection of distances . Step 3: Using the distances, we calculate a set of weights for each input sample using Definition 4.3. We’ve chosen the Gaussian Kernel and chosen the bandwidth parameter via leave-one-out cross-validation. Note that we have not chosen a value for in Definition 4.3 so we never run into the case where the sum of kernel weights is 0.
Step 4: Create the regression estimate by the weighted average of target values using the previously calculated weights.
The Python code used to implement the method, along with all datasets used in the experiments have been made publicly available at kernel-regression-persistence-diagrams.git
Interpolation Parameter Experiment
We begin with demonstrating our method on a toy dataset.
Dataset
We illustrate our method on a synthetic toy dataset designed to interpolate continuously between two simple geometric structures. Fix 20 equidistant angles . Let be independent noise variables for each point and each coordinate. For a given interpolation parameter , we generate a point cloud according to
When , the point cloud concentrates around a noisy circle, while for it lies approximately along a noisy line. Intermediate values of yield a smooth geometric interpolation between these two regimes. The regression task is to predict the parameter from a noisy point cloud realization. Figure 5 illustrates representative samples for several values of .

Figure 5. Sample point clouds from the Interpolation Parameter Experiment (, , and ) and their associated full persistence diagrams PD and persistence images PI.
Methods
To assess the benefits of operating directly in the space of persistence diagrams, we compare our kernel regression method described in § 5.1 with a commonly used vectorization approach based on persistence images. In both cases, we employ the same kernel regression framework. The difference lies solely in the representation of the persistence diagrams: either as elements of persistence diagram space equipped with the Wasserstein distance, or as finite-dimensional vectors in Euclidean space via persistence images. Figure 5 includes the persistence diagrams and persistence images associated with the sample point clouds for each value of .
Persistence images provide a stable vectorization of persistence diagrams by convolving each persistence point with a Gaussian kernel and discretization the resulting surface on a fixed grid. We follow the construction of [12] and refer to that work for full methodological details. As noted in [12], the method is robust to the choice of resolution and Gaussian variance parameters. Hence, we’ve chosen suitable parameters and fixed the Gaussian variance at 0.1 and use a grid resolution throughout. No weighting function is applied, as we aim to evaluate the estimator without assuming higher-persistence features are more important. All persistence image summaries are computed using GUDHI [32].
Results
Predictive performance is evaluated using the coefficient of determination between the predicted and true parameter values. Let and denote the number of training and testing samples respectively. We fix and vary to study performance under differing levels of data availability. For each value of , the experiment is repeated 10 times with independent training and test sets, and we report the mean and standard deviation of the resulting scores.
Figure 6 summarizes the results by plotting the mean as a function of for each method, with error bars indicating one standard deviation across the 10 repetitions. Across all training sample sizes, the proposed kernel regression method on persistence diagrams attains higher mean values than the persistence image based approach, with the performance gap most pronounced in low-sample regimes. As increases, the performance of both methods improves, though the persistence diagram based estimator remains consistently superior. The results indicate that preserving the geometry of persistence diagram space can yield improved predictive performance, particularly when training data are limited. Exact numerical values corresponding to the curves in Figure 6 are reported in the Table 1.

Figure 6. Mean predictive performance () as a function of training sample size for persistence diagram (PD) and persistence image (PI) based methods. Points denote empirical means across repetitions. Error bars indicate standard deviation.
| PD_kernel | PI_kernel | |
| 10 | 0.8435 (0.0901) | 0.5283 (0.1354) |
| 20 | 0.9221 (0.0246) | 0.7219 (0.0684) |
| 30 | 0.9277 (0.0233) | 0.7166 (0.1675) |
| 40 | 0.9368 (0.0167) | 0.7058 (0.1545) |
| 50 | 0.9329 (0.0101) | 0.7652 (0.0351) |
| 60 | 0.9331 (0.0145) | 0.7798 (0.0745) |
| 70 | 0.9247 (0.0317) | 0.7970 (0.0353) |
| 80 | 0.9260 (0.0238) | 0.7716 (0.0290) |
| 90 | 0.9501 (0.0146) | 0.8007 (0.0724) |
| 100 | 0.9458 (0.0129) | 0.7931 (0.0956) |
Table 1. Interpolation parameter experiment: mean with standard deviation (in parentheses) over 10 repetitions.
Curvature Parameter Experiment
Next, we evaluate our method on a regression task introduced in [7], which aims to predict the curvature of an underlying surface with constant curvature from a point cloud sampled from a unit disk embedded in that surface. This task is motivated by applications in geometry processing and shape analysis, where curvature encodes fundamental local geometric information. An extensive computational study of this task is conducted in [39]. We replicate their experimental setup, but reduce both the number of training samples and the number of points sampled per point cloud. This modification allows us to assess performance in a low-data regime, where differences between methods are most apparent.
Dataset
Following the procedure of [39], each point cloud is generated by sampling from a unit disk embedded in a surface with constant curvature . For 50 evenly spaced curvature values, we generate point clouds consisting of 50 points, where the sampling density is proportional to the surface area measure. This yields 50 training samples. Test data are constructed analogously using 50 curvature values sampled uniformly at random from . We refer the reader to [39] for full details of the data generation procedure and the associated code.
Methods
We evaluate the same kernel regression framework described in § 5.1, using persistence diagram representations of the point clouds (denoted as PD_kernel). For comparison, all baseline methods from [39] are included. These are comprised of TDA-based machine learning approaches after vectorization (ml_on_ph0, ml_on_ph1, ml_on_ph0_longest, ml_on_ph1_longest, ph0_ml, ph1_ml, ml_on_dis_mat) and neural network approaches (nn_shallow, nn_deep, point_net). All methods are evaluated using the original implementations provided by the authors. We refer the reader to [39] for full methodological details.
Results
Predictive performance is evaluated using the mean squared error (MSE), following the same evaluation protocol as [39]. Table 2 summarizes the results. The proposed kernel regression method on persistence diagrams attains the lowest MSE among the methods considered.
| Method | MSE |
| ml_on_ph0 | 0.3498 |
| ml_on_ph1 | 0.6315 |
| ml_on_ph0_longest | 0.2912 |
| ml_on_ph1_longest | 0.6189 |
| ph0_ml | 0.2669 |
| ph1_ml | 0.5247 |
| ml_on_dis_mat | 0.3916 |
| nn_shallow | 1.1812 |
| nn_deep | 2.7978 |
| point_net | 37.1275 |
| PD_kernel | 0.2258 |
Table 2. Curvature experiment results: Mean Square Error (MSE) comparison between all methods.
Reynolds Number Experiment
Finally, we introduce a new experiment to investigate the applicability of the proposed method to regression problems involving complex spatial data. Specifically, we consider the prediction of the Reynolds number of a simulated fluid flow from its velocity field. The Reynolds number characterizes the relative importance of inertial and viscous forces in a fluid, with low Reynolds numbers generally associated with smooth, orderly flow patterns, while high Reynolds numbers give rise to more complex, irregular spatial structures and turbulent behaviour. This provides an interesting setting for persistence diagram regression, as the topological features of the velocity field may encode information about these underlying differences in flow structure.
Dataset
We consider the 2D Unsteady Fluid Simulation Ensemble for Machine Learning introduced in [23]. The dataset contains 8000 simulations of incompressible flow on a periodic square domain (a torus), each stored as a sequence of velocity field snapshots on a grid at times . The simulations differ in their Reynolds number , which controls the turbulence and spatial complexity of the flow. Representative flows for different Reynolds numbers at different snapshot times are shown in Figure 8. See [31] for details on how the fluid flow simulations were created. The regression task is to predict of a simulation from a snapshot of the fluid velocity field at a fixed point in time for .

Figure 8. Sample vorticity fields from fluid dynamics dataset [23] and their associated persistence diagrams, at snapshot times and . Different simulations are shown (with each row) with varying Reynolds numbers.
Methods
We use the same kernel regression procedure of § 5.1 with a few changes to adapt to this setting. Since the snapshots are vector fields on a grid, rather than point clouds, Step 1 differs from the other experiments. For each snapshot of the velocity field we compute the vorticity scalar field and the persistence diagram of its sublevel-set filtration (Figure 7). Steps 2–4 in the procedure are unchanged.

Figure 7. Data pipeline for converting a fluid simulation snapshot at a fixed time point to a persistence diagram. The velocity field (left) gives the vorticity field (middle) via its curl; and the sublevel-set filtration of the vorticity yields the persistence diagram (right).
The diagrams are computed with the cubical complex module of GUDHI [32]. The grid of vorticity values is passed as the filtration values on the vertices of a cubical complex, in which each higher-dimensional cell takes the maximum value of its vertices, so the sublevel set is the union of the cells with filtration value at most . Because the simulation domain is periodic, we use the periodic cubical complex with periodic boundary conditions in both directions, so the underlying space is a torus rather than a square. Representative vorticity fields and persistence diagrams at different Reynolds numbers and snapshot times are shown in Figure 8.
Results
We use 400 simulations spread evenly over the whole range of Reynolds numbers, and the same simulations at every time point . Performance is measured by the out-of-sample on . For each of 5 random train/test splits, we hold out 100 simulations for testing and train on nested subsets of the remaining simulations of size .
Figure 9 plots the mean as a function of for each snapshot time, with error bars indicating one standard deviation across the 5 splits, and the exact values are reported in Table 3. The mean is higher at earlier snapshot times for every training size, demonstrating that our kernel method for persistence diagrams has strong predictive power for inferring the Reynold’s number at time .
| 25 | 0.7620 (0.0319) | 0.5295 (0.0232) | 0.2811 (0.0590) | 0.1401 (0.0886) | 0.0979 (0.0589) |
| 50 | 0.7643 (0.0411) | 0.5175 (0.0710) | 0.2927 (0.0502) | 0.1632 (0.0720) | 0.1204 (0.0708) |
| 100 | 0.7756 (0.0382) | 0.5543 (0.0704) | 0.3113 (0.0980) | 0.2004 (0.0856) | 0.1715 (0.0844) |
| 200 | 0.8011 (0.0275) | 0.5685 (0.0689) | 0.3317 (0.0893) | 0.2230 (0.0619) | 0.1918 (0.0597) |
| 300 | 0.8083 (0.0243) | 0.5856 (0.0563) | 0.3451 (0.0669) | 0.2498 (0.0515) | 0.2162 (0.0552) |
Table 3. Reynolds Number Experiment: mean with standard deviation (in parentheses) over 5 random train/test splits, for each snapshot time .

Figure 9. Mean predictive performance () as a function of training sample size for persistence diagram kernel regression of from a single vorticity snapshot, shown for snapshot times . Points denote empirical means across 5 random train/test splits with 100 test simulations each. Error bars indicate standard deviation.
For snapshots of the fluid simulations at later times, the method does not perform as well, and the value drops significantly. On further examination, we see that this is due to the fluid settling in to an almost-steady state at later times with similar vortex structures in each simulation at different Reynold’s numbers. See Figure 8 to compare the vorticity fields at and .
The similarity at say makes the corresponding persistence diagrams harder to distinguish, but that difficulty also holds to some extent for visual inspection of the vortex field. Looking at the vortex fields in Figure 8, it is hard to see much difference for example between the and simulations at . It is no surprise then that our kernel estimation of the Reynold’s number loses accuracy at later times. This is reflected in Figure 10, which plots the predicted against the true for a single split with at , 5 and 9. The predicted values deviate much more from the true values at higher Reynolds numbers, and this deviation is larger at the later time points (, 0.242 and 0.128 respectively).

Figure 10. Predicted versus true on a single train/test split (, ) for persistence diagram kernel regression at snapshot times , and . Each point is one test simulation, and the dotted line marks perfect prediction. The of the split is shown in each panel.
Technical Lemmas
The lemma below allows us to bound probabilities with covering numbers of our space. The original proof can be found in [1].
Lemma A.1 (Small Ball Probability Control). Let be a probability space and let be compact. Consider the ball for some fixed and . Then:
The proof for the lemma below can be found in [22].
Lemma A.2 (Binomial inverse expectation bound). Let be a binomial random variable with parameters and . Then:
(i)
(ii)
Additional Proofs
Proof of Theorem 4.1.
Proof.
We can write the above expression as:
Using the inequality , we split the expectation as follows:
We will show that each of as , which is the desired result.
First we show as . We know by condition 1, that almost surely for all :
We only need to consider on the compact support . Since is continuous on , we know for some . Hence, we attain a uniform bound by an integrable function:
Finally, since condition 3 gives us the following convergence in probability:
we can apply the Vitali convergence theorem to obtain the desired result:
Next we work on as
But the cross-terms disappear since for :
by law of total expectation and independence
So it remains to control:
But conditioning on gives:
where the inequality follows from the conditional second-moment assumption in the regression set up, and the convergence follows from condition 4. Hence as required.
Now it remains to show
By the Cauchy-Schwarz inequality and applying condition 1:
We now split the expectation depending on whether lies inside or outside the ball :
The first expectation goes to zero by application of condition 2 and since :
The second expression (for values inside the ball ) can be controlled because:
And since is continuous on a compact set, we know it is uniformly continuous. Thus:
And so as required.
Thus, we have shown that , completing the proof.
Proof for Theorem 4.2
PROOF. We just need to verify that the weights for the kernel estimator satisfy Stone’s conditions. Note that we use the following notation for scaling the kernel function:
Since our weights are normalised in the definition this condition becomes trivial since for any and :
By our condition on the kernel function we know:
But since , for any we can choose large enough so so:
Finally by dominated convergence theorem we obtain the desired result:
Since our weights are normalised, they always sum to 1 as long as the sum of kernel values is non-zero. We will show that the probability of the kernel sum being 0 is also 0 in the limit:
For any fixed , we are demanding that there are no samples in . Since the sample observations are i.i.d:
Finally, we can apply the small ball probability control Lemma A.1 and obtain:
Since we have:
Since the observations are i.i.d for a fixed , let be a binomial random variable where is the probability of success. When we have:
since . When :
since the weights are non-negative and sum to at most 1. Combining these two cases gives:
Taking the conditional expectation given and integrating over the distribution of for the expectation, we obtain:
Again applying the small ball probability control Lemma A.1 we obtain the desired result:
References
- [1]ABRAHAM, C., BIAU, G. and CADRE, B. (2006). On the Kernel Rule for Function Classification. Annals of the Institute of Statistical Mathematics 58 619–633. https://doi.org/10.1007/s10463-006-0032-1
- [2]ADAMS, H., EMERSON, T., KIRBY, M., NEVILLE, R., PETERSON, C., SHIPMAN, P., CHEPUSHTANOVA, S., HANSON, E., MOTTA, F. and ZIEGELMEIER, L. (2017). Persistence images: A stable vector representation of persistent homology. Journal of Machine Learning Research 18 1–35.
- [3]AKTAS MEHMET E, F. A. E. AKBAS ESRA (2019). Persistence homology of networks: methods and applications. Applied Network Science. https://doi.org/10.1007/s41109-019-0179-3
- [4]BAUER, U. (2021). Ripser: efficient computation of Vietoris-Rips persistence barcodes. J. Appl. Comput. Topol. 5 391–423. https://doi.org/10.1007/s41468-021-00071-5 MR4298669
- [5]BIAU, G., CEROU, F. and GUYADER, A. (2010). Rates of Convergence of the Functional k-Nearest Neighbor Estimate. IEEE Transactions on Information Theory 56 2034–2040. https://doi.org/10.1109/TIT.2010.2040857
- [6]BUBENIK, P. (2015). Statistical topological data analysis using persistence landscapes. Journal of Machine Learning Research 16 77–102.
- [7]BUBENIK, P., HULL, M., PATEL, D. and WHITTLE, B. (2020). Persistent homology detects curvature. Inverse Problems 36 025008. https://doi.org/10.1088/1361-6420/ab4ac0
- [8]BUBENIK, P. and VERGILI, T. (2018). Topological spaces of persistence modules and their properties. Journal of Applied and Computational Topology 2 233–269. https://doi.org/10.1007/s41468-018-0022-4
- [9]CARRIÈRE, M., CUTURI, M. and OUDOT, S. (2017). Sliced Wasserstein kernel for persistence diagrams. In International Conference on Machine Learning 664–673. PMLR.arxiv.org/abs/1706.03358
- [10]CARRIÈRE, M. and BAUER, U. (2019). On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert Spaces. LIPIcs, Volume 129, SoCG 2019 129 21:1–21:15. https://doi.org/10.4230/LIPIcs.SOCG.2019.21
- [11]CÉROU, F. and GUYADER, A. (2006). Nearest neighbor classification in infinite dimension. ESAIM: Probability and Statistics 10 340–355. https://doi.org/10.1051/ps:2006014 MR2274925
- [12]CHEPUSHTANOVA, S., EMERSON, T., HANSON, E. M., KIRBY, M., MOTTA, F. C., NEVILLE, R., PETERSON, C., SHIPMAN, P. D. and ZIEGELMEIER, L. (2015). Persistence Images: An Alternative Persistent Homology Representation. Corr abs/1507.06217.
- [13]COHEN-STEINER, D., EDELSBRUNNER, H. and HARER, J. (2007). Stability of persistence diagrams. Discrete & Computational Geometry 37 103–120.
- [14]COHEN-STEINER, D., EDELSBRUNNER, H., HARER, J. and MILEYKO, Y. (2010). Lipschitz functions have Lp-stable persistence. Foundations of Computational Mathematics 10 127–139.
- [15]CRAWLEY-BOEVEY, W. (2015). Decomposition of pointwise finite-dimensional persistence modules. Journal of Algebra and Its Applications 14 1550066. https://doi.org/10.1142/S0219498815500668
- [16]DABO-NIANG, S. and RHOMARI, N. (2003). Estimation non paramétrique de la régression avec variable explicative dans un espace métrique. Comptes Rendus Mathematique 336 75-80. https://doi.org/10.1016/S1631-073X(02)00012-2
- [17]DEVROYE, L. P. and WAGNER, T. J. (1980). Distribution-Free Consistency Results on Nonparametric Discrimination and Regression Function Estimation. The Annals of Statistics 8 231 – 239. https://doi.org/10.1214/aos/1176344949
- [18]EDELSBRUNNER, H. and HARER, J. (2010). Computational Topology: An Introduction. https://doi.org/10.1007/978-3-540-33259-6_7
- [19]FASY, B. T., LECCI, F., RINALDO, A., WASSERMAN, L., BALAKRISHNAN, S. and SINGH, A. (2014). Confidence sets for persistence diagrams. The Annals of Statistics 42 2301–2339.
- [20]Ferraty, F. and Vieu, P. (2006). Nonparametric Functional Data Analysis: Theory and Practice 51. https://doi.org/10.1007/0-387-36620-2
- [21]Forzani, L., Fraiman, R. and Llоp, P. (2012). Consistent Nonparametric Regression for Functional Data Under the Stone–Besicovitch Conditions. IEEE Transactions on Information Theory 58 6697–6708. https://doi.org/10.1109/TIT.2012.2209628
- [22]Györfi, L., Kohler, M., Krzyżak, A. and Walk, H. (2002). A Distribution-Free Theory of Nonparametric Regression. Springer series in statistics. Springer.DOI
- [23]Jakob, J., Gross, M. and Günther, T. (2021). A Fluid Flow Data Set for Machine Learning and its Application to Neural Flow Map Interpolation. IEEE Transactions on Visualization and Computer Graphics 27 1279–1289. https://doi.org/10.1109/TVCG.2020.3028947
- [24]Kpotufe, S. (2009). Fast, smooth and adaptive regression in metric spaces. In Advances in Neural Information Processing Systems 22 1024–1032.
- [25]Kulkarni, S. R. and Posner, S. E. (1995). Rates of convergence of nearest neighbor estimation under arbitrary sampling. IEEE Transactions on Information Theory 41 1028–1039. https://doi.org/10.1109/18.391248
- [26]Kwitt, R., Huber, S., Niethammer, M., Lin, W. and Bauer, U. (2015). Statistical topological data analysis – A kernel perspective. In Advances in Neural Information Processing Systems 28 3070–3078.
- [27]Mileyko, Y., Mukherjee, S. and Harer, J. (2011). Probability measures on the space of persistence diagrams. Inverse Problems 27 124007. https://doi.org/10.1088/0266-5611/27/12/124007
- [28]Nadaraya, E. A. (1964). On Estimating Regression. Theory of Probability & Its Applications 9 141–142. https://doi.org/10.1137/1109020
- [29]Obayashi, I., Hiraoka, Y. and Kimura, M. (2018). Persistence diagrams with linear machine learning models. Journal of Applied and Computational Topology.arxiv.org/abs/1706.10082
- [30]Perea, J., Munch, E. and Khasawneh, F. (2022). Approximating Continuous Functions on Persistence Diagrams Using Template Functions. Foundations of Computational Mathematics. https://doi.org/10.48550/arXiv.1902.07190
- [31]Popinet, S. (2004). Free Computational Fluid Dynamics. ClusterWorld 2.
- [32]Project, T. G. (2023). GUDHI – Geometry Understanding in Higher Dimensions. https://gudhi.inria.fr/.
- [33]Pun, C. S., Xia, K. and Lee, S. (2022). Persistent-Homology-based Machine Learning and its Applications – A Survey. Artificial Intelligence Review. https://doi.org/10.48550/arXiv.1811.00252
- [34]Reininghaus, J., Huber, S., Bauer, U. and Kwitt, R. (2015). A stable multi-scale kernel for topological machine learning. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition 4741–4748.arxiv.org/abs/1412.6821
- [35]Robinson, A. and Turner, K. (2017). Hypothesis Testing for Topological Data Analysis. Journal of Applied and Computational Topology 1 241–261. https://doi.org/10.1007/s41468-017-0008-7
- [36]Spiegelman, C. and Sacks, J. (1980). Consistent Window Estimation in Nonparametric Regression. The Annals of Statistics 8 240–246. https://doi.org/10.1214/aos/1176344950
- [37]Stone, C. J. (1977). Consistent Nonparametric Regression. The Annals of Statistics 5 595 – 620. https://doi.org/10.1214/aos/1176343886
- [38]Stone, C. J. (1982). Optimal global rates of convergence for nonparametric regression. The Annals of Statistics 10 1040–1053.DOI
- [39]Turkeš, R., Montúfar, G. and Otter, N. (2023). On the effectiveness of persistent homology. https://arxiv.org/abs/2206.10551.
- [40]Turner, K., Mileyko, Y., Mukherjee, S. and Harer, J. (2012). Frechet Means for Distributions of Persistence Diagrams. Discrete and Computational Geometry 52. https://doi.org/10.1007/s00454-014-9604-7
- [41]Turner, K. and Spreemann, G. (2019). Same But Different: Distance Correlations Between Topological Summaries. arXiv preprint arXiv:1903.01051. https://doi.org/10.48550/arXiv.1903.01051
- [42]Watson, G. S. (1964). Smooth regression analysis. Sankhyā: The Indian Journal of Statistics, Series A 359–372.