Related papers: Bounds on Discrete Fourier Transform of Random Mas…
Convergence bounds are one of the main tools to obtain information on the performance of a distributed machine learning task, before running the task itself. In this work, we perform a set of experiments to assess to which extent, and in…
In this paper, by using a combinatorial approach, we establish a new upper bound for the F-threshold $c^\mm(\mm)$ of determinantal rings generated by maximal minors. We prove that $c^\mm(\mm)$ coincides with the $a$-invariant in the case of…
We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on…
Recently W. Lao and M. Mayer [6], [7], [9] considered $U$-max - statistics, where instead of sum appears the maximum over the same set of indices. Such statistics often appear in stochastic geometry. The examples are given by the largest…
In this paper q-ary Raptor codes under ML decoding are considered. An upper bound on the probability of decoding failure is derived using the weight enumerator of the outer code, or its expected weight enumerator if the outer code is drawn…
We present a series of closed-form maximum entropy upper bounds for the differential entropy of a continuous univariate random variable and study the properties of that series. We then show how to use those generic bounds for upper bounding…
We show that the error probability of reconstructing kernel matrices from Random Fourier Features for the Gaussian kernel function is at most $\mathcal{O}(R^{2/3} \exp(-D))$, where $D$ is the number of random features and $R$ is the…
We consider matrix products of the form $A_1(A_2A_2)^\top\ldots(A_{m}A_{m}^\top)A_{m+1}$, where $A_i$ are normalized random Fourier-Walsh matrices. We identify an interesting polynomial scaling regime when the operator norm of the expected…
Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…
Experimental design is an approach for selecting samples among a given set so as to obtain the best estimator for a given criterion. In the context of linear regression, several optimal designs have been derived, each associated with a…
In this paper, we introduce an achievability bound on the frame error rate of random tree code ensembles under a sequential decoding algorithm with a hard computational limit and consider the optimization of the random tree code ensembles…
This paper is concerned with the inverse random source problem for a stochastic time fractional diffusion equation, where the source is assumed to be driven by a Gaussian random field. The direct problem is shown to be well-posed by…
We prove a sharp upper bound on convex domains, in terms of the diameter alone, of the best constant in a class of weighted Poincar\'e inequalities. The key point is the study of an optimal weighted Wirtinger inequality.
We study the asymptotic behavior of the diameter or maximum interpoint distance of a cloud of i.i.d. $d$-dimensional random vectors when the number of points in the cloud tends to infinity. This is a non standard extreme value problem since…
Given a correlation generated by a (possibly quantum) communication network, we study the amount of shared randomness required to generate it. We develop a novel upper bound for approximating distributions generated by arbitrary networks…
We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…
We improve the range for the discrete Fourier restriction to the four and five dimensional spheres. We rely on two new ingredients, incidence theory and Siegel's mass formula.
This paper develops a threshold model with a time-varying threshold, represented using a wavelet series expansion. The model adequately captures irregular and abrupt variations, as well as smooth changes in the threshold parameter, allowing…
We prove a maximal restriction inequality for the Fourier transform, providing an answer to a question left open by M\"uller, Ricci and Wright. Our methods are similar to the ones in their article, with the addition of a suitable trick to…
The Random Permutation Set (RPS) is a new type of set proposed recently, which can be regarded as the generalization of evidence theory. To measure the uncertainty of RPS, the entropy of RPS and its corresponding maximum entropy have been…