APAaron Peikert

Aaron Peikert

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Aaron Peikert has a total of 118 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    StructuralEquationModels.jl: a Julia Package for Extensible and Efficient Structural Equation Modeling

    by Maximilian Stefan Ernst, Alexey Stukalov, Andreas Markus Brandmaier, Aaron Peikert

    We introduce StructuralEquationModels.jl, a novel structural equation modeling (SEM) software designed with extensibility as its core principle. Since the introduction of SEM, the range of problems it is applied to is rapidly expanding. However, SEM software implementations did not anticipate such expansion, so software flexibility has become one major factor limiting the adoption of innovations in the field of SEM. StructuralEquationModels.jl is designed to be modular and extensible to remove that bottleneck. This approach not only speeds up innovation in SEM but also ensures the integrity and reliability of existing functionality. We leverage the Julia programming language's ecosystem to achieve efficient implementations of loss functions and gradients and support modern optimization backends. The versatility of StructuralEquationModels.jl is demonstrated on a set of examples (e.g., adding support for regularized SEM) and simulations (e.g., sensitivity of the RMSEA to misspecification of large factor analysis models). Using these simulations as a benchmark, we further demonstrate StructuralEquationModels.jl’s high computational efficiency.

  • Open Access

    A Transparency Checklist for Theory-Driven Work in Psychology

    by Philipp Musfeld, Nele Freyer, Jens Lange, Felix D. Schönbrodt, Noah N'DJaye Nikolai van Dongen, Aaron Peikert, Anna-Lena Schubert, Rahel Geppert, Matthias Borgstede, Daniel Leising

    In light of the replication crisis and the Open Science Movement, transparency in psychological research has been increasingly recognized as being of key importance for cumulative knowledge gain. Numerous standards and checklists have been developed to improve transparency in reporting (see e.g., Aczel et al., 2019; Schubert et al., 2025). However, most of the available resources focus on methodological and statistical aspects of reporting, leaving the quality of theory development and theory testing largely unaddressed. To help close this gap, we develop a transparency checklist for reporting theoretical and theory-driven work in psychology, covering five main areas: 1) reporting of verbal theories; 2) reporting of formal models; 3) reporting theory evaluations by simulations; 4) reporting theory evaluations by empirical data; 5) reporting theory evaluations by comparison. The checklist is being actively developed in an iterative consensus process, in which sets of quality criteria are proposed, tested, evaluated by a large sample of experts, and then revised. Here, we present version 4 of the checklist, which is based on the input from 92 experts in the field. The checklist may be used to facilitate more precise and transparent reporting of theoretical work and can incentivize the role of theory in psychology when used in review and research assessment processes.

  • Open Access

    Why, when, and how to (or not to) preregister a simulation study

    by Björn S. Siepe, František Bartoš, Anne-Laure Boulesteix, Daniel W. Heck, Aaron Peikert, Alexandra Sarafoglou, Samuel Pawel

    Simulation studies play a central role in methodological research by providing evidence about the empirical performance of statistical methods. At the same time, they involve substantial researcher degrees of freedom in the choice of data-generating mechanisms, methods, performance measures, and reporting decisions, which can undermine the credibility of their results. Preregistration has been proposed as a tool to increase transparency and reduce such flexibility, yet its role in simulation studies remains contested. In this paper, we discuss why researchers should or should not preregister their simulation studies, elaborating on the theoretical and pragmatic benefits as well as disadvantages of preregistration. Drawing on philosophical accounts, we argue that preregistration primarily reduces epistemic uncertainty about which simulation conditions were considered and why, which enables honest evaluation of whether results support the conclusions drawn. We argue that the resulting benefits depend critically on the aims of a study and its position within the methodological research cycle. Late-phase studies that investigate mature methods tend to benefit more, while early-phase studies investigating newly proposed methods generally benefit less from preregistration. We further discuss practical challenges specific to simulation studies, including the timing of preregistration, the role of preliminary simulations, and safeguards against post hoc registration. Finally, we outline concrete guidance on how to preregister simulation studies and discuss Registered Reports as a particularly promising format. Overall, we argue for a nuanced, purpose-driven use of preregistration that supports rather than hinders methodological progress.

  • Open Access

    To Be FAIR: Theory Specification Needs an Update

    by Caspar J. Van Lissa, Aaron Peikert, Maximilian S. Ernst, Noah N. N. van Dongen, Felix D. Schönbrodt, Andreas M. Brandmaier

    Open science innovations have focused on rigorous theory testing, yet methods for specifying, sharing, and iteratively improving theories remain underdeveloped. To address this limitation, we introduce FAIR theory , a standard for specifying theories as findable, accessible, interoperable, and reusable digital objects. FAIR theories are findable in well-established archives; accessible in terms of their availability and ability to be understood; interoperable for specific purposes, such as selecting control variables; and reusable in that they can be iteratively and collaboratively improved on. This article adapts the FAIR principles for theory; reflects on current FAIR practices in relation to psychological theory; and discusses FAIR theories’ potential impact in terms of reducing research waste, enabling metaresearch on theories’ structure and development, and incorporating theory into reproducible research workflows—from hypothesis generation to simulation studies. We present a conceptual workflow for FAIRifying theory that builds on existing open science principles and infrastructures. More detailed tutorials, worked examples, and convenience functions to automate this workflow are available in the theorytools R package. FAIR theory constitutes a structured protocol for archiving, communicating about, and iteratively improving theory, addressing a critical gap in open scholarly practices and potentially increasing the efficiency of cumulative knowledge acquisition in psychology and beyond.


  • Open Access

    Evaluate what is claimed to be confirmed: Initial version of a falsification assessment form (FAF)

    by Michael Höfler, Anja Kräplin, Mahmoud Medhat Elsherif, Moritz Schepke, Maria Montefinese, Yashvin Seetahul, Bjørn Sætrevik, Aaron Peikert, Marton Aron Varga, Lukas Wallrich

    Scientific claims, and the way they are tested must be unambiguous and flexibility must be disclosed. Grounded in Popper’s principle of falsification, we suggest the Falsification Assessment Form. The form aims to identify ambiguity and undisclosed flexibility in the entire research process with 11 items covering hypothesis formulation, data processing, analysis, and alternative explanations. It also collects information on transparency measures, such as preregistration. The form was developed through consensus among the authors and refined via a collaborative feedback assessment of 19 experts. It is intended for original, quantitative research, it highlights potential issues and requires authors to provide detailed responses. FAF is meant to be a structured qualitative audit framework. It can be used to identify concerns in published research, improve the quality of papers during peer review, or guide rigorous study planning from the outset. We open up further refinement and testing of FAF to the scientific community.


  • Open Access

    Why does preregistration increase the persuasiveness of evidence? A Bayesian rationalization

    by Aaron Peikert, Maximilian Stefan Ernst, Andreas Markus Brandmaier

    The replication crisis has led many researchers to preregister their hypotheses and data analysis plans before collecting data.A widely held view is that preregistration is supposed to limit the extent to which data may influence the hypotheses to be tested.Only if data have no influence an analysis is considered confirmatory. Consequently, many researchers believe that preregistration is only applicable in confirmatory paradigms.In practice, researchers may struggle to preregister their hypotheses because of vague theories that necessitate data-dependent decisions (aka exploration).We argue that preregistration benefits any study on the continuum between confirmatory and exploratory research.To that end, we formalize a general objective of preregistration and demonstrate that exploratory studies also benefit from preregistration.Drawing on Bayesian philosophy of science, we argue that preregistration should primarily aim to reduce uncertainty about the inferential procedure used to derive results.This approach provides a principled justification of preregistration, separating the procedure from the goal of ensuring strictly confirmatory research.We acknowledge that knowing the extent to which a study is exploratory is central, but certainty about the inferential procedure is a prerequisite for persuasive evidence.Finally, we discuss the implications of these insights for the practice of preregistration.

  • Open Access

    Automated Reproducibility Testing in R Markdown

    by Andreas M. Brandmaier, Aaron Peikert

    Computational results are considered reproducible if the same computation on the same data yields the same results if performed on a different computer or on the same computer later in time. Reproducibility is a prerequisite for replicable, robust, and transparent research in digital environments. Various approaches have been suggested to increase chances of reproducibility of R code. Many of them rely on R Markdown as a language to dynamically generate reproducible research assets (e.g., reports, posters, or presentations). However, a simple way to automatically verify reproducibility is still missing. We introduce the R package reproducibleRchunks, which automatically stores metadata about original computational results and verifies later reproduction attempts automatically. With a minimal change to users’ workflows, we hope that this approach increases transparency and trustworthiness of digital research assets.


  • Open Access

    Automated Reproducibility Testing in R Markdown

    by Andreas Markus Brandmaier, Aaron Peikert

    Computational results are considered _reproducible_ if the same computation on the same data yields the same results if performed on a different computer or on the same computer later in time. Reproducibility is a prerequisite for replicable, robust and transparent research in digital environments. Various approaches have been suggested to increase chances of reproducibility. Many of them rely on R Markdown as a language to dynamically generate reproducible research assets (e.g., reports, posters, or presentations). However, a simple way to detect non-reproducibility, that is, unwanted changes in these assets over time is still missing. We introduce the R package `reproducibleRchunks`, which provides a new type of code chunk in R Markdown documents, which automatically stores meta data about original computational results and verifies later reproduction attempts. With a minimal change to users' workflows, we hope that this approach increases transparency and trustworthiness of digital research assets.

  • Open Access

    Eleven strategies for making reproducible research and open science training the norm at research institutions

    by Friederike E Kohrs, Susann Auer, Alexandra Bannach-Brown, Susann Fiedler, Tamarinde Laura Haven, Verena Heise, Constance Holman, Flavio Azevedo, René Bernard, Arnim Bleier, et al.

    Reproducible research and open science practices have the potential to accelerate scientific progress by allowing others to reuse research outputs, and by promoting rigorous research that is more likely to yield trustworthy results. However, these practices are uncommon in many fields, so there is a clear need for training that helps and encourages researchers to integrate reproducible research and open science practices into their daily work. Here, we outline eleven strategies for making training in these practices the norm at research institutions. The strategies, which emerged from a virtual brainstorming event organized in collaboration with the German Reproducibility Network, are concentrated in three areas: (i) adapting research assessment criteria and program requirements; (ii) training; (iii) building communities. We provide a brief overview of each strategy, offer tips for implementation, and provide links to resources. We also highlight the importance of allocating resources and monitoring impact. Our goal is to encourage researchers – in their roles as scientists, supervisors, mentors, instructors, and members of curriculum, hiring or evaluation committees – to think creatively about the many ways they can promote reproducible research and open science practices in their institutions.


  • On the Performance of Different Regularization Methods in Bifactor-(S-1) Models with Explanatory Variables-Caveats, Recommendations, and Future Directions

    by Benedikt Friemelt, Christian Bloszies, Maximilian S. Ernst, Aaron Peikert, Andreas M. Brandmaier, Tobias Koch

    Regularization methods in linear regression models with manifest variables have been shown to be effective in selecting key predictors from a set of many variables, while improving predictions for novel observations. Regularization methods are particularly attractive for the analysis of complex multidimensional data when theory development is the primary goal; for example when researchers attempt to predict general or specific factors in bifactor models using many potentially relevant predictors. However, applications of regularization methods in such models are still scarce. In a simulation study, we examined the performance of different regularization methods in bifactor-(S-1) models, varying the number of predictors, the correlations with the outcome (effect size), the underlying structure of multicollinearity as well as the sample size, the type of penalty, and a single-step versus a two-step approach. We explore potential caveats in the use of regularization methods in bifactor-(S-1) models, provide practical recommendations, and discuss future directions.