Pith. sign in

REVIEW 2 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1105.3259 v1 pith:OPK2OPPW submitted 2011-05-17 cs.IT cs.LGmath.IT

On R\'enyi and Tsallis entropies and divergences for exponential families

classification cs.IT cs.LGmath.IT
keywords distributionsexponentialenyitsallisdivergencesentropiesfamiliesgaussian
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Many common probability distributions in statistics like the Gaussian, multinomial, Beta or Gamma distributions can be studied under the unified framework of exponential families. In this paper, we prove that both R\'enyi and Tsallis divergences of distributions belonging to the same exponential family admit a generic closed form expression. Furthermore, we show that R\'enyi and Tsallis entropies can also be calculated in closed-form for sub-families including the Gaussian or exponential distributions, among others.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantizing gravitational fields with an entropy-corrected action principle

    quant-ph 2026-05 unverdicted novelty 6.0

    An entropy-corrected action principle on superspace recovers the Wheeler-DeWitt equation for gravity and a Schrödinger equation for coupled scalar fields with emergent time and a G ħ² correction term.

  2. Towards Tsallis Fully Probabilistic Design

    math.OC 2026-02 unverdicted novelty 6.0

    Tsallis FPD generalizes standard fully probabilistic design using Tsallis divergence and proves that a double backwards induction fixed-point iteration converges to an optimal solution.