AbstractIf S is an infinite sequence over a finite alphabet Σ and β is a probability measure on Σ, then the dimension of S with respect to β, written dimβ(S), is a constructive version of Billingsley dimension that coincides with the (constructive Hausdorff) dimension dim(S) when β is the uniform probability measure. This paper shows that dimβ(S) and its dual Dimβ(S), the strong dimension of S with respect to β, can be used in conjunction with randomness to measure the similarity of two probability measures α and β on Σ. Specifically, we prove that the divergence formuladimβ(R)=Dimβ(R)=H(α)H(α)+D(α∥β) holds whenever α and β are computable, positive probability measures on Σ and R∈Σ∞ is random with respect to α. In this formula, H(α) is the ...
For the simplest colored branching process, we prove an analog to the McMillan theorem and calculate...
AbstractGiven a set X of sequences over a finite alphabet, we investigate the following three quanti...
This paper studies the complexity of estimating Rényi divergences of discrete distributions: p obser...
AbstractA constructive version of Hausdorff dimension is developed using constructive supergales, wh...
AbstractA constructive version of Hausdorff dimension is developed using constructive supergales, wh...
Vovk’s randomness criterion characterizes sequences that are random relative to two distinct computa...
Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and p...
International audienceThis paper is devoted to the mathematical study of some divergences based on t...
This thesis documents three different contributions in statistical learning theory. They were develo...
Accepted by IEEE Transactions on Information Theory. To appear.Rényi divergence is related to Rényi ...
International audienceWe characterize probability measures whose Hausdorff dimension or packing dime...
Abstract—Rényi divergence is related to Rényi entropy much like Kullback-Leibler divergence is rel...
For the simplest colored branching process, we prove an analog to the McMillan theorem and calculate...
AbstractLet μ be a self-similar measure in Rd. A point x∈Rd for which the limit limr↘0logμB(x,r)logr...
Abstract. When comparing discrete probability distributions, natural measures of similarity are not ...
For the simplest colored branching process, we prove an analog to the McMillan theorem and calculate...
AbstractGiven a set X of sequences over a finite alphabet, we investigate the following three quanti...
This paper studies the complexity of estimating Rényi divergences of discrete distributions: p obser...
AbstractA constructive version of Hausdorff dimension is developed using constructive supergales, wh...
AbstractA constructive version of Hausdorff dimension is developed using constructive supergales, wh...
Vovk’s randomness criterion characterizes sequences that are random relative to two distinct computa...
Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and p...
International audienceThis paper is devoted to the mathematical study of some divergences based on t...
This thesis documents three different contributions in statistical learning theory. They were develo...
Accepted by IEEE Transactions on Information Theory. To appear.Rényi divergence is related to Rényi ...
International audienceWe characterize probability measures whose Hausdorff dimension or packing dime...
Abstract—Rényi divergence is related to Rényi entropy much like Kullback-Leibler divergence is rel...
For the simplest colored branching process, we prove an analog to the McMillan theorem and calculate...
AbstractLet μ be a self-similar measure in Rd. A point x∈Rd for which the limit limr↘0logμB(x,r)logr...
Abstract. When comparing discrete probability distributions, natural measures of similarity are not ...
For the simplest colored branching process, we prove an analog to the McMillan theorem and calculate...
AbstractGiven a set X of sequences over a finite alphabet, we investigate the following three quanti...
This paper studies the complexity of estimating Rényi divergences of discrete distributions: p obser...