✗ Mechanism failed 2026

Kernel-Zubov Trust Region for Neural Rollouts

Implementation & benchmark of arXiv:2608.01018 — Data-Driven Domain of Attraction Estimation via Convergent Koopman-Zubov Approximation

Usefulness7/10
Difficulty5/10
Novelty8/10

Source paper: Data-Driven Domain of Attraction Estimation via Convergent Koopman-Zubov Approximation arXiv:2608.01018 ⓘ · analyzed Aug 31, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Use a convergent kernel approximation of the Zubov invariant as a trust-region monitor for a learned dynamics model. The estimated Zubov sublevel sets become an inference-time gate that rejects, shortens, or dampens transitions predicted to leave the learned attraction region.

Formulas

$$u_N(x)=b+\sum_{j=1}^{N}\alpha_j k(x,x_j),\qquad v_N(x)=1-u_N(x).$$
$$\Omega_c=\{x:v_N(x)\le c\},\qquad v_N(F_\theta(x))\le v_N(x)+\varepsilon.$$$$
$$\widehat{x}_{t+1}=F_\theta(x_t),\qquad x_{t+1}=\begin{cases}\widehat{x}_{t+1},&v_N(\widehat{x}_{t+1})\le v_N(x_t)+\varepsilon,\\x_t+\alpha(\widehat{x}_{t+1}-x_t),&\text{otherwise},\end{cases}$$
$$\|u_N-u\|_{\mathcal{D}}\le C\,\mathrm{err}_{\mathrm{model}}+C'N^{-\beta},\qquad \beta>0.$$

Mathematical statement

Let \(v(x)=1-u(x)\) be the Zubov function, where \(u\) satisfies the discounted Koopman invariance relation. Sublevel sets \(\Omega_c=\{x:v(x)\le c\}\), with \(0<c<1\), approximate positively invariant subsets of the domain of attraction. Represent the estimator in an RKHS as \(u_N(x)=b+\sum_{j=1}^N\alpha_j k(x,x_j)\), where \(x_j\) are sampled states, \(k\) is a linear-radial product kernel, \(\alpha_j\) are fitted coefficients, and \(b\) is the explicitly augmented constant component. Fit the coefficients from sampled invariance equations. The paper's mechanism is spectral convergence of the Zubov-Koopman operator and a sectorially bounded approximation error decreasing with sample size. In a neural rollout, accept a transition only when the estimated Lyapunov-like score does not increase beyond tolerance.

Implementation notes

Apply this as a wrapper around a learned simulator, neural ODE integrator, model-based RL rollout, or latent diffusion sampler. Collect a replay buffer of states and short transitions, preferably including both successful and failed trajectories. Fit a kernel estimator \(u_N(x)=b+\sum_j\alpha_j k(x,x_j)\) with a linear-radial product kernel such as \(k(x,y)=\langle x,y\rangle\psi(\|x-y\|^2)\), plus an explicit constant column. For each transition \((x_i,x'_i)\), solve regularized least squares for \(u_N(x_i)-\gamma_i u_N(x'_i)=0\), where \(\gamma_i=\exp[-\Delta t q(x_i)]\). At inference, predict \(x'=F_\theta(x)\), evaluate \(\Delta v=v_N(x')-v_N(x)\), and accept the transition only if \(\Delta v\le\varepsilon\); otherwise shorten the step by interpolation or reduce action magnitude. The paper supplies the kernel invariant construction and sample-dependent error mechanism. Estimate the threshold \(c\), tolerance \(\varepsilon\), and exponent \(\beta\) on validation trajectories. First test a learned two-dimensional Duffing-oscillator or pendulum model with 100-step rollouts, comparing unconstrained and Zubov-gated prediction. The prediction is a sharp increase in basin-exit probability outside \(\Omega_c\), while in-DOA accepted steps satisfy the inequality in at least 95 percent of cases. Increasing samples from \(N\) to \(4N\) should reduce held-out invariance residual approximately by \(4^{-\beta}\); fit the log-residual versus log-sample-size slope and require it to be negative.

Verification

Mechanism failed

Stage 1 · Toy mechanism gate: Failed ✗

Stage 2 · Mechanism transferred to benchmark: Not tested

Stage 2 · Practical benchmark result: Not run

Methodology: Toy-system gate first; the benchmark stage runs only after a pass. How verification works

Stage 1 — Mechanism check agent confidence 9/10

Built a constant-augmented linear-radial kernel Zubov estimator, invariance-equation ridge fit, trust-region shortening gate, and fixed-seed 2D nonlinear rollout experiment. The core approximation trend was promising: held-out median residual had log-log slope -0.718, although it was not monotonic from N=20 to 40. The gate’s post-update inequality was always satisfied, but this is partly tautological because rejected steps were shortened or held; it did not reduce basin exits (baseline and gated exit rates were both 1.0), and the tolerance sweep failed the predicted monotone safety trend.

Agent confidence
9/10
Baseline
400 trajectories, 100 steps, exit_rate=1.000, accepted_rate=1.000
Idea
400 trajectories, 100 steps, epsilon=0.03, exit_rate=1.000, accepted_rate=1.000; residual median N=20..320 = [0.0391, 0.0498, 0.0219, 0.0104, 0.0071], fitted slope=-0.718

Limitations: This is a toy synthetic system rather than Duffing or pendulum, and no neural learned dynamics model was trained. The fitted invariance target uses the synthetic reference score, the gate threshold/sublevel calibration was not independently validated, and no FLOP or inference-speed measurement was performed.

How to run: python3 experiment.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Artifacts

Implementation overview ⬇ Download all as ZIP 3 files · code, reports and structured results