Pith. sign in

REVIEW 3 cited by

Bandit Algorithms for Precision Medicine

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2108.04782 v1 pith:KNV3ILLV submitted 2021-08-10 stat.ML cs.LG

classification stat.MLcs.LG
keywords algorithmsbanditmedicineprecisionhealthmobileadvancesbeen
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The Oxford English Dictionary defines precision medicine as "medical care designed to optimize efficiency or therapeutic benefit for particular groups of patients, especially by using genetic or molecular profiling." It is not an entirely new idea: physicians from ancient times have recognized that medical treatment needs to consider individual variations in patient characteristics. However, the modern precision medicine movement has been enabled by a confluence of events: scientific advances in fields such as genetics and pharmacology, technological advances in mobile devices and wearable sensors, and methodological advances in computing and data sciences. This chapter is about bandit algorithms: an area of data science of special relevance to precision medicine. With their roots in the seminal work of Bellman, Robbins, Lai and others, bandit algorithms have come to occupy a central place in modern data science ( Lattimore and Szepesvari, 2020). Bandit algorithms can be used in any situation where treatment decisions need to be made to optimize some health outcome. Since precision medicine focuses on the use of patient characteristics to guide treatment, contextual bandit algorithms are especially useful since they are designed to take such information into account. The role of bandit algorithms in areas of precision medicine such as mobile health and digital phenotyping has been reviewed before (Tewari and Murphy, 2017; Rabbi et al., 2019). Since these reviews were published, bandit algorithms have continued to find uses in mobile health and several new topics have emerged in the research on bandit algorithms. This chapter is written for quantitative researchers in fields such as statistics, machine learning, and operations research who might be interested in knowing more about the algorithmic and mathematical details of bandit algorithms that have been used in mobile health.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Faster Rates for Private Adversarial Bandits

    cs.LG 2025-05 conditional novelty 8.0 of 10

    By batching losses and using heavy-tailed bandit algorithms, any non-private adversarial bandit algorithm can be made epsilon-differentially private with regret O(sqrt(KT)/sqrt(epsilon)), and the first private expert-...

  2. Decentralized Relaxed Smooth Optimization with Gradient Descent Methods

    math.OC 2025-08 unverdicted novelty 6.0 of 10

    A decentralized gradient descent method with adaptive clipping is claimed to reach best-known convergence rates for convex and nonconvex problems under (L0,L1)-smoothness without knowing the constants.

  3. Non-Linear Model-Based Sequential Decision-Making in Agriculture

    stat.ML 2025-09 reject novelty 4.0 of 10

    Nonlinear mechanistic yield models inside epsilon-greedy, UCB, and ViOlin bandits are proposed for fertilizer decisions, but the main theoretical guarantee rests on a false mathematical bound and a promised real-data ...

Pith tools