In artificial intelligence, lazy learning is a learning method in which generalization beyond the training data is delayed until a query is made to the system, as opposed to in eager learning, where the system tries to generalize the training data before receiving queries.
The main advantage gained in employing a lazy learning method, such as Case based reasoning, is that the target function will be approximated locally, such as in the k-nearest neighbor algorithm. Because the target function is approximated locally for each query to the system, lazy learning systems can simultaneously solve multiple problems and deal successfully with changes in the problem domain.
The disadvantages with lazy learning include the large space requirement to store the entire training dataset. Particularly noisy training data increases the case base unnecessarily, because no abstraction is made during the training phase. Another disadvantage is that lazy learning methods are usually slower to evaluate, though this is coupled with a faster training phase.
Lazy classifiers are most useful for large datasets with few attributes.
Famous quotes containing the words lazy and/or learning:
“Along with the lazy man ... the dying man is the immoral man: the former, a subject that does not work; the latter, an object that no longer even makes itself available to be worked on by others.”
—Michel de Certeau (1925–1986)
“Acting is not about dressing up. Acting is about stripping bare. The whole essence of learning lines is to forget them so you can make them sound like you thought of them that instant.”
—Glenda Jackson (b. 1937)