On Learning Sets and Functions

Natarajan, B. K.

doi:10.1007/BF00114804

On Learning Sets and Functions

B. K. Natarajan

MLJ 1989 pp. 67-97

doi:10.1007/BF00114804 /mlj/1989/natarajan1989mlj-learning/

Abstract

This paper presents some results on the probabilistic analysis of learning, illustrating the applicability of these results to settings such as connectionist networks. In particular, it concerns the learning of sets and functions from examples and background information. After a formal statement of the problem, some theorems are provided identifying the conditions necessary and sufficient for efficient learning, with respect to measures of information complexity and computational complexity. Intuitive interpretations of the definitions and theorems are provided.

PDF MLJ Semantic Scholar

Cite

Text

Natarajan. "On Learning Sets and Functions." Machine Learning, 1989. doi:10.1007/BF00114804

Markdown

[Natarajan. "On Learning Sets and Functions." Machine Learning, 1989.](https://mlanthology.org/mlj/1989/natarajan1989mlj-learning/) doi:10.1007/BF00114804

BibTeX

@article{natarajan1989mlj-learning,
  title     = {{On Learning Sets and Functions}},
  author    = {Natarajan, B. K.},
  journal   = {Machine Learning},
  year      = {1989},
  pages     = {67-97},
  doi       = {10.1007/BF00114804},
  volume    = {4},
  url       = {https://mlanthology.org/mlj/1989/natarajan1989mlj-learning/}
}