Related papers: On the High-Level Error Bound for Gaussian Interpo…
Skew-symmetric functions are a class of functions defined on a product space $M \times M$ that are antisymmetric with respect to the order of their inputs. In [13], the authors proved that non-deterministic skew-symmetric Gaussian fields…
We introduce and discuss the concept of Gaussian probability density function (pdf) for the n-dimensional hyperbolic space which has been proposed as an environment for coding and decoding signals. An upper bound for the error probability…
The concept of edit distance, which dates back to the 1960s in the context of comparing word strings, has since found numerous applications with various adaptations in computer science, computational biology, and applied topology. By…
It is well-known that polynomial reproduction is not possible when approximating with Gaussian kernels. Quasi-interpolation schemes have been developed which use a finite number of Gaussians at different scales, which then reproduce…
The maximum-marginal-a-posteriori success rate of statistical decision under multivariate Gaussian error distribution on an integer lattice is almost rigorously calculated by using union-bound approximation and Monte Carlo integration.…
Coherent lower previsions are general probabilistic models allowing incompletely specified probability distributions. However, for complete description of a coherent lower prevision -- even on finite underlying sample spaces -- an infinite…
In this work we consider a model problem of deep neural learning, namely the learning of a given function when it is assumed that we have access to its point values on a finite set of points. The deep neural network interpolant is the the…
The interference channel with common information (IC-CI) consists of two transmit-receive pairs that communicate over a common noisy medium. Each transmitter has an individual message for its paired receiver, and additionally, both…
Given $ -\infty< \lambda < \Lambda < \infty $, $ E \subset \mathbb{R}^n $ finite, and $ f : E \to [\lambda,\Lambda] $, how can we extend $ f $ to a $ C^m(\mathbb{R}^n) $ function $ F $ such that $ \lambda\leq F \leq \Lambda $ and $…
We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program. Our algorithm constructs an approximation f* of f, such that their difference probably has at most half the number of terms of…
In this manuscript we consider the problem of generalized linear estimation on Gaussian mixture data with labels given by a single-index model. Our first result is a sharp asymptotic expression for the test and training errors in the…
This paper provides data-dependent bounds on the expected error of the Gibbs algorithm in the overparameterized interpolation regime, where low training errors are also obtained for impossible data, such as random labels in classification.…
We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an active noisy Gaussian feedback link. We impose an \emph{expected}…
Let $A$ be a square complex matrix, $z_1$, ..., $z_{n}\in\mathbb C$ be (possibly repetitive) points of interpolation, $f$ be analytic in a neighborhood of the convex hull of the union of the spectrum of $A$ and the points $z_1$, ...,…
It has long been known how to construct radiation boundary conditions for the time dependent wave equation. Although arguments suggesting that they are accurate have been given, it is only recently that rigorous error bounds have been…
Let $\lambda$ be a positive number, and let $(x_j:j\in\mathbb Z)\subset\mathbb R$ be a fixed Riesz-basis sequence, namely, $(x_j)$ is strictly increasing, and the set of functions $\{\mathbb R\ni t\mapsto e^{ix_jt}:j\in\mathbb Z\}$ is a…
Our ability to calibrate current kilometer-scale interferometers can potentially confound the inference of astrophysical signals. Current calibration uncertainties are well described by a Gaussian process. I exploit this description to…
This paper addresses the problem of approximating a function of bounded variation from its scattered data. Radial basis function(RBF) interpolation methods are known to approximate only functions in their native spaces, and to date, there…
In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as the most efficient numerical interpolation method in terms of approximation accuracy and computational effort. However, we show numerically that the…
This article pertains to interpolation of Sobolev functions at shrinking lattices $h\mathbb{Z}^d$ from $L_p$ shift-invariant spaces associated with cardinal functions related to general multiquadrics,…