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:
“To exercise power costs effort and demands courage. That is why so many fail to assert rights to which they are perfectly entitled—because a right is a kind of power but they are too lazy or too cowardly to exercise it. The virtues which cloak these faults are called patience and forbearance.”
—Friedrich Nietzsche (1844–1900)
“I think it is better to show love by meeting needs than to keep telling my son that I love him. Right now he is learning to tie his shoes. He is old enough, so even though it’s hard for him, sometimes I insist. But once in a while when I see he’s tired I still do it for him, and I have noticed that while I am tying his shoe, he says, “I love you, Mommy.” When he says, “I love you,” I know that he knows that he is loved.”
—Anonymous Parent (20th century)