paper-with-me

Papers

A Biologically Plausible Benchmark for Contextual Bandit Algorithms in Precision Oncology Using in vitro Data

2019-11-11 · Niklas T. Rindtorff, MingYu Lu, Nisarg A. Patel, Huahua Zheng, Alexander D'Amour

Precision oncology, the genetic sequencing of tumors to identify druggable targets, has emerged as the standard of care in the treatment of many cancers. Nonetheless, due to the pace of therapy development and variability in patient information, designing effective protocols for individual treatment assignment in a sample-efficient way remains a major challenge. One promising approach to this problem is to frame precision oncology treatment as a contextual bandit problem and to apply sequential decision-making algorithms designed to minimize regret in this setting. However, a clear prerequisite for considering this methodology in high-stakes clinical decisions is careful benchmarking to understand realistic costs and benefits. Here, we propose a benchmark dataset to evaluate contextual bandit algorithms based on real in vitro drug response of approximately 900 cancer cell lines. Specifically, we curated a dataset of complete treatment responses for a subset of 7 treatments from prior in vitro studies. This allows us to compute the regret of proposed decision policies using biologically plausible counterfactuals. We ran a suite of Bayesian bandit algorithms on our benchmark, and found that the methods accumulate less regret over a sequence of treatment assignment tasks than a rule-based baseline derived from current clinical practice. This effect was more pronounced when genomic information was included as context. We expect this work to be a starting point for evaluation of both the unique structural requirements and ethical implications for real-world testing of bandit based clinical decision support.

📄 PDF Abstract BibTeX arXiv:1911.04389

Code (1)

NiklasTR/oncoassign 공식 구현

Tasks

BenchmarkingDecision MakingSequential Decision Making

Similar Papers 제목 키워드 기반

HTMRL: Biologically Plausible Reinforcement Learning with Hierarchical Temporal Memory

2020-09-18 · Jakob Struye, Kevin Mets, Steven Latré

Building Reinforcement Learning (RL) algorithms which are able to adapt to continuously evolving tasks is an open research challenge. One technology that is known to inherently handle such non-stationary input patterns w…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Biologically-plausible learning algorithms can scale to large datasets

2018-11-08 · ICLR 2019 5 · Will Xiao, Honglin Chen, Qianli Liao, Tomaso Poggio

The backpropagation (BP) algorithm is often thought to be biologically implausible in the brain. One of the main reasons is that BP requires symmetric weight matrices in the feedforward and feedback pathways. To address …

Biologically-plausible Training

Biologically-Plausible Determinant Maximization Neural Networks for Blind Separation of Correlated Sources

2022-09-27 · Bariscan Bozkurt, Cengiz Pehlevan, Alper T. Erdogan

Extraction of latent sources of complex stimuli is critical for making sense of the world. While the brain solves this blind source separation (BSS) problem continuously, its algorithms remain unknown. Previous work on b…

blind source separation

Towards Biologically Plausible Computing: A Comprehensive Comparison

2024-06-23 · Changze Lv, Yufei Gu, Zhengkang Guo, Zhibo Xu 외

Backpropagation is a cornerstone algorithm in training neural networks for supervised learning, which uses a gradient descent method to update network weights by minimizing the discrepancy between actual and desired outp…

Biologically-plausible Training

Beyond accuracy: generalization properties of bio-plausible temporal credit assignment rules

2022-06-02 · Yuhan Helena Liu, Arna Ghosh, Blake A. Richards, Eric Shea-Brown 외

To unveil how the brain learns, ongoing work seeks biologically-plausible approximations of gradient descent algorithms for training recurrent neural networks (RNNs). Yet, beyond task accuracy, it is unclear if such lear…

Learning Theory