✗ Failed on benchmark 2026

Robust Barrier Projection for Learned Dynamics

Implementation & benchmark of arXiv:2608.12638 — Improving Fast Charging Safety With Core Temperature Estimation Via Kolmogorov-Arnold Network

Usefulness8/10
Difficulty5/10
Novelty5/10

Source paper: Improving Fast Charging Safety With Core Temperature Estimation Via Kolmogorov-Arnold Network arXiv:2608.12638 ⓘ · analyzed Sep 1, 2026

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

Idea description

Wrap a learned neural controller or world-model policy with a quadratic-program projection that enforces a robust higher-order control barrier condition. The projection uses a neural estimate of hidden state variables and a certified bound on model and estimator residuals, so the nominal policy is changed only when it approaches a learned safety boundary.

Formulas

$$\eta(x)=\begin{bmatrix}B(x)&L_fB(x)&\cdots&L_f^{r-1}B(x)\end{bmatrix}^{\top},\qquad F-GK_\alpha\ \text{Hurwitz},$$
$$B^{(r)}(x,u)\geq -K_\alpha\eta(x),$$
$$L_f^rB(x)+L_gL_f^{r-1}B(x)u+\Delta_r(x,t)\geq-K_\alpha\eta(x),$$
$$L_f^rB(x)+L_gL_f^{r-1}B(x)u-\overline{\Delta}_r\geq-K_\alpha\eta(x),\qquad \Delta_r(x,t)\geq-\overline{\Delta}_r.$$

Mathematical statement

Consider a control-affine learned or physical system $\dot{x}=f(x)+g(x)u$ with an unknown additive residual represented in the $r$-th barrier derivative by $\Delta_r(x,t)$. Let $B(x)\geq 0$ define the safe set, let $r$ be its relative degree, and define $\eta(x)=[B(x),L_fB(x),\ldots,L_f^{r-1}B(x)]^\top$. Choose $K_\alpha=[\alpha_1,\ldots,\alpha_r]$ so that the companion error matrix $F-GK_\alpha$ is Hurwitz. Enforce $L_f^rB(x)+L_gL_f^{r-1}B(x)u-\overline{\Delta}_r\geq-K_\alpha\eta(x)$, where $\Delta_r(x,t)\geq-\overline{\Delta}_r$. The robust inequality implies the nominal higher-order barrier condition despite the residual, and hence forward invariance of $B(x)\geq0$ under the usual regularity assumptions. In a neural implementation, $x$ may be replaced by an estimator $\hat{x}$ and $\overline{\Delta}_r$ must include both learned-dynamics error and state-estimation error.

Implementation notes

1. Integration point: use this as an inference-time safety wrapper around a neural policy $u_{\mathrm{nom}}=\pi_\theta(o_t)$, or around the action emitted by a world model or reinforcement-learning agent. Define a differentiable safety function $B(x)$, such as a distance-to-obstacle margin, actuator-temperature margin, maximum latent-state norm margin, or predicted rollout constraint. A KAN, MLP, encoder, or recurrent estimator produces $\hat{x}$ from observations. 2. Pseudocode: compute $\hat{x}=E_\phi(o_t)$; evaluate $B(\hat{x})$ and its Lie derivatives using automatic differentiation through a learned vector field $\hat f_\psi$ and input matrix $\hat g_\psi$; form $\eta(\hat{x})$; solve $u^*=\arg\min_u\|u-u_{\mathrm{nom}}\|_R^2$ subject to $L_{\hat f}^rB+L_{\hat g}L_{\hat f}^{r-1}B\,u-\bar\Delta_r\geq-K_\alpha\eta(\hat{x})$ and actuator bounds. Apply $u^*$ and log the unconstrained and projected actions. 3. Compute versus estimate: $K_\alpha$ is selected offline by checking Hurwitz eigenvalues; Lie derivatives are computed by autodiff; $\bar\Delta_r$ is estimated from held-out transition residuals using a high quantile, then inflated by the observed estimator error and a safety factor. The paper supplies the robust inequality, while the residual bound must be calibrated empirically or with a confidence method. 4. First cheap experiment: train a small neural state-space model and PPO policy on a two-dimensional obstacle-avoidance or cart-pole task with hidden velocity and a hard state constraint. Compare an unconstrained policy, nominal CBF projection, and robust projection. Sweep the safety-bound multiplier $c$ in $\bar\Delta_r=cq_{0.999}(|\widehat{\Delta}_r|)$. The quantitative prediction is a sharp safety transition: for $c\geq1$ and no residual exceeding the bound, constraint violations should be zero up to numerical tolerance; for $c<1$, violations should begin specifically on trajectories where $\Delta_r<-\bar\Delta_r$. Also measure projection magnitude: it should remain near zero far from the boundary and grow approximately linearly with the barrier deficit near activation.

Verification

Failed on benchmark

Stage 1 · Toy mechanism gate: Passed ✓

Stage 2 · Mechanism transferred to benchmark: Not reproduced ✗

Stage 2 · Practical benchmark result: Significantly worse ✗

Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works

Stage 1 — Mechanism check agent confidence 9/10

The robust barrier projection mechanism was verified in a scalar relative-degree-one toy system. The safety transition occurred at c=1 as predicted, boundary correction scaled with slope 0.25, and active projection versus state had slope -2.0.

Agent confidence
9/10
Baseline
Unconstrained violation 6.0; nominal CBF c=0 violation 0.124615.
Idea
Robust CBF c=1 violation 0, final x=0.000333, and robust inequality minimum approximately 0. c=0.99 had violation 0.000916, while c=1.0 and c=1.1 had zero violation.

Limitations: Only a deterministic scalar relative-degree-one system was tested. Neural state estimation, learned dynamics, higher-order barriers, multidimensional QPs, stochastic residuals, and actuator infeasibility were not tested.

How to run: python3 robust_barrier_experiment.py

Stage 2 — Benchmark vs. tuned baseline (arXiv:2608.12638)

Significantly WORSE than the tuned baseline (+16701.2%, p=0.0081, wins 0 / 8 paired seeds).

Benchmark
Local_robust_barrier_pendulum
Model
local_mlp_2x32
Paired seeds
8
Baseline mean
0.0022
Idea mean
0.372
Effect (Δ)
0.3698 (+16701.2%; negative = idea better)
Wins
0 / 8 paired seeds
p-value
0.0081 (permutation test, 20 000 shuffles)
Smallest detectable effect
±1182.6%
Mechanism
Not confirmed ✗
Practical effect
Hurts
Baseline tuning
swept over 3 configs
Limitations:

The experiment uses a small supervised state-to-action pendulum-style regression track rather than online RL or physical rollout evaluation. It does not test learned hidden-state estimation, learned vector-field residual calibration from held-out transitions, higher-dimensional QPs, actuator infeasibility handling beyond the emergency fallback, or safety-vs-performance Pareto curves.

How to run: python3 robust_barrier_bench.py

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

Stage 2 — Benchmark latest Failed ✗

Agent confidence: 9/10

Built a local dynamics custom track with identical end-to-end MLP systems differing only by the robust relative-degree-2 barrier projection, plus parity-preserving learning-rate sweeps and an 8-seed paired report. The baseline achieved test MSE 0.002214, while the robust idea achieved 0.372039; paired delta was +0.369825 with permutation p=0.0081, therefore the idea was significantly worse. The trained-model mechanism signature was not confirmed: projection intervention averaged 0.8061 with 90.1% activation, while realized robust margins remained negative on this dataset.

Baseline
Best lr=0.003, epochs=12; full 8-seed MSE mean 0.0022143643, std 0.0008738586; per-seed [0.0017547822, 0.0017171794, 0.0013646294, 0.0029080887, 0.0039492799, 0.0022941593, 0.0026330287, 0.0010937665].
Idea
Best among 3 settings was lr=0.003, eps=0.15, epochs=12; full 8-seed MSE mean 0.3720389754, std 0.0296594559; per-seed [0.3806046844, 0.3429493010, 0.3951434195, 0.4191932678, 0.4037822485, 0.3515276313, 0.3354842365, 0.3476270139].
Mechanism signature
Mean intervention 0.8060816, active fraction 0.900625, nominal margin mean -1.9932071, realized margin after projection -2.1362924, negative-margin violation 2.5684525, confirmed=false
Paired comparison
delta_mean=+0.3698246111 (idea-baseline; lower is better), idea_wins=0/8, permutation p_value=0.0081, verdict='idea worse (significant)'

Benchmark result

Significantly WORSE than the tuned baseline (+16701.2%, p=0.0081, wins 0 / 8 paired seeds).

Benchmark
Local_robust_barrier_pendulum
Model
local_mlp_2x32
Paired seeds
8
Baseline mean
0.0022
Idea mean
0.372
Effect (Δ)
0.3698 (+16701.2%; negative = idea better)
Wins
0 / 8 paired seeds
p-value
0.0081 (permutation test, 20 000 shuffles)
Smallest detectable effect
±1182.6%
Mechanism
Not confirmed ✗
Practical effect
Hurts
Baseline tuning
swept over 3 configs
Limitations:

The experiment uses a small supervised state-to-action pendulum-style regression track rather than online RL or physical rollout evaluation. It does not test learned hidden-state estimation, learned vector-field residual calibration from held-out transitions, higher-dimensional QPs, actuator infeasibility handling beyond the emergency fallback, or safety-vs-performance Pareto curves.

How to run: python3 robust_barrier_bench.py

Artifacts

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