Value-Gradient Trajectory Collocation
Implementation & benchmark of arXiv:2608.11480 — Forward Trajectory Steering for Hamilton-Jacobi Reachability Analysis
Source paper: Forward Trajectory Steering for Hamilton-Jacobi Reachability Analysis arXiv:2608.11480 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace a static or uniformly random PINN collocation distribution with points generated by rolling out the model's own local feedback dynamics. For a learned scalar field V_theta(x,t), compute a control and adversarial direction from grad_x V_theta, integrate the physical dynamics forward, add controlled Gaussian exploration, and train on the resulting points together with a small uniform reservoir. This should concentrate samples near reachable boundaries, large-residual regions, and dynamically important trajectories while retaining coverage of the global domain.
Formulas
Mathematical statement
For dynamics dot{x}=f(x,u,d), let V_theta(x,t) be the neural value function and let p=grad_x V_theta(x,t). Define the Hamiltonian H(x,p)=min_{u in U} max_{d in D} p^T f(x,u,d), with the min/max reversed if the application uses the opposite value convention. At each rollout state, choose approximate actions (u*,d*) by solving these bounded inner optimizations, then evolve a stochastic steering process dX_s=f(X_s,u*(X_s),d*(X_s))ds+sqrt(2 sigma^2)dW_s. Collocation samples are drawn from the empirical occupation measure rho_hat(x)=(NK)^(-1) sum_k sum_j delta(x-X_kj), optionally mixed with uniform density rho_train=(1-alpha)rho_uniform+alpha rho_hat. The PINN minimizes the HJ residual R_theta=partial_t V_theta+H(x,grad_x V_theta) and boundary or terminal residuals. The transferable mechanism is feedback-induced concentration, while sigma greater than zero prevents collapse onto a few deterministic characteristics.
Implementation notes
1. Exact integration point: use this sampler between optimizer updates for any PINN, neural ODE residual model, or value/world-model network. Maintain a replay buffer containing a fixed fraction of uniform domain points and a steerable buffer containing states from current forward rollouts. At a sampled (x,t), evaluate V_theta and its input gradient with autodiff. For box-bounded controls and disturbances, first implement the cheap affine case: calculate g_u=(grad_x V_theta)^T f_u and g_d=(grad_x V_theta)^T f_d, then choose each component of u* and d* at the corresponding bound according to the sign of its coefficient; for nonlinear dynamics use 3-5 projected-gradient steps or a small random candidate set. 2. Pseudocode: initialize uniform points; repeat: compute p=grad_x(V_theta(x,t)); solve u_star=argmin_u p^T f(x,u,d) and d_star=argmax_d p^T f(x,u,d); set x_next=x+Delta_t f(x,u_star,d_star)+sqrt(2 sigma^2 Delta_t) epsilon, where epsilon is standard Gaussian noise; append x_next and intermediate states to the trajectory buffer; draw a batch with alpha trajectory points and 1-alpha uniform points; minimize mean(R_theta^2)+lambda_B mean(boundary_residual^2); periodically refresh the buffer because the policy induced by V_theta changes. Clip states to the PDE domain and reject or reflect invalid points. 3. Computed from the paper's mechanism: the feedback direction from the current value gradient, forward trajectory steering, and injected exploration. Estimated empirically: the occupation density and suitable alpha, Delta_t, and sigma. Use detached gradients for sampling so the sampler does not add second-order terms to the training loss. 4. First cheap experiment: solve a 2-D Burgers or linear-advection PINN and a 2-D double-integrator reachability HJ equation. Compare uniform Sobol sampling, residual-based adaptive sampling, and this method at equal network evaluations. Use a 4-layer tanh MLP, 10,000 collocation points, alpha=0.7, and noise levels sigma in {0, 0.01, 0.05}. The quantitative prediction is that the steered sampler lowers mean squared residual in the top 10 percent largest-error states by at least 25 percent at equal sample count and produces a sharper concentration of points within a prescribed distance of the learned zero level set. Sweep the control gain or steering strength: excessive steering should cause mode collapse and worse global error, while uniform mixing should prevent it. Measure the collapse transition by the effective sample size of occupied spatial bins; the useful regime should have high boundary coverage and lower residual, whereas sigma=0 should show visibly lower coverage and greater run-to-run variance.
Verification
Stage 1 · Toy mechanism gate: Passed ✓
Stage 2 · Mechanism transferred to benchmark: Confirmed ✓
Stage 2 · Practical benchmark result: No measurable effect
Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works
Stage 1 — Mechanism check agent confidence 6/10
Built Value-Gradient Trajectory Collocation with affine bounded min/max actions, stochastic steering, uniform-reservoir mixing, and a small PINN experiment. The checks confirmed zero-error affine corner selection, deterministic displacement scaling as gamma·dt, Brownian variance scaling as 2·sigma²·dt, and exact trajectory mixture fractions. The trajectory sampler did not improve this toy PINN: global residual MSE was 0.000706 versus 0.000359 for uniform sampling, and top-error MSE was 0.00246 versus 0.00116, so the mechanism was validated but the promised accuracy win was not observed.
- Agent confidence
- 6/10
- Baseline
- Uniform PINN: global residual MSE 3.5895e-4; top-error residual MSE 1.1628e-3.
- Idea
- Trajectory PINN: global residual MSE 7.0623e-4; top-error residual MSE 2.4586e-3. Math checks: affine max error 0; gamma displacement/prediction ratios approximately 1.0; sigma variance/prediction ratios 1.002, 0.999, 0.997; mixture trajectory fractions exactly matched alpha.
Limitations: Only a small 1D toy steering field and 1D Hamilton-Jacobi PINN were tested; no 2D Burgers, double-integrator reachability, Sobol baseline, residual-based adaptive baseline, FLOP-normalized study, or extensive alpha/sigma/gain sweeps were run.
How to run: python3 experiment.py
Stage 2 — Benchmark vs. tuned baseline (arXiv:2608.11480)
No significant difference vs. the tuned baseline (+0.8%, p=0.4855, wins 3 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.7875
- Idea mean
- 0.7941
- Effect (Δ)
- 0.0066 (+0.8%; negative = idea better)
- Wins
- 3 / 8 paired seeds
- p-value
- 0.4855 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±2.5%
- Mechanism
- Confirmed ✓
- Practical effect
- No effect
- Baseline tuning
- swept over 3 configs
The completed run used a reduced but complete protocol budget of n_train=256, n_test=128, and 5 epochs per run after the initial 400-sample/14-epoch version exceeded the time limit. Only one alpha and sigma setting was tested; no broader sampler hyperparameter sweep, longer training, or comparison against residual-based adaptive sampling was run. PyTorch emitted the benchmark's existing MSE broadcasting warning because targets are shape [N] while rnn_small outputs [N,1]; this shape convention was shared by both systems.
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
Implemented Value-Gradient Trajectory Collocation on the structurally matched dynamics track using the shared rnn_small architecture, paired seeds, equal epochs/batch/optimizer, and a parity-compliant learning-rate sweep. The mechanism signature measured on trained models confirmed 1.0 sign agreement for the feedback control prediction, but test MSE was slightly worse for the idea (0.79414 vs 0.78750), with delta_mean=+0.00664 and permutation p=0.4855. Therefore the mechanism signal is present, but the promised benchmark improvement was not observed.
- Baseline
- dynamics/rnn_small: best lr=0.001; 8-seed test MSE mean=0.7875012234, std=0.0678897644; paired baseline values=[0.8156408072,0.7547019720,0.8308971524,0.9123226404,0.7518438101,0.7541651726,0.8133183718,0.6671198606]. Baseline sweep means: lr=0.001 -> 0.8283906430, lr=0.003 -> 0.8293724805, lr=0.01 -> 0.8328554034.
- Idea
- feedback trajectory sampler with alpha=0.7, sigma=0.035, dt=0.05, lr=0.001; 8-seed test MSE mean=0.7941433117, std=0.0710090306; paired idea values=[0.8096513748,0.8031849861,0.8362289667,0.9341802597,0.7649334669,0.7608115077,0.7781288624,0.6660270691]. Idea sweep means: lr=0.001 -> 0.7941433117, lr=0.003 -> 0.8040007651, lr=0.01 -> 0.8066116720. paired delta_mean=+0.0066420883, idea wins=3/8, permutation p=0.4855.
Benchmark result
No significant difference vs. the tuned baseline (+0.8%, p=0.4855, wins 3 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.7875
- Idea mean
- 0.7941
- Effect (Δ)
- 0.0066 (+0.8%; negative = idea better)
- Wins
- 3 / 8 paired seeds
- p-value
- 0.4855 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±2.5%
- Mechanism
- Confirmed ✓
- Practical effect
- No effect
- Baseline tuning
- swept over 3 configs
The completed run used a reduced but complete protocol budget of n_train=256, n_test=128, and 5 epochs per run after the initial 400-sample/14-epoch version exceeded the time limit. Only one alpha and sigma setting was tested; no broader sampler hyperparameter sweep, longer training, or comparison against residual-based adaptive sampling was run. PyTorch emitted the benchmark's existing MSE broadcasting warning because targets are shape [N] while rnn_small outputs [N,1]; this shape convention was shared by both systems.
How to run: python3 stage2_bench.py
Artifacts
- bench_report.json 4.0 KB View Raw
- experiment.py 4.6 KB View Raw
- report.md 1.5 KB View
- report_bench_2026-09-01T131251.md 4.7 KB View
- results.json 2.1 KB View Raw
- stage2_bench.py 6.9 KB View Raw