Inductive Learning

The inductive learning problem P:=⟨H,f,≈⟩\mathcal{P}:=\langle\mathcal{H}, f, \approx\rangle is made up of a

  • Hypothesis Space H\mathcal{H}
  • the to be found hypothesis h∈Hh\in \mathcal{H}
  • and a consistent training set ff of examples (x,yx,y pairs)

We want to find the hypothesis hh such that

f≈(h∣dom⁡(f))f \approx\left(\left.h\right|_{\operatorname{dom}(f)}\right)

which means we want to find a function hh that is on the domain of ff roughly equal to ff.

For inductive learning we assume

Consistency and Simplicity

Ockhams Razor
CleanShot 2023-09-30 at 11.20.25@2x.png
CleanShot 2023-09-30 at 11.20.34@2x.png
CleanShot 2023-09-30 at 11.20.46@2x.png

CleanShot 2023-09-30 at 11.20.57@2x.png