SearcharxivSearch

arXiv · 2608.22921

fdWasserstein: Optimal Transport Methods for Covariance Operators of Functional Data

Abstract

Data increasingly arrive as collections of curves - a voice recording, a growth trajectory, a day of sensor readings - where each observation is a whole function rather than a single number. The usual question asked of such data is how the average curve differs from one group to the next. But the average is only half the picture: two populations of curves can share almost the same mean and still differ profoundly in how they fluctuate around it, and it is often this variability - the pattern of covariation within a curve - that carries the scientific signal. Comparing populations at this level means comparing their covariance operators, and statistics on covariances is impaired by their non-linearity. The fdWasserstein package equips R users with functions to make such comparisons. It is centered on the geometry of optimal transport, under which covariance operators can be meaningfully averaged, contrasted, and interpolated. It provides the Procrustes-Wasserstein distance between covariance operators, their Frechet mean (barycenter), an ANOVA-type permutation test for the equality of several covariances, principal component analysis of covariance variation, and an entropy-regularized soft clustering of curves by their covariance structure. We outline the underlying ideas, discuss the implementation and demonstrate the complete workflow on the phoneme data shipped with the package.

Explore related subjects

Keep this discovery

BibTeXRIS

V. Masarotto. 2026-08-24. fdWasserstein: Optimal Transport Methods for Covariance Operators of Functional Data. https://arxiv.org/abs/2608.22921

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO