SODA
2012
ACM
11 years 7 months ago
2012
ACM
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
CSDA
2004
13 years 4 months ago
2004
We present an algorithm for computing the probability density function of the product of two independent random variables, along with an implementation of the algorithm in a compu...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of n ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We survey a few concentration inequalities for submodular and fractionally subadditive functions of independent random variables, implied by the entropy method for self-bounding f...
EUSFLAT
2003
13 years 5 months ago
2003
A generalized dice model for the pairwise comparison of non-necessarily independent random variables is established. It is shown how the transitivity of the probabilistic relation...
COLT
1992
Springer
13 years 8 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
AC
2003
Springer
13 years 9 months ago
2003
Springer
Concentration inequalities deal with deviations of functions of independent random variables from their expectation. In the last decade new tools have been introduced making it pos...
STOC
2001
ACM
14 years 4 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
STOC
2004
ACM
14 years 4 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...