Konstantin Genin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Konstantin Genin has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Kevin T. Kelly
Carnegie Mellon University
2 shared publications
Latest Publications
- 4 August 2018
- Published by Springer Nature in Studia Logica
- Vol. 107 (5) , 949-989
Theory Choice, Theory Change, and Inductive Truth-Conduciveness
- 4 August 2018
- Published by Springer Nature in Studia Logica
- Vol. 107 (5) , 949-989
Theory Choice, Theory Change, and Inductive Truth-Conduciveness
- Open Access
- 25 July 2017
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 251, 236-250
The Topology of Statistical Verifiability
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.Comment: In Proceedings TARK 2017, arXiv:1707.0825
- 25 July 2017
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 251, 236-250
Open AccessThe Topology of Statistical Verifiability
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.Comment: In Proceedings TARK 2017, arXiv:1707.0825