Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions
Atin Gayen, M. Ashok Kumar
TL;DR
The paper extends classical sufficiency to estimation problems based on Jones et al. and Basu et al. α-likelihoods, identifying power-law extensions of exponential families (including Student distributions) as the fixed-dimension sufficiency class. It develops generalized factorization and minimal sufficiency, establishes Rao-Blackwell-type theorems for these likelihoods, and derives Cramér-Rao-type bounds for estimators in power-law families. The results provide a unified framework for robust inference with probabilistic models beyond ML, yielding sharper variance bounds and best-unbiased estimators for deformed models. Applications to Student distributions illustrate improved estimator efficiency under generalized sufficiency, with implications for robust statistical practice and information-theoretic connections.
Abstract
This paper generalizes the notion of sufficiency for estimation problems beyond maximum likelihood. In particular, we consider estimation problems based on Jones et al. and Basu et al. likelihood functions that are popular among distance-based robust inference methods. We first characterize the probability distributions that always have a fixed number of sufficient statistics (independent of sample size) with respect to these likelihood functions. These distributions are power-law extensions of the usual exponential family and contain Student distributions as a special case. We then extend the notion of minimal sufficient statistics and compute it for these power-law families. Finally, we establish a Rao-Blackwell-type theorem for finding the best estimators for a power-law family. This helps us establish Cramér-Rao-type lower bounds for power-law families.
