Superefficiency from the vantage point of computability
From MaRDI portal
Abstract: In 1952 Lucien Le Cam announced his celebrated result that, for regular univariate statistical models, sets of points of superefficiency have Lebesgue measure zero. After reviewing the turbulent history of early studies of superefficiency, I suggest using the notion of computability as a tool for exploring the phenomenon of superefficiency. It turns out that only computable parameter points can be points of superefficiency for computable estimators. This algorithmic version of Le Cam's result implies, in particular, that sets of points of superefficiency not only have Lebesgue measure zero but are even countable.
Recommendations
- Super-tasks, accelerating Turing machines and uncomputability
- scientific article; zbMATH DE number 7652695
- scientific article; zbMATH DE number 1630107
- scientific article; zbMATH DE number 1909825
- A note on superlinear speedup
- On superlinear speedups
- scientific article; zbMATH DE number 1157651
- scientific article; zbMATH DE number 5204606
Cites work
- scientific article; zbMATH DE number 3114761 (Why is no real title available?)
- scientific article; zbMATH DE number 3137798 (Why is no real title available?)
- scientific article; zbMATH DE number 3145671 (Why is no real title available?)
- scientific article; zbMATH DE number 3826980 (Why is no real title available?)
- scientific article; zbMATH DE number 3178119 (Why is no real title available?)
- scientific article; zbMATH DE number 3522963 (Why is no real title available?)
- scientific article; zbMATH DE number 1064665 (Why is no real title available?)
- scientific article; zbMATH DE number 3428899 (Why is no real title available?)
- scientific article; zbMATH DE number 3211307 (Why is no real title available?)
- scientific article; zbMATH DE number 3224089 (Why is no real title available?)
- scientific article; zbMATH DE number 3244995 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3388421 (Why is no real title available?)
- scientific article; zbMATH DE number 3188866 (Why is no real title available?)
- scientific article; zbMATH DE number 3059245 (Why is no real title available?)
- scientific article; zbMATH DE number 3103824 (Why is no real title available?)
- scientific article; zbMATH DE number 3106656 (Why is no real title available?)
- An Unsolvable Problem of Elementary Number Theory
- Finite combinatory processes—formulation
- Fisher in 1921
- Information theory and superefficiency
- Large-Sample Theory: Parametric Case
- Maximum probability estimators and related topics
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- On Fisher's Bound for Asymptotic Variances
- On degrees of unsolvability
- On the Asymptotic Efficiency of Median Unbiased Estimates
- On the asymptotic efficiency of strongly asymptotically median unbiased estimators
- On the definitions of computable real continuous functions
- Probability and Statistics
- R. A. Fisher and the making of maximum likelihood 1912--1922
- R. A. Fisher: The founder of modern statistics
- Sur l'extension de certaines evaluations statistiques au cas de petits echantillons
- Systems of Logic Based on Ordinals†
- The Logic of Inductive Inference
- The epic story of maximum likelihood
This page was built for publication: Superefficiency from the vantage point of computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q900476)
