Splinets -- splines through the Taylor expansion, their support sets and orthogonal bases

Krzysztof Podgórski

Home/Archive/arXiv

arXiv · 2102.00733

Splinets -- splines through the Taylor expansion, their support sets and orthogonal bases

Krzysztof Podgórski

View original source ↗Read source document ↗Export metadata ↓

Abstract

A new representation of splines that targets efficiency in the analysis of functional data is implemented. The efficiency is achieved through two novel features: using the recently introduced orthonormal spline bases, the so-called {\it splinets} and accounting for the spline support sets in the proposed spline object representation. The recently-introduced orthogonal splinets are evaluated by {\it dyadic orthogonalization} of the $B$-splines. The package is built around the {\it Splinets}-object that represents a collection of splines. It treats splines as mathematical functions and contains information about the support sets and the values of the derivatives at the knots that uniquely define these functions. Algebra and calculus of splines utilize the Taylor expansions at the knots within the support sets. Several orthonormalization procedures of the $B$-splines are implemented including the recommended dyadic method leading to the splinets. The method bases on a dyadic algorithm that can be also viewed as the efficient method of diagonalizing a band matrix. The locality of the $B$-splines in terms of the support sets is, to a great extend, preserved in the corresponding splinet. This together with implemented algorithms utilizing locality of the supports provides a valuable computational tool for functional data analysis. The benefits are particularly evident when the sparsity in the data plays an important role. Various diagnostic tools are provided allowing to maintain the stability of the computations. Finally, the projection operation to the space of splines is implemented that facilitates functional data analysis. An example of a simple functional analysis of the data using the tools in the package is presented. The functionality of the package extends beyond the splines to piecewise polynomial functions, although the splines are its focus.

Explore related subjects

stat.CO cs.NA math.NA

Keep this discovery

BibTeX RIS

Krzysztof Podgórski. 2021-02-01. Splinets -- splines through the Taylor expansion, their support sets and orthogonal bases. https://arxiv.org/abs/2102.00733

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

KEEP EXPLORING

Related papers

arXiv2026

Extended One-Liners for the Gamma, Poisson, and Binomial Distributions

We demonstrate explicit transformations of three independent uniforms with exact Gamma$(a,1)$, $a>0$, Poisson$(\lambda)$, $\lambda>0$, and Binomial$(N,p)$, $N\geq 1$, $0\leq p \leq 1$ laws using only elementary operations.

stat.CO↗

arXiv2026

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↗

arXiv2026

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↗