Ryan S. Brill
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ryan S. Brill has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Abraham J. Wyner
Department of Statistics and Data Science, The Wharton School, University of Pennsylvania
9 shared publications- Abraham J. Wyner
Department of Statistics Wharton School University of Pennsylvania Philadelphia 19104 PA USA
2 shared publications Ronald Yurko
Department of Statistics and Data Science , Carnegie Mellon University , Pittsburgh , USA
2 shared publicationsSameer K. Deshpande
Dept. of Statistics University of Wisconsin-Madison
2 shared publications- Abraham J. Wyner
University of Pennsylvania, Philadelphia, PA, USA
1 shared publication - Ian Barnett
Department of Biostatistics, Epidemiology, and Informatics, University of Pennsylvania, Perelman School of Medicine , Philadelphia, PA
1 shared publication
Latest Publications
- Open Access
- 2 October 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (40)
Correcting for spatial and temporal dependence in estimating the economic effect of extreme heat
Callahan and Mankin argue that extreme heat, measured by maximum 5-day average temperature, has a precise and economically meaningful effect on subnational gross domestic product per-capita growth. We reexamine this claim and find that the reported precision does not survive methods that respect the data’s spatial and temporal dependence. Country-preserving permutations and postselection correction substantially widen marginal-effect intervals. The estimates are also highly sensitive to influential countries and years, with exclusions sometimes collapsing the effect or reversing its sign. A hierarchical Bayesian model with region-within-country structure and AR(1) year effects yields much larger uncertainty, shrinks the estimated effect by 67 to 90%, and produces credible intervals spanning zero. Last, rolling out-of-sample tests show that adding extreme-climate variables does not improve prediction over models without them. We conclude that the claimed precision is not sustained once dependence, model selection, and influential observations are handled appropriately.
- 2 October 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (40)
Open AccessCorrecting for spatial and temporal dependence in estimating the economic effect of extreme heat
Callahan and Mankin argue that extreme heat, measured by maximum 5-day average temperature, has a precise and economically meaningful effect on subnational gross domestic product per-capita growth. We reexamine this claim and find that the reported precision does not survive methods that respect the data’s spatial and temporal dependence. Country-preserving permutations and postselection correction substantially widen marginal-effect intervals. The estimates are also highly sensitive to influential countries and years, with exclusions sometimes collapsing the effect or reversing its sign. A hierarchical Bayesian model with region-within-country structure and AR(1) year effects yields much larger uncertainty, shrinks the estimated effect by 67 to 90%, and produces credible intervals spanning zero. Last, rolling out-of-sample tests show that adding extreme-climate variables does not improve prediction over models without them. We conclude that the claimed precision is not sustained once dependence, model selection, and influential observations are handled appropriately.
- 14 July 2025
- Published by Taylor & Francis in The American Statistician
- Vol. 80 (1) , 15-30
The Loser’s Curse and the Critical Role of the Utility Function
- 14 July 2025
- Published by Taylor & Francis in The American Statistician
- Vol. 80 (1) , 15-30
The Loser’s Curse and the Critical Role of the Utility Function
- Open Access
- 30 June 2025
- Published by Walter de Gruyter GmbH in Journal of Quantitative Analysis in Sports
- Vol. 22 (1) , 105-115
Exploring the difficulty of estimating win probability: a simulation study
Estimating win probability is one of the classic modeling tasks of sports analytics. Many widely used win probability estimators use machine learning to fit the relationship between a binary win/loss outcome variable and certain game-state variables. To illustrate just how difficult it is to accurately fit such a model from noisy and highly correlated observational data, in this paper we conduct a simulation study. We create a simplified random walk version of football in which true win probability at each game-state is known, and we see how well a model recovers it. We find that the dependence structure of observational play-by-play data substantially inflates the bias and variance of estimators and lowers the effective sample size. Further, to achieve approximately valid marginal coverage, win probability confidence intervals need to be substantially wide. Concisely, these are high variance estimators subject to substantial uncertainty. Our findings are not unique to the particular application of estimating win probability; they are broadly applicable across sports analytics, as myriad other sports datasets are clustered into groups of observations that share the same outcome.
- 30 June 2025
- Published by Walter de Gruyter GmbH in Journal of Quantitative Analysis in Sports
- Vol. 22 (1) , 105-115
Open AccessExploring the difficulty of estimating win probability: a simulation study
Estimating win probability is one of the classic modeling tasks of sports analytics. Many widely used win probability estimators use machine learning to fit the relationship between a binary win/loss outcome variable and certain game-state variables. To illustrate just how difficult it is to accurately fit such a model from noisy and highly correlated observational data, in this paper we conduct a simulation study. We create a simplified random walk version of football in which true win probability at each game-state is known, and we see how well a model recovers it. We find that the dependence structure of observational play-by-play data substantially inflates the bias and variance of estimators and lowers the effective sample size. Further, to achieve approximately valid marginal coverage, win probability confidence intervals need to be substantially wide. Concisely, these are high variance estimators subject to substantial uncertainty. Our findings are not unique to the particular application of estimating win probability; they are broadly applicable across sports analytics, as myriad other sports datasets are clustered into groups of observations that share the same outcome.
- Open Access
Putting Skill as Nearly Indistinguishable from Noise: An Empirical Bayes Analysis of PGA Tour Performance
We revisit a foundational question in golf analytics: how important are the core components of performance--driving, approach play, and putting--in explaining success on the PGA Tour? Building on Mark Broadie's strokes gained analyses, we use an empirical Bayes approach to estimate latent golfer skill and assess statistical significance using a multiple testing procedure that controls the false discovery rate. While tee-to-green skill shows clear and substantial differences across players, putting skill is both less variable and far less reliably estimable. Indeed, putting performance appears nearly indistinguishable from noise.
Open AccessPutting Skill as Nearly Indistinguishable from Noise: An Empirical Bayes Analysis of PGA Tour Performance
We revisit a foundational question in golf analytics: how important are the core components of performance--driving, approach play, and putting--in explaining success on the PGA Tour? Building on Mark Broadie's strokes gained analyses, we use an empirical Bayes approach to estimate latent golfer skill and assess statistical significance using a multiple testing procedure that controls the false discovery rate. While tee-to-green skill shows clear and substantial differences across players, putting skill is both less variable and far less reliably estimable. Indeed, putting performance appears nearly indistinguishable from noise.
- 22 April 2025
- Published by Taylor & Francis in The American Statistician
- Vol. 79 (3) , 393-409
Analytics, Have Some Humility: A Statistical View of Fourth-Down Decision Making
- 22 April 2025
- Published by Taylor & Francis in The American Statistician
- Vol. 79 (3) , 393-409
Analytics, Have Some Humility: A Statistical View of Fourth-Down Decision Making
- Open Access
Moving from Machine Learning to Statistics: the case of Expected Points in American football
Expected points is a value function fundamental to player evaluation and strategic in-game decision-making across sports analytics, particularly in American football. To estimate expected points, football analysts use machine learning tools, which are not equipped to handle certain challenges. They suffer from selection bias, display counter-intuitive artifacts of overfitting, do not quantify uncertainty in point estimates, and do not account for the strong dependence structure of observational football data. These issues are not unique to American football or even sports analytics; they are general problems analysts encounter across various statistical applications, particularly when using machine learning in lieu of traditional statistical models. We explore these issues in detail and devise expected points models that account for them. We also introduce a widely applicable novel methodological approach to mitigate overfitting, using a catalytic prior to smooth our machine learning models.
Open AccessMoving from Machine Learning to Statistics: the case of Expected Points in American football
Expected points is a value function fundamental to player evaluation and strategic in-game decision-making across sports analytics, particularly in American football. To estimate expected points, football analysts use machine learning tools, which are not equipped to handle certain challenges. They suffer from selection bias, display counter-intuitive artifacts of overfitting, do not quantify uncertainty in point estimates, and do not account for the strong dependence structure of observational football data. These issues are not unique to American football or even sports analytics; they are general problems analysts encounter across various statistical applications, particularly when using machine learning in lieu of traditional statistical models. We explore these issues in detail and devise expected points models that account for them. We also introduce a widely applicable novel methodological approach to mitigate overfitting, using a catalytic prior to smooth our machine learning models.
- Open Access
Entropy-Based Strategies for Multi-Bracket Pools
Much work in the parimutuel betting literature has discussed estimating event outcome probabilities or developing optimal wagering strategies, particularly for horse race betting. Some betting pools, however, involve betting not just on a single event, but on a tuple of events. For example, pick six betting in horse racing, March Madness bracket challenges, and predicting a randomly drawn bitstring each involve making a series of individual forecasts. Although traditional optimal wagering strategies work well when the size of the tuple is very small (e.g., betting on the winner of a horse race), they are intractable for more general betting pools in higher dimensions (e.g., March Madness bracket challenges). Hence we pose the multi-brackets problem: supposing we wish to predict a tuple of events and that we know the true probabilities of each potential outcome of each event, what is the best way to tractably generate a set of n predicted tuples? The most general version of this problem is extremely difficult, so we begin with a simpler setting. In particular, we generate n independent predicted tuples according to a distribution having optimal entropy. This entropy-based approach is tractable, scalable, and performs well.
Open AccessEntropy-Based Strategies for Multi-Bracket Pools
Much work in the parimutuel betting literature has discussed estimating event outcome probabilities or developing optimal wagering strategies, particularly for horse race betting. Some betting pools, however, involve betting not just on a single event, but on a tuple of events. For example, pick six betting in horse racing, March Madness bracket challenges, and predicting a randomly drawn bitstring each involve making a series of individual forecasts. Although traditional optimal wagering strategies work well when the size of the tuple is very small (e.g., betting on the winner of a horse race), they are intractable for more general betting pools in higher dimensions (e.g., March Madness bracket challenges). Hence we pose the multi-brackets problem: supposing we wish to predict a tuple of events and that we know the true probabilities of each potential outcome of each event, what is the best way to tractably generate a set of n predicted tuples? The most general version of this problem is extremely difficult, so we begin with a simpler setting. In particular, we generate n independent predicted tuples according to a distribution having optimal entropy. This entropy-based approach is tractable, scalable, and performs well.
- Open Access
- 27 May 2024
- Published by Walter de Gruyter GmbH in Journal of Quantitative Analysis in Sports
- Vol. 20 (4) , 293-329
Introducing Grid WAR: rethinking WAR for starting pitchers
The baseball statistic “Wins Above Replacement” (WAR) has emerged as one of the most popular evaluation metrics. But it is not readily observed and tabulated; WAR is an estimate of a parameter in a vaguely defined model with all its attendant assumptions. Industry-standard models of WAR for starting pitchers from FanGraphs and Baseball Reference all assume that season-long averages are sufficient statistics for a pitcher’s performance. This provides an invalid mathematical foundation for many reasons, especially because WAR should not be linear with respect to any counting statistic. To repair this defect, as well as many others, we devise a new measure, Grid WAR, which accurately estimates a starting pitcher’s WAR on a per-game basis. The convexity of Grid WAR diminishes the impact of “blow-up” games and up-weights exceptional games, raising the valuation of pitchers like Sandy Koufax, Whitey Ford, and Catfish Hunter who exhibit fundamental game-by-game variance. Although Grid WAR is designed to accurately measure historical performance, it has predictive value insofar as a pitcher’s Grid WAR is better than Fangraphs’ FIP WAR at predicting future performance. Finally, at https://gridwar.xyz we host a Shiny app which displays the Grid WAR results of each MLB game since 1952, including career, season, and game level results, which updates automatically every morning.
- 27 May 2024
- Published by Walter de Gruyter GmbH in Journal of Quantitative Analysis in Sports
- Vol. 20 (4) , 293-329
Open AccessIntroducing Grid WAR: rethinking WAR for starting pitchers
The baseball statistic “Wins Above Replacement” (WAR) has emerged as one of the most popular evaluation metrics. But it is not readily observed and tabulated; WAR is an estimate of a parameter in a vaguely defined model with all its attendant assumptions. Industry-standard models of WAR for starting pitchers from FanGraphs and Baseball Reference all assume that season-long averages are sufficient statistics for a pitcher’s performance. This provides an invalid mathematical foundation for many reasons, especially because WAR should not be linear with respect to any counting statistic. To repair this defect, as well as many others, we devise a new measure, Grid WAR, which accurately estimates a starting pitcher’s WAR on a per-game basis. The convexity of Grid WAR diminishes the impact of “blow-up” games and up-weights exceptional games, raising the valuation of pitchers like Sandy Koufax, Whitey Ford, and Catfish Hunter who exhibit fundamental game-by-game variance. Although Grid WAR is designed to accurately measure historical performance, it has predictive value insofar as a pitcher’s Grid WAR is better than Fangraphs’ FIP WAR at predicting future performance. Finally, at https://gridwar.xyz we host a Shiny app which displays the Grid WAR results of each MLB game since 1952, including career, season, and game level results, which updates automatically every morning.
- Open Access
Entropy-Based Strategies for Multi-Bracket Pools
Much work in the parimutuel betting literature has discussed estimating event outcome probabilities or developing optimal wagering strategies, particularly for horse race betting. Some betting pools, however, involve betting not just on a single event, but on a tuple of events. For example, pick six betting in horse racing, March Madness bracket challenges, and predicting a randomly drawn bitstring each involve making a series of individual forecasts. Although traditional optimal wagering strategies work well when the size of the tuple is very small (e.g., betting on the winner of a horse race), they are intractable for more general betting pools in higher dimensions (e.g., March Madness bracket challenges). Hence we pose the multi-brackets problem: supposing we wish to predict a tuple of events and that we know the true probabilities of each potential outcome of each event, what is the best way to tractably generate a set of $n$ predicted tuples? The most general version of this problem is extremely difficult, so we begin with a simpler setting. In particular, we generate $n$ independent predicted tuples according to a distribution having optimal entropy. This entropy-based approach is tractable, scalable, and performs well.Open AccessEntropy-Based Strategies for Multi-Bracket Pools
Much work in the parimutuel betting literature has discussed estimating event outcome probabilities or developing optimal wagering strategies, particularly for horse race betting. Some betting pools, however, involve betting not just on a single event, but on a tuple of events. For example, pick six betting in horse racing, March Madness bracket challenges, and predicting a randomly drawn bitstring each involve making a series of individual forecasts. Although traditional optimal wagering strategies work well when the size of the tuple is very small (e.g., betting on the winner of a horse race), they are intractable for more general betting pools in higher dimensions (e.g., March Madness bracket challenges). Hence we pose the multi-brackets problem: supposing we wish to predict a tuple of events and that we know the true probabilities of each potential outcome of each event, what is the best way to tractably generate a set of $n$ predicted tuples? The most general version of this problem is extremely difficult, so we begin with a simpler setting. In particular, we generate $n$ independent predicted tuples according to a distribution having optimal entropy. This entropy-based approach is tractable, scalable, and performs well. - Open Access
Introducing Grid WAR: Rethinking WAR for Starting Pitchers
The baseball statistic "Wins Above Replacement" (WAR) has emerged as one of the most popular evaluation metrics. But it is not readily observed and tabulated; WAR is an estimate of a parameter in a vaguely defined model with all its attendant assumptions. Industry-standard models of WAR for starting pitchers from FanGraphs and Baseball Reference all assume that season-long averages are sufficient statistics for a pitcher's performance. This provides an invalid mathematical foundation for many reasons, especially because WAR should not be linear with respect to any counting statistic. To repair this defect, as well as many others, we devise a new measure, Grid WAR, which accurately estimates a starting pitcher's WAR on a per-game basis. The convexity of Grid WAR diminishes the impact of "blow-up" games and upweights exceptional games, raising the valuation of pitchers like Sandy Koufax, Whitey Ford, and Catfish Hunter who exhibit fundamental game-by-game variance. Grid WAR is designed to accurately measure past performance, but also has predictive value insofar as a pitcher's Grid WAR is better than WAR at predicting future performance. Finally, at https://gridwar.xyz we host a Shiny app which displays the Grid WAR results of each MLB game since 1952, including career, season, and game level results, which updates automatically every morning.
Open AccessIntroducing Grid WAR: Rethinking WAR for Starting Pitchers
The baseball statistic "Wins Above Replacement" (WAR) has emerged as one of the most popular evaluation metrics. But it is not readily observed and tabulated; WAR is an estimate of a parameter in a vaguely defined model with all its attendant assumptions. Industry-standard models of WAR for starting pitchers from FanGraphs and Baseball Reference all assume that season-long averages are sufficient statistics for a pitcher's performance. This provides an invalid mathematical foundation for many reasons, especially because WAR should not be linear with respect to any counting statistic. To repair this defect, as well as many others, we devise a new measure, Grid WAR, which accurately estimates a starting pitcher's WAR on a per-game basis. The convexity of Grid WAR diminishes the impact of "blow-up" games and upweights exceptional games, raising the valuation of pitchers like Sandy Koufax, Whitey Ford, and Catfish Hunter who exhibit fundamental game-by-game variance. Grid WAR is designed to accurately measure past performance, but also has predictive value insofar as a pitcher's Grid WAR is better than WAR at predicting future performance. Finally, at https://gridwar.xyz we host a Shiny app which displays the Grid WAR results of each MLB game since 1952, including career, season, and game level results, which updates automatically every morning.