Results 221 to 230 of about 3,913 (266)
Some of the next articles are maybe not open access.
Learnability and Automatizability
45th Annual IEEE Symposium on Foundations of Computer Science, 2004We consider the complexity of properly learning concept classes, i.e. when the learner must output a hypothesis of the same form as the unknown concept. We present the following upper and lower bounds on well-known concept classes: 1) We show that unless NP = RP, there is no polynomial-time PAC learning algorithm for DNF formulae where the hypothesis ...
Michael Alekhnovich +4 more
openaire +2 more sources
Kybernetik, 1973
A new theory of learning is presented. Learning has been discussed by philosophers as a problem of acquiring knowledge. Historically, we can distinguish empiricism and rationalism. The rationalist insists that the essential part of our knowledge is innately built in ourselves, while the empiricist asserts that all knowledge derives from experience. The
Uesaka, Yoshinori +3 more
openaire +3 more sources
A new theory of learning is presented. Learning has been discussed by philosophers as a problem of acquiring knowledge. Historically, we can distinguish empiricism and rationalism. The rationalist insists that the essential part of our knowledge is innately built in ourselves, while the empiricist asserts that all knowledge derives from experience. The
Uesaka, Yoshinori +3 more
openaire +3 more sources
WIREs Cognitive Science, 2013
AbstractLearnability theory is a body of mathematical and computational results concerning questions such as: when is learning possible? What prior information is required to support learning? What computational or other resources are required for learning to be possible?
Sean A, Fulop, Nick, Chater
openaire +2 more sources
AbstractLearnability theory is a body of mathematical and computational results concerning questions such as: when is learning possible? What prior information is required to support learning? What computational or other resources are required for learning to be possible?
Sean A, Fulop, Nick, Chater
openaire +2 more sources
Communications of the ACM, 1984
Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from a computational viewpoint.
openaire +2 more sources
Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from a computational viewpoint.
openaire +2 more sources
Learnable And Non-learnable Visual Concepts
[1988 Proceedings] Second International Conference on Computer Vision, 1990Valiant's theory of the learnable is applied to visual concepts in digital pictures. Several visual concepts that are easily perceived by humans are shown to be learnable from positive examples. These concepts include a certain type of inaccurate copies of line drawings, identifying a subset of objects at specific locations, and pictures of lines in a ...
openaire +2 more sources
From Theoretical Learnability to Statistical Measures of the Learnable
1999The main focus of theoretical models for machine learning is to formally describe what is the meaning of learnable, what is a learning process, or what is the relationship between a learning agent and a teaching one. However, when we prove from a theoretical point of view that a concept is learnable, we have no a priori idea concerning the difficulty ...
Marc Sebban, Gilles Richard
openaire +1 more source
Learnability and rationality of choice [PDF]
Journal of Economic Theory, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the Learnability of Recursive Data
Mathematics of Control, Signals, and Systems, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Learnability can be undecidable
Nature Machine Intelligence, 2019The mathematical foundations of machine learning play a key role in the development of the field. They improve our understanding and provide tools for designing new learning paradigms. The advantages of mathematics, however, sometimes come with a cost. Godel and Cohen showed, in a nutshell, that not everything is provable.
Shai Ben-David +4 more
openaire +3 more sources
2016
The study of natural language learnability is necessarily multidisciplinary. Its aim is to devise and evaluate possible psychological mechanisms by which a system bounded by the cognitive capabilities and linguistic exposure of a young child might be able to arrive at rich knowledge of an adult human language.
Janet Fodor, William Sakas
openaire +1 more source
The study of natural language learnability is necessarily multidisciplinary. Its aim is to devise and evaluate possible psychological mechanisms by which a system bounded by the cognitive capabilities and linguistic exposure of a young child might be able to arrive at rich knowledge of an adult human language.
Janet Fodor, William Sakas
openaire +1 more source