In his new foreword to this edition, Hilary Putnam forcefully rejects these nativist claims.

This paper pursues a thorough-going instrumentalist, or means-ends, approach to the theory of inductive inference. I consider three epistemic aims: convergence to a correct theory, fast convergence to a correct theory and steady convergence to a correct theory (avoiding retractions). For each of these, two questions arise: (1) What is the structure of inductive problems in which these aims are feasible? (2) When feasible, what are the inference methods that attain them? Formal learning theory provides the tools for a complete (...) set of answers to these questions. As an illustration of the results, I apply means-ends analysis to various versions of Goodman's Riddle of Induction. (shrink)

This paper describes the corner-stones of a means-ends approach to the philosophy of inductive inference. I begin with a fallibilist ideal of convergence to the truth in the long run, or in the 'limit of inquiry'. I determine which methods are optimal for attaining additional epistemic aims (notably fast and steady convergence to the truth). Means-ends vindications of (a version of) Occam's Razor and the natural generalizations in a Goodmanian Riddle of Induction illustrate the power of this approach. The paper (...) establishes a hierarchy of means-ends notions of empirical success, and discusses a number of issues, results and applications of means-ends epistemology. (shrink)

In his commentary on my paper, “Means-Ends Epistemology”, David Chart constructs a Riddle of Induction with the following feature: Means-ends analysis, as I formulated it in the paper, selects “all emeralds are grue” as the optimal conjecture after observing a sample of all green emeralds. Chart’s construction is rigorous and correct. If we disagree, it is in the philosophical morals to be drawn from his example. Such morals are best discussed by elucidating some of the larger epistemological issues involved. “Means-ends (...) Epistemology” sought a normative theory of hypothesis selection. I defined what it means for an inductive method to reliably and efficiently find a correct hypothesis from a set of alternative hypotheses. (In fact, I investigated a number of standards of empirical success for inductive methods.) Call such methods optimal. We may take optimal inferences to be those made by optimal methods. This defines a relation Optimal-Inference(h,e,H): “given the set of alternative hypotheses H, and evidence e, hypothesis h is an optimal inference”. One fundamental difference between the means-ends approach and traditional confirmation theory is that the latter has sought a two-place relation between theory and evidence alone, something like “hypothesis h is highly confirmed given evidence e”. From my point of view, posing the problem of induction as discerning the right relation between theory and evidence is elliptical because it leaves unspecified the set of alternative hypotheses under investigation (as well as other relevant factors, such as the scientist’s background knowledge, observational means, cognitive capacities and epistemic values). Chart’s Riddle highlights the fact that depending on the space of alternative hypotheses, means-ends analysis may select a different hypothesis on the same evidence: “all emeralds are green” in my Goodmanian Riddle, and “all emeralds are grue” in his. To my mind, his example.. (shrink)

I propose that empirical procedures, like computational procedures, are justified in terms of truth-finding efficiency. I contrast the idea with more standard philosophies of science and illustrate it by deriving Ockham's razor from the aim of minimizing dramatic changes of opinion en route to the truth.

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 efficient truth finding method minimizes worst case costs en route to converging to the true answer to a theory choice problem. Let the costs considered include the number of times a false answer is selected, the number of times opinion is reversed, and the times at which the reversals occur. It is demonstrated that (1) (...) always choosing the simplest theory compatible with experience, and (2) hanging onto it while it remains simplest, is both necessary and sufficient for efficiency. †To contact the author, please write to: Department of Philosophy, Carnegie Mellon University, Baker Hall 135, Pittsburgh, PA 15213-3890; e-mail: [email protected]. (shrink)

The aim of this book is to discuss the fundamental ideas which lie behind the statistical theory of learning and generalization. It considers learning as a general problem of function estimation based on empirical data. Omitting proofs and technical details, the author concentrates on discussing the main results of learning theory and their connections to fundamental problems in statistics. This second edition contains three new chapters devoted to further development of the learning theory and SVM techniques. Written in a readable (...) and concise style, the book is intended for statisticians, mathematicians, physicists, and computer scientists. (shrink)

Introduction 1 1 Inductive Inference: A New Approach 19 2 Luck, License, and Lingo 31 3 Natural Kinds 41 4 Concerning a Fiction about How Facts Are Forecast 57 5 Grue 79 6 Concepts of Projectibility and the Problems of Induction 97 7 Induction, Conceptual Spaces, and AI 117 8 The Projectibility Constraint 135 9 Simplicity as a Pragmatic Criterion for Deciding What Hypotheses to Take Seriously 153 10 A Grue Thought in a Bleen Shade: ’Grue’ as a Disjunctive Predicate (...) 173 11 Entrenchment 193 12 No Model, No Inference: A Bayesian Primer on the Grue Problem 225 13 Bayesian Projectibility 241 14 Learning and Projectibility 263 15 Selecting Variables and Getting to the Truth 273 Annotated Bibliography 281 Index 459. (shrink)

In _Reliable Reasoning_, Gilbert Harman and Sanjeev Kulkarni -- a philosopher and an engineer -- argue that philosophy and cognitive science can benefit from statistical learning theory, the theory that lies behind recent advances in machine learning. The philosophical problem of induction, for example, is in part about the reliability of inductive reasoning, where the reliability of a method is measured by its statistically expected percentage of errors -- a central topic in SLT. After discussing philosophical attempts to evade the (...) problem of induction, Harman and Kulkarni provide an admirably clear account of the basic framework of SLT and its implications for inductive reasoning. They explain the Vapnik-Chervonenkis dimension of a set of hypotheses and distinguish two kinds of inductive reasoning. The authors discuss various topics in machine learning, including nearest-neighbor methods, neural networks, and support vector machines. Finally, they describe transductive reasoning and suggest possible new models of human reasoning suggested by developments in SLT. (shrink)

Theoretical Computer Science, 383: 270-289, 2007.