✗ Failed on benchmark 2026

Noise-Whitened Trajectory-KL Policy Regularization

Implementation & benchmark of arXiv:2607.22201 — Trajectory-Regularized Stochastic Optimal Control via KL Divergence

Usefulness7/10
Difficulty5/10
Novelty6/10

Source paper: Trajectory-Regularized Stochastic Optimal Control via KL Divergence arXiv:2607.22201 ⓘ · analyzed Aug 30, 2026

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

Idea description

Train a neural policy against task cost while penalizing its induced drift mismatch from a reference policy or offline-data dynamics model. Unlike action-space behavior cloning, the penalty weights deviations by the inverse diffusion covariance, so deviations in highly noisy directions are cheap and deviations in predictable directions are expensive. This gives a principled interpolation between reference preservation and task optimization.

Formulas

$$D_{\mathrm{KL}}(P^u_{0:T}\|P^0_{0:T})=\frac{1}{2}\mathbb{E}_{P^u}\left[\int_0^T\left\|\sigma(X_t)^\dagger\left(f(X_t,u_t)-f_0(X_t)\right)\right\|^2dt\right].$$
$$J_\lambda(u)=\mathbb{E}\left[\int_0^T\ell(X_t,u_t)dt+\Phi(X_T)+\frac{\lambda}{2}\int_0^T(f(X_t,u_t)-f_0(X_t))^\top a(X_t)^\dagger(f(X_t,u_t)-f_0(X_t))dt\right].$$
$$0=\arg\min_u\left\{\ell(x,u)+\nabla V(x)^\top f(x,u)+\frac{1}{2}\operatorname{tr}\left(a(x)\nabla^2V(x)\right)+\frac{\lambda}{2}(f(x,u)-f_0(x))^\top a(x)^\dagger(f(x,u)-f_0(x))\right\}.$$
$$R_\lambda=R+\lambda B^\top a^\dagger B,\qquad R_\lambda u^*=-B^\top\nabla V-\lambda B^\top a^\dagger(b-b_0-Bu_0).$$

Mathematical statement

Let the controlled diffusion be $dX_t=f(X_t,u_t)dt+\sigma(X_t)dW_t$ and the reference diffusion be $dX_t=f_0(X_t)dt+\sigma(X_t)dW_t$, with $a(x)=\sigma(x)\sigma(x)^\top$. Assuming equal diffusion and that $f-f_0$ lies in the range of $\sigma$, Girsanov's theorem gives the trajectory KL divergence $D_{\mathrm{KL}}(P^u_{0:T}\|P^0_{0:T})=\frac{1}{2}\mathbb{E}_{P^u}[\int_0^T\|\sigma(X_t)^\dagger(f(X_t,u_t)-f_0(X_t))\|^2dt]$, where $\sigma^\dagger$ is the Moore-Penrose pseudoinverse. Add this quantity with coefficient $\lambda\geq0$ to the task objective. If $f=b+Bu$, $f_0=b_0+Bu_0$, and the ordinary control cost is $\frac12u^\top Ru$, the local optimal control has effective curvature $R_\lambda=R+\lambda B^\top a^\dagger B$ and satisfies $R_\lambda u^*=-B^\top\nabla V-\lambda B^\top a^\dagger(b-b_0-Bu_0)$.

Implementation notes

1. Exact integration point: use this as an auxiliary loss during policy training. Let $\pi_\theta(u\mid x)$ be the trainable policy and $\pi_0(u\mid x)$ a frozen behavior policy, offline policy, or reference-dynamics controller. Estimate the environment drift as $f_\theta(x)=b(x)+B(x)\bar u_\theta(x)$ and the reference drift as $f_0(x)=b_0(x)+B(x)\bar u_0(x)$; for a learned world model, learn both drifts from transition data. 2. Pseudocode: sample a batch of transitions or short rollouts; compute $d_i=f_\theta(x_i)-f_0(x_i)$ and $a_i=\sigma(x_i)\sigma(x_i)^\top$; solve $a_i z_i=d_i$ with damping $a_i+\epsilon I$; set $L_{\mathrm{trajKL}}=\frac{1}{2N}\sum_i d_i^\top z_i\Delta t$; optimize $L=L_{\mathrm{task}}+\lambda L_{\mathrm{trajKL}}$. If only actions are available and $f=b+Bu$, use $d_i=B_i(\bar u_\theta-\bar u_0)$ rather than an action-norm penalty. 3. Computed from the paper: the quadratic drift mismatch and inverse-covariance weighting. Estimated empirically: $B$, $b$, $b_0$, $\sigma$, and the finite-horizon KL from rollouts. Clip or damp inverse covariance eigenvalues for numerical stability. 4. First cheap experiment: use Pendulum-v1 or a linear-Gaussian control task, comparing PPO or SAC with ordinary behavior regularization against this penalty, using a noisy reference controller trained on half the data. Sweep $\lambda$. The quantitative prediction is that measured trajectory KL decreases monotonically with $\lambda$, while in the local linear-quadratic regime the control deviation satisfies $\|u_\lambda-u_0\|=O(1/\lambda)$ along directions where $B^\top a^\dagger B$ is positive; the fitted local control curvature should match $R+\lambda B^\top a^\dagger B$ within approximately 20%. Increasing environmental noise in a drift direction should reduce its regularization weight in proportion to the corresponding eigenvalue of $a^{-1}$.

Verification

Failed on benchmark

Stage 1 · Toy mechanism gate: Passed ✓

Stage 2 · Mechanism transferred to benchmark: Not reproduced ✗

Stage 2 · Practical benchmark result: Inconclusive

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

Stage 1 — Mechanism check agent confidence 8/10

Built a linear-Gaussian MVP implementing the inverse-covariance drift penalty, analytic optimizer, finite-difference math check, parameter sweeps, and a fixed-seed PyTorch policy comparison. The mechanism manifested: trajectory KL decreased monotonically with lambda, large-lambda scaling approached the predicted noise-dependent limit with 14.7% maximum relative error, and measured curvature exactly matched the predicted ratio of 4.0. The idea reduced trajectory KL by 77.1% versus action regularization, while task loss increased slightly, demonstrating the intended preservation/task tradeoff rather than an unconditional task win.

Agent confidence
8/10
Baseline
Action-norm regularization: task half-MSE 0.39499, trajectory KL 0.16137, action penalty 0.04937.
Idea
Noise-whitened drift regularization: task half-MSE 0.41197, trajectory KL 0.03702, action penalty 0.11427; toy KL decreased from 8.5 at lambda=0 to 0.000789 at lambda=100; curvature ratio observed/predicted 4.0/4.0; asymptotic lambda*u relative error 14.7%.

Limitations: Only a synthetic linear-Gaussian setting was tested; no Pendulum/PPO, learned drift or diffusion model, finite-horizon rollout KL estimation, stochastic policy distributions, model misspecification, or broad lambda/task-performance sweep was evaluated.

How to run: python3 experiment.py

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

No significant difference vs. the tuned baseline (+7.1%, p=0.0956, wins 1 / 8 paired seeds).

Benchmark
Dynamics forecasting
Model
rnn_small
Paired seeds
8
Baseline mean
0
Idea mean
0
Effect (Δ)
0 (+7.1%; negative = idea better)
Wins
1 / 8 paired seeds
p-value
0.0956 (permutation test, 20 000 shuffles)
Smallest detectable effect
±8.1%
Mechanism
Not confirmed ✗
Practical effect
Inconclusive
Baseline tuning
swept over 9 configs
Limitations:

The built-in dynamics track is a forecast task rather than an explicit policy-rollout environment with learned drift and diffusion models. The implementation therefore used predicted theta minus persistence-reference theta as a differentiable drift proxy and a state-dependent proxy variance; PPO/SAC interaction, offline behavior policies, finite-horizon trajectory KL, and larger models were not tested.

How to run: python3 stage2_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

The noise-whitened drift penalty was implemented as a training-loss modification on the structurally matched dynamics track using the shared rnn_small model. The tuned baseline outperformed the best idea configuration: baseline MSE 1.38641318e-05 versus idea MSE 1.48492650e-05, paired delta +9.85133170e-07 and permutation p=0.0956. The mechanism signature was not confirmed, so this is not a win.

Baseline
lr=0.01, reg=0.03; mean=1.3864131801710755e-05, std=2.917053139718998e-06
Idea
lr=0.01, reg=0.03; mean=1.4849264971417142e-05, std=2.2583458302260994e-06
Paired delta
9.85133169706387e-07
Permutation p
0.0956

Benchmark result

No significant difference vs. the tuned baseline (+7.1%, p=0.0956, wins 1 / 8 paired seeds).

Benchmark
Dynamics forecasting
Model
rnn_small
Paired seeds
8
Baseline mean
0
Idea mean
0
Effect (Δ)
0 (+7.1%; negative = idea better)
Wins
1 / 8 paired seeds
p-value
0.0956 (permutation test, 20 000 shuffles)
Smallest detectable effect
±8.1%
Mechanism
Not confirmed ✗
Practical effect
Inconclusive
Baseline tuning
swept over 9 configs
Limitations:

The built-in dynamics track is a forecast task rather than an explicit policy-rollout environment with learned drift and diffusion models. The implementation therefore used predicted theta minus persistence-reference theta as a differentiable drift proxy and a state-dependent proxy variance; PPO/SAC interaction, offline behavior policies, finite-horizon trajectory KL, and larger models were not tested.

How to run: python3 stage2_bench.py

Artifacts

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