Evidence map›Paper›PMID 30799874›Full record

ArticleBiometrika2018

Targeted learning ensembles for optimal individualized treatment rules with time-to-event outcomes.

I Díaz, O Savenkov, K Ballman

Abstract read
In one paragraph

Article in Biometrika, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

0numbers the graph read from it
0cells of the map it votes in
9citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

9 citing papers in PubMed.

  1. Article
  2. AUGMENTED DOUBLY ROBUST POST-IMPUTATION INFERENCE FOR PROTEOMIC DATA.bioRxiv : the preprint server for biology · 2025
    Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. When the Ends do not Justify the Means: Learning Who is Predicted to Have Harmful Indirect Effects.Journal of the Royal Statistical Society. Series A, (Statistics in Society) · 2022
    Article
  8. Article
  9. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

I DíazDivision of Biostatistics, Weill Cornell Medicine, 402 East 67th Street, New York, New York, U.S.A.
O SavenkovDivision of Biostatistics, Weill Cornell Medicine, 402 East 67th Street, New York, New York, U.S.A.
K BallmanDivision of Biostatistics, Weill Cornell Medicine, 402 East 67th Street, New York, New York, U.S.A.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

We consider estimation of an optimal individualized treatment rule when a high-dimensional vector of baseline variables is available. Our optimality criterion is with respect to delaying the expected time to occurrence of an event of interest. We use semiparametric efficiency theory to construct estimators with properties such as double robustness. We propose two estimators of the optimal rule, which arise from considering two loss functions aimed at directly estimating the conditional treatment effect and recasting the problem in terms of weighted classification using the 0-1 loss function. Our estimated rules are ensembles that minimize the crossvalidated risk of a linear combination in a user-supplied library of candidate estimators. We prove oracle inequalities bounding the finite-sample excess risk of the estimator. The bounds depend on the excess risk of the oracle selector and a doubly robust term related to estimation of the nuisance parameters. We discuss the convergence rates of our estimator to the oracle selector, and illustrate our methods by analysis of a phase III randomized study testing the efficacy of a new therapy for the treatment of breast cancer.

Indexed as

Double robustnessIndividualized treatment ruleOracle inequalitySuper-learning

Identifiers

PMID30799874
PMCPMC6374011

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.