---
title: Sequential E-Process Methods
url: https://www.emergentmind.com/topics/sequential-e-process
type: topic
---

# Sequential E-Process Methods

Sequential e-processes are nonnegative evidence processes designed for anytime-valid inference. In the standard formulation, a process \((E_t)_{t\ge 0}\) with \(E_0=1\) is an e-process for a null \(H_0\) if, for every stopping time \(\tau\), \(\mathbb E_P[E_\tau]\le 1\) for every \(P\in H_0\). This yields the time-uniform guarantee
\[
P\!\left(\sup_{t\in\mathbb N} E_t \ge \frac1\alpha\right)\le \alpha,
\]
so rejection can be based on threshold crossing rather than on a pre-specified analysis time. Recent work has expanded this object well beyond single-stream optional-stopping robustness, developing sequential e-process methodology for multiple testing, changepoint detection, randomized trials, agent monitoring, and asymptotic regimes in which exact e-values are unavailable [2501.19360] [2604.19353].

## 1. Definition, validity, and the role of filtration

An e-variable is a nonnegative random variable \(E\) satisfying \(\mathbb E[E]\le 1\) under the null. An e-process is its sequential analogue: a nonnegative adapted process such that every stopped value remains an e-variable. One equivalent formulation is that, for every null law \(P\), the process is dominated by a nonnegative supermartingale with initial value \(1\). In this sense, e-processes formalize optional-stopping-robust evidence accumulation rather than fixed-sample evidence summaries [2502.08539].

The filtration is part of the definition. If \(\{M_n\}\) is an e-process on a filtration \(\{F_n\}\), then “\(M_\tau\) is an e-value” is guaranteed only for \(\tau\) that are stopping times with respect to \(\{F_n\}\). This filtration-relativity is routine in single-hypothesis sequential testing, but it becomes decisive in multi-stream settings, where local and global filtrations need not coincide [2502.08539].

In the finite-horizon setting, the same logic appears through test martingales. A nonnegative martingale with initial value \(1\) is an e-process by optional stopping, and an e-process is strictly stronger than a single terminal e-value because it remains valid under arbitrary bounded stopping times. This connection is central to the betting interpretation of sequential evidence: one monitors a capital process rather than a single terminal statistic [2007.06382].

## 2. Canonical constructions and complete-class results

A basic construction starts from sequential e-values \(E_1,\dots,E_K\) satisfying
\[
\mathbb E[E_k\mid E_1,\dots,E_{k-1}] \le 1.
\]
Given a gambling system \(s:[0,\infty)^{<K}\to[0,1]\), the associated game martingale is
\[
S_0:=c,\qquad
S_{k+1}(\mathbf e)=S_k(\mathbf e)\bigl(s(\mathbf e_{(k)})\,e_{k+1}+1-s(\mathbf e_{(k)})\bigr).
\]
Any such martingale merger is an se-merging function, and every se-merging function is dominated by a martingale merging function. More strongly, adapted, anytime-valid, precise constructions based on sequential e-values coincide with game martingales. In this finite-horizon sequential-merging setting, martingale betting is therefore not merely a convenient construction; it is the complete admissible class [2007.06382].

A second complete-class result concerns conditional nonparametric hypotheses defined by finitely many conditional constraints. For
\[
\mathcal H_{\Phi,S}^\infty
=
\left\{
P:
\mathbb E_P[\Phi(X_t)\mid X^{t-1}] \in S
\text{ for all finite } t\ge1,\ P\text{-a.s.}
\right\},
\]
every e-process is pointwise dominated by a predictable product of affine one-step e-variables. The one-step factors are
\[
e_\lambda(x)=
\begin{cases}
1+\lambda\cdot\Phi(x)-\sigma(\lambda), & x\in\mathcal X_{\mathcal H},\\
+\infty, & x\notin\mathcal X_{\mathcal H},
\end{cases}
\]
and the dominating process has the form
\[
E_t^{\lambda^\infty}(x^t)=\prod_{s=1}^t e_{\lambda_s(x^{s-1})}(x_s).
\]
For this class of hypotheses, arbitrary e-processes can therefore be replaced without loss by test supermartingales, and sequential design reduces to choosing predictable coefficients \(\lambda_t\) in a finite-dimensional action set [2606.06769].

Taken together, these results identify a recurring structural theme: although e-processes are more general than supermartingales in full generality, large and practically important sequential-testing classes admit complete descriptions by predictable multiplicative updates.

## 3. Multiple testing, running suprema, and stopped e-BH

In multiple testing with parallel e-processes \((E_t^k)_{t\ge 0}\), pointwise application of e-BH to the current vector \((E_t^1,\dots,E_t^K)\) yields fixed-time FDR control, but it is not “carefree” in a genuinely sequential sense. A hypothesis rejected at time \(t\) may no longer be rejected at time \(t+1\) after collecting more data for one or more unrelated streams. The proposed sequential target is therefore FDR based on running suprema,
\[
M_t^k=\max_{1\le s\le t}E_s^k,
\qquad
\mathrm{FDR}\big(\sup_t E_t^1,\dots,\sup_t E_t^K\big)\le \alpha.
\]
This is the paper’s FDR-sup criterion, and it yields an accept-to-reject monotonicity property: the rejection set is nondecreasing in time. However, raw running maxima are generally not e-variables, and e-BH applied directly to \(M_t^k\) does not in general control FDR-sup under arbitrary dependence. The correction is to pass each running maximum through an admissible adjuster \(\mathrm A\) satisfying
\[
\int_1^\infty \frac{\mathrm A(E)}{E^2}\,dE = 1,
\]
so that \((\mathrm A(M_t^k))_{t\ge0}\) becomes an e-process. The main theorem then states that e-BH applied to adjusted running maxima controls FDR-sup at level \(K_0\alpha/K\). Concrete admissible adjusters include
\[
\mathrm A_1(E)=\frac{E-1-\log E}{\log^2 E},
\qquad
\mathrm A_2(E)=\sqrt E -1
\]
[2501.19360].

A distinct subtlety arises when e-BH is stopped at a global stopping time. In a multi-stream problem, each stream often has its own local filtration \(\{F_n^g\}\), while the analyst stops using the global filtration
\[
F_n=\sigma(F_n^g:g\in[G]).
\]
An adaptively stopped local e-process is an e-value only for local stopping times; this does not automatically imply validity at global stopping times. The resulting “stopped e-BH procedure” can therefore fail under arbitrary dependence. A sufficient condition for globalization is the causal condition
\[
Y_n \perp (X_1,\dots,X_{n-1};\,Y_1,\dots,Y_{n-1}) \mid X_n,
\]
under which standard products of one-step local e-values become nonnegative supermartingales on the global filtration, and stopped e-BH regains finite-sample, nonasymptotic FDR control for any global stopping time. When that condition is doubtful, the paper also gives a filtration-agnostic fallback via adjusters applied to running maxima [2502.08539].

These developments show that “sequential multiple testing with e-processes” is not merely fixed-time e-BH rerun at successive looks. The correct object is evidence accumulated over time and across streams in a way that respects monotonicity, filtration, and dependence.

## 4. Major instantiations

In randomized clinical trials, the randomization e-process (e-RT) constructs a patient-by-patient wealth process
\[
(W_n)_{n\ge0},\qquad W_0=1,
\]
with updates
\[
W_i = W_{i-1} \times
\begin{cases}
\lambda_i/p & \text{if } T_i = \text{intervention}\\
(1-\lambda_i)/(1-p) & \text{if } T_i = \text{control},
\end{cases}
\]
where \(p\) is the known randomization probability and \(\lambda_i\in[0,1]\) is chosen after observing the current outcome but before revealing treatment assignment. Under the sharp null of no treatment effect, \(Y_i\perp T_i\), the conditional expected multiplier is \(1\), so \((W_n)\) is a test martingale and rejection at \(W_\tau\ge 1/\alpha\) is anytime-valid. In simulations with \(\alpha=0.05\), type I error was between \(0.021\) and \(0.035\), e-RT power was about \(50\%\) for designs built for \(80\%\) power and about \(63\%-66\%\) for designs built for \(90\%\) power, and the median crossing occurred between \(47\%\) and \(56\%\) of full enrollment [2512.04366].

In agent verification, verifier-score prefixes \(\mathbf S_{[1:t]}\) are turned into sequential evidence through the density-ratio process
\[
M_t=\frac{p_0(\mathbf S_{[1:t]})}{p_1(\mathbf S_{[1:t]})},
\]
where \(P_1\) is the score-sequence law on successful trajectories and \(P_0\) is the corresponding law on unsuccessful trajectories. Under the null \(\mathcal H_N:\mathbf S\sim P_1\), \((M_t)\) is a test martingale with
\[
\Pr_{\mathcal H_N}\!\left[\exists\, t : M_t \ge \frac1\alpha\right]\le \alpha.
\]
The practical method estimates the ratio with a classifier,
\[
\hat M_t
=
\frac{1-\hat f_t(\mathbf S_{[1:t]})}{\hat f_t(\mathbf S_{[1:t]})}
\cdot
\frac{\hat\pi_1}{1-\hat\pi_1},
\]
and calibrates either the theory-motivated threshold \(1/\alpha\) or a PAC threshold based on \(\max_t \hat M_t\) over held-out successful trajectories [2512.03109].

In sequential change detection, the primary object is an e-detector rather than a single e-process. If \(\Lambda^{(j)}\) is an \(e_j\)-process started at candidate changepoint time \(j\), then the Shiryaev–Roberts and CUSUM-style e-detectors are
\[
M_n^{SR}:=\sum_{j=1}^n \Lambda_n^{(j)},
\qquad
M_n^{CU}:=\max_{j\in[n]} \Lambda_n^{(j)}.
\]
An e-detector satisfies
\[
\mathbb E_{P,\infty}[M_\tau]\le \mathbb E_{P,\infty}[\tau]
\]
under the no-change model, so thresholding at \(1/\alpha\) yields average run length at least \(1/\alpha\). This framework recovers classical likelihood-based CUSUM and Shiryaev–Roberts procedures in parametric settings and extends them to nonparametric composite pre-change classes [2203.03532].

In stratified count data, per-block conditional e-variables \(S_j\) are multiplied into cumulative e-processes
\[
E^{(m)}:=\prod_{j=1}^m S_j,
\]
yielding sequential tests of the global null
\[
H_0:\ \theta_{a,k}=\theta_{b,k}\quad \text{for all }k.
\]
The same machinery is inverted into anytime-valid confidence sequences. The framework allows adaptive block sizes, arbitrary stratum arrival patterns, convex mixtures across strata, switching, and “cross-talk” in which alternative-side estimators for one stratum borrow information from others while preserving e-validity [2302.11401].

## 5. Asymptotic, approximate, and optimal e-processes

Exact finite-sample e-processes are not always available. Asymptotic e-processes address this by introducing a doubly indexed process \((E_{m,n})_{m,n\in\mathbb N}\), where \(m\) is an approximation index and \(n\) is monitoring time. For a horizon sequence \(r_m\), a uniformly strongly \(r\)-asymptotic e-process satisfies
\[
\forall \tau=(\tau_m)\in T(r,\mathcal F,\mathcal P),
\qquad
\limsup_{m\to\infty}\sup_{P\in\mathcal P}\mathbb E_P[E_{m,\tau_m}] \le 1.
\]
This yields the asymptotic Ville inequality
\[
\limsup_{m\to\infty}\sup_{P\in\mathcal P}
P\!\left[\sup_{n\in\{0,\dots,r_m\}}E_{m,n}\ge \frac1\alpha\right]\le \alpha.
\]
For cumulative-product constructions with approximation error \(d_m\downarrow 0\), one may take any horizon \(r_m\) such that
\[
r_m d_m \to 0.
\]
The framework formalizes sequential validity when e-values are available only approximately, for example because of nuisance estimation or model misspecification [2604.19353].

A converse optimality theory starts from sequential tests rather than from e-processes. Given valid level-indexed stopping times \((\tau_k)\) with \(\sup_{P\in\mathcal P}P(\tau_k<\infty)\le \alpha_k\), the paper defines a WAIT e-process,
\[
M_t:=\sum_{k=1}^\infty w_k \mathbf 1\{\tau_k\le t\},
\]
with budget \(\sum_k w_k\alpha_k\le 1\) and profile
\[
W(x):=\sum_{k:\,b_k\le x} w_k,\qquad b_k:=\log(1/\alpha_k).
\]
If
\[
\frac{\tau_k}{b_k}\to \frac1I \quad\text{a.s. under }Q
\]
and
\[
\frac{\log W(x)}{x}\to \rho,
\]
then
\[
\frac1t\log M_t \to \rho I \quad\text{a.s. under }Q.
\]
Thus asymptotically optimal sequential tests can be aggregated into asymptotically log-optimal e-processes; full log-optimality corresponds to \(\rho=1\) [2605.12720].

A complementary result studies wealth processes of the form
\[
W_n=\prod_{i=1}^n\big((1-\lambda_i)E_i^{(1)}+\lambda_i E_i^{(2)}\big)
\]
under composite alternatives. If the process satisfies a deterministic sublinear portfolio regret bound
\[
\mathcal R_n(W_n)\le r_n,\qquad r_n=o(n),
\]
then for every alternative \(Q\),
\[
\frac1n\log W_n \to \ell_Q^\star \quad Q\text{-a.s.},
\qquad
\ell_Q^\star := \max_{\lambda\in[0,1]}
\mathbb E_Q\!\left[\log\!\big((1-\lambda)E_1^{(1)}+\lambda E_1^{(2)}\big)\right].
\]
The associated rejection time
\[
\tau_\alpha:=\inf\{n\ge 1:W_n\ge 1/\alpha\}
\]
satisfies the matching asymptotic bound
\[
\lim_{\alpha\to 0^+}\frac{\mathbb E_Q[\tau_\alpha]}{\log(1/\alpha)}=\frac1{\ell_Q^\star}.
\]
This links betting regret, Kelly-style log growth, and first-order optimal sequential testing [2504.02818].

## 6. Tradeoffs, misconceptions, and open directions

Several recurring misconceptions are explicitly ruled out by the recent literature. Pointwise-in-time FDR control is not the same as order-invariant sequential multiple testing, and local optional-stopping validity is not the same as global optional-stopping validity. In multi-stream settings, “an adaptively stopped e-process is an e-value” can fail once stopping depends on a larger filtration. Likewise, in agent monitoring, marginal calibration of a verifier score does not by itself control false alarm rate, and still less the probability of ever crossing a threshold over time [2501.19360] [2512.03109].

Conservativeness is a second recurring theme. Adjusting running maxima restores FDR-sup control but costs power, sometimes appreciably. In clinical trials, e-RT is a conservative, assumption-free complement to model-based sequential analyses and is usually less powerful than model-based methods when parametric assumptions are credible. In approximate settings, asymptotic e-processes are only valid up to a horizon \(r_m\) tied to approximation quality, rather than on an unrestricted infinite horizon at fixed \(m\) [2501.19360] [2512.04366] [2604.19353].

Current scope limitations are also explicit. The randomization e-process has been developed for binary outcomes; extension to continuous endpoints is suggested but not yet developed, and application to time-to-event outcomes is unclear and under development. The conditional complete-class theorem for finitely many conditional constraints does not cover hypotheses like conditional sub-Gaussianity that naturally involve infinitely many inequalities. Estimated density-ratio procedures for agent monitoring are not exact e-processes, and long trajectories can stress estimation quality [2512.04366] [2606.06769] [2512.03109].

These limitations do not weaken the central methodological conclusion. Sequential e-processes provide a unified language for evidence accumulation under optional stopping, but valid deployment requires careful attention to filtration, dependence, lookback calibration, and approximation error. The recent theory shows both where naive transplants from fixed-time inference fail and how principled constructions—game martingales, affine one-step factors, adjusted running maxima, e-detectors, asymptotic horizons, and regret-optimal wealth processes—repair those failures within a coherent sequential framework.

Source: https://www.emergentmind.com/topics/sequential-e-process