Abstract

The paper demonstrates that falsifiability is fundamental to learning. We prove the following theorem for statistical learning and sequential prediction: If a theory is falsifiable then it is learnable -- i.e. admits a strategy that predicts optimally. An analogous result is shown for universal induction.

Description

[1408.6618] Falsifiable implies Learnable

Links and resources

Tags

community

  • @kirk86
  • @dblp
@kirk86's tags highlighted