35 search results - page 3 / 7 » Concentration Inequalities |
ADCM
2006
13 years 5 months ago
2006
We obtain an inequality on a measure of the spread in time of periodic functions that are concentrated in frequency, i.e. all but a fixed finite number of Fourier coefficients van...
CISS
2010
IEEE
12 years 9 months ago
2010
IEEE
Abstract—The theoretical analysis of randomized compressive operators often relies on the existence of a concentration of measure inequality for the operator of interest. Though ...
DAGSTUHL
2006
13 years 7 months ago
2006
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...
APPROX
2010
Springer
13 years 7 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
JMLR
2012
11 years 8 months ago
2012
We develop a new tool for data-dependent analysis of the exploration-exploitation trade-off in learning under limited feedback. Our tool is based on two main ingredients. The fi...