Related papers: Surface Spline Approximation on SO(3)
We propose algorithms to take point sets for kernel-based interpolation of functions in reproducing kernel Hilbert spaces (RKHSs) by convex optimization. We consider the case of kernels with the Mercer expansion and propose an algorithm by…
We study approximation properties of linear sampling operators in the spaces $L_p$ for $1\le p<\infty$. By means of the Steklov averages, we introduce a new measure of smoothness that simultaneously contains information on the smoothness of…
Kernel machines have sustained continuous progress in the field of quantum chemistry. In particular, they have proven to be successful in the low-data regime of force field reconstruction. This is because many equivariances and invariances…
In the context of functional data analysis, probability density functions as non-negative functions are characterized by specific properties of scale invariance and relative scale which enable to represent them with the unit integral…
We introduce an algorithm of joint approximation of a function and its first derivative by alternative orthogonal polynomials on the interval [0,1].The algorithm exhibits properties of shape preserving approximation for the function. A weak…
We introduce a new method to prove lower estimates for the approximation error of general linear operators with smooth range in terms of classical moduli of smoothness and related $K$-functionals. In addition, we explicitly show how to…
The accurate description of molecule-surface interactions requires a detailed knowledge of the underlying potential-energy surface (PES). Recently, neural networks (NNs) have been shown to be an efficient technique to accurately interpolate…
A numerical scheme is described for accurately accommodating oblique, non-aligned, boundaries, on a three-dimensional cartesian grid. The scheme gives second-order accuracy in the solution for potential of Poisson's equation using compact…
We examine implicit representations of parametric or point cloud models, based on interpolation matrices, which are not sensitive to base points. We show how interpolation matrices can be used for ray shooting of a parametric ray with a…
This paper introduces an approach for detecting differences in the first-order structures of spatial point patterns. The proposed approach leverages the kernel mean embedding in a novel way by introducing its approximate version tailored to…
We study nonlinear approximation in $\operatorname{BMO}$ from splines generated by a hierarchy of B-splines over regular multilevel nested partitions of $\mathbb R$. Companion Jackson and Bernstein estimates are established that allow to…
We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…
Deep reinforcement learning (RL) is increasingly deployed in resource-constrained environments, yet the go-to function approximators - multilayer perceptrons (MLPs) - are often parameter-inefficient due to an imperfect inductive bias for…
Implicit neural representations (INRs), which leverage neural networks to represent signals by mapping coordinates to their corresponding attributes, have garnered significant attention. They are extensively utilized for image…
Deep learning based methods have recently pushed the state-of-the-art on the problem of Single Image Super-Resolution (SISR). In this work, we revisit the more traditional interpolation-based methods, that were popular before, now with the…
Many rotational invariants for crystal structure representations have been used to describe the structure-property relationship by machine learning. The machine learning interatomic potential (MLIP) is one of the applications of rotational…
We introduce kernel thinning, a new procedure for compressing a distribution $\mathbb{P}$ more effectively than i.i.d. sampling or standard thinning. Given a suitable reproducing kernel $\mathbf{k}_{\star}$ and $O(n^2)$ time, kernel…
We propose Splinter, a new technique for proving properties of heap-manipulating programs that marries (1) a new separation logic-based analysis for heap reasoning with (2) an interpolation-based technique for refining heap-shape invariants…
This paper deals with Hermite osculatory interpolating splines. For a partition of a real interval endowed with a refinement consisting in dividing each subinterval into two small subintervals, we consider a space of smooth splines with…
We provide improved error bounds for kernel-based numerical differentiation in terms of growth functions when kernels are of a finite smoothness, such as polyharmonic splines, thin plate splines or Wendland kernels. In contrast to existing…