International audienceWe provide new concentration inequalities for functions of dependent variables. The work extends that of Janson (2004), which proposes concentration inequalities using a combination of the Laplace transform and the idea of fractional graph coloring, as well as many works that derive concentration inequalities using the entropy method (see, e.g., (Boucheron et al., 2003)). We give inequalities for fractionally sub-additive and fractionally self-bounding functions. In the way, we prove a new Talagrand concentration inequality for fractionally sub-additive functions of dependent variables. The results allow us to envision the derivation of generalization bounds for various applications where dependent variables naturally ...
International audienceLet Y v , v ∈ V , be real-valued random variables having a dependency graph G ...
International audienceLet Y v , v ∈ V , be real-valued random variables having a dependency graph G ...
International audienceLet Y v , v ∈ V , be real-valued random variables having a dependency graph G ...
International audienceWe provide new concentration inequalities for functions of dependent variables...
We obtain exponential concentration inequalities for sub-additive functions of independent random va...
We obtain exponential concentration inequalities for sub-additive functions of independent random va...
We see that the entropy method yields strong concentration results for general self-bounding functio...
Following the entropy method this paper presents general concentra-tion inequalities, which can be a...
We show that the thermal subadditivity of entropy provides a common basis to derive a strong form of...
An extended version of a concentration inequality based on the work of Talagrand is presented. The g...
Let Y v , v ∈ V , be real-valued random variables having a dependency graph G = (V, E). We show that...
Let Y v , v ∈ V , be real-valued random variables having a dependency graph G = (V, E). We show that...
Concentration inequalities deal with deviations of functions of independent random variables from th...
We present a new general concentration-of-measure inequality and illustrate its power by application...
Concentration inequalities deal with deviations of functions of independent random variables from th...
International audienceLet Y v , v ∈ V , be real-valued random variables having a dependency graph G ...
International audienceLet Y v , v ∈ V , be real-valued random variables having a dependency graph G ...
International audienceLet Y v , v ∈ V , be real-valued random variables having a dependency graph G ...
International audienceWe provide new concentration inequalities for functions of dependent variables...
We obtain exponential concentration inequalities for sub-additive functions of independent random va...
We obtain exponential concentration inequalities for sub-additive functions of independent random va...
We see that the entropy method yields strong concentration results for general self-bounding functio...
Following the entropy method this paper presents general concentra-tion inequalities, which can be a...
We show that the thermal subadditivity of entropy provides a common basis to derive a strong form of...
An extended version of a concentration inequality based on the work of Talagrand is presented. The g...
Let Y v , v ∈ V , be real-valued random variables having a dependency graph G = (V, E). We show that...
Let Y v , v ∈ V , be real-valued random variables having a dependency graph G = (V, E). We show that...
Concentration inequalities deal with deviations of functions of independent random variables from th...
We present a new general concentration-of-measure inequality and illustrate its power by application...
Concentration inequalities deal with deviations of functions of independent random variables from th...
International audienceLet Y v , v ∈ V , be real-valued random variables having a dependency graph G ...
International audienceLet Y v , v ∈ V , be real-valued random variables having a dependency graph G ...
International audienceLet Y v , v ∈ V , be real-valued random variables having a dependency graph G ...