A Bayesian Analysis of Algorithms for Learning Finite Functions

We consider algorithms for learning functions f : X ! Y , where X and Y are finite, and there is assumed to be no noise in the data. Learning algorithms, Alg, are connected with \Gamma(Alg), the set of prior probability distributions for which they are optimal. A method for constructing \Gamma(Alg) from Alg is given and the relationship between the various \Gamma(Alg) is discussed. Improper algorithms are identified as those for which \Gamma(Alg) has zero volume. Improper algorithms are investigated using linear algebra and two examples of improper algorithms are given. This framework is then applied to the question of choosing between competing algorithms. "Leave-oneout " cross-validation is hence characterised as a crude method of ML-II prior selection. We conclude by examining how the mathematical results bear on practical problems and by discussing related work, as well as suggesting future work. 1 Introduction Given the plethora of different learning algorithms produced by the m..

A Bayesian Analysis of Algorithms for Learning Finite Functions

We consider algorithms for learning functions f: X → where X, and Y are finite, and there is assumed to be no noise in the data. Learning algorithms, Alg, are connected with γ(Alg), the set of prior probability distributions for which they are optimal. A method for constructing γ(Alg) from Alg is given and the relationship between the various γ(Alg) is discussed. Improper algorithms are identified as those for which γ(Alg) has zero volume. Improper algorithms are investigated using linear algebra and two examples of improper algorithms are given. This framework is then applied to the question of choosing between competing algorithms. “Leave-one-out” cross-validation is hence characterised as a crude method of ML-II prior selection. We conclude by examining how the mathematical results bear on practical problems and by discussing related work, as well as suggesting future work