Pith. Sign in

RECORD

Dynamic Measurement Scheduling for Event Forecasting using Deep RL

Machine Learning · Submitted 24 Jan 2019

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In a real-world ICU mortality prediction task (MIMIC3), our policies reduce the total number of measurements by $31\%$ or improve predictive gain by a factor of $3$ as compared to physicians, under the off-policy policy evaluation.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1901.09699 (version 3)
Pith ID2SI2WXVX, Pith's permanent record of this paper and its review
CitationAnna Goldenberg, Chun-Hao Chang, Mingjie Mai. "Dynamic Measurement Scheduling for Event Forecasting using Deep RL." arXiv:1901.09699 (2019). https://pith.science/paper/2SI2WXVX
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,449 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.19 · human participants 0.70 · controlled comparison 0.88 · randomized assignment 0.02 · states quantitative result 0.98 · compares with prior results 0.97 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v3. Results and the main claim are underlined; .

Imagine a patient in critical condition. What and when should be measured to forecast detrimental events, especially under the budget constraints? We answer this question by deep reinforcement learning (RL) that jointly minimizes the measurement cost and maximizes predictive gain, by scheduling strategically-timed measurements. We learn our policy to be dynamically dependent on the patient's health history. To scale our framework to exponentially large action space, we distribute our reward in a sequential setting that makes the learning easier. In our simulation, our policy outperforms heuristic-based scheduling with higher predictive gain and lower cost. In a real-world ICU mortality prediction task (MIMIC3), our policies reduce the total number of measurements by $31\%$ or improve predictive gain by a factor of $3$ as compared to physicians, under the off-policy policy evaluation.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Imagine a patient in critical condition. background 1.00 0.03 0.01 unclear 0.83
s1 What and when should be measured to forecast detrimental events, especially under the budget constraints? background 0.79 0.04 0.02 unclear 0.98
s2 We answer this question by deep reinforcement learning (RL) that jointly minimizes the measurement cost and maximizes predictive gain, by scheduling strategically-timed measurements. method 0.56 0.93 0.35 asserted 1.00
s3 We learn our policy to be dynamically dependent on the patient's health history. method 0.94 0.92 0.06 asserted 1.00
s4 To scale our framework to exponentially large action space, we distribute our reward in a sequential setting that makes the learning easier. method 0.96 0.91 0.04 asserted 1.00
s5 In our simulation, our policy outperforms heuristic-based scheduling with higher predictive gain and lower cost. result 1.00 0.95 0.23 asserted 1.00
s6 In a real-world ICU mortality prediction task (MIMIC3), our policies reduce the total number of measurements by $31\%$ or improve predictive gain by a factor of $3$ as compared to physicians, under the off-policy policy evaluation. result 1.00 0.95 0.64 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.56.

What was examined, and what was not

sources read
  • arXiv listing abstract v3
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Imagine a patient in critical condition. What and when should be measured to forecast detrimental events, especially under the budget constraints? We answer this question by deep reinforcement learning (RL) that jointly minimizes the measurement cost and maximizes predictive gain, by scheduling strategically-timed measurements. We learn our policy to be dynamically dependent on the patient's health history. To scale our framework to exponentially large action space, we distribute our reward in a sequential setting that makes the learning easier. In our simulation, our policy outperforms heuristic-based scheduling with higher predictive gain and lower cost. In a real-world ICU mortality prediction task (MIMIC3), our policies reduce the total number of measurements by $31\%$ or improve predictive gain by a factor of $3$ as compared to physicians, under the off-policy policy evaluation.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 8 sentences without a confident label

Uses the method or tool of 2 papers
  • We use regression-based estimator [ref] to estimate the values of physician and our learned policies using physician collected data.

    Doubly Robust Off-policy Value Evaluation for Reinforcement Learning · Off-Policy Policy Evaluation (OPPE) · 0.92

  • Dueling DQN factorizes the computation of Q-value into value stream and advantage stream [ref] , i.e. [equation] where $ξ$, $η$, and $ψ$ are respectively, the parameters of the shared encoder $f_ξ$ of the value stream $V_η$, and of the advantage stream $A_ψ$ (Figure [ref], Policy Learning).

    Dueling Network Architectures for Deep Reinforcement Learning · Dueling Deep Q Network (DQN) · 0.85

Cites as background 5 papers

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.