2003 | OriginalPaper | Chapter
A Tour of Robust Learning
Authors : Sanjay Jain, Frank Stephan
Published in: Computability and Models
Publisher: Springer US
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Bārzdiņš conjectured that only recursively enumerable classes of functions can be learned robustly. This conjecture, which was finally refuted by Fulk, initiated the study of notions of robust learning. The present work surveys research on robust learning and focuses on the recently introduced variants of uniformly robust and hyperrobust learning. Proofs are included for the (already known) results that uniformly robust Ex-learning is more restrictive than robust Ex-learning, that uniformly robustly Ex-learnable classes are consistently learnable, that hyperrobustly Ex-learnable classes are in Num and that some hyperrobustly BC-learnable class is not in Num.