Related papers: A Gaussian small deviation inequality for convex f…
In this article, we derive the weak limiting distribution of the least squares estimator (LSE) of a convex probability mass function (pmf) with a finite support. We show that it can be defined via a certain convex projection of a Gaussian…
Consider the Gaussian vector model with mean value {\theta}. We study the twin problems of estimating the number |{\theta}|_0 of non-zero components of {\theta} and testing whether |{\theta}|_0 is smaller than some value. For testing, we…
We consider the paths of a Gaussian random process $x(t)$, $x(0)=0$ not exceeding a fixed positive level over a large time interval $(0,T)$, $T\gg 1$. The probability $p(T)$ of such event is frequently a regularly varying function at…
Let $\{X(t):t\in\mathbb R_+\}$ be a stationary Gaussian process with almost surely (a.s.) continuous sample paths, $\mathbb E X(t) = 0$, $\mathbb E X^2(t) = 1$ and correlation function satisfying (i) $r(t) = 1 - C|t|^{\alpha} +…
Context: Two-point correlation functions are used throughout cosmology as a measure for the statistics of random fields. When used in Bayesian parameter estimation, their likelihood function is usually replaced by a Gaussian approximation.…
This paper establishes the optimal sub-Gaussian variance proxy for truncated Gaussian and truncated exponential random variables. The proofs rely on first characterizing the optimal variance proxy as the unique solution to a set of two…
Simulations are made of a probe particle diffusing through a complex fluid. Probe particle motions are described by the Mori-Zwanzig equation and Mori's orthogonal hierarchy of random forces scheme, subject to the approximation that the…
Variable selection for Gaussian process models is often done using automatic relevance determination, which uses the inverse length-scale parameter of each input variable as a proxy for variable relevance. This implicitly determined…
Due to their flexibility, Gaussian processes (GPs) have been widely used in nonparametric function estimation. A prior information about the underlying function is often available. For instance, the physical system (computer model output)…
Gaussian Processes (GPs) are a versatile and popular method in Bayesian Machine Learning. A common modification are Sparse Variational Gaussian Processes (SVGPs) which are well suited to deal with large datasets. While GPs allow to…
We study the small deviation problem $\log\mathbb{P}(\sup_{t\in[0,1]}|X_t|\leq\varepsilon)$, as $\varepsilon\to0$, for general L\'{e}vy processes $X$. The techniques enable us to determine the asymptotic rate for general real-valued…
Maximizing high-dimensional, non-convex functions through noisy observations is a notoriously hard problem, but one that arises in many applications. In this paper, we tackle this challenge by modeling the unknown function as a sample from…
We study the hole probability of Gaussian random entire functions. More specifically, we work with entire functions in Taylor series form with i.i.d complex Gaussian coefficients. A hole is the event where the function has no zeros in a…
We show a general phenomenon of the constrained functional value for densities satisfying general convexity conditions, which generalizes the observation in Bobkov and Madiman (2011) that the entropy per coordinate in a log-concave random…
This note demonstrates that it is possible to bound the expectation of an arbitrary norm of a random matrix drawn from the Stiefel manifold in terms of the expected norm of a standard Gaussian matrix with the same dimensions. A related…
We find the logarithmic $L_2$-small ball asymptotics for a class of zero mean Gaussian fields with covariances having the structure of "tensor product". The main condition imposed on marginal covariances is slow growth at the origin of…
In this work we prove an analogue, for partial differential equations on the space of probability measures, of the classical vanishing viscosity result known for equations on the Euclidean space. Our result allows in particular to show that…
We consider a random process as a solution of stochastic differential equations with dependence of the coefficients on small parameter $\varepsilon$ and we suppose that the drift coefficients of these equations are unbounded on the…
Assume that f is a strict convex function with a unique minimum in R^n. We divide the vector of n-variables to d groups of vector subvariables with d at least two. We assume that we can find the partial minimum of f with respect to each…
In decision-making problems under uncertainty, probabilistic constraints are a valuable tool to express safety of decisions. They result from taking the probability measure of a given set of random inequalities depending on the decision…