Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Balasubramanian, V.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Balasubramanian, V.

Neural Computation, Vol 9, 349-368, Copyright © 1997 by The MIT Press


LETTERS

Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions

Vijay Balasubramanian

The task of parametric model selection is cast in terms of a statistical mechanics on the space of probability distributions. Using the techniques of low-temperature expansions, I arrive at a systematic series for the Bayesian posterior probability of a model family that significantly extends known results in the literature. In particular, I arrive at a precise understanding of how Occam's razor, the principle that simpler models should be preferred until the data justify more complex models, is automatically embodied by probability theory. These results require a measure on the space of model parameters and I derive and discuss an interpretation of Jeffreys' prior distribution as a uniform prior over the distributions indexed by a family. Finally, I derive a theoretical index of the complexity of a parametric family relative to some true distribution that I call the razor of the model. The form of the razor immediately suggests several interesting questions in the theory of learning that can be studied using the techniques of statistical mechanics.


This article has been cited by other articles:


Home page
Neural Comput.Home page
D. J. Navarro and T. L. Griffiths
Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach
Neural Comput., November 1, 2008; 20(11): 2597 - 2628.
[Abstract] [Full Text] [PDF]


Home page
Psychon Bull RevHome page
W. VANPAEMEL and G. STORMS
In search of abstraction: The varying abstraction model of categorization
Psychon Bull Rev, August 1, 2008; 15(4): 732 - 749.
[Abstract] [PDF]


Home page
Neural Comput.Home page
M. B. Kennel, J. Shlens, H. D. I. Abarbanel, and E. J. Chichilnisky
Estimating Entropy Rates with Bayesian Confidence Intervals
Neural Comput., July 1, 2005; 17(7): 1531 - 1576.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
S. Still and W. Bialek
How Many Clusters? An Information-Theoretic Perspective
Neural Comput., December 1, 2004; 16(12): 2483 - 2506.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
D. J. Navarro
A Note on the Applied Use of MDL Approximations
Neural Comput., September 1, 2004; 16(9): 1763 - 1768.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
W. Bialek, I. Nemenman, and N. Tishby
Predictability, Complexity, and Learning
Neural Comput., November 1, 2001; 13(11): 2409 - 2463.
[Abstract] [Full Text]


Home page
Proc. Natl. Acad. Sci. USAHome page
I. J. Myung, V. Balasubramanian, and M. A. Pitt
Counting probability distributions: Differential geometry and model selection
PNAS, September 22, 2000; (2000) 170283897.
[Abstract] [Full Text]


Home page
Neural Comput.Home page
M. Brand
Structure Learning in Conditional Probability Models via an Entropic Prior and Parameter Extinction
Neural Comput., July 1, 1999; 11(5): 1155 - 1182.
[Abstract] [Full Text]


Home page
Proc. Natl. Acad. Sci. USAHome page
I. J. Myung, V. Balasubramanian, and M. A. Pitt
Counting probability distributions: Differential geometry and model selection
PNAS, October 10, 2000; 97(21): 11170 - 11175.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1997 by The MIT Press.