[HTML][HTML] Confirmation

V Crupi - 2013 - plato.stanford.edu
Human cognition and behavior heavily relies on the notion that evidence (data, premises)
can affect the credibility of hypotheses (theories, conclusions). This general idea seems to …

Detailed multidisciplinary monitoring reveals pre-and co-eruptive signals at Nyamulagira volcano (North Kivu, Democratic Republic of Congo)

B Smets, N d'Oreye, F Kervyn, M Kervyn, F Albino… - Bulletin of …, 2014 - Springer
This paper presents a thorough description of Nyamulagira's January 2010 volcanic
eruption (North Kivu, Democratic Republic of Congo), based on a combination of field …

Statistical Learning Theory and Occam's Razor: The Core Argument

TF Sterkenburg - Minds and Machines, 2025 - Springer
Statistical learning theory is often associated with the principle of Occam's razor, which
recommends a simplicity preference in inductive inference. This paper distills the core …

Reliability and Interpretability in Science and Deep Learning

L Scorzato - Minds and Machines, 2024 - Springer
In recent years, the question of the reliability of Machine Learning (ML) methods has
acquired significant importance, and the analysis of the associated uncertainties has …

A new solution to the puzzle of simplicity

KT Kelly - Philosophy of Science, 2007 - cambridge.org
Explaining the connection, if any, between simplicity and truth is among the deepest
problems facing the philosophy of science, statistics, and machine learning. Say that an …

Statistical learning theory and Occam's razor: The argument from empirical risk minimization

TF Sterkenburg - arXiv preprint arXiv:2312.13842, 2023 - arxiv.org
This paper considers the epistemic justification for a simplicity preference in inductive
inference that may be obtained from the machine learning framework of statistical learning …

A geo-logical solution to the lottery paradox, with applications to conditional logic

H Lin, KT Kelly - Synthese, 2012 - Springer
We defend a set of acceptance rules that avoids the lottery paradox, that is closed under
classical entailment, and that accepts uncertain propositions without ad hoc restrictions. We …

On the solvability of inductive problems: A study in epistemic topology

A Baltag, N Gierasimczuk, S Smets - arXiv preprint arXiv:1606.07518, 2016 - arxiv.org
We investigate the issues of inductive problem-solving and learning by doxastic agents. We
provide topological characterizations of solvability and learnability, and we use them to …

Belief revision as a truth-tracking process

A Baltag, N Gierasimczuk, S Smets - Proceedings of the 13th …, 2011 - dl.acm.org
We analyze the learning power of iterated belief revision methods, and in particular their
universality: whether or not they can learn everything that can be learnt. We look in particular …

[HTML][HTML] Formal learning theory

O Schulte - 2002 - seop.illc.uva.nl
Formal learning theory is the mathematical embodiment of a normative epistemology. It
deals with the question of how an agent should use observations about her environment to …