Fleming-Viot Stable-Trajectory Optimizer
Implementation & benchmark of arXiv:2607.29251 — Fleming-Viot Selection of the Yaglom Limit for Age-Structured Bellman-Harris Processes, with Application to Livestock Epidemic Surveillance
Source paper: Fleming-Viot Selection of the Yaglom Limit for Age-Structured Bellman-Harris Processes, with Application to Livestock Epidemic Surveillance arXiv:2607.29251 ⓘ · analyzed Aug 31, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Run multiple neural-network parameter trajectories in parallel and define divergence, NaNs, loss explosions, or trust-region violations as absorbing failure events. Whenever one replica fails, replace it with a copy of a uniformly selected survivor while tracking the time since its last replacement. This creates an empirical quasi-stationary distribution of robust training states instead of relying on one potentially unstable trajectory.
Formulas
Mathematical statement
The paper lifts a non-Markovian population-size process to an age configuration eta_t = sum_i delta_{a_i(t)}, where a_i is the age of particle i and the total death intensity is the sum of individual hazards mu(a_i). The neural analogue maintains parameter states theta_i, ages a_i, and an absorbing bad set B. Between replacements, each survivor follows noisy gradient dynamics theta_{k+1}^i = theta_k^i - eta grad_hat L(theta_k^i) + sqrt(2 eta T) epsilon_k^i, where eta is the learning rate, T is an optional temperature, and epsilon_k^i is standard Gaussian noise. A failed particle is replaced by a uniformly sampled survivor j and its age is reset to zero. The quasi-stationary distribution nu is the limiting law conditioned on non-failure. The predicted transient error decays as O(exp(-r t)), where r is the estimated Malthusian or conditional-survival decay rate, while the finite-particle approximation error decreases polynomially with N.
Implementation notes
Integrate the method as an outer wrapper around SGD or Adam. Maintain N parameter replicas, each with its own optimizer state, minibatch stream, and age. At every step, compute a minibatch gradient and update each nonfailed replica. Define the absorbing set B using one or more fixed conditions: validation loss above a threshold, gradient norm above a threshold, NaN or Inf detection, parameter norm outside a trust region, or a sudden loss increase. After updates, mark failed replicas. For each failed index i, sample a surviving index j uniformly, copy both parameters and optimizer state from j to i, and set age[i] = 0; increment the ages of all other replicas. A constant hazard can be implemented as failure probability p per step; an age-dependent hazard uses q(a) = 1 - exp(-mu(a) Delta t). The paper provides the age-space construction, hazard survival relation, cloning mechanism, and conditional exponential convergence; estimate the decay rate and finite-particle exponent from experiments. First test: train a 32-replica MLP on MNIST with an aggressive learning rate, comparing ordinary SGD, independent replicas, and Fleming–Viot SGD at equal total gradient budget. Record survivor fraction, loss, and parameter diversity. The prediction is a sharp stability transition as eta increases: ordinary SGD should diverge above a critical eta, while the particle system remains populated until replacement frequency becomes excessive. Fit log survival probability versus time and test whether the late-time conditional distribution approaches a stationary ensemble with residual slope approximately -r. Repeat with N = 8, 16, 32, 64 and check polynomial error reduction relative to an N = 256 reference ensemble.
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.