Clark Glymour

Rather than attempting to characterize a relation of confirmation between evidence and theory, epistemology might better consider which methods of forming conjectures from evidence, or of altering beliefs in the light of evidence, are most reliable for getting to the truth. A logical framework for such a study was constructed in the early 1960s by E. Mark Gold and Hilary Putnam. This essay describes some of the results that have been obtained in that framework and their significance for philosophy of science, artificial intelligence, and for normative epistemology when truth is relative.

We describe a unification of old and recent ideas for formulating graphical models to explain time series data, including Granger causality, semi-automated search procedures for graphical causal models, modeling of contemporaneous influences in times series, and heuristic generalized additive model corrections to linear models. We illustrate the procedures by finding a structure of exogenous variables and mediating variables among time series of remote geospatial indices of ocean surface temperatures and pressures. The analysis agrees with known exogenous drivers of the indices, not assumed in the analysis. Automated search applied to the residuals after regressing each series on its lags and the lags of its Granger causes yields a graphical model of “comtemporaneous” causal relations identical with the qualitative graphical relations from the time series. A similar analysis produces reasonable results when applied to candidate climate indices obtained by a clustering method from sea surface temperature and sea level pressure data.

Convergent realists desire scientific methods that converge reliably to informative, true theories over a wide range of theoretical possibilities. Much attention has been paid to the problem of induction from quantifier-free data. In this paper, we employ the techniques of formal learning theory and model theory to explore the reliable inference of theories from data containing alternating quantifiers. We obtain a hierarchy of inductive problems depending on the quantifier prefix complexity of the formulas that constitute the data, and we provide bounds relating the quantifier prefix complexity of the data to the quantifier prefix complexity of the theories that can be reliably inferred from such data without background knowledge. We also examine the question whether there are theories with mixed quantifiers that can be reliably inferred with closed, universal formulas in the data, but not without

Few people have thought so hard about the nature of the quantum theory as has Jeff Bub,· and so it seems appropriate to offer in his honor some reflections on that theory. My topic is an old one, the consistency of our microscopic theories with our macroscopic theories, my example, the Aspect experiments (Aspect et al., 1981, 1982, 1982a; Clauser and Shimony, l978;_Duncan and Kleinpoppen, 199,8) is familiar, and my sirnplrcation of it is borrowed. All that is new here is a kind of diagonalization: an argument that the fundamental principles found to be violated by the quantum theory must be assumed to be true of the experimental apparatus used in the experiments..

The Bell Curve aims to establish a set of causal claims. I argue that the methodology of The Bell Curve is typical of much of contemporary social science and is intrinsically defective. I claim better methods are available for causal inference from observational data, but that those methods would yield no causal conclusions from the data used in the formal analyses in The Bell Curve. Against the laissez-faire social policies advocated in the book, I claim that when combined with common sense and other information, the informal data mustered in The Bell Curve support a range of "liberal" social policies

Linear structural equation models (SEMs) are widely used in sociology, econometrics, biology, and other sciences. A SEM (without free parameters) has two parts: a probability distribution (in the Normal case specified by a set of linear structural equations and a covariance matrix among the “error” or “disturbance” terms), and an associated path diagram corresponding to the causal relations among variables specified by the structural equations and the correlations among the error terms. It is often thought that the path diagram is nothing more than a heuristic device for illustrating the assumptions of the model. However, in this paper, we will show how path diagrams can be used to solve a number of important problems in structural equation modelling.

Twenty years ago, Nancy Cartwright wrote a perceptive essay in which she clearly distinguished causal relations from associations, introduced philosophers to Simpson’s paradox, articulated the difficulties for reductive probabilistic analyses of causation that flow from these observations, and connected causal relations with strategies of action (Cartwright 1979). Five years later, without appreciating her essay, I and my (then) students began to develop formal representations of causal and probabilistic relations, which, subsequently informed by the work of computer scientists and statisticians, led eventually to a practical theory of causal inference and prediction, a theory incorporating some of the sensibilities Cartwright had voiced (Glymour et al. 1987; Spirtes et al. 1993). That theory, and ideas related to it, have become a subfield of computer science with contributions far deeper than mine from many sources, and its inferential and predictive techniques have been successfully applied in biology, economics, educational research, geology and space physics.

Of the many proposals for inferring genetic regulatory structure from microarray measurements of mRNA transcript hybridization, several aim to estimate regulatory structure from the associations of gene expression levels measured in repeated samples. The repeated samples may be from a single experimental condition, or from several distinct experimental conditions; they may be “equilibrium” measurements or time series; the associations may be estimated by correlation coefficients or by conditional frequencies (for discretized measurements) or by some other statistic. This paper describes two elementary statistical difficulties for all such procedures, no matter whether based on Bayesian updating, conditional independence testing, or other machine learning procedures such as simulated annealing or neural net pruning. One difficulty obtains if large numbers of cells are aggregated in a measurement of expression levels from a common population of cells; the other obtains if small numbers of cells are aggregated or if samples are separately aggregated over different populations of cells.

Recent literature in philosophy of science has addressed purported notions of explanatory virtues—‘explanatory power’, ‘unification’, and ‘coherence’. In each case, a probabilistic relation between a theory and data is said to measure the power of an explanation, or degree of unification, or degree of coherence. This essay argues that the measures do not capture cases that are paradigms of scientific explanation, that the available psychological evidence indicates that the measures do not capture judgements of explanatory power, and, finally, that the measures do not provide useful methods for selecting hypotheses. 1. Introduction2. Some Proposed Measures of Explanatory Virtues3. Descriptive Inadequacy3.1 Excellent but false explanations3.2 Causal explanation4. Psychological Inadequacy5. Finding the Truth6. Conclusion

After reviewing theoretical reasons for doubting that machine learning methods can accurately infer gene regulatory networks from microarray data, we test 10 algorithms on simulated data from the sea urchin network, and on microarray data for yeast compared with recent experimental determinations of the regulatory network in the same yeast species. Our results agree with the theoretical arguments: most algorithms are at chance for determining the existence of a regulatory connection between gene pairs, and the algorithms that perform better than chance are nonetheless so errorprone as to be of little practical use in these applications.