Reflected Survival Routing
Implementation & benchmark of arXiv:2607.21062 — A new probabilistic approach for mean field games of optimal stopping
Source paper: A new probabilistic approach for mean field games of optimal stopping arXiv:2607.21062 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace independent binary early-exit or token-pruning decisions with a monotone randomized survival process for each token or expert route. A token can lose survival mass at each layer but cannot become active again; the model is trained with a reflected obstacle-style penalty that activates when the predicted value of continuing computation is below the value of stopping plus the compute cost. Mean-field statistics are computed over currently surviving tokens, making routing less sensitive to batch size and avoiding feedback from already-terminated tokens.
Formulas
Mathematical statement
The paper defines the empirical occupation measure of players that have not stopped as $m_t^N(dx)=\frac{1}{N}\sum_{k=1}^N\delta_{X_t^{k,N}}(dx)\mathbf{1}_{t<\tau^k}$, where $X_t^{k,N}$ is the state of player $k$, $\tau^k$ is its stopping time, and $N$ is the population size. It also uses an adapted $[0,1]$-valued non-increasing càdlàg process $L$, whose increments $dL_t$ represent randomized stopping mass, and interaction terms of the form $\mathbb{E}[\int_{0^-}^T\phi(t-s)dL_s]$, where $\phi$ is a temporal kernel. We adapt these objects to layer index $\ell$: $S_{i,\ell}$ is token $i$'s probability of surviving through layer $\ell$, $S_{i,\ell+1}\le S_{i,\ell}$, and $\Delta L_{i,\ell}=S_{i,\ell}-S_{i,\ell+1}\ge0$ is its stopping mass. Let $V_{i,\ell}^{\mathrm{cont}}$ be the predicted value of applying another layer and $V_{i,\ell}^{\mathrm{stop}}$ the value of exiting now; the obstacle residual is $r_{i,\ell}=V_{i,\ell}^{\mathrm{cont}}-V_{i,\ell}^{\mathrm{stop}}$. The reflected/complementarity target is $r\ge0$, $\Delta L\ge0$, and $r\Delta L=0$: stopping mass should be placed only where continuation is no better than stopping. In finite-dimensional training this is enforced by $\mathcal{L}_{\mathrm{comp}}=\operatorname{softplus}(-r)^2+\lambda_{\mathrm{comp}}(r\Delta L)^2$ together with a monotonic parameterization of $S$.
Implementation notes
Integrate this into a Transformer encoder as a token-wise adaptive-depth wrapper, or into an MoE block as a survival-aware router. At layer $\ell$, maintain a vector of survival masses $S\in[0,1]^B$ for the batch's tokens. The halting head receives the current token representation, the layer index, an estimated continuation value, and a mean-field statistic computed only from active tokens. Use the following pseudocode: initialize $S_i=1$ and $h_i=x_i$; for each layer $\ell$, define $A=\{i:S_i>\epsilon\}$, compute $\mu_\ell=\sum_i S_i g(h_i)/(\sum_i S_i+\epsilon)$, optionally compute temporal memory $c_\ell=\sum_{s\le\ell}\phi(\ell-s)\Delta L_s$, run the layer only for active tokens, predict $q_i=\operatorname{sigmoid}(f_\theta(h_i,\mu_\ell,c_\ell,\ell))$, and update $\Delta L_i=S_iq_i$, $S_i\leftarrow S_i-\Delta L_i$. Tokens with $S_i<\epsilon$ are removed from subsequent attention and their outputs are cached. Define $V^{stop}$ from an exit classifier or the residual stream's prediction head, and define $V^{cont}$ with a one-step value head predicting the benefit of one more layer minus its normalized FLOP cost. Add the task loss, compute penalty $\lambda_c\sum_{i,\ell}\Delta L_{i,\ell}C_\ell$, and complementarity loss $\lambda_{comp}[\operatorname{softplus}(-r)^2+(r\Delta L)^2]$. The paper-derived quantities are the monotone stopping measure, survivor occupation measure, and kernel convolution; the value heads, kernel bandwidth, and loss weights are learned or estimated empirically. First test on CIFAR-100 with a 6-layer ViT-Tiny, comparing fixed-depth inference, standard ACT, and independent token pruning at an equal accuracy target. Measure average active tokens per layer, FLOPs, calibration, and whether survival curves are monotone and non-oscillatory. A useful signal is at least 20% lower inference FLOPs at matched top-1 accuracy, with lower variance in compute across batches than independent halting.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.