Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > stat > arXiv:1911.00878

Help | Advanced Search

Statistics > Computation

arXiv:1911.00878 (stat)
[Submitted on 3 Nov 2019 (v1) , last revised 29 Jul 2020 (this version, v3)]

Title: Bayesian adaptive N-of-1 trials for estimating population and individual treatment effects

Title: 贝叶斯自适应N-of-1试验用于估计群体和个体治疗效果

Authors:S. G. Jagath Senarathne, Antony M. Overstall, James M. McGree
Abstract: This article proposes a novel adaptive design algorithm that can be used to find optimal treatment allocations in N-of-1 clinical trials. This new methodology uses two Laplace approximations to provide a computationally efficient estimate of population and individual random effects within a repeated measures, adaptive design framework. Given the efficiency of this approach, it is also adopted for treatment selection to target the collection of data for the precise estimation of treatment effects. To evaluate this approach, we consider both a simulated and motivating N-of-1 clinical trial from the literature. For each trial, our methods were compared to the multi-armed bandit approach and a randomised N-of-1 trial design in terms of identifying the best treatment for each patient and the information gained about the model parameters. The results show that our new approach selects designs that are highly efficient in achieving each of these objectives. As such, we propose our Laplace-based algorithm as an efficient approach for designing adaptive N-of-1 trials.
Abstract: 本文提出了一种新颖的自适应设计算法,可用于寻找 N-of-1 临床试验中的最优治疗分配。 该新方法使用两次拉普拉斯近似,在重复测量的自适应设计框架内提供人群和个体随机效应的计算高效估计。 鉴于此方法的效率,它也被用于治疗选择,以针对收集数据以精确估计治疗效果。 为了评估这种方法,我们考虑了文献中一个模拟的和激励性的 N-of-1 临床试验。 对于每个试验,我们的方法与多臂老虎机方法和随机化 N-of-1 试验设计在识别每位患者的最佳治疗以及关于模型参数所获得的信息方面进行了比较。 结果显示,我们提出的新方法选择了在实现这些目标方面非常高效的试验设计。 因此,我们建议基于拉普拉斯的算法作为设计自适应 N-of-1 试验的一种高效方法。
Subjects: Computation (stat.CO) ; Methodology (stat.ME)
Cite as: arXiv:1911.00878 [stat.CO]
  (or arXiv:1911.00878v3 [stat.CO] for this version)
  https://doi.org/10.48550/arXiv.1911.00878
arXiv-issued DOI via DataCite

Submission history

From: Jagath Senarathne [view email]
[v1] Sun, 3 Nov 2019 12:53:41 UTC (850 KB)
[v2] Tue, 5 Nov 2019 02:27:53 UTC (850 KB)
[v3] Wed, 29 Jul 2020 03:59:33 UTC (982 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
stat.CO
< prev   |   next >
new | recent | 2019-11
Change to browse by:
stat
stat.ME

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号