Related papers: Bounds for covariances and variances of truncated …
In this paper we derive sharp lower and upper bounds for the covariance of two bounded random variables when knowledge about their expected values, variances or both is available. When only the expected values are known, our result can be…
In this paper, we define the upper (resp. lower) covariance under multiple probabilities via a corresponding max-min-max (resp. min-max-min) optimization problem and the related properties of covariances are obtained. In particular, we…
For arbitrary two probability measures on real d-space with given means and variances (covariance matrices), we provide lower bounds for their total variation distance. In the one-dimensional case, a tight bound is given.
In this article we derive the best possible upper bound for $E[\max{X_i}-\min_i{X_i}]$ under given means and variances on $n$ random variables $X_i$. The random vector $(X_1,...,X_n)$ is allowed to have any dependence structure, provided $E…
In this paper, we obtain the upper and lower bounds for two inequalities related to the range statistics. The first one is concerning the one-variable case and the second one is about the bivariate case.
We study a new family of random variables, that each arise as the distribution of the maximum or minimum of a random number $N$ of i.i.d.~random variables $X_1,X_2,\ldots,X_N$, each distributed as a variable $X$ with support on $[0,1]$. The…
This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win…
Exact lower bounds on the exponential moments of min(y,X) and XI{X<y} are provided given the first two moments of a random variable X. These bounds are useful in work on large deviations probabilities and nonuniform Berry-Esseen bounds,…
We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.
For functions of independent random variables, various upper and lower variance bounds are revisited in diverse settings. These are then specialized to the Bernoulli, Gaussian, infinitely divisible cases and to Banach space valued random…
In this work, we consider the problem of bounding the values of a covariance function corresponding to a continuous-time stationary stochastic process or signal. Specifically, for two signals whose covariance functions agree on a finite…
In this paper a numerical method is presented, which finds a lower bound for the mutual information between a binary and an arbitrary finite random variable with joint distributions that have a variational distance not greater than a known…
We study weakest precondition reasoning about the (co)variance of outcomes and the variance of run-times of probabilistic programs with conditioning. For outcomes, we show that approximating (co)variances is computationally more difficult…
A classical statistical inequality is used to show that the distance covariance of two bounded random vectors is bounded from above by a simple function of the dimensionality and the bounds of the random vectors. Two special cases that…
Worst-case bounds on the expected shortfall risk given only limited information on the distribution of the random variables has been studied extensively in the literature. In this paper, we develop a new worst-case bound on the expected…
We derive tight lower bounds on the smallest eigenvalue of a sample covariance matrix of a centred isotropic random vector under weak or no assumptions on its components.
Let $X$ denote a nonnegative random variable with $\mathsf{E} X<\infty$. Upper and lower bounds on $\mathsf{E} X-\exp\mathsf{E}\ln X$ are obtained, which are exact, in terms of $V_X$ and $E_X$ for the upper bound and in terms of $V_X$ and…
This paper derives the maximum variance of a finite dataset of real numbers, given their mean, minimum and maximum. An example is provided in which the maximum variance is less than half of the Bhatia-Davis upper bound, (maximum -…
Estimating and optimizing Mutual Information (MI) is core to many problems in machine learning; however, bounding MI in high dimensions is challenging. To establish tractable and scalable objectives, recent work has turned to variational…
We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…