For Machine Learning special issue On the Mathematical Foundation of Learning Algorithms
Download:
|
|
by Huaiyu Zhu
http://www.santafe.edu/~zhuh/old/foundation.ps
Add To MetaCart
Abstract:
A general mathematical framework is developed for learning algorithms. A learning task belongs to either of two classes, reactive and adaptive. For the reactive tasks, learning algorithms can be analysed as statistical estimators, for which the theory of Bayesian information geometry provides a complete description. In particular, there exists ideal estimates holding all the information in the sample. Under computational constraint the optimal estimates are obtained by approximating the ideal estimates. This encompasses most of the commonly used statistical principles and criteria. For the adaptive tasks no complete theory exists at present, but the results for reactive tasks can be used as both components and guidance. Several most
Citations
| 597 | Sobolev Spaces – Adams - 1975 |
| 31 | Differential geometry of curved exponential families---curvature and information – Amari - 1982 |
