---
title: 'E-measure: A Cross-Disciplinary Overview'
url: https://www.emergentmind.com/topics/e-measure
type: topic
---

# E-measure: A Cross-Disciplinary Overview

Searching arXiv for recent papers on “E-measure” to ground the article in the current literature.
E-measure is a cross-disciplinary term rather than a single standardized construct. In recent statistical literature, it denotes a measure-like generalization of the E-value on a hypothesis class; in sequential risk validation, it refers to betting-style quantities built from e-values, e-statistics, and e-processes; in computer vision, it denotes the Enhanced-alignment measure for binary foreground map evaluation; in transcendence theory, it denotes a transcendence measure for numbers such as \(e^{1/n}\); and in measure-theoretic work on co-occurrence, an associated E-measure is induced from E-integrals by applying them to indicator functions [2604.20788] [2209.00991] [1805.10421] [2303.05542] [2210.09913].

## 1. Terminological scope

The literature represented here uses the same label for several mathematically unrelated objects. The term therefore requires domain-specific disambiguation rather than a single universal definition.

| Domain | Meaning of “E-measure” | Representative source |
|---|---|---|
| Statistical evidence | A map \(\mathbf{e}:\mathcal{H}\to[0,\infty]\) satisfying an infimum closure rule over unions of hypotheses | [2604.20788] |
| Risk backtesting | A family of e-values, backtest e-statistics, and e-processes for VaR and ES forecasts | [2209.00991] |
| Computer vision | The Enhanced-alignment measure for binary foreground map evaluation | [1805.10421] |
| Transcendence theory | Any explicit upper bound for \(\omega(k,H)\), yielding lower bounds on \(|P(\xi)|\) | [2303.05542] |
| Measure-theoretic co-occurrence | A set function induced from an E-integral by \(A\mapsto E_{[\cdots]}(\mathbf{1}_A)\) | [2210.09913] |

A recurrent source of confusion is that the 2022 backtesting paper explicitly uses “E‑measure” for betting-style evidence objects and states that this is not the information-retrieval F1-type measure, whereas the 2018 computer-vision paper uses “E-measure” precisely for a foreground-map evaluation score [2209.00991] [1805.10421]. The term is therefore best understood as a family resemblance across disciplines rather than a single invariant concept.

## 2. E-measure as a measure-like generalization of the E-value

In "The E-measure" [2604.20788], the object is defined on a hypothesis space \((\mathcal{P},\mathcal{H})\), where a hypothesis is a subset \(H\subseteq\mathcal{P}\) and \(\mathcal{H}\) is closed under arbitrary unions. The starting point is an E-function \(\mathbf{e}:\mathcal{H}\to[0,\infty]\) satisfying \(\mathbf{e}(\emptyset)=\infty\), followed by the antitonicity requirement for E-capacities,
\[
H\subseteq H' \implies \mathbf{e}(H')\le \mathbf{e}(H).
\]
The defining axiom of an E-measure is the closure rule
\[
\mathbf{e}\Big(\bigcup_{H\in\mathcal{S}} H\Big)=\inf_{H\in\mathcal{S}}\mathbf{e}(H),
\]
for every \(\mathcal{S}\subseteq\mathcal{H}\). This makes evidence behave compatibly with logical implication: more specific hypotheses cannot have less evidence against them, and unions are evaluated by infimum rather than by addition [2604.20788].

This formulation places E-measures in deliberate contrast with classical measures. Classical measures are monotone and additive on disjoint sets, whereas E-measures are antitone and combine by infimum on arbitrary unions. On the \(p\)-value scale \(p(H)=1/\mathbf{e}(H)\), the closure rule becomes
\[
p\Big(\bigcup_{H\in\mathcal{S}} H\Big)=\sup_{H\in\mathcal{S}} p(H),
\]
which the paper identifies as a maxitive measure in the sense of Shilkret [2604.20788].

A central simplification occurs for intersection-closed hypothesis classes. If \(\mathcal{H}\) is closed under arbitrary intersections and contains \(\mathcal{P}\), then every \(P\in\mathcal{P}\) has a least hypothesis
\[
H_P=\bigcap\{H\in\mathcal{H}: P\in H\}.
\]
For an E-capacity \(\mathbf{e}\), its closure satisfies
\[
\overline{\mathbf{e}}(H)=\inf_{P\in H}\mathbf{e}(H_P).
\]
Thus the values on least hypotheses form an E-density that determines the entire E-measure. The closure operator is also minimal: it is the smallest E-measure dominating the original E-function [2604.20788].

The data-dependent version is an E-kernel \(\mathbf{e}(H\mid x)\), which is an E-measure in \(H\) for each \(x\) and a valid E-variable in \(x\) for each \(H\). Under intersection-closure and a countability condition on distinct least hypotheses, Theorem 4.4 states that closure preserves validity and that any non-dominated, hypothesis-wise valid E-capacity kernel must already be an E-measure kernel [2604.20788]. The same framework yields familywise evidence control and false evidence rate control without multiplicity correction when the hypothesis class is intersection-closed, and it supports a frequentist update from E-prior to closed E-posterior by pointwise multiplication followed by closure [2604.20788].

The paper further abstracts “hypothesis” away from subsets of \(\mathcal{P}\) to subsets of other spaces, leading to predictive E-measures. In that setting, a predictive E-kernel gives evidence against claims \(X^*\in H\), and under intersection-closure predictive validity reduces to validity of the single E-variable attached to the least hypothesis \(H_x\) for each outcome \(x\) [2604.20788].

## 3. Betting-style E-measures in risk backtesting

In "E-backtesting" [2209.00991], the relevant objects are e-values, e-statistics, and e-processes for model-free, non-asymptotic, anytime-valid backtesting of Expected Shortfall and Value-at-Risk forecasts. For a hypothesis \(H\), an e-variable is a nonnegative random variable \(E\) with
\[
\mathbb{E}^P[E]\le 1 \quad \text{for all } P\in H,
\]
and a realized value is an e-value. In sequential form, an e-process is a nonnegative adapted process \((E_t)\) such that
\[
\mathbb{E}^P[E_\tau]\le 1
\]
for all stopping times \(\tau\), equivalently a nonnegative supermartingale with \(E_0=1\). Ville’s inequality gives
\[
\mathbb{P}_0\big(\sup_{t\in K}E_t\ge 1/\alpha\big)\le \alpha,
\]
so rejection can occur at any time without violating level-\(\alpha\) validity [2209.00991].

To connect these objects to risk forecasts, the paper defines point e-statistics, one-sided e-statistics, and backtest e-statistics for functionals \(\psi=(\rho,\phi)\). A backtest e-statistic is calibrated so that the expected e-value is at most \(1\) under correct or conservative forecasts and strictly greater than \(1\) under underestimation. Monotonicity means that larger risk forecasts produce smaller e-values, thereby rewarding prudence [2209.00991].

For \(\mathrm{VaR}_p\), the canonical example is
\[
e_p^Q(x,r)=\frac{1}{1-p}\,1_{\{x>r\}},
\]
which is a monotone backtest e-statistic. For \((\mathrm{ES}_p,\mathrm{VaR}_p)\), the paper introduces
\[
e_p^{\mathrm{ES}}(x,r,z)=\frac{(x-z)_+}{(1-p)(r-z)}, \qquad z\le r,
\]
and Theorem 2.4 shows that this is a monotone backtest e-statistic for \((\mathrm{ES}_p,\mathrm{VaR}_p)\). The construction uses the Rockafellar–Uryasev convex dual representation of ES, so that the normalized excess-tail loss has expectation \(1\) under correct forecasts and exceeds \(1\) when ES is underestimated [2209.00991].

Evidence is accumulated over time by a betting transform. If \(X_t=e(L_t,r_t,z_t)\) is the per-period e-variable and \(\lambda_t\in[0,1]\) is predictable, then
\[
M_t(\boldsymbol{\lambda})=\prod_{s=1}^t (1-\lambda_s+\lambda_s X_s)
\]
is an e-process. The paper studies several choices of betting fraction: GRO, GREE, GREL, and the mixture GREM, and measures their performance through e-power \(\mathbb{E}[\log E]\). Under the stated iid or convergence conditions, GREE and GREL are asymptotically optimal in the sense that their normalized log-growth matches that of the oracle GRO, while GREM is asymptotically optimal whenever either GREE or GREL is [2209.00991].

The paper also establishes characterization results. For VaR, any reasonable one-sided e-statistic is bounded above by a mixture of \(1\) and \(e_p^Q\); for ES, under the stated monotonicity and continuity conditions, any such e-statistic is a mixture of \(1\) and \(e_p^{\mathrm{ES}}\). This makes the proposed constructions essentially canonical within the model-free framework [2209.00991]. In that sense, the paper’s “E-measure” is a sequential evidence process aligned with regulatory concern about one-sided underestimation of risk.

## 4. Enhanced-alignment E-measure in binary foreground evaluation

In "Enhanced-alignment Measure for Binary Foreground Map Evaluation" [1805.10421], E-measure is a scalar score for comparing a binary foreground map \(\mathrm{FM}\) with a binary ground-truth map \(\mathrm{GT}\). The stated motivation is that existing binary foreground map measures treat pixel-level match or image-level information independently, whereas the proposed measure combines local pixel values with the image-level mean value in one term, jointly capturing image-level statistics and local pixel matching information [1805.10421].

The construction begins by mean-centering both binary maps:
\[
\Phi_I = I-\mu_I A,\qquad I\in\{\mathrm{GT},\mathrm{FM}\},
\]
where \(\mu_I\) is the image-level mean value and \(A\) is an all-ones matrix. Writing the centered maps as \(Y_{\mathrm{GT}}\) and \(Y_{\mathrm{FM}}\), the alignment matrix is
\[
E_{\mathrm{FM}}(x,y)=
\frac{2\,Y_{\mathrm{GT}}(x,y)\,Y_{\mathrm{FM}}(x,y)}
{Y_{\mathrm{GT}}(x,y)^2+Y_{\mathrm{FM}}(x,y)^2}.
\]
This quantity lies in \([-1,1]\), is nonnegative when the centered values have the same sign, and couples local agreement to global foreground proportions through the means \(\mu_{\mathrm{GT}}\) and \(\mu_{\mathrm{FM}}\) [1805.10421].

To amplify positive alignment and suppress negative alignment, the paper applies the convex map
\[
f(x)=\frac{1}{4}(1+x)^2,
\]
defining an enhanced alignment matrix \(\Phi_{\mathrm{FM}}(x,y)=f(E_{\mathrm{FM}}(x,y))\). The final E-measure is the spatial average
\[
Q_{\mathrm{FM}}=\frac{1}{w\times h}\sum_{x=1}^{w}\sum_{y=1}^{h}\Phi_{\mathrm{FM}}(x,y),
\]
so that \(Q_{\mathrm{FM}}\in[0,1]\) [1805.10421].

The empirical evaluation uses four popular datasets and five meta-measures: ranking models for applications, demoting generic maps, demoting random Gaussian noise maps, ground-truth switch, and human judgments. The paper reports large improvements in almost all meta-measures and, for application ranking, an improvement ranging from \(9.08\%\) to \(19.65\%\) compared with other popular measures [1805.10421]. It also states that E-measure and S-measure are the only tested measures that never prefer random noise over state-of-the-art maps on the reported datasets, while E-measure achieves the best alignment with human judgments in the FMDatabase experiment [1805.10421].

The stated limitations are specific rather than general. On PASCAL-S, which contains more structurally complex images, S-measure can outperform E-measure on structural meta-measures, and a reported failure case shows a generic map ranked above a map from RFCN because the metric exploits shape and alignment but not semantic information [1805.10421]. The scope of the method is therefore binary foreground-map evaluation rather than soft saliency-map assessment.

## 5. E-measure in transcendence theory

In "Transcendence measure of \(e^{1/n}\)" [2303.05542], an E-measure is a transcendence measure. For a transcendental number \(\xi\) and a polynomial
\[
P(X)=\lambda_0+\cdots+\lambda_kX^k\in\mathbb{Z}[X],
\]
the paper defines \(\omega(k,H)\) as the infimum of real numbers \(r>0\) such that
\[
\left|\lambda_0+\lambda_1\xi+\cdots+\lambda_k\xi^k\right|>\frac{1}{H^r}
\]
for all nonzero integer coefficient vectors with \(\max_{0\le i\le k}|\lambda_i|\le H\). Any function greater than or equal to \(\omega(k,H)\) is a transcendence measure of \(\xi\) [2303.05542].

Specializing to \(\xi=e^{1/n}\), the main theorem states that for \(k\ge n\ge 2\),
\[
|\lambda_0+\lambda_1e^{1/n}+\cdots+\lambda_ke^{k/n}|>H^{-r},
\]
where \(r>\omega(k,H)\), and that one may take
\[
\omega(k,H)=
k+\frac{k^2\log k}{\log\log H}\left(1+\frac{0.69}{\log k-1}\right)
\]
for \(k\ge 5\), with separate explicit constants for \(k=2,3,4\), under the condition
\[
\log H\ge s(n,k)e^{s(n,k)},\qquad s(n,k)=(k+n)(\log(k+n))^2.
\]
As \(H\to\infty\) with fixed \(k\), the correction term tends to \(0\), so the exponent approaches \(k\) from above [2303.05542].

The paper compares this bound with Mahler’s 1975 result specialized to the same setting. The stated conclusion is that the new bound is better than Mahler’s bound, because the correction term in Mahler’s exponent has the asymptotic form \(k+\text{const}\cdot k^2\sqrt{\log k\,\log\log H}\), whereas the new exponent differs from \(k\) by about \(k^2\log k/\log\log H\) [2303.05542]. The method is an explicit Hermite–Mahler style auxiliary-function construction based on simultaneous Padé-type approximations, determinant arguments, and integral estimates, specialized to the sequence \(e^{j/n}\) [2303.05542].

In this domain, “E-measure” is tied to the constant \(e\) rather than to evidence measures. The term refers to quantitative lower bounds for nonzero polynomial values at transcendental numbers related to \(e\), and the paper identifies its contribution as the first explicit measure tailored for roots of \(e\) [2303.05542].

## 6. E-integrals and associated E-measures for complex co-occurrence

In "Measure-Theoretic Probability of Complex Co-occurrence and E-Integral" [2210.09913], the primitive object is the E-integral rather than an E-measure in the sense of hypothesis testing. The setting consists of a probability space \((\Omega,\mathscr{F},P)\), measurable spaces \((\Omega_i,\mathscr{F}_i)\), and random objects \(X_i:(\Omega,\mathscr{F})\to(\Omega_i,\mathscr{F}_i)\). For finite index sets, the paper defines co-occurrence probabilities such as
\[
P[A_i,i\in I]:=P\Big(\bigcap_{i\in I}A_i\Big)
\]
and conditional probabilities of co-occurrence by normalizing joint co-occurrence when the conditioning event has positive probability [2210.09913].

The E-integral is then defined as an integral of a measurable function with respect to a co-occurrence measure or a conditional co-occurrence kernel. In the simplest case,
\[
E_{[X_2,X_1\in A_1]}(Y)
=
\int_{\Omega_2}Y(\omega_2)\,P[X_2,X_1\in A_1](d\omega_2),
\]
where
\[
P[X_2,X_1\in A_1](B_2)=P[X_2\in B_2,X_1\in A_1].
\]
More general forms integrate with respect to measures such as \(P[X_{I_2},X_{I_4}\in A_{I_4}]\), \(P[X_{I_2},X_{I_4}\in A_{I_4}\mid X_{I_3}\in A_{I_3}]\), or conditional kernels \(P[X_{I_2},X_{I_4}\in A_{I_4}\mid X_{I_1},X_{I_3}\in A_{I_3}]\) [2210.09913].

An associated E-measure arises by applying the E-integral to indicator functions:
\[
\mu_E(B):=E_{[\cdots]}(\mathbf{1}_B).
\]
For example,
\[
\mu_{E,[X_{I_2},X_{I_4}\in A_{I_4}]}(B)
=
E_{[X_{I_2},X_{I_4}\in A_{I_4}]}(\mathbf{1}_B)
=
P[X_{I_2}\in B,X_{I_4}\in A_{I_4}].
\]
In this sense, the paper treats expectation-like functionals as primary and recovers measures from them through indicator functions, explicitly aligning the discussion with the expectation functional approach associated with Whittle and Pollard [2210.09913].

The paper establishes linearity, monotonicity, absolute-value inequalities, monotone convergence theorems, tower-type identities, and factorization properties under independence for these E-integrals [2210.09913]. Its stated motivation is sparse high-dimensional co-occurrence data, where joint densities may fail to exist or may be analytically inconvenient; the E-integral framework remains measure-theoretic and kernel-based, so it can represent expectations under complex co-occurrence and conditioning structures without relying on smooth density models [2210.09913].

The resulting terminology differs sharply from the evidence-theoretic E-measure of [2604.20788]. Here, the “E” is attached to an expectation-like integral operator over co-occurrence measures, and the induced E-measure is simply the set function generated from that operator.

## 7. Conceptual distinctions and recurring themes

The surveyed uses share notation but not ontology. In [2604.20788], an E-measure is a logically coherent evidence assignment on a hypothesis class. In [2209.00991], the operative objects are e-values, backtest e-statistics, and e-processes whose sequential growth quantifies evidence against under-conservative risk forecasts. In [1805.10421], E-measure is a deterministic image-comparison functional. In [2303.05542], it is a transcendence measure for \(e^{1/n}\). In [2210.09913], it is a measure induced from E-integrals in a co-occurrence framework.

A common misconception is therefore to treat “E-measure” as if it named one established metric across fields. The recent literature does not support that reading. The strongest unifying statement supported by these sources is narrower: each usage introduces a structured scalar- or measure-valued object that aggregates information under a discipline-specific notion of coherence—logical closure in hypothesis classes, supermartingale validity in sequential testing, global-local alignment in binary masks, explicit lower bounds in transcendence theory, or integral representation for co-occurrence measures [2604.20788] [2209.00991] [1805.10421] [2303.05542] [2210.09913]. This suggests that the term functions primarily as a local technical label whose meaning must be fixed by context.

Source: https://www.emergentmind.com/topics/e-measure