Search arXivSearch

arXiv · 2604.00424

Distributional regression models for meta-analysis

Abstract

Meta-analyses are regarded as the highest level in the hierarchy of evidence, yet standard models traditionally concentrated on estimating the mean effect size, often under restrictive assumptions about the underlying distribution, such as homogeneous variance, symmetric shapes. We introduce a distributional regression framework for meta-analysis that generalizes these conventional models by allowing all parameters of the effect size distribution, such as location, scale, and shape, to be modelled as functions of explanatory variables. This unified framework accommodates a wide range of existing models, including random-effects, multilevel, multivariate, location-scale, and outlier-robust meta-analyses, as special cases. We provide an illustrative example, using 67,393 meta-analyses from the Cochrane Database of Systematic Reviews, employing location-scale models to investigate whether smaller studies tend to report larger effect sizes (i.e., small-study effects) and exhibit greater heterogeneity. We discuss implementation strategies using existing software, considerations for model selection and pre-registration, and the need for further methodological development. By moving beyond the mean effect size, distributional regression enables researchers to explore systematic variation in distributional structure, facilitating the joint test of new hypotheses corresponding to multiple distributional parameters.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yefeng Yang, Shinichi Nakagawa. 2026-04-01. Distributional regression models for meta-analysis. https://arxiv.org/abs/2604.00424

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