Counting probability distributions: Differential geometry and model selection

被引:119
作者
Myung, IJ
Balasubramanian, V
Pitt, MA
机构
[1] Ohio State Univ, Dept Psychol, Columbus, OH 43210 USA
[2] Harvard Univ, Jefferson Lab Phys, Cambridge, MA 02138 USA
关键词
D O I
10.1073/pnas.170283897
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
A central problem in science is deciding among competing explanations of data containing random errors. We argue that assessing the "complexity" of explanations is essential to a theoretically well-founded model selection procedure. We formulate model complexity in terms of the geometry of the space of probability distributions, Geometric complexity provides a clear intuitive understanding of several extant notions of model complexity. This approach allows us to reconceptualize the model selection problem as one of counting explanations that lie close to the "truth." We demonstrate the usefulness of the approach by applying it to the recovery of models in psychophysics.
引用
收藏
页码:11170 / 11175
页数:6
相关论文
共 26 条
[1]  
Akaike H., 1973, 2 INT S INFORM THEOR, P267, DOI [DOI 10.1007/978-1-4612-1694-0_15, 10.1007/978-1-4612-1694-0_15]
[2]  
Amari S., 1983, Electronics and Communications in Japan, V66, P1, DOI 10.1002/ecja.4400660602
[3]  
Amari S., 1985, DIFFERENTIAL GEOMETR
[4]  
Amari Shunichi, 1987, Differential Geometry in Statistical Inference
[5]  
Atkinson C., 1981, SANKHYA A, V43, P345
[6]   Statistical inference, Occam's razor, and statistical mechanics on the space of probability distributions [J].
Balasubramanian, V .
NEURAL COMPUTATION, 1997, 9 (02) :349-368
[7]  
BALASUBRAMANIAN V, 1996, PUPT1588
[8]   MINIMUM COMPLEXITY DENSITY-ESTIMATION [J].
BARRON, AR ;
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) :1034-1054
[9]   ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES [J].
CHAITIN, GJ .
JOURNAL OF THE ACM, 1966, 13 (04) :547-+
[10]   INFORMATION-THEORETIC ASYMPTOTICS OF BAYES METHODS [J].
CLARKE, BS ;
BARRON, AR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (03) :453-471