Maximal machine learnable classes

被引：2
|
作者：
Case, J [1 ]
Fulk, MA
机构：
[1] Univ Delaware, Dept CIS, Newark, DE 19716 USA
[2] Genesee Valley Software, Rochester, NY 14618 USA
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1999年 / 58卷 / 01期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1006/jcss.1997.1518
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A class of computable functions is maximal iff it can be incrementally learned by some inductive inference machine (IIM), but no infinitely larger class of computable functions can be so learned. Rolf Wiehagen posed the question whether there exist such maximal classes. This question and many interesting variants are answered herein in the negative, Viewed positively, each IIM can be infinitely improved upon! Also discussed are the problems of algorithmically finding the improvements proved to exist. (C) 1999 Academic Press.
引用
收藏
页码：211 / 214
页数：4
相关论文
共 50 条
  • [1] Maximal machine learnable classes
    Univ of Delaware, Newark, United States
    J Comput Syst Sci, 1 (211-214):
  • [2] Not All Learnable Distribution Classes are Privately Learnable
    Bun, Mark
    Kamath, Gautam
    Mouzakis, Argyris
    Singhal, Vikrant
    INTERNATIONAL CONFERENCE ON ALGORITHMIC LEARNING THEORY, VOL 237, 2024, 237
  • [3] Enlarging learnable classes
    Jain, Sanjay
    Koetzing, Timo
    Stephan, Frank
    INFORMATION AND COMPUTATION, 2016, 251 : 194 - 207
  • [4] Splitting of Learnable Classes
    Li, Hongyang
    Stephan, Frank
    GRAMMATICAL INFERENCE: THEORETICAL RESULTS AND APPLICATIONS, ICGI 2010, 2010, 6339 : 109 - 121
  • [5] Machine Learnable Fold Space Representation based on Residue Cluster Classes
    Corral-Corral, Ricardo
    Chavez, Edgar
    Del Rio, Gabriel
    COMPUTATIONAL BIOLOGY AND CHEMISTRY, 2015, 59 : 1 - 7
  • [6] Classes with easily learnable subclasses
    Jain, S
    Menzel, W
    Stephan, F
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2002, 2533 : 218 - 232
  • [7] Classes with easily learnable subclasses
    Jain, S
    Menzel, W
    Stephan, F
    INFORMATION AND COMPUTATION, 2004, 190 (01) : 81 - 99
  • [8] Learnable classes of general combinatory grammars
    Moreau, E
    LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS, PROCEEDINGS, 2005, 3492 : 189 - 204
  • [9] Littlestone Classes are Privately Online Learnable
    Golowich, Noah
    Livni, Roi
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [10] A characterization of the language classes OF learnable with correction queries
    Tirnauca, Cristina
    Kobayashi, Satoshi
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 398 - +
12345