Skip to search formSkip to main contentSkip to account menu

Probably approximately correct learning

Known as: Probably approximately correct, PAC-learning, PAC Learning 
In computational learning theory, probably approximately correct learning (PAC learning) is a framework for mathematical analysis of machine learning… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A* is a best-first search algorithm that returns an optimal solution. w-admissible algorithms guarantee that the returned… 
2002
2002
This paper proposes a new tool-supported technique for the complete development of safety-critical interactive systems from the… 
1999
1999
  • B. Hammer
  • 1999
  • Corpus ID: 15480204
Abstract. We establish some general results concerning PAC learning: We find a characterization of the property that any… 
1999
1999
Predictive models have been widely used long before the development of the new eld that we call data mining. Expanding… 
1996
1996
A software architecture is an organisation of computational elements and the description of their interactions. Although… 
1995
1995
This article is concerned with the usability and implementation of multimodal user interfaces. We show how the usability of such… 
1994
1994
We propose a notion of the refutably PAC learning, which formalizes the refutability of hypothesis spaces in the PAC learning… 
1994
1994
This chapter discusses within the framework of computational learning theory the current state of knowledge and some open… 
1989
1989
The least action principle algorithm is extended to model the development of a three dimensional latent image in an exposed…