pith. sign in

arxiv: 1404.7527 · v2 · pith:ROJCT2EVnew · submitted 2014-04-29 · 💻 cs.LG

A Map of Update Constraints in Inductive Inference

classification 💻 cs.LG
keywords learningrestrictionsdifferentemphcompletedelayablegivealways
0
0 comments X
read the original abstract

We investigate how different learning restrictions reduce learning power and how the different restrictions relate to one another. We give a complete map for nine different restrictions both for the cases of complete information learning and set-driven learning. This completes the picture for these well-studied \emph{delayable} learning restrictions. A further insight is gained by different characterizations of \emph{conservative} learning in terms of variants of \emph{cautious} learning. Our analyses greatly benefit from general theorems we give, for example showing that learners with exclusively delayable restrictions can always be assumed total.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.