Related papers: Exact Deconvolution for Schwartz Kernels: From Pol…
Motivated by the study of H\"ormander's sums-of-squares operators and their generalizations, we define the convolution algebra of transverse distributions associated to a singular foliation. We prove that this algebra is represented as…
Learning the kernel functions used in kernel methods has been a vastly explored area in machine learning. It is now widely accepted that to obtain 'good' performance, learning a kernel function is the key challenge. In this work we focus on…
In this paper we introduce reproducing kernel Hilbert spaces of polyanalytic functions of infinite order. First we study in details the counterpart of the Fock space and related results in this framework. In this case the kernel function is…
In this work, we consider "finite bandwidth" reproducing kernel Hilbert spaces which have orthonormal bases of the form $f_n(z)=z^n \prod_{j=1}^J \left( 1 - a_{n}w_j z \right)$, where $w_1 ,w_2, \ldots w_J $ are distinct points on the…
Contrary to the traditional pursuit of research on nonuniform sampling of bandlimited signals, the objective of the present paper is not to find sampling conditions that permit perfect reconstruction, but to perform the best possible signal…
We present a versatile formulation of the convolution operation that we term a "mapped convolution." The standard convolution operation implicitly samples the pixel grid and computes a weighted sum. Our mapped convolution decouples these…
Computing many eigenpairs of the Schr{\"o}dinger operator presents a computational bottleneck in large-scale quantum simulations due to the global communication overhead of explicit orthogonalization. To address this issue, we propose a…
Image restoration, including image denoising, super resolution, inpainting, and so on, is a well-studied problem in computer vision and image processing, as well as a test bed for low-level image modeling algorithms. In this work, we…
We consider the eigenvalue problem of certain kind of non-compact linear operators given as the sum of a multiplication and a kernel operator. A degenerate kernel method is used to approximate isolated eigenvalues. It is shown that entries…
Deconvolution is a fundamental inverse problem in signal processing and the prototypical model for recovering a signal from its noisy measurement. Nevertheless, the majority of model-based inversion techniques require knowledge on the…
This paper considers the approximation of spatial convolution with a given radial integral kernel. Previous studies have demonstrated that approximating spatial convolution using a system of partial differential equations (PDEs) can…
Motivated by the challenge of seeking a rigorous foundation for the bulk-boundary correspondence for free fermions, we introduce an algorithm for determining exactly the spectrum and a generalized-eigenvector basis of a class of banded…
Existing ultrasound deconvolution approaches unrealistically assume, primarily for computational reasons, that the convolution model relies on a spatially invariant kernel and circulant boundary conditions. We discard both restrictions and…
This article establishes sharp inverse and saturation statements for kernel-based approximation using finitely smooth Sobolev kernels on bounded Lipschitz regions. The analysis focuses on the superconvergence regime, for which direct…
We introduce the concept of compressed convolution, a technique to convolve a given data set with a large number of non-orthogonal kernels. In typical applications our technique drastically reduces the effective number of computations. The…
Deconvolution with a box (square wave) is a key operation for super-resolution with pixel-shift cameras. In general convolution with a box is not invertible. However, we can obtain perfect reconstructions of sparse signals using convex…
Based on direct integrals, a framework allowing to integrate a parametrised family of reproducing kernels with respect to some measure on the parameter space is developed. By pointwise integration, one obtains again a reproducing kernel…
The Riesz transform of $u$ : $\mathcal{S}(\mathbb{R}^n) \rightarrow \mathcal{S'}(\mathbb{R}^n)$ is defined as a convolution by a singular kernel, and can be conveniently expressed using the Fourier Transform and a simple multiplier. We…
We study the statistical-computational trade-offs for learning with exact invariances (or symmetries) using kernel regression. Traditional methods, such as data augmentation, group averaging, canonicalization, and frame-averaging, either…
In this paper we first identify a basic limitation in gradient descent-based optimization methods when used in conjunctions with smooth kernels. An analysis based on the spectral properties of the kernel demonstrates that only a vanishingly…