Search arXivSearch

arXiv · 2312.00632

A Conversation with A. Philip Dawid

Abstract

Beginning in the 1970s, Alexander Philip Dawid has been a leading contributor to the foundations of statistics and especially to the development and application of Bayesian statistics. He is also known for his work on causality, especially his notation for conditional independence and his critique of the overuse of counterfactuals, and for his contributions to forensic statistics. Dawid was born in Lancashire, England, on February 1, 1946. His family moved to London soon afterwards, and he attended the City of London School from 1956 to 1963. He studied mathematics at Cambridge, earning a BA (Bachelor of Arts) degree in 1966. After earning a Diploma in Mathematical Statistics in the academic year 1966-1967, he studied for a PhD at Imperial, then at UCL, where he became a Lecturer in Statistics in 1969. In 1978, he left UCL for a position as Professor of Statistics in the Department of Mathematics, The City University, London, where he served as Head of Statistics Section and Director of the Statistical Laboratory. He returned to the Department of Statistics at UCL in 1981, serving as Head of Department from 1983 to 1993. He moved to the University of Cambridge in 2007, becoming Professor of Statistics and Fellow of Darwin College. He has continued his work in mathematical statistics after retiring from Cambridge in 2013 and was elected Fellow of the Royal Society in 2018.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vladimir Vovk, Glenn Shafer. 2023-12-01. A Conversation with A. Philip Dawid. https://doi.org/10.1214/23-sts903

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

See You at the Posterior Line: Learning Bayesian Modeling Through a Car Racing Game

We present an interactive classroom activity designed to address a central challenge in teaching introductory Bayesian statistics: how to formalize subjective knowledge and available information into prior distributions and then update them with empirical data. Role-playing as data analysts for a racing team, students evaluate candidate tires by converting qualitative engineering reports into prior distributions, collecting primary data via a virtual racing game, and using a Beta-Binomial model to inform team strategy. This discovery-based exercise allows small groups to observe directly how different prior choices and sample data jointly shape posterior inference. Student feedback ($n=32$) highlights high enjoyment, engagement and improved conceptual clarity. Open-access materials to implement the activity are provided, alongside recommendations for adapting it to other teaching contexts.

stat.OT

Why is Regularization Underused? An Empirical Study on Trust and Adoption of Statistical Methods

Statistical practice does not automatically follow methodological innovation. Regularization methods, widely advocated to reduce overfitting and stabilize inference, are readily available in modern software, but are not consistently used by data analysts. We investigate this implementation gap in a large-scale empirical study of trust in, and acceptance of, regularization techniques, based on $N = 606$ data analysts. Drawing on measurement frameworks from technology acceptance research, we survey practitioners and embed a randomized experiment to test whether written recommendation of regularization methods increases trust or intended use. We find no evidence of such an effect. Instead, adoption intentions are strongly associated with analysts' perceptions of ease of implementation and practical benefit, such as improved bias control or interpretability. Perceived social norms also emerge as a central driver. These results indicate that uptake of statistical methodology depends less on formal recommendations than on usability, perceived utility, and community practice.

stat.OT

Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times

This paper studies a two-server split--merge queue with positively dependent subtask service times modeled through a latent-factor bivariate Erlang construction. An exact characterization of the split--merge completion time is obtained, including explicit formulas for its first two moments and the resulting mean waiting time. Under fixed marginal service-time distributions, independence is shown to stochastically increase the completion time and hence overestimate mean waiting time. Numerical illustrations show that this benchmark gap can be substantial.

stat.OT