Related papers: Reconstruction of density functions by sk-splines
We propose a Semi-Lagrangian scheme coupled with Radial Basis Function interpolation for approximating a curvature-related level set model, which has been proposed by Zhao et al. in \cite{ZOMK} to reconstruct unknown surfaces from sparse,…
This contribution presents a new analysis of properties of the interpolation using Radial Bases Functions (RBF) related to large data sets interpolation. The RBF application is convenient method for scattered d-dimensional interpolation.…
We exhibit three classes of compactly supported functions which provide reproducing kernels for the Sobolev spaces $H^\delta(\R^d)$ of arbitrary order $\,\delta>d/2.\,$ Our method of construction is based on a new class of oscillatory…
Kernel methods are an incredibly popular technique for extending linear models to non-linear problems via a mapping to an implicit, high-dimensional feature space. While kernel methods are computationally cheaper than an explicit feature…
A feature-mapping framework for inverse reconstruction of density-based topology optimization results is proposed. Unlike SIMP, whose voxelized outputs are hard to interpret or reuse, the method represents designs with high-level geometric…
Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…
This paper studies the influence of scaling on the behavior of Radial Basis Function interpolation. It focuses on certain central aspects, but does not try to be exhaustive. The most important questions are: How does the error of a…
We present Neural Splines, a technique for 3D surface reconstruction that is based on random feature kernels arising from infinitely-wide shallow ReLU networks. Our method achieves state-of-the-art results, outperforming recent neural…
We present a constructive approximation framework for analyzing the expressive power of Fourier residual networks in approximating a broad class of one-dimensional functions. Our study covers both piecewise continuous functions -- including…
Recently, deep neural networks (DNNs) have become powerful tools for solving inverse scattering problems. However, the approximation and generalization rates of DNNs for solving these problems remain largely under-explored. In this work, we…
We study mapping properties of operators with kernels defined via a combination of continuous and discrete orthogonal polynomials, which provide an abstract formulation of quantum (q-) Fourier type systems. We prove Ismail conjecture…
Density-functional theory is a formally exact description of a many-body quantum system in terms of its density; in practice, however, approximations to the universal density functional are required. In this work, a model based on deep…
We employ the functional renormalization group approach formulated on the Schwinger-Keldysh contour to calculate real-time correlation functions in scalar field theories. We provide a detailed description of the formalism, discuss suitable…
A binary quenched-annealed hard core mixture is considered in one dimension in order to model fluid adsorbates in narrow channels filled with a random matrix. Two different density functional approaches are employed to calculate adsorbate…
A computationally inexpensive k.p-based interpolation scheme is developed that can extend the eigenvalues and momentum matrix elements of a sparsely sampled k-point grid into a densely sampled one. Dense sampling, often required to…
We investigate the problem of bulk metric reconstruction in holography by leveraging the inverse scattering framework applied to boundary two-point correlation functions. We generalize our previous work of scalar field and show that…
In this paper, we consider the problem of reconstructing piecewise smooth functions to high accuracy from nonuniform samples of their Fourier transform. We use the framework of nonuniform generalized sampling (NUGS) to do this, and to…
Kernel methods give powerful, flexible, and theoretically grounded approaches to solving many problems in machine learning. The standard approach, however, requires pairwise evaluations of a kernel function, which can lead to scalability…
The traditional approaches to computerized tomography (CT) depend on the samples of Radon transform at multiple angles. In optics, the real time imaging requires the reconstruction of an object by the samples of Radon transform at a single…
Estimating expected polynomials of density functions from samples is a basic problem with numerous applications in statistics and information theory. Although kernel density estimators are widely used in practice for such functional…