It is argued that ordinary enumerative induction can achieve everywhere convergence, whereas meta-induction fails even to achieve almost everywhere convergence, and no inference method whatsoever achieves almost everywhere convergence.
Abstract
This paper challenges the pessimistic meta-inductive argument against scientific realism by undermining its inductive step rather than its historical premise. Although related challenges already exist, I develop a new one. Drawing on a general epistemology of scientific inference developed in frequentist statistics, machine learning, and formal epistemology, I evaluate induction in terms of convergence to the truth. I argue that ordinary enumerative induction can achieve everywhere convergence, whereas meta-induction fails even to achieve almost everywhere convergence. Indeed, in the problem context where meta-induction arises, the failure is deeper: no inference method whatsoever achieves almost everywhere convergence.
This essay argues that enthusiasm for ML as a turning point rests on a category confusion between two distinct scientific imaginaries: Laplace’s deterministic universe and Comte’s social physics, which sought descriptive regularities rather than causal mechanisms.
Induction is the process by which empirical evidence is transformed to knowledge. Hume famously argued---and Popper and others agree---that there can be no logical justification for induction. A weaker form of induction, due to Bayes, expresses the aforementioned knowledge in terms of probabilities, and we review some...
Ryan Martin, Shih-Ni Prim, Max Raner et al.· 0 citations
Solomonoff induction is relativized to an information vantage point, biasing toward short programs with access to all preexisting information, which reframes the inductive bias: instead of seeking some absolute notion of simplicity, it favor accessibility with respect to the authors' vantage point.
Aram Ebtekar, Marcus Hutter, D. Sutherland· 2 citations
Large language models have shifted AI toward statistical learning, but knowledge-based methods remain essential for tasks governed by combinatorial structure, declarative correctness, strong domain priors, and auditable reasoning. This paper treats the issue as one of task–architecture fit rather than paradigm competit...
Maikel Leon· WSEAS Transactions on System...· 0 citations
Probabilism is the thesis that the degrees of belief of rational agents behave like Kolmogorovian probabilities. There are quite different lines of argument for probabilism in the literature, including Dutch book arguments, arguments based on representation theorems, and epistemic utility arguments. This paper focuss...
Nicholas J. J. Smith· Noûs· 1 citation
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
Microsoft Research Blog· microsoft.comOct 12, 2026
StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.