Sample-adaptive Lipschitz budget for diffusion policies
Implementation & benchmark of arXiv:2607.07967 — Expressivity and Statistical Trade-offs in Diffusion Policy Learning
Source paper: Expressivity and Statistical Trade-offs in Diffusion Policy Learning arXiv:2607.07967 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Treat the diffusion drift Lipschitz constant K as an explicit capacity knob and tune it from the amount of trajectory data. Enforce K directly with spectral normalization or a product-of-layer-norm constraint, then select among a small set of budgets using held-out return or behavior-cloning likelihood rather than allowing unconstrained networks to acquire an uncontrolled effective Lipschitz constant.
Formulas
Mathematical statement
The paper's transferable approximation statement is that a diffusion policy whose drift is K-Lipschitz can approximate concentrated deterministic optimal policies with value error of order 1/K, while nondegenerate diffusion noise gives a matching lower bound of the same order. Let b_theta(t,x,a) be the neural drift, with time t, state x in R^m, action/noise coordinate a, and parameters theta. The imposed budget is ||b_theta(t,x,a)-b_theta(t,x',a')|| <= K||(x,a)-(x',a')|| for all relevant inputs. The paper reports finite-sample generic neural-network performance gap tilde-O(n^{-2/(m+6)}) after balancing approximation and statistical complexity, where n is the number of samples and m is state dimension. The implementation uses an empirical upper bound K_hat = product_l s_l on the network's layer spectral norms s_l, multiplied by activation Lipschitz constants when necessary. The diffusion policy is the terminal law of dA_t = b_theta(t,x,A_t)dt + sigma dW_t, with diffusion coefficient sigma, Brownian motion W_t, initial state A_0, and terminal sampled action A_T.
Implementation notes
(1) Integration point: replace the unconstrained drift MLP inside a conditional diffusion policy with a spectrally normalized drift network. The network receives diffusion time t, observation x, and current action state A_t, and predicts b_theta(t,x,A_t); this modification affects both the training-time diffusion loss and inference-time Euler or Heun sampling. Use a fixed candidate budget set K_grid, for example {0.5, 1, 2, 4, 8, 16}, after normalizing state and action coordinates.
(2) Pseudocode:
for K in K_grid:
construct drift b_theta with Wbar_l = W_l * min(1, c_l / sigma_max(W_l))
choose c_l so product_l c_l = K / product_l Lip(activation_l)
train b_theta on training trajectories
for validation state x:
A = sample_base_noise()
for j in range(N_steps):
t = j*T/N_steps
A = A + b_theta(t, x, A)*dt + sigma*sqrt(dt)*normal()
evaluate validation return or action log-likelihood
select K with the best validation score
The displayed Lipschitz inequality is the target constraint and the product of spectral norms is the computable upper bound. Estimate each sigma_max(W_l) with one to three power iterations per optimizer step; estimate actual local sensitivity separately with random finite differences, K_local = max ||b(z+epsilon*u)-b(z)||/epsilon over validation samples. The approximation term and sample-size rate come from the paper; the practical K choice is selected by validation because constants, action dimension, horizon, and noise level are unknown. First experiment: train a small two-layer diffusion policy on a multimodal two-dimensional continuous-control imitation or offline-RL task, comparing unconstrained training, fixed spectral normalization, and the K grid at equal parameter count and sampling steps. Measure terminal-action Wasserstein distance to demonstrations, return, validation likelihood, empirical K_local, and gradient stability. Success is a U-shaped validation-error or return curve in K, with small K underfitting multimodality and large K overfitting, plus improved held-out return at the selected K over an unconstrained baseline.
Verification
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 9/10
Built and ran a small conditional drift MLP with product spectral-norm budgets and an unconstrained baseline. The mechanism manifested: Euler stability matched the predicted K<20 boundary exactly, OU variance matched theory within 0.41%, and approximation error decreased to zero at the predicted K>=4 threshold; empirical local sensitivity also tracked the imposed budget. However, the practical held-out imitation proxy did not beat the unconstrained model, so this verifies the mechanism but not a downstream performance win.
- Agent confidence
- 9/10
- Baseline
- Unconstrained: validation score MSE 3.104, terminal proxy MSE 0.1273, product norm 19.45, local sensitivity 8.90
- Idea
- Best constrained K=16: validation score MSE 3.124, terminal proxy MSE 0.1281, product norm 10.69, local sensitivity 5.11; K=8 had the best constrained proxy MSE 0.1392 among lower budgets but remained worse than baseline
Limitations: Toy scalar-action imitation rather than a full RL environment or trajectory-return evaluation; one random seed; one-step denoising proxy instead of full Euler/Heun diffusion sampling; no Wasserstein metric, confidence intervals, or multi-seed validation; projection is post-update hard spectral clipping rather than differentiable spectral normalization.
How to run: python3 experiment.py
Stage 2 — Benchmark vs. tuned baseline (arXiv:2607.07967)
No significant difference vs. the tuned baseline (+31.0%, p=0.2294, wins 1 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.0001
- Idea mean
- 0.0001
- Effect (Δ)
- 0 (+31.0%; negative = idea better)
- Wins
- 1 / 8 paired seeds
- p-value
- 0.2294 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±56.4%
- Mechanism
- Not confirmed ✗
- Practical effect
- Inconclusive
- Baseline tuning
- swept over 3 configs
Only the registered built-in dynamics track was tested. The experiment did not evaluate a full conditional diffusion policy with Euler or Heun terminal-action sampling, trajectory return, Wasserstein distance, or larger neural policies. The intervention used post-update hard spectral projection rather than differentiable spectral normalization.
How to run: python3 bench_experiment.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 and ran the sample-adaptive Lipschitz budget on the registered dynamics track using a matched rnn_small architecture and post-update product spectral-norm projection. The trained-model mechanism signature was confirmed: the measured input Jacobian stayed below the imposed K budget, and the Euler contraction boundary matched theory. The best constrained model was not better than the tuned unconstrained baseline, so the idea does not earn worked=true.
- Baseline
- Unconstrained rnn_small, lr=0.01: mean test MSE 7.418319e-05 over 8 paired seeds.
- Idea
- Constrained rnn_small, lr=0.01, K=4.0: mean test MSE 9.720995e-05 over 8 paired seeds; paired delta +2.302676e-05 and permutation p=0.22945.
- Mechanism
- Euler prediction confirmed; trained product norm 2.29884 <= K=4; measured maximum input Jacobian 0.56577 <= K.
Benchmark result
No significant difference vs. the tuned baseline (+31.0%, p=0.2294, wins 1 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.0001
- Idea mean
- 0.0001
- Effect (Δ)
- 0 (+31.0%; negative = idea better)
- Wins
- 1 / 8 paired seeds
- p-value
- 0.2294 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±56.4%
- Mechanism
- Not confirmed ✗
- Practical effect
- Inconclusive
- Baseline tuning
- swept over 3 configs
Only the registered built-in dynamics track was tested. The experiment did not evaluate a full conditional diffusion policy with Euler or Heun terminal-action sampling, trajectory return, Wasserstein distance, or larger neural policies. The intervention used post-update hard spectral projection rather than differentiable spectral normalization.
How to run: python3 bench_experiment.py
Artifacts
- REPORT.md 2.6 KB View
- bench_experiment.py 6.5 KB View Raw
- bench_report.json 3.2 KB View Raw
- experiment.py 4.1 KB View Raw
- report.md 1.5 KB View
- report_bench_2026-08-30T233857.md 5.4 KB View
- results.json 2.2 KB View Raw