We consider the problem of learning real-valued functions from random examples when the function values are corrupted with noise. With mild conditions on independent observation noise, we provide characterizations of the learnability of a real-valued function class in terms of a generalization of th
✦ LIBER ✦
On the inductive inference of recursive real-valued functions
✍ Scribed by Kalvis Apsītis; Setsuo Arikawa; Rũsiņš Freivalds; Eiju Hirowatari; Carl H. Smith
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 894 KB
- Volume
- 219
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
We combine traditional studies of inductive inference and classical continuous mathematics to produce a study of learning real-valued functions. We consider two possible ways to model the learning by example of functions with domain and range the real numbers. The first approach considers functions as represented by computable analytic functions. The second considers arbitrary computable functions of recursive real numbers. In each case we find natural examples of learnable classes of functions and unlearnable classes of functions.
📜 SIMILAR VOLUMES
Fat-Shattering and the Learnability of R
✍
Peter L. Bartlett; Philip M. Long; Robert C. Williamson
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 1011 KB
Additive representations of real-valued
✍
Peter C. Fishburn
📂
Article
📅
1971
🏛
Elsevier Science
🌐
English
⚖ 383 KB
On the power of inductive inference from
✍
R. Freivalds; E.B. Kinber; R. Wiehagen
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 809 KB
On some topologies defined by a class of
✍
J. Novák
📂
Article
📅
1971
🏛
Elsevier Science
⚖ 572 KB
On Completeness and Projective Descripti
✍
Angela A. Albanese
📂
Article
📅
2000
🏛
John Wiley and Sons
🌐
English
⚖ 259 KB
Generalizations of a theorem of Sarkovsk
✍
Stewart Baldwin
📂
Article
📅
1987
🏛
Elsevier Science
🌐
English
⚖ 1011 KB