Path-Complete Robust Critic
Implementation & benchmark of arXiv:2607.15055 — Robust Optimal Control of Arbitrarily Switched Systems: A Path-Complete Framework
Source paper: Robust Optimal Control of Arbitrarily Switched Systems: A Path-Complete Framework arXiv:2607.15055 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace a single value critic with graph-indexed critics V_alpha and graph-indexed policy heads pi_A, where the labeled graph covers every possible environment mode at every step. Train sampled Bellman inequalities rather than only equality-based temporal-difference errors, and select the policy head using the paper's min-max reachability rule. This targets robust RL settings in which the transition mode can change arbitrarily, such as unknown actuator regimes, domain randomization modes, or adversarial perturbation types.
Formulas
Mathematical statement
For switched dynamics x_{k+1}=f_i(x_k,u_k), with modes i in {1,...,M}, the paper uses a path-complete labeled graph G=(S,E), whose nodes alpha,beta index nonnegative functions V_alpha and whose edges (alpha,beta,i) specify a possible mode-i transition. A reachability graph H has node sets A subseteq S and labeled edges (A,B,i), and must satisfy: for every beta in B, there exists alpha in A with (alpha,beta,i) in E. Given policies pi_A, the central graph-based Bellman inequalities are V_alpha(x) >= c(x,pi_A(x)) + V_beta(f_i(x,pi_A(x))) for every x, every reachability node A, and every edge (alpha,beta,i) with alpha in A. The deployed policy is phi(x)=pi_{A*(x)}(x), where A*(x) is any minimizer of max_{alpha in A} V_alpha(x). In a neural implementation, V_alpha and pi_A are neural networks, and the inequality is enforced on sampled transitions; a true certificate additionally requires global verification or conservative interval bounds over the state domain.
Implementation notes
1. Integration point: use this as the critic and actor structure in a robust model-based or model-free RL loop. Define M known or learned transition modes f_i; examples include different simulators, actuator models, corruption operators, or adversarial disturbance choices. Build a small path-complete graph G and a reachability graph H offline. Instantiate one scalar critic V_alpha(x) per graph node alpha and one policy head pi_A(x) per reachability node A, sharing a trunk but using separate output heads. At action time compute q_A=max_{alpha in A} V_alpha(x), choose A*=argmin_A q_A, and execute pi_A*(x). 2. Pseudocode: sample x; for every A and every graph edge (alpha,beta,i) with alpha in A, set r=c(x,pi_A(x))+V_beta_target(f_i(x,pi_A(x))); violation=softplus((r-V_alpha(x))/tau); minimize the sum of violation terms plus ordinary actor/environment return loss. Use stop-gradient target critics, target-network Polyak averaging, and a multiplier or hinge schedule that gradually increases the inequality penalty. For real transitions, sample i uniformly or from a worst-case mode distribution; for model-based training evaluate all M modes. 3. The graph construction and reachability relation are computed exactly from the discrete graph. Neural values, transition outputs, and Bellman residuals are estimated empirically. To test certification, bound each residual on a box using interval bound propagation or dense state gridding, and report the largest upper-bound violation rather than claiming formal validity from samples. 4. First experiment: train a 2-layer MLP actor/critic on a toy 2D environment with four arbitrary switching modes and compare SAC, a single robust critic using max-over-modes, and this 4-node path-complete critic at equal environment steps and model evaluations. Measure worst-mode return, ordinary return, mode-switch frequency, Bellman residual, and catastrophic-state rate. Success is a higher minimum-over-switch-sequences return and lower worst-case residual without reducing average return by more than 5 percent.
Verification
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 8/10
Built a tabular Path-Complete Robust Critic MVP with graph-indexed critics, labeled mode edges, Bellman-inequality updates, and min-max head routing in path_complete_critic.py. The quantitative predictions were confirmed: observed contraction ratios were 0.50, 0.70, 0.90, and 0.97 for matching predicted gamma values, and complete graph coverage reduced the maximum residual to numerical zero while omitting either mode left a hidden-mode violation of 6.888. The robust policy had worst-case return 90.0 versus 91.5 for the expectation baseline, so the mechanism manifested but this toy did not demonstrate a robust-return win.
- Agent confidence
- 8/10
- Baseline
- Expectation-trained single policy: worst-mode return 91.50; expected return 26.05
- Idea
- Robust graph policy: worst-mode return 90.00; expected return 29.47; complete-graph max violation 8.81e-12; incomplete-graph hidden violation 6.888; contraction ratios matched gamma within about 3e-14
Limitations: This is a small tabular finite-state toy, not a neural actor/critic or SAC comparison. It does not test continuous states, sampled stochastic optimization, target networks, interval-bound certification, larger reachability graphs, mode-switch frequency, or statistically repeated seeds; the routing component was demonstrated structurally but not validated through a broad routing parameter sweep.
How to run: python3 path_complete_critic.py
Stage 2 — Benchmark vs. tuned baseline (arXiv:2607.15055)
Significantly WORSE than the tuned baseline (+425.5%, p=0.0152, wins 1 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.0014
- Idea mean
- 0.0073
- Effect (Δ)
- 0.0059 (+425.5%; negative = idea better)
- Wins
- 1 / 8 paired seeds
- p-value
- 0.0152 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- n/a
- Mechanism
- Not confirmed ✗
- Practical effect
- Hurts
- Baseline tuning
- swept over 3 configs
Only the built-in dynamics track was tested. Formal interval/global certification and full environment rollout evaluation were not performed. The mechanism signature was unconfirmed due to NaN fallback measurements.
How to run: python3 bench_path_complete.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Stage 2 — Benchmark latest Failed ✗
Agent confidence: 10/10
The matched dynamics experiment used rnn_small for both systems, with the idea adding graph-indexed critics, policy heads, switched-mode Bellman-inequality penalties, and min-max routing. Baseline mean test MSE was 0.001391 versus 0.007308 for the idea; paired delta was +0.005917 and permutation p=0.0152, indicating a significant disadvantage. The neural-scale mechanism signature was not confirmed because recorded mode-violation values were NaN.
- Baseline
- mean test MSE 0.0013907151; best lr 0.006
- Idea
- mean test MSE 0.0073077537; best lr 0.006, ineq 0.3, tau 1.0; delta +0.0059170; p 0.0152; 1/8 wins
Benchmark result
Significantly WORSE than the tuned baseline (+425.5%, p=0.0152, wins 1 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.0014
- Idea mean
- 0.0073
- Effect (Δ)
- 0.0059 (+425.5%; negative = idea better)
- Wins
- 1 / 8 paired seeds
- p-value
- 0.0152 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- n/a
- Mechanism
- Not confirmed ✗
- Practical effect
- Hurts
- Baseline tuning
- swept over 3 configs
Only the built-in dynamics track was tested. Formal interval/global certification and full environment rollout evaluation were not performed. The mechanism signature was unconfirmed due to NaN fallback measurements.
How to run: python3 bench_path_complete.py
Artifacts
- bench_path_complete.py 9.0 KB View Raw
- bench_report.json 5.2 KB View Raw
- path_complete_critic.py 7.6 KB View Raw
- report.md 1.6 KB View
- report_bench_2026-08-30T183624.md 3.5 KB View
- results.json 3.3 KB View Raw