Search arXivSearch

arXiv · 2608.20541

Statistics in the Age of AI

Abstract

Artificial intelligence (AI) can automate programming, model fitting, visualization, simulation, literature synthesis, and increasingly sophisticated methodological tasks, but it cannot remove the logical conditions under which data support scientific claims or consequential decisions. We formalize these conditions through statistical warrant, which connects data to a claim through the target, observation regime, assumptions, procedure, uncertainty assessment, validation criterion, loss structure, governance and accountability. No algorithm can consistently recover a target that is not identified by the observation regime without additional information or assumptions. From this principle, we organize the argument around five statements. Questions and targets are integral to statistical methods. Data acquire evidential meaning only through design, provenance, and assumptions. Description, prediction, causal inference, and decision are mathematically distinct tasks. Analytical abundance requires accounting for how analyses are selected, uncertainty across the analytical system, and deployment validation. The statistician's fundamental role is therefore to construct, criticize, and safeguard statistical warrant, including by developing new methodology when existing theory is inadequate. This role requires statistical reasoning and attributable human and institutional responsibility.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juan Sosa, Brenda Betancourt. 2026-08-20. Statistics in the Age of AI. https://arxiv.org/abs/2608.20541

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