Choosing a Reliable Hypothesis (Extended Abstract)
Download:
|
|
by William Evans, Sridhar Rajagopalan, Umesh Vazirani
http://www.cs.arizona.edu/~will/papers/relhyp.ps.gz
Add To MetaCart
Abstract:
We study the problem of inferring an accurate model for a stochastic process from its output. We identify two desirable properties--- resoluteness and reliability--- of any identification algorithm. We prove that for any countable class of stochastic processes, there is an identification algorithm that has these properties. This result also formulates an optimization problem whose solution is sufficent to solve the identification problem. In this sense, our result provides an analogue to the Occam principle in a probabilistic setting.
Citations
| 481 | Compression of individual sequences via variable-rate coding – Ziv, Lempel - 1978 |
| 280 | A universal prior for integers and estimation by minimum description length – Rissanen - 1983 |
| 224 | Practical Prefetching via Data Compression – Curewitz, Krishnan, et al. - 1993 |
| 115 | Universal prediction of individual sequences – Feder, Merhav, et al. - 1992 |
| 92 | Bounds on the sample complexity of Ba.yesian learning using information theory and the VC dimension – Haussler, Kearns, et al. - 1991 |
| 51 | Inductive reasoning and Kolmogorov complexity – Li, Vitányi - 1992 |
| 44 | On the necessity of Occam algorithms – Pitt, Board - 1990 |
| 14 | Inferring the structure of a Markov chain from its output – Rudich - 1985 |
| 5 | Inferring statistical complexity, Phys – Crutchfield, Young - 1989 |
