Related papers: Custom-made Gauss quadrature for statisticians
We study the total mass of high points in a random model for the Riemann-Zeta function. We consider the same model as in [8], [2], and build on the convergence to 'Gaussian' multiplicative chaos proved in [14]. We show that the total mass…
In this work, we revisit the problem of estimating the mean and covariance of an unknown $d$-dimensional Gaussian distribution in the presence of an $\varepsilon$-fraction of adversarial outliers. The pioneering work of [DKK+16] gave a…
We propose a new approach for the study of the quadratic stochastic Euclidean bipartite matching problem between two sets of $N$ points each, $N\gg 1$. The points are supposed independently randomly generated on a domain…
We study the time-sliced thawed Gaussian propagation method, which was recently proposed for solving the time-dependent Schr\"odinger equation. We introduce a triplet of quadrature-based analysis, synthesis and re-initialization operators…
This survey provides an exposition of a suite of techniques based on the theory of polynomials, collectively referred to as polynomial methods, which have recently been applied to address several challenging problems in statistical…
There is a result of Diaconis and Freedman which says that, in a limiting sense, for large collections of high-dimensional data most one-dimensional projections of the data are approximately Gaussian. This paper gives quantitative versions…
This review outlines concepts of mathematical statistics, elements of probability theory, hypothesis tests and point estimation for use in the analysis of modern astronomical data. Least squares, maximum likelihood, and Bayesian approaches…
Engineers widely use Gaussian process regression framework to construct surrogate models aimed to replace computationally expensive physical models while exploring design space. Thanks to Gaussian process properties we can use both samples…
Gaussian functions are commonly used in different fields, many real signals can be modeled into such form. Research aiming to obtain a precise fitting result for these functions is very meaningful. This manuscript intends to introduce a new…
We study the application of graph random features (GRFs) - a recently introduced stochastic estimator of graph node kernels - to scalable Gaussian processes on discrete input spaces. We prove that (under mild assumptions) Bayesian inference…
Gaussian processes are a powerful framework for uncertainty-aware function approximation and sequential decision-making. Unfortunately, their classical formulation does not scale gracefully to large amounts of data and modern hardware for…
In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…
Algorithm and code to produce sequences whose members obey Gaussian distribution function is reported. Discreet and limited number of groups are defined in the distribution function, where each group is represented only with one value…
Gaussian processes are a key component of many flexible statistical and machine learning models. However, they exhibit cubic computational complexity and high memory constraints due to the need of inverting and storing a full covariance…
A class of high-order numerical algorithms for Riesz derivatives are established through constructing new generating functions. Such new high-order formulas can be regarded as the modification of the classical (or shifted) Lubich's…
We introduce Gaussian quadrature rules for spline spaces that are frequently used in Galerkin discretizations to build mass and stiffness matrices. By definition, these spaces are of even degrees. The optimal quadrature rules we recently…
We obtain estimates of the multiplicative constants appearing in local convergence results of the Riemannian Gauss-Newton method for least squares problems on manifolds and relate them to the geometric condition number of [P. B\"urgisser…
One of the outstanding problems in the numerical discretization of the Feynman-Kac formula calls for the design of arbitrary-order short-time approximations that are constructed in a stable way, yet only require knowledge of the potential…
We present a novel Kalman filter for spatiotemporal systems called the numerical Gaussian process Kalman filter (GPKF). Numerical Gaussian processes have recently been introduced as a physics informed machine learning method for simulating…
In \cite{NRxx}, we proposed a numerical regularized moment method of arbitrary order (abbreviated as NRxx method) for Boltzmann-BGK equation, which makes numerical simulation using very large number of moments possible. In this paper, we…