Efficient estimation for a smoothing thin plate spline in a two-dimensional space

Joaquin Cavieres; Michael Karkulik

Home/Archive/arXiv

arXiv · 2404.01902

Efficient estimation for a smoothing thin plate spline in a two-dimensional space

Joaquin Cavieres·Michael Karkulik

View original source ↗Read source document ↗Export metadata ↓

Abstract

Using a deterministic framework allows us to estimate a function with the purpose of interpolating data in spatial statistics. Radial basis functions are commonly used for scattered data interpolation in a d-dimensional space, however, interpolation problems have to deal with dense matrices. For the case of smoothing thin plate splines, we propose an efficient way to address this problem by compressing the dense matrix by an hierarchical matrix ($\mathcal{H}$-matrix) and using the conjugate gradient method to solve the linear system of equations. A simulation study was conducted to assess the effectiveness of the spatial interpolation method. The results indicated that employing an $\mathcal{H}$-matrix along with the conjugate gradient method allows for efficient computations while maintaining a minimal error. We also provide a sensitivity analysis that covers a range of smoothing and compression parameter values, along with a Monte Carlo simulation aimed at quantifying uncertainty in the approximated function. Lastly, we present a comparative study between the proposed approach and thin plate regression using the "mgcv" package of the statistical software R. The comparison results demonstrate similar interpolation performance between the two methods.

Explore related subjects

stat.CO stat.OT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Joaquin Cavieres, Michael Karkulik. 2024-04-02. Efficient estimation for a smoothing thin plate spline in a two-dimensional space. https://arxiv.org/abs/2404.01902

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

KEEP EXPLORING

Related papers

arXiv2026

Kinetic Interacting Particle Langevin Monte Carlo

This paper introduces and analyses interacting underdamped Langevin algorithms, termed Kinetic Interacting Particle Langevin Monte Carlo (KIPLMC) methods, for statistical inference in latent variable models. We propose a diffusion process that evolves jointly in the space of parameters and latent variables and show that the stationary distribution of this diffusion concentrates around the maximum marginal likelihood estimate of the parameters. We then provide two explicit discretisations of this diffusion as practical algorithms to estimate parameters of statistical models. For each algorithm, we obtain nonasymptotic rates of convergence in Wasserstein-2 distance for the case where the joint log-likelihood is strongly concave with respect to latent variables and parameters. We achieve accelerated convergence rates clearly demonstrating improvement in dimension dependence. To demonstrate the utility of the introduced methodology, we provide numerical experiments that illustrate the effectiveness of the proposed diffusion for statistical inference. Our setting covers a broad number of applications, including unsupervised learning, statistical inference, and inverse problems.

stat.CO↗

arXiv2026

Graph-Enabled Efficient Federated Bayesian Modeling

Federated Bayesian modeling requires combining evidence across distributed data holders while preserving posterior uncertainty and keeping local data decentralized. We propose Federated Latent Graph MCMC (FLaG-MCMC), a framework for sequential posterior transfer in which accumulated posterior information is represented by a reservoir of Monte Carlo samples. FLaG-MCMC constructs a graph that captures the geometry of the posterior reservoir and uses graph-enabled proposals whose per-iteration cost is independent of the reservoir size. Each data holder updates the inherited posterior using its local likelihood and returns an updated reservoir for subsequent inference. We apply FLaG-MCMC in two health science settings. Using mobile and wearable device data from GLOBEM, we investigate associations between depression status and behavioral patterns while sequentially accumulating posterior information across participants. FLaG-MCMC accurately reconstructs the corresponding pooled Bayesian posterior while closely tracking evolving posterior location and uncertainty in these associations. We also conduct a simulation study motivated by Bayesian evidence synthesis for opioid use disorder prevalence across studies, transferring posterior information from an Ohio study to a subsequent New York analysis under covariate shift. In this setting, FLaG-MCMC demonstrates reliable posterior transfer and favorable computational scaling. Theoretical results establish the validity and consistency of the framework.

stat.CO↗

arXiv2026

Optimal Scaling of Langevin Proposals with Generalized Acceptance Rules

Langevin-based Markov chain Monte Carlo (MCMC) algorithms use gradient information to improve sampling, particularly in high dimensions. Classical optimal scaling theory for these algorithms has largely focused on the Metropolis-Hastings (MH) acceptance rule. However, there has been a recent surge in acceptance rules beyond MH for applications spanning differential privacy, stochastic MCMC, diffusion models, and molecular dynamics. We develop optimal scaling results for Langevin proposals employed with generalized acceptance rules belonging to a suitable class. For high-dimensional targets, we recover the usual $O(d^{-1/3})$ scaling, while different acceptance rules lead to different optimal acceptance probabilities.

stat.CO↗