论文标题
伪造和假设检验的组合
The Combinatorics of Falsification and Hypothesis Testing
论文作者
论文摘要
本文涉及一个问题，即单一命题在短期内长期以来是如何伪造的。诸如Schulte和Juhl之类的正规学习理论家认为，在合适的拓扑空间中，长期的假冒性能的特征是无处密度的拓扑概念。我认为，假设的短期可解释性反过来又以假设的VC有限性为特征。至关重要的是，VC有限假设与NIP结构中的可定义集有关。我结束了本章，以严格的基础为梅奥（Mayo）通过组合，非稳态的惊喜概念为严格的测试概念提供了严格的基础。 VC有限假设再次出现为具有保证短期惊喜界定的假设。因此，NIP理论和VC有限假设捕获了短期可变性的概念。
The present paper is concerned with the question of how falsifiable a single proposition is in the short and long run. Formal Learning theorists such as Schulte and Juhl have argued that long-run falsifiability is characterized by the topological notion of nowhere density in a suitable topological space. I argue that the short-run falsifiability of a hypothesis is in turn characterized by the VC finiteness of the hypothesis. Crucially, VC finite hypotheses correspond precisely to definable sets in NIP structures. I end the chapter by giving rigorous foundations for Mayo's conception of severe testing by way of a combinatorial, non-probabilistic notion of surprise. VC finite hypotheses again appear as the hypotheses with guaranteed short-run surprise bounds. Therefore, NIP theories and VC finite hypotheses capture the notion of short-run falsifiability.
