Superefficiency from the Vantage Point of Computability
Vladimir Vovk
Source: Statist. Sci. Volume 24, Number 1 (2009), 73-86.
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.
Keywords: Asymptotic efficiency; computable estimators; superefficiency
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.ss/1255009012
Digital Object Identifier: doi:10.1214/09-STS279
References
[1] Aldrich, J. (1997). R. A. Fisher and the making of maximum likelihood 1912–1922. Statist. Sci. 12 162–176.
Mathematical Reviews (MathSciNet):
MR1617519
Digital Object Identifier: doi:10.1214/ss/1030037906
Project Euclid: euclid.ss/1030037906
[2] Bahadur, R. R. (1960). On the asymptotic efficiency of tests and estimates. Sankhyā 22 229–252.
Mathematical Reviews (MathSciNet):
MR293767
Zentralblatt MATH:
0109.12503
[3] Bahadur, R. R. (1964). On Fisher’s bound for asymptotic variances. Ann. Math. Statist. 35 1545–1552.
Mathematical Reviews (MathSciNet):
MR166867
Digital Object Identifier: doi:10.1214/aoms/1177700378
Project Euclid: euclid.aoms/1177700378
[4] Barron, A. and Hengartner, N. (1998). Information theory and superefficiency. Ann. Statist. 26 1800–1825.
Mathematical Reviews (MathSciNet):
MR1673279
Zentralblatt MATH:
0932.62005
Digital Object Identifier: doi:10.1214/aos/1024691358
Project Euclid: euclid.aos/1024691358
[5] Chernoff, H. (1956). Large-sample theory: Parametric case. Ann. Math. Statist. 27 1–22.
Mathematical Reviews (MathSciNet):
MR76245
Digital Object Identifier: doi:10.1214/aoms/1177728347
Project Euclid: euclid.aoms/1177728347
[6] Church, A. (1936). An unsolvable problem of elementary number theory. Amer. J. Math. 58 345–363.
Mathematical Reviews (MathSciNet):
MR1507159
Digital Object Identifier: doi:10.2307/2371045
JSTOR: links.jstor.org
[7] Cox, D. R. and Hinkley, D. V. (1974). Theoretical Statistics. Chapman and Hall, London.
Mathematical Reviews (MathSciNet):
MR370837
[8] Cramér, H. (1946). Mathematical Methods of Statistics. Princeton Univ. Press, Princeton, NJ.
Mathematical Reviews (MathSciNet):
MR16588
[9] Doob, J. L. (1934). Probability and statistics. Trans. Amer. Math. Soc. 36 759–775.
Mathematical Reviews (MathSciNet):
MR1501765
Digital Object Identifier: doi:10.2307/1989822
JSTOR: links.jstor.org
[10] Feller, W. (1970). An Introduction to Probability Theory and Its Applications 1, 3rd ed. Wiley, New York.
[11] Fisher, R. A. (1922). On the mathematical foundations of theoretical statistics. Philos. Trans. Roy. Soc. London A 222 309–368.
[12] Fisher, R. A. (1925). Theory of statistical estimation. Proc. Cambridge Philos. Soc. 22 700–725.
[13] Fisher, R. A. (1935). The logic of inductive inference. J. Roy. Statist. Soc. 98 39–54.
[14] Fréchet, M. (1943). Sur l’extension de certaines évaluations statistiques au cas de petits échantillons. Revue de l’Institut International de Statistique 11 182–205.
[15] Grzegorczyk, A. (1957). On the definitions of computable real continuous functions. Fund. Math. 44 61–71.
Mathematical Reviews (MathSciNet):
MR89809
[16] Hájek, J. (1972). Local asymptotic minimax and admissibility in estimation. In Proc. Sixth Berkeley Symp. Math. Statist. Probab. 1 175–194. Univ. California Press, Berkeley.
[17] Hotelling, H. (1930). Letter to R. A. Fisher of December 12, 1930. Available on-line at the R. A. Fisher Digital Archive, http://digital.library.adelaide.edu.au/coll/special/fisher/, University of Adelaide. Accessed on February 1, 2009.
[18] Hotelling, H. (1930). The consistency and ultimate distribution of optimum statistics. Trans. Amer. Math. Soc. 32 847–859.
Mathematical Reviews (MathSciNet):
MR1501565
Digital Object Identifier: doi:10.2307/1989353
JSTOR: links.jstor.org
[19] Ibragimov, I. A. and Has’minskii, R. Z. (1981). Statistical Estimation: Asymptotic Theory. Springer, New York. Russian original (1979): Acимптoтичecкaя тeopия oцeнивaния, Nauka, Moscow.
Mathematical Reviews (MathSciNet):
MR620321
[20] Kallianpur, G. (1963). Von Mises functionals and max- imum likelihood estimation. Sankhyā A 25 149–158.
Mathematical Reviews (MathSciNet):
MR170421
[21] Kallianpur, G. and Rao, C. R. (1955). On Fisher’s lower bound to asymptotic variance of a consistent estimate. Sankhyā 15 331–342. Correction: 16 206.
Mathematical Reviews (MathSciNet):
MR75498
Zentralblatt MATH:
0067.37301
[22] Kolmogorov, A. N. (1953). O пoнятии aлгopитмa (On the notion of an algorithm). Уcпeхи Maтeмaтичecких Нayк 8 (4) 175–176. English translation in: Selected Works of A. N. Kolmogorov, Kluwer, Dordrecht, 1993.
[23] Kolmogorov, A. N. and Uspensky, V. A. (1958). К oпpeдeлeнию aлгopитмa (On the definition of an algorithm). Уcпeхи Maтeмaтичecких Нayк 13 (4) 3–28. English translation in: Amer. Math. Soc. Transl., Series 2 29 217–245, 1963; Selected Works of A. N. Kolmogorov, Kluwer, Dordrecht, 1993.
[24] Kolmogorov, A. N. and Uspensky, V. A. (1987). Algorithms and randomness. Theory Probab. Appl. 32 389–412. Russian original: Aлгopитмы и cлyчaйнocть. Teopия Bepoятнocтeй и ee Пpимeнeния 32 425–455.
Mathematical Reviews (MathSciNet):
MR914935
[25] Le Cam, L. (1952). On sets of parameter points where it is possible to achieve superefficiency of estimates. Ann. Math. Statist. 23 148. This is the abstract of the paper presented by Le Cam at the Boston meeting of the IMS on December 29, 1951.
[26] Le Cam, L. (1953). On some asymptotic properties of maximum likelihood estimates and related Bayes’ estimates. University of California Publications in Statistics 1 277–329.
Mathematical Reviews (MathSciNet):
MR54913
[27] Le Cam, L. (1958). Les propriétés asymptotiques des solutions de Bayes. Publications de l’Institut de Statistique de l’Université de Paris 7 17–35.
Mathematical Reviews (MathSciNet):
MR106531
[28] Le Cam, L. (1998). Recollection of my contacts with Jaroslav Hájek. In Collected Works of Jaroslav Hájek: With Commentary (M. Hušková, R. Beran and V. Dupač, eds.) 21–28. Wiley, Chichester, England.
[29] Lehmann, E. L. (1983). Theory of Point Estimation. Wiley, New York. Second edition (with George Casella): Springer, New York, 1998.
Mathematical Reviews (MathSciNet):
MR1639875
[30] Markov, A. A., Jr. (1951). Teopия aлгopифмoв (The theory of algorithms). Tpyды MИAН CCCP 38 176–189. English translation in: Amer. Math. Soc. Transl., Series 2 15 1–14, 1960.
Mathematical Reviews (MathSciNet):
MR46991
[31] Martin-Löf, P. (1970). Notes on Constructive Mathematics. Almqvist & Wiksell, Stockholm.
Mathematical Reviews (MathSciNet):
MR485251
[32] Michel, R. (1978). On the asymptotic efficiency of strongly asymptotically median unbiased estimators. Ann. Statist. 6 920–922.
Mathematical Reviews (MathSciNet):
MR491566
Zentralblatt MATH:
0378.62032
Digital Object Identifier: doi:10.1214/aos/1176344266
Project Euclid: euclid.aos/1176344266
[33] Neyman, J. (1949). Contribution to the theory of the χ2 test. In Proc. Berkeley Symp. Math. Statist. Probab. 239–273. Univ. California Press, Berkeley.
Mathematical Reviews (MathSciNet):
MR28003
[34] Pfanzagl, J. (1970). On asymptotic efficiency of median unbiased estimators. Ann. Math. Statist. 41 1500–1509.
Mathematical Reviews (MathSciNet):
MR266360
Digital Object Identifier: doi:10.1214/aoms/1177696795
Project Euclid: euclid.aoms/1177696795
[35] Post, E. L. (1936). Finite combinatory processes—formulation 1. J. Symbolic Logic 1 103–105.
[36] Rao, C. R. (1945). Information and accuracy attainable in the estimation of statistical parameters. Bull. Calcutta Math. Soc. 37 81–91.
Mathematical Reviews (MathSciNet):
MR15234
Zentralblatt MATH:
0063.06409
[37] Rao, C. R. (1957). Theory of the method of estimation by minimum chi-square. Bull. Inst. Internat. Statist. 35 25–32. This paper is based on Rao’s talk at the Twenty Ninth Session of the International Statistical Institute, Petrópolis, June–July 1955.
[38] Rao, C. R. (1962). Efficient estimates and optimum inference procedures in large samples (with discussion). J. Roy. Statist. Soc. Ser. B 24 46–72.
Mathematical Reviews (MathSciNet):
MR293766
JSTOR: links.jstor.org
[39] Rao, C. R. (1963). Criteria of estimation in large samples. Sankhyā A 25 189–206.
Mathematical Reviews (MathSciNet):
MR175225
[40] Rao, C. R. (1992). R. A. Fisher: The founder of modern statistics. Statist. Sci. 7 34–48.
Mathematical Reviews (MathSciNet):
MR1173416
Digital Object Identifier: doi:10.1214/ss/1177011442
Project Euclid: euclid.ss/1177011442
[41] Rogers, H., Jr. (1967). Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York. Paperback edition: MIT Press, Cambridge, MA, 1987.
Mathematical Reviews (MathSciNet):
MR886890
[42] Schmetterer, L. (1966). On the asymptotic efficiency of estimates. In Research Papers in Statistics: Festschrift for J. Neyman (F. N. David, ed.) 301–317. Wiley, London.
Mathematical Reviews (MathSciNet):
MR210231
Zentralblatt MATH:
0152.36801
[43] Shoenfield, J. R. (1977). Degrees of Unsolvability. North-Holland, Amsterdam.
[44] Stigler, S. M. (2005). Fisher in 1921. Statist. Sci. 20 32–49.
Mathematical Reviews (MathSciNet):
MR2182986
Digital Object Identifier: doi:10.1214/088342305000000025
Project Euclid: euclid.ss/1118065041
[45] Stigler, S. M. (2007). The epic story of maximum likelihood. Statist. Sci. 22 598–620. This paper is based on the IMS Le Cam lecture “The tragic story of maximum likelihood” presented by Stigler on August 2, 2006.
Mathematical Reviews (MathSciNet):
MR2410255
Digital Object Identifier: doi:10.1214/07-STS249
Project Euclid: euclid.ss/1207580174
[46] Turing, A. M. (1936–1937). On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc., Series 2 42 230–265. Read on November 12, 1936. Correction: 43 544–546.
[47] Turing, A. M. (1939). Systems of logic based on ordinals. Proc. London Math. Soc., Series 2 45 161–228.
[48] van der Vaart, A. W. (1997). Superefficiency. In Festschrift for Lucien Le Cam (D. Pollard, E. Torgersen and G. L. Yang, eds.) 397–410. Springer, New York.
Mathematical Reviews (MathSciNet):
MR1462961
Zentralblatt MATH:
0897.62025
[49] Vovk, V. (1991). Asymptotic efficiency of estimators: An algorithmic approach. Theory Probab. Appl. 36 329–343. Russian original: Acимптoтичecкaя эффeктивнocть oцeнoк: aлгopитмичecкий пoдхoд. Teopия Bepoятнocтeй и ee Пpимeнeния 36 247–261.
Mathematical Reviews (MathSciNet):
MR1119500
[50] Walker, A. M. (1963). A note on asymptotic efficiency of an asymptotically normal estimator sequence. J. Roy. Statist. Soc. Ser. B 25 195–200.
Mathematical Reviews (MathSciNet):
MR168070
JSTOR: links.jstor.org
[51] Weiss, L. and Wolfowitz, J. (1974). Maximum Probability Estimators and Related Topics. Lecture Notes in Math. 424. Springer, Berlin.
Mathematical Reviews (MathSciNet):
MR359152
Zentralblatt MATH:
0297.62015
[52] Wolfowitz, J. (1965). Asymptotic efficiency of the maximum likelihood estimator. Theory Probab. Appl. 10 247–260. Originally published in: Teopия Bepoятнocтeй и ee Пpимeнeния 10 267–281.
Mathematical Reviews (MathSciNet):
MR184338
