Predicted Information Gain

• Predicted Information Gain is a metric that estimates expected information yield before an observation by evaluating anticipated entropy reduction or mutual information.
• It is applied in domains like multi-robot exploration, active learning, and Gaussian process design to rank candidate queries, experiments, and paths under uncertainty.
• Computational approximations and normalization techniques are essential to align raw gain estimates with practical objectives and mitigate bias in decision-making.

Searching arXiv for recent and relevant papers on predicted information gain across domains. arXiv search: "predicted information gain" Predicted Information Gain denotes a family of pre-action criteria that estimate, before an observation is acquired, how much useful information a candidate query, measurement, path, action, or experiment is expected to produce. The term is not tied to a single formalism. In different literatures it appears as expected entropy reduction over an occupancy map, expected reduction of predictive entropy on an evaluation set, mutual information between future observations and a hidden variable, log-determinant information gain in Gaussian process design, and even a local log-likelihood advantage used to score predicted posteriors. What unifies these uses is that the quantity is evaluated prospectively and is used to rank choices under uncertainty, often under additional constraints such as path length, delivery time, class imbalance, risk, or computational budget (Kim et al., 12 Apr 2026, Mehta et al., 2022, Smith et al., 2023, Flynn, 5 Oct 2025, Tonks et al., 26 Feb 2026).

1. Core definitions and mathematical forms

A common starting point is entropy reduction. In multi-robot exploration and relaying, if $M$ is a random occupancy-grid map and $D$ denotes observations, information gain is defined as

$\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$

with occupancy-grid entropy often written as

$$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$

For a planned path $\pi$, predicted information gain is the expectation of this reduction under anticipated observations $D_\pi$; in implementation, this is often instantiated as expected newly visible cells rather than exact entropy (Kim et al., 12 Apr 2026).

In partially observable control, predicted information gain is the expected reduction in belief entropy after an action. With belief $b_t$ over a hidden variable, the criterion is

$$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$

Equivalent mutual-information and expected-$\mathrm{KL}$ forms are also used, making explicit that the quantity measures how much the next observation is expected to reveal about what is hidden (Satsangi et al., 2020).

In active learning, the object of uncertainty is often not the environment but the model’s downstream predictions. For a candidate $x_a$, Expected Information Gain is defined as the expected reduction in predictive entropy on a fixed evaluation set $D$0 after hypothetically labeling $D$1. Prediction-Oriented Bayesian Active Learning sharpens this idea by defining Expected Predictive Information Gain as

$D$2

so that acquisition is aligned with the target input distribution rather than with parameter uncertainty alone (Mehta et al., 2022, Smith et al., 2023).

In Gaussian process regression, predicted information gain for a proposed design $D$3 is the mutual information between observations and latent function values,

$D$4

with spectral form $D$5. Here the gain is a property of a design and a kernel, rather than of a single measurement outcome (Flynn, 5 Oct 2025).

In generative posterior evaluation, Information Gain can be defined cell-wise as

$D$6

where $D$7 is a predicted posterior and $D$8 is a baseline marginal. Its expectation under the true posterior equals $D$9, which makes it a strictly proper scoring rule (Tonks et al., 26 Feb 2026).

Setting	Uncertain object	Typical predicted-gain form
Exploration and relaying	Map or unique payload	Expected entropy reduction or expected coverage along a path
Active learning	Predictive distribution on evaluation inputs	Expected reduction of evaluation-set entropy
Bayesian design / GP regression	Latent function values	$\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$0
Posterior evaluation	Conditional predictive density	$\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$1

These formulations differ in target, conditioning structure, and approximation strategy. A plausible implication is that predicted information gain is better understood as a design pattern—prospective valuation of information under a task-specific uncertainty model—than as a single universal metric.

2. Objective alignment and decision rules

A central issue is that raw information gain is often not the final objective. In Multi-Robot Exploration and Relaying, the relevant quantity is delivered unique information per unit time,

$\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$2

not simply accrued information. PRoID compares an immediate relay with explore-then-relay and triggers relay when the present delivery rate exceeds the predicted future delivery rate by a conservative factor $\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$3. PRoID-Safe multiplies these rates by survival probabilities from a Weibull failure model, so increasing hazard naturally biases decisions toward earlier relay (Kim et al., 12 Apr 2026).

In medical active learning, standard expected information gain can be unreliable under class imbalance because the expectation over candidate labels is dominated by current predictive probabilities. Adapted Expected Information Gain addresses this by weighting class contributions with evaluation-set class frequencies

$\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$4

thereby reweighting expected reduction toward minority classes that matter under the evaluation distribution (Mehta et al., 2022).

Prediction-Oriented Bayesian Active Learning makes objective mismatch explicit. BALD measures information gain about model parameters, whereas EPIG measures information gain in the space of predictions on $\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$5. The distinction matters because parameter-space information can increase on points that are irrelevant to deployment. The paper’s GP example shows that BALD can diverge as labels are acquired at extreme inputs while predictive information gain on $\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$6 vanishes (Smith et al., 2023).

The same issue appears in exploration. In quality-constrained exploration, where completion to a target coverage level is the objective, total gain at completion is “essentially constant.” The paper “Information Gain Is Not All You Need” argues that maximizing gain per step is then a mismatched objective that creates “frontier debt” and later backtracking. It proposes using information gain only to filter viable candidates, while selection is driven by “distance advantage,” a heuristic that prefers isolated frontiers before their cheap visitation opportunities disappear (Ericson et al., 28 Mar 2025).

Across these cases, predicted information gain remains useful, but only after the quantity is normalized, weighted, discounted, or filtered to reflect the operational target: delivery, prediction, completion, or risk.

3. Estimation strategies and computational approximations

Exact computation of predicted information gain is usually prohibitive. The major literatures therefore rely on structured approximations.

In active learning for medical image classification, exact EIG or AEIG would require retraining the model for each candidate and each possible label. The practical approximation uses the validation set as $\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$7, updates only the classifier head, and estimates each hypothetical label effect by a single gradient step. The per-candidate cost is $\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$8 forward computation, plus a small backward pass on the classifier head. Reported per-image score times were approximately $\mathrm{IG}(D; M) \triangleq H(M) - H(M \mid D),$9 ms for Random, $$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$0 ms for Entropy, $$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$1 ms for MCD-Entropy, $$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$2 ms for MCD-BALD, and $$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$3 ms for AEIG (Mehta et al., 2022).

In partially observable RL, one route is to avoid explicit belief inference altogether. The prediction-reward construction in “Maximizing Information Gain in Partially Observable Environments via Prediction Reward” shows that maximizing a convex function of belief, including negative entropy, can be lower-bounded by maximizing an expected prediction reward. For negative entropy, the paper gives an exact error formula between $$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$4 and the surrogate $$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$5, as well as a uniform bound. Deep Anticipatory Networks exploit this to learn information-seeking behavior with supervised prediction and DQN-style control, rather than by explicitly estimating future belief entropy (Satsangi et al., 2020).

In exploration, predicted map completion and raycasting dominate. PRoID uses learned map prediction $$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$6, ensemble uncertainty, and probabilistic raycasting to estimate $$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$7; the complexity of prediction-based gain is $$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$8, where $$H(M) = -\sum_i \left[p_i \log p_i + (1-p_i)\log(1-p_i)\right].$$9 is ensemble size, $\pi$0 is the number of sampled path points, and $\pi$1 is the number of hypothetical rays (Kim et al., 12 Apr 2026). PIPE replaces discrete waypoint scoring with pathwise visibility $\pi$2, computed by probabilistic ray termination and a single flood-fill over a polygon union. This reduces frontier evaluation time by up to $\pi$3 on large maps (2503.07504). MapEx similarly estimates visibility from the ensemble mean predicted map and weights it by pixelwise variance; its probabilistic ray accumulation stops when cumulative occupancy reaches $\pi$4 (Ho et al., 2024).

In GP regression, some settings remain analytically tractable. The log-determinant information gain can be computed by Cholesky factorization, eigendecomposition, stochastic trace estimation, or low-rank approximations such as Nyström and inducing-point methods (Flynn, 5 Oct 2025).

Even in classical tree induction, estimator bias changes predicted-gain rankings. The paper “Improved Information Gain Estimates for Decision Tree Induction” shows that maximum-likelihood entropy is biased downward in classification and that the usual multivariate normal plug-in entropy is biased in regression. It advocates the Grassberger entropy estimator for classification and the Kozachenko–Leonenko $\pi$5-NN estimator for differential entropy in regression (Nowozin, 2012).

4. Robotics and autonomous exploration

Robotics has produced some of the most operational forms of predicted information gain because decisions must combine geometry, sensing, timing, communication, and failure.

PRoID addresses Multi-Robot Exploration and Relaying, where robots must both explore and deliver acquired information to a base station before a mission deadline. Unique information is defined by excluding already reported and delegated cells, and the relay decision compares immediate return against explore-then-return. Team knowledge $\pi$6 matters because relayed or delegated regions shrink the unique payload. PRoID-Safe introduces survival weighting through a Weibull model with $\pi$7 and $\pi$8 in the failure scenarios. In no-failure experiments, PRoID outperformed the best periodic baseline ($\pi$9) by $D_\pi$0, $D_\pi$1, $D_\pi$2, and $D_\pi$3 percentage points for team sizes $D_\pi$4. In ablations with $D_\pi$5, removing relay handoff reduced coverage from $D_\pi$6 to $D_\pi$7, and removing trajectory or plan sharing reduced it to $D_\pi$8. The exploration-bias parameter $D_\pi$9 gave the best trade-off in the reported study (Kim et al., 12 Apr 2026).

PIPE Planner moves from pointwise to pathwise predicted information gain. Instead of scoring only the destination frontier, it integrates predicted visibility over the entire A* path and weights cells by ensemble variance $b_t$0,

$b_t$1

The method uses a probabilistic raycast stopping rule $b_t$2 with threshold $b_t$3, which reduces the overestimation typical of naive pathwise gain. On KTH floor plans, PIPE achieved the highest IoU AUC across small, medium, and large maps and was the only method with $b_t$4 failure rate at both $b_t$5 and $b_t$6 IoU across all map sizes (2503.07504).

MapEx takes a viewpoint-based variant of the same idea. It predicts a global map ensemble $b_t$7, computes the mean map $b_t$8 and variance map $b_t$9, builds a probabilistic visibility mask $$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$0 for each frontier cell $$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$1, and defines

$$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$2

Experiments on KTH floor plans reported average improvements of $$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$3 over representative map-prediction-based exploration and $$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$4 over nearest frontier (Ho et al., 2024).

A different line makes frontier gain differentiable. “Frontier-based Automatic-differentiable Information Gain Measure for Robotic Exploration of Unknown 3D Environments” replaces hard visible-frontier counts with a fuzzy soft count $$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$5, retaining hard occlusion but smoothing range and frustum membership. This allows automatic differentiation of path-level frontier gain and joint optimization with path length. Reported full-exploration results showed information-gain increases of $$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$6, $$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$7, and $$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$8 in storage room, lab, and factory environments, with corresponding path-length reductions of $$\mathrm{IG}(a \mid b_t) = H(b_t) - \mathbb{E}_{o \sim p(o \mid a, b_t)}[H(b_{t+1})].$$9, $\mathrm{KL}$0, and $\mathrm{KL}$1 (Deng et al., 2020).

These systems also expose a recurrent tension. Predicted information gain can improve exploration when it models actual sensor coverage, delivery, or risk, but it can be counterproductive when it is optimized greedily against a mismatched end objective.

5. Active learning, prediction-oriented acquisition, and posterior evaluation

In active learning, predicted information gain has shifted from parameter-centric criteria toward prediction-centric ones.

For medical image classification, EIG ranks an unlabeled image by the expected reduction in predictive entropy on a fixed evaluation set after that image is labeled. AEIG modifies the expectation by multiplying candidate-label probabilities by class-frequency weights from the evaluation set, which makes the acquisition more sensitive to class imbalance. On diabetic retinopathy, AEIG achieved about $\mathrm{KL}$2 of all-labeled performance with only about $\mathrm{KL}$3 of the training data; Random and CoreSet required about $\mathrm{KL}$4, while Entropy and MCD-BALD required about $\mathrm{KL}$5. On ISIC skin lesions, AEIG reached about $\mathrm{KL}$6 of all-labeled performance with about $\mathrm{KL}$7 labeled, while Random required about $\mathrm{KL}$8, Entropy about $\mathrm{KL}$9, CoreSet about $x_a$0, MCD-Entropy about $x_a$1, and MCD-BALD about $x_a$2 (Mehta et al., 2022).

EPIG generalizes this prediction orientation in Bayesian active learning. Rather than maximizing information about $x_a$3, it maximizes expected predictive information about future labels $x_a$4 at inputs $x_a$5. The method is motivated by examples in which BALD prioritizes outliers that reduce parameter uncertainty but do not improve predictive performance on the target distribution. Across synthetic, UCI, and MNIST variants, EPIG was reported to produce stronger predictive performance than BALD and to function as a “drop-in replacement” (Smith et al., 2023).

Predicted information gain also appears as an evaluation criterion, not only as an acquisition rule. In virtual staining, per-cell IG is the log-likelihood advantage of a predicted posterior over a baseline marginal. Because

$x_a$6

the expected score is uniquely maximized by the true posterior, making IG a strictly proper scoring rule. In the reported HTS evaluation, IG revealed substantial conditional differences between a conditional DDPM and Pix2PixHD that marginal and rank-based metrics did not. Representative feature-wise mean differences ranged from about $x_a$7 to $x_a$8 nats per cell, with the largest gains on intensity features (Tonks et al., 26 Feb 2026).

A related lesson appears in tree induction. Decision trees choose splits by estimated information gain, but the estimated gain can be systematically biased. Replacing naive plug-in entropy estimates with improved estimators yielded better split selection and better trees, especially in multiclass settings and probabilistic regression (Nowozin, 2012).

6. Sequential control, dynamical systems, and theoretical extensions

Outside exploration and active learning, predicted information gain has been extended into sequential representation learning, parameter identifiability, kernel complexity, quantum measurement, and language representation.

In partially observable RL, the basic form remains expected belief-entropy reduction, but the practical question is how to optimize it. Deep Anticipatory Networks learn a policy $x_a$9 and predictor $D$00 so that the policy selects actions that improve prediction accuracy, which lower-bounds negative entropy and approximates information gain without explicit belief updates. The approach improved sensor selection for tracking and discrete attention tasks; the paper emphasized that continuous reward formulation was important for tracking performance (Satsangi et al., 2020).

A different RL perspective treats predictive information itself as the target. PI-SAC uses the mutual information between past and future,

$D$01

as an auxiliary objective for representation learning through a contrastive Conditional Entropy Bottleneck. On DM Control, PI-SAC matched or exceeded baselines on all nine reported tasks and was the most sample-efficient system-to-system in the study (Lee et al., 2020).

In dynamical systems, Information Sensitivity Functions track cumulative and incremental parameter information over time using only classical sensitivity functions. With a standardized Gaussian prior, the joint information gain after measurements up to $D$02 is

$D$03

and the incremental contribution of a new measurement is

$D$04

The framework was used to localize informative time intervals, diagnose identifiability, and quantify posterior correlations among parameters (Pant, 2017).

In GP regression, Relative Information Gain

$D$05

measures the sensitivity of information gain to observation noise. It interpolates between standard information gain and effective dimension, shares the growth rate of the effective dimension, and appears naturally as the complexity term in a PAC-Bayesian excess-risk bound (Flynn, 5 Oct 2025).

Quantum variants reinterpret information gain through coherent information. In quantum measurement, the information gained by the apparatus is equal to the coherent information $D$06, and for a pure system state it is upper-bounded by the initial relative entropy of coherence $D$07. In quantum tomography of a kicked top, information gain is linked to the log-determinant of the Fisher information matrix, and higher chaoticity increases information gain and reconstruction fidelity (Sharma et al., 2019, Madhok et al., 2013).

In distributional semantics, the information gain conveyed by a word is defined as

$D$08

and the paper “Norm of Word Embedding Encodes Information Gain” shows that, under the exponential-family view of SGNS and softmax models, this quantity is approximately encoded by a quadratic form in the embedding, often close to the squared norm after centering or whitening (Oyama et al., 2022).

7. Limitations, controversies, and open directions

Several limitations recur across the literature.

First, the metric can be misaligned with the task. Quality-constrained exploration shows that more accurate gain estimation can worsen completion path length by intensifying greediness, so information gain may be appropriate as a candidate filter but not as the optimization objective (Ericson et al., 28 Mar 2025). In active learning, EIG, AEIG, and EPIG depend on the representativeness of $D$09 or $D$10; if evaluation or target distributions are mismatched, the acquisition criterion can optimize the wrong uncertainty (Mehta et al., 2022, Smith et al., 2023).

Second, most practical systems rely on surrogates. PRoID uses coverage counts as an operational substitute for entropy reduction, and its own limitations list notes that “coverage-as-IG ignores semantic value,” that the survival model assumes stationary hazard, that communication is binary-range rather than obstruction-aware, and that the base station is static (Kim et al., 12 Apr 2026). PIPE and MapEx depend on the quality of learned map predictions and on thresholds such as $D$11; too-low or too-high thresholds can under- or overestimate visibility, and poor ensemble diversity degrades the uncertainty signal (2503.07504, Ho et al., 2024).

Third, estimator fidelity can dominate performance. One-step classifier-head updates only approximate retraining in AEIG; large nonlinear parameter shifts can weaken the approximation. Nonparametric entropy estimators for regression assume absolute continuity and can fail on mixed discrete–continuous targets. Information Sensitivity Functions depend on local linearization and Gaussian assumptions, which can break in strongly nonlinear or multimodal regimes (Mehta et al., 2022, Nowozin, 2012, Pant, 2017).

Fourth, predicted information gain is often computationally heavy. EPIG typically costs $D$12 per candidate in classification, AEIG requires hypothetical updates for each label, and map-based exploration systems are dominated by repeated raycasting, visibility computation, or predictor inference (Smith et al., 2023, Mehta et al., 2022, Kim et al., 12 Apr 2026).

Open directions listed in the robotics and learning papers include calibrated probabilistic predictors and Bayesian occupancy models; multi-metric information objectives such as mutual information and submodular approximations; communication delays and bandwidth constraints; heterogeneous sensors; nonuniform value of information; mobile base stations; predictive teammate modeling; and tighter combinations of information valuation with planning under risk and cost (Kim et al., 12 Apr 2026, 2503.07504).

Taken together, these results suggest that predicted information gain is most effective when three conditions hold simultaneously: the uncertainty object is explicitly specified, the gain is aligned with the deployment objective, and the approximation used to compute it is commensurate with the geometry, dynamics, and statistics of the problem.