Stef Baas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Stef Baas has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Richard J. Boucherie
Center for Healthcare Operations Improvement and Research, University of Twente, Enschede, The Netherlands
5 shared publications - Sofia S. Villar
University of Cambridge
4 shared publications - Aleida Braaksma
Stochastic Operations Research Group, Department of Applied Mathematics, University of Twente, 7500 AE Enschede, Netherlands
3 shared publications - David S. Robertson
University of Cambridge
3 shared publications - Lukas Pin
MRC Biostatistics Unit, University of Cambridge, UK
3 shared publications - Alex John London
Philosophy Department, Carnegie Mellon University, Pittsburgh, PA, USA
2 shared publications
Latest Publications
- Open Access
- 4 August 2026
- Published by SAGE Publications in Clinical Trials
- Vol. 23 (5) , 472-481
Adaptive versus fixed designs in confirmatory clinical trials: centering the choice on ethics
Background: Because confirmatory clinical trials are costly, large-scale endeavors, the choice of their design carries significant weight. While the current methodological landscape offers tools to address residual pre-trial uncertainty through prespecified adaptations to design elements, design choices remain frequently constrained by prevailing orthodoxies. Methods: We examine how unacknowledged design uncertainties (e.g., sample size calculations based on incorrect effect size or variance estimates) impact the statistical, ethical, and resource-stewardship goals of confirmatory trials. We contrast how fixed and adaptive design strategies handle these uncertainties, detailing the operational safeguards, firewalls, and trade-offs (e.g., complexity, operational bias) required to preserve trial integrity. Results: Strict adherence to default templates prevents stakeholders from matching the design strategy to the specific complexities of the research question. We observe that the gold standard status of fixed designs often obscures their limitations in handling design uncertainties. A rigid adherence to these conventions can ethically hinder a trial’s ability to deliver conclusive results. Conversely, while adaptive designs can offer tools to efficiently reduce uncertainty, we acknowledge that adaptive elements are not without cost; their implementation requires rigorous safeguards to manage specific risks to trial integrity and potential operational biases. Conclusion: To better align clinical research with its ethical and scientific mandates, we issue two calls to action. First, trial designers, including statisticians, must clearly articulate how target and design uncertainties impact ethical obligations, promoting an open-minded evaluation of both fixed and adaptive methods. Second, stakeholders must foreground ethical considerations during design selection, requiring explicit justification for the use—or non-use—of adaptive elements. The ethical path forward is not to default to the old or blindly adopt the new, but to explicitly justify the chosen design based on its responsiveness to the specific uncertainties of the trial. We posit that trial design must transition from a habit-based process to one where pre-trial uncertainties are openly discussed and addressed.
- 4 August 2026
- Published by SAGE Publications in Clinical Trials
- Vol. 23 (5) , 472-481
Open AccessAdaptive versus fixed designs in confirmatory clinical trials: centering the choice on ethics
Background: Because confirmatory clinical trials are costly, large-scale endeavors, the choice of their design carries significant weight. While the current methodological landscape offers tools to address residual pre-trial uncertainty through prespecified adaptations to design elements, design choices remain frequently constrained by prevailing orthodoxies. Methods: We examine how unacknowledged design uncertainties (e.g., sample size calculations based on incorrect effect size or variance estimates) impact the statistical, ethical, and resource-stewardship goals of confirmatory trials. We contrast how fixed and adaptive design strategies handle these uncertainties, detailing the operational safeguards, firewalls, and trade-offs (e.g., complexity, operational bias) required to preserve trial integrity. Results: Strict adherence to default templates prevents stakeholders from matching the design strategy to the specific complexities of the research question. We observe that the gold standard status of fixed designs often obscures their limitations in handling design uncertainties. A rigid adherence to these conventions can ethically hinder a trial’s ability to deliver conclusive results. Conversely, while adaptive designs can offer tools to efficiently reduce uncertainty, we acknowledge that adaptive elements are not without cost; their implementation requires rigorous safeguards to manage specific risks to trial integrity and potential operational biases. Conclusion: To better align clinical research with its ethical and scientific mandates, we issue two calls to action. First, trial designers, including statisticians, must clearly articulate how target and design uncertainties impact ethical obligations, promoting an open-minded evaluation of both fixed and adaptive methods. Second, stakeholders must foreground ethical considerations during design selection, requiring explicit justification for the use—or non-use—of adaptive elements. The ethical path forward is not to default to the old or blindly adopt the new, but to explicitly justify the chosen design based on its responsiveness to the specific uncertainties of the trial. We posit that trial design must transition from a habit-based process to one where pre-trial uncertainties are openly discussed and addressed.
- Open Access
- 3 August 2026
- Published by SAGE Publications in Clinical Trials
- Vol. 23 (5) , 486-489
Rejoinder: “Adaptive versus fixed designs in confirmatory clinical trials: Centering the choice on ethics”
- 3 August 2026
- Published by SAGE Publications in Clinical Trials
- Vol. 23 (5) , 486-489
Open AccessRejoinder: “Adaptive versus fixed designs in confirmatory clinical trials: Centering the choice on ethics”
- Open Access
- 30 March 2026
- Published by Springer Nature in Health Care Management Science
- Vol. 29 (2) , 18
A stochastic programming approach for dynamic allocation of bed capacity and assignment of patients to collaborating hospitals during pandemic outbreaks
Sustaining regular and infectious care during an infectious outbreak requires adequate management support for patient capacity allocation. During the COVID-19 pandemic, hospitals faced severe challenges, including uncertainty surrounding the number of infectious patients needing hospitalization and too little regional cooperation. This led to inefficient usage of healthcare capacity. To better prepare for future pandemics, we have developed a decision support system for central regional decision-making on opening and closing hospital rooms for infectious patients and assigning new infectious patients to hospitals. Since relabeling rooms takes some lead time, we develop a stochastic lookahead approach using stochastic programming with sample average approximation based on scenarios of the number of occupied infectious beds and infectious patients needing hospitalization. The lookahead approach models the impact of current decisions on future costs, such as costs for bed shortages, unused beds for infectious patients, and opening and closing rooms. These decisions affect the quality of care by ensuring capacity for either infectious or regular care patients. Our simulation study of a COVID-19 scenario in the Netherlands demonstrates that the stochastic lookahead approach outperforms a deterministic approach as well as other heuristic decision rules, such as hospitals acting individually and implementing a pandemic unit where one hospital is designated to take all regional infectious patients until full. Our approach is very flexible and capable of tuning model parameters to account for the characteristics of future, yet unknown, pandemics, and supports sustaining regular care by minimizing the strain of infectious care on the available regular care capacity.
- 30 March 2026
- Published by Springer Nature in Health Care Management Science
- Vol. 29 (2) , 18
Open AccessA stochastic programming approach for dynamic allocation of bed capacity and assignment of patients to collaborating hospitals during pandemic outbreaks
Sustaining regular and infectious care during an infectious outbreak requires adequate management support for patient capacity allocation. During the COVID-19 pandemic, hospitals faced severe challenges, including uncertainty surrounding the number of infectious patients needing hospitalization and too little regional cooperation. This led to inefficient usage of healthcare capacity. To better prepare for future pandemics, we have developed a decision support system for central regional decision-making on opening and closing hospital rooms for infectious patients and assigning new infectious patients to hospitals. Since relabeling rooms takes some lead time, we develop a stochastic lookahead approach using stochastic programming with sample average approximation based on scenarios of the number of occupied infectious beds and infectious patients needing hospitalization. The lookahead approach models the impact of current decisions on future costs, such as costs for bed shortages, unused beds for infectious patients, and opening and closing rooms. These decisions affect the quality of care by ensuring capacity for either infectious or regular care patients. Our simulation study of a COVID-19 scenario in the Netherlands demonstrates that the stochastic lookahead approach outperforms a deterministic approach as well as other heuristic decision rules, such as hospitals acting individually and implementing a pandemic unit where one hospital is designated to take all regional infectious patients until full. Our approach is very flexible and capable of tuning model parameters to account for the characteristics of future, yet unknown, pandemics, and supports sustaining regular care by minimizing the strain of infectious care on the available regular care capacity.
- 19 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
A Sampling-Based Gittins Index Approximation
A sampling-based method is introduced to approximate the Gittins index for a general family of alternative bandit processes. The approximation consists of a truncation of the optimization horizon and support for the immediate rewards, an optimal stopping value approximation, and a stochastic approximation procedure. Finite-time error bounds are given for the three approximations, leading to a procedure to construct a confidence interval for the Gittins index using a finite number of Monte Carlo samples as well as an epsilon-optimal policy for the family of alternative bandit processes. Proofs are given for almost sure convergence and a central limit theorem for the sampling-based Gittins index approximation. In a numerical study, the quality of the approximation is verified for the Bernoulli bandit and the Gaussian bandit with known variance, and the method is shown to significantly outperform Thompson sampling and the Bayesian upper-confidence-bound algorithms for a novel random effects multi-armed bandit.
- 19 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
A Sampling-Based Gittins Index Approximation
A sampling-based method is introduced to approximate the Gittins index for a general family of alternative bandit processes. The approximation consists of a truncation of the optimization horizon and support for the immediate rewards, an optimal stopping value approximation, and a stochastic approximation procedure. Finite-time error bounds are given for the three approximations, leading to a procedure to construct a confidence interval for the Gittins index using a finite number of Monte Carlo samples as well as an epsilon-optimal policy for the family of alternative bandit processes. Proofs are given for almost sure convergence and a central limit theorem for the sampling-based Gittins index approximation. In a numerical study, the quality of the approximation is verified for the Bernoulli bandit and the Gaussian bandit with known variance, and the method is shown to significantly outperform Thompson sampling and the Bayesian upper-confidence-bound algorithms for a novel random effects multi-armed bandit.
- Open Access
- 19 January 2026
- Published by SAGE Publications in Statistical Methods in Medical Research
- Vol. 35 (11) , 2320-2340
A burn-in(g) question: How long should an initial equal randomization stage be before Bayesian response-adaptive randomization?
Response-adaptive randomization (RAR) can increase participant benefit in clinical trials, but also complicates statistical analysis. The burn-in period—a non-adaptive initial stage—is commonly used to mitigate this disadvantage, yet guidance on its optimal duration is scarce. To address this critical gap, this paper introduces an exact evaluation approach to investigate how the burn-in length impacts statistical operating characteristics of two-arm binary Bayesian RAR (BRAR) designs. We show that (1) commonly used calibration and asymptotic tests show substantial type I error rate inflation for BRAR designs without a burn-in period, and increasing the total burn-in length to more than half the trial size reduces but does not fully mitigate type I error rate inflation, necessitating exact tests; (2) exact tests conditioning on total successes show the highest average and minimum power up to large burn-in lengths; (3) the burn-in length substantially influences power and participant benefit, which are often not maximized at the maximum or minimum possible burn-in length; (4) the test statistic influences the type I error rate and power; (5) estimation bias decreases quicker in the burn-in length for larger treatment effects and increases for larger trial sizes under the same burn-in length. Our approach is illustrated by re-designing the ARREST trial.
- 19 January 2026
- Published by SAGE Publications in Statistical Methods in Medical Research
- Vol. 35 (11) , 2320-2340
Open AccessA burn-in(g) question: How long should an initial equal randomization stage be before Bayesian response-adaptive randomization?
Response-adaptive randomization (RAR) can increase participant benefit in clinical trials, but also complicates statistical analysis. The burn-in period—a non-adaptive initial stage—is commonly used to mitigate this disadvantage, yet guidance on its optimal duration is scarce. To address this critical gap, this paper introduces an exact evaluation approach to investigate how the burn-in length impacts statistical operating characteristics of two-arm binary Bayesian RAR (BRAR) designs. We show that (1) commonly used calibration and asymptotic tests show substantial type I error rate inflation for BRAR designs without a burn-in period, and increasing the total burn-in length to more than half the trial size reduces but does not fully mitigate type I error rate inflation, necessitating exact tests; (2) exact tests conditioning on total successes show the highest average and minimum power up to large burn-in lengths; (3) the burn-in length substantially influences power and participant benefit, which are often not maximized at the maximum or minimum possible burn-in length; (4) the test statistic influences the type I error rate and power; (5) estimation bias decreases quicker in the burn-in length for larger treatment effects and increases for larger trial sizes under the same burn-in length. Our approach is illustrated by re-designing the ARREST trial.
- Open Access
- 2 September 2025
- Published by Springer Nature in Annals of Operations Research
- p. 1-51
Constrained Markov decision processes for response-adaptive procedures in clinical trials with binary outcomes
A constrained Markov decision process (CMDP) approach is developed to construct response-adaptive procedures in clinical trials with binary outcomes. The resulting CMDP class of Bayesian response-adaptive procedures can target a certain objective, such as maximizing expected treatment outcomes, while using constraints to control other operating characteristics such as the type I error rate. The constraints can be formulated under different priors, enforcing control of trial operating statistics given that the parameters lie in a specific part of the parameter space (e.g., following from a statistical hypothesis). A solution method is developed to find an optimal policy, while we propose a computationally efficient method based on a cutting plane algorithm that uses backward recursion at every iteration, yielding a feasible policy accompanied by a respective optimality gap. In three applications, we impose constraints on the Bayesian average (i.e., a priori expected) type I error rate, power, and mean-squared error, and a constraint on prior robustness. Comparison of the constructed CMDP procedures with the constrained randomized dynamic programming procedure shows a stronger frequentist type I error control and similar performance in the other operating characteristics when constraining the Bayesian average type I error rate, power, and mean-squared error, whereas CMDP additionally shows substantial outperformance in terms of expected treatment outcomes when only constraining the type I error rate and power. The third application shows that the CMDP approach provides a previously unexplored way to construct response-adaptive procedures with a desired degree of robustness to prior misspecification in terms of expected treatment outcomes.
- 2 September 2025
- Published by Springer Nature in Annals of Operations Research
- p. 1-51
Open AccessConstrained Markov decision processes for response-adaptive procedures in clinical trials with binary outcomes
A constrained Markov decision process (CMDP) approach is developed to construct response-adaptive procedures in clinical trials with binary outcomes. The resulting CMDP class of Bayesian response-adaptive procedures can target a certain objective, such as maximizing expected treatment outcomes, while using constraints to control other operating characteristics such as the type I error rate. The constraints can be formulated under different priors, enforcing control of trial operating statistics given that the parameters lie in a specific part of the parameter space (e.g., following from a statistical hypothesis). A solution method is developed to find an optimal policy, while we propose a computationally efficient method based on a cutting plane algorithm that uses backward recursion at every iteration, yielding a feasible policy accompanied by a respective optimality gap. In three applications, we impose constraints on the Bayesian average (i.e., a priori expected) type I error rate, power, and mean-squared error, and a constraint on prior robustness. Comparison of the constructed CMDP procedures with the constrained randomized dynamic programming procedure shows a stronger frequentist type I error control and similar performance in the other operating characteristics when constraining the Bayesian average type I error rate, power, and mean-squared error, whereas CMDP additionally shows substantial outperformance in terms of expected treatment outcomes when only constraining the type I error rate and power. The third application shows that the CMDP approach provides a previously unexplored way to construct response-adaptive procedures with a desired degree of robustness to prior misspecification in terms of expected treatment outcomes.
- Open Access
- 6 August 2024
- Published by Elsevier in Journal of Multivariate Analysis
- Vol. 204
Bayesian covariance structure modeling of interval-censored multi-way nested survival data
- 6 August 2024
- Published by Elsevier in Journal of Multivariate Analysis
- Vol. 204
Open AccessBayesian covariance structure modeling of interval-censored multi-way nested survival data
- Open Access
A Sampling-Based Method for Gittins Index Approximation
A sampling-based method is introduced to approximate the Gittins index for a general family of alternative bandit processes. The approximation consists of a truncation of the optimization horizon and support for the immediate rewards, an optimal stopping value approximation, and a stochastic approximation procedure. Finite-time error bounds are given for the three approximations, leading to a procedure to construct a confidence interval for the Gittins index using a finite number of Monte Carlo samples, as well as an epsilon-optimal policy for the Bayesian multi-armed bandit. Proofs are given for almost sure convergence and convergence in distribution for the sampling based Gittins index approximation. In a numerical study, the approximation quality of the proposed method is verified for the Bernoulli bandit and Gaussian bandit with known variance, and the method is shown to significantly outperform Thompson sampling and the Bayesian Upper Confidence Bound algorithms for a novel random effects multi-armed bandit.
Open AccessA Sampling-Based Method for Gittins Index Approximation
A sampling-based method is introduced to approximate the Gittins index for a general family of alternative bandit processes. The approximation consists of a truncation of the optimization horizon and support for the immediate rewards, an optimal stopping value approximation, and a stochastic approximation procedure. Finite-time error bounds are given for the three approximations, leading to a procedure to construct a confidence interval for the Gittins index using a finite number of Monte Carlo samples, as well as an epsilon-optimal policy for the Bayesian multi-armed bandit. Proofs are given for almost sure convergence and convergence in distribution for the sampling based Gittins index approximation. In a numerical study, the approximation quality of the proposed method is verified for the Bernoulli bandit and Gaussian bandit with known variance, and the method is shown to significantly outperform Thompson sampling and the Bayesian Upper Confidence Bound algorithms for a novel random effects multi-armed bandit.