SearcharxivSearch

arXiv · 2601.23021

Comparing Bayesian Dynamic Borrowing and Synthetic Control Methods: Apples to Oranges?

Abstract

Bayesian dynamic borrowing (BDB) and synthetic control methods (SCM) are strategies to incorporate historical data in clinical trial design when control recruitment is a challenge. While both methods aim to improve efficiency, they differ in conceptual approach: BDB adjusts borrowing based on prior-data conflict, whereas SCM synthesizes individual-level control outcomes. This study aims to conduct a comparison BDB (using meta-analytic predictive prior (MAP)) and SCM using a case study of Pediatric Atopic Dermatitis. Six historical randomised control trials were selected for use in both the creation of the MAP prior and synthetic control arm. BDB MAP prior produced a mean response rate (historical control response probability) of 0.22 (posterior 95% credible interval: 0.11-0.36) (0.22 and 0.11-0.37 robustified), a power of 0.58, a type 1 error rate of 0.03, bias of 0.0007 (0.0008 robustified), a coverage of 0.96 (0.94 robustified) and prior ESS of 8.9 (3.32 robustified). SCM produced a mean response rate of 0.26 (95% confidence interval: 0.17-0.36), a power of 0.75, type 1 error rate of 0.013, bias of -0.0002, and coverage of 0.97; when adjusted to match the BDB ESS, SCM reported a similar mean response rate (0.27 and 0.13-0.46). a lower power (0.54), type 1 error rate (0.002) and bias(-0.0006), and the same coverage rate (0.97) to the initial SCM results. For this case study, the sample size adjusted SCM model produced a relatively similar power and type 1 error rate to the BDB MAP prior method. However, direct comparisons between these two methods fail to capture the true relationship due to how the data is handled differently and the purpose of each method. Method selection should consider trial-specific constraints, prior-data heterogeneity, and the desired balance between efficiency and robustness.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicole Cizauskas, Foteini Strimenopoulou, Svetlana S. Cherlin, James M. S. Wason. 2026-01-30. Comparing Bayesian Dynamic Borrowing and Synthetic Control Methods: Apples to Oranges?. https://arxiv.org/abs/2601.23021

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Surprise Reduction and Nullification in Bayesian and Inverse Bayesian Inference under Ambiguous Prediction-Error Attribution

In non-stationary environments, prediction errors may signal environmental change or transient outliers, and adaptive systems must track such changes without overreacting to outliers. We distinguish surprise reduction, which updates beliefs to fit observations, from surprise nullification, which weakens constraints imposed by the predictive structure, and formalize both within Bayesian and inverse Bayesian (BIB) inference. Belief and likelihood updates are derived from variational objectives sharing a nullification strength, determined endogenously by minimizing surprise under the candidate post-update predictive distribution. In the Gaussian case, nullification expands belief and likelihood variances by a common factor relative to standard Bayesian updating, leaving the ratio unchanged. BIB thus defers attribution of the prediction error, committing to neither latent-state change nor observation-process uncertainty. The nullification strength is carried over as a candidate and is maintained or released according to the predictive surprise of the next observation. In a mean estimation task with outliers and changepoints, no scanned parameter setting of a Sage-Husa-type adaptive Kalman filter, fixed-strength BIB variant, or belief-forgetting-only variant outperforms BIB in both changepoint tracking and post-outlier stability. An oracle-informed reduced Bayesian model tracks changepoints better but is less stable after outliers. Although BIB maintains no explicit hypotheses about changepoints or outliers, it generates event-dependent dynamics. The learning rate increases after changepoints, whereas after outliers, nullification is released, and this increase is suppressed. Deferring attribution and letting subsequent observations differentiate the responses may constitute a principle of adaptive inference in non-stationary environments.

stat.ME

Generalized Ridge Refitting for the Lasso and Prediction Improvement Bounds

We study a class of Lasso based estimators obtained by applying a quadratic correction on the Lasso equicorrelation set. The penalty matrix determines both the magnitude and geometry of the correction and contains, among other cases, the isotropic Lasso--Ridge correction, least squares refitting, Gram proportional interpolation between the Lasso and least squares, and coordinate specific penalties. We first derive a closed form representation and isolate the positive gain component of the resulting prediction improvement. We then control the remaining stochastic linear term in expectation by localizing the random signed equicorrelation model around a deterministic reference support. This yields a finite sample expectation bound that explicitly accounts for the randomness induced by Lasso model selection. The resulting decomposition provides a unified framework for understanding when Lasso based quadratic corrections can improve prediction.

stat.ME

Discretization in covariate-adaptive randomization: gains and losses

Covariate-adaptive randomization(CAR) is widely implemented in clinical trials to balance prognostic covariates across treatment arms. Continuous covariates are often discretized into strata in practice, yet their consequences are not clearly understood. This paper provides a comprehensive study of the impact of discretization on both the CAR design process and the inferential results thereafter. We establish the asymptotic properties of both imbalance measures and treatment effect estimators under discretized and non-discretized settings. Practical recommendations are given on when and how discretization should be employed. We show that discretization in design is generally recommended, as it enhances robustness against model misspecification. However, if the true model is known, the most efficient strategy is to balance covariates according to that model in the design. The theoretical results are corroborated by extensive simulation studies and an empirical application to a diabetes trial dataset. Together, the results clarify the gains and losses of discretization in CAR and pave the way for learning impact of discretization to other designs and beyond.

stat.ME