Value of Information Concept Note - EVPI, EVPPI and EVSI

Summary

Concept note, no raw source. The value-of-information hierarchy is : the value of a specific finite study, of perfectly learning a parameter subset, and of perfectly learning everything. Subtract a study’s cost from EVSI to get the expected net benefit of sampling (ENBS). A closed form for a normal prior and normal data is verified numerically below.

Overview

Heath, Manolopoulou and Baio (2015) cover EVPI and EVPPI computation (Heath 2015 - Net Benefit, EVPI and EVPPI Definitions); EVSI is introduced in the same literature (Ades, Lu and Claxton 2004; Raiffa and Schlaifer 1961 for the decision-theoretic roots; Strong, Oakley and Brennan 2014 and Heath et al. for modern computation). This note states the definitions and an analytic case. Marked as a concept note: formulas are standard, derivations are this vault’s.

Main Content

EVPI

: the expected gain from knowing exactly before deciding. It is the most any study, model or forecast could ever be worth.

EVPPI

for a parameter subset (Heath 2015 - Regression-Based EVPPI (GAM and Gaussian Process) gives the regression estimator).

EVSI

For a planned study producing data from ,

The outer expectation is over the preposterior distribution of the data. Expected net benefit of sampling: ; run the study iff , and choose the sample size maximising it.

Hierarchy

For any study informative about : . Sketch. Data about gives posterior expectations that are conditional expectations of given ; by the convexity of (Jensen), averaging first and then maximising cannot beat maximising with known, which in turn cannot beat maximising pointwise. Non-negativity by Jensen in the other direction.

Closed form: two options, normal prior, normal data

Let the incremental net benefit of option 1 over option 0 be and data . The posterior variance is and the posterior mean is, preposteriorly, with . Then

Proof. The decision after the study is option 1 iff , so the value is for ; subtract the no-study value . EVPI is the limit ().

Examples

Verified numbers (, , ): EVPI .

observationsEVSI closed formEVSI Monte CarloShare of EVPI
10.3330.4080.05500.055335%
40.1670.5770.11070.110571%
160.05560.6670.14240.143591%
640.01520.6960.15320.151898%

Diminishing returns in are the reason ENBS has an interior optimum: if each observation costs , choose where the marginal EVSI equals .

import numpy as np
from scipy import stats
def emax(m, s): return s*stats.norm.pdf(m/s) + m*stats.norm.cdf(m/s)
def evsi_normal(m, s02, sig2, n):
    s1 = 1/(1/s02 + n/sig2); tau = np.sqrt(s02 - s1)
    return emax(m, tau) - max(m, 0)

PyMC-style sketch (untested) for non-conjugate EVSI: simulate from prior draws, summarise by a statistic, regress on that statistic (the regression-EVPPI trick applied to the data summary; Strong et al. 2015 EVSI by regression, Heath et al. moment matching), and apply the five-step formula of Heath 2015 - Regression-Based EVPPI (GAM and Gaussian Process).

Connections

See Also

Sources

  • Raiffa and Schlaifer (1961), Applied Statistical Decision Theory. Ades, Lu and Claxton (2004), Med Decis Making 24:207-227. Strong, Oakley and Brennan (2014), Med Decis Making 34:311-326. Strong, Oakley, Brennan and Breeze (2015), EVSI by regression, Med Decis Making 35:570-583 (citation from memory; verify). Heath, Manolopoulou and Baio, EVSI by moment matching (arXiv:1611.01373). Closed form derived here.