After sketching the conflict between objectivists and subjectivists on the foundations of statistics, this paper discusses an issue facing statisticians of both schools, namely, model validation. Statistical models originate in the study of games of chance, and have been successfully applied in the physical and life sciences. However, there are basic problems in applying the models to social phenomena; some of the difficulties will be pointed out. Hooke's law will be contrasted with regression models for salary discrimination, the latter being (...) a fairly typical application in the social sciences. (shrink)

In Causation, Prediction, and Search (CPS hereafter), Peter Spirtes, Clark Glymour and I developed a theory of statistical causal inference. In his presentation at the Notre Dame conference (and in his paper, this volume), Glymour discussed the assumptions on which this theory is built, traced some of the mathematical consequences of the assumptions, and pointed to situations in which the assumptions might fail. Nevertheless, many at Notre Dame found the theory difficult to understand and/or assess. As a result I was (...) asked to write this paper to provide a more intuitive introduction to the theory. In what follows I shun almost all formality and avoid the numerous and complicated qualifiers that typically accompany definitions or important philosophical concepts. They can be all be found in Glymour's paper or in CPS, which are clear although sometimes dense. Here I attempt to fix intuitions by highlighting a few of the essential ideas and by providing extremely simple examples throughout. (shrink)

This book provides a post-positivist theory of deterministic and probabilistic causality that supports both quantitative and qualitative explanations. Features of particular interest include the ability to provide true explanations in contexts where our knowledge is incomplete, a systematic interpretation of causal modeling techniques in the social sciences, and a direct realist view of causal relations that is compatible with a liberal empiricism. The book should be of wide interest to both philosophers and scientists. Originally published in 1989. The Princeton Legacy (...) Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905. (shrink)

In Causation, Prediction, and Search, we undertook a three part project. First, we characterized when causal models are indistinguishable by population conditional independence relations under several different assumptions relating causality to probability. Second, we proposed a number of algorithms that take sample data and optional background knowledge as input, and output a class of causal models compatible with the data and the background knowledge; the algorithms were accompanied by proofs of their correctness given assumptions that were clearly stated in CPS, (...) and that we will restate below. Finally, we offered a theory of how to predict the effects of interventions in causal structures, given only partial knowledge of causal structure. Freedman's objections are all directed against the causal inference algorithms we proposed. We do not have room here to discuss all of his criticisms, but we have answered his major points. With regard to the points we do not have room to discuss, the reader should be warned that Freedman is an unreliable interpreter of what we have written. For convenience, we have divided Freedman's objections into the following categories. 1.) Freedman questions some of the assumptions on which our correctness theorems are based. Some of his criticisms are based on covariance matrices that he constructed. None of the examples he constructed in sections 11.2, 11.3, or 12.3 are counterexamples to any theorem that we stated, nor are they even germane to the question of how probable are the assumptions we make. His examples only illustrate points discussed in detail in our book, in which we give similar examples. 2.) The most serious charge that Freedman makes is that the algorithms do not compute what we say they do. (shrink)