Abstract: Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2], statistics [6, 7] and modal logic [17, 4]. In those applications, open sets are typically interpreted as hypotheses deductively verifiable by true propositional information that rules out relevant possibilities. However, in statistical data analysis, one routinely receives random samples logically compatible with every statistical hypothesis. We bridge the gap between propositional and statistical data by solving for the unique topology on probability measures in which the open sets are exactly the statistically verifiable hypotheses. Furthermore, we extend that result to a topological characterization of learnability in the limit from statistical data.
Recommendations
Cites work
- \(\Sigma^{0}_\alpha\)-admissible representations. (Extended abstract)
- A general classification rule for probability measures
- A topological criterion for hypothesis testing
- scientific article; zbMATH DE number 1233702 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 949397 (Why is no real title available?)
- Hypothesis testing for families of ergodic processes
- On a class of time inhomogeneous nonsingular flows and Schrödinger operators
- On the relation between realizable and nonrealizable cases of the sequence prediction problem
- On the solvability of inductive problems: a study in epistemic topology
- Subset space public announcement logic
- Topological properties of concept spaces (full version)
- Topological subset space models for public announcements
Cited in
(4)
This page was built for publication: The topology of statistical verifiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384072)
