Theory ideas

Provable properties, identifiability and convergence arguments, each attached to a toy numerical demonstration.

△ Mechanism confirmed, baseline not beaten 2026

Conformal Lower-Clearance Certificate for Neural Selectors

Attach a finite-sample lower safety certificate to the trajectory selected by a neural planner or policy by calibrating the difference between predicted and realized clearance. A lower-tail CVaR of sampled neural predictions can provide the raw margin, while conformal calibration subtracts an empirical correction that absorbs predictor bias and sampling error.

Useful8/10
Difficulty4/10
Novelty5/10
Paper: Barrier Function Conformal Safety Clearance Certification with CVaR for Driving Trajectory Selection arXiv:2608.26533
△ Mechanism confirmed, baseline not beaten 2026

Statistical Safety Gate for Neural Policies

Wrap policy training or deployment with a distribution-level statistical verifier that tests whether a candidate neural policy violates either a performance threshold or any safety constraint with probability at most \(\varepsilon\). The verifier returns a policy only after obtaining a high-confidence upper bound on the violation rate, making safety a measurable acceptance criterion rather than an average reward penalty.

Useful8/10
Difficulty5/10
Novelty6/10
Paper: SMC-ES: Automated synthesis of formally verified control policies arXiv:2607.15003
✗ Failed on benchmark 2026

Risk-Calibrated World-Model Gates

Replace a fixed-size random transition gate with a risk-calibrated gate whose test count is chosen from the estimated probability of a critical event and the cost of shipping a model that misses it. The gate should combine ordinary i.i.d. rollouts with planner-generated probes aimed at high-cost boundaries, because uniform sampling can make a dangerous model appear perfectly accurate.

Useful7/10
Difficulty4/10
Novelty7/10
Paper: An Omitted Mode Is a Rare Rule: The Sampling-Verification Danger Law in Continuous Code World Models arXiv:2608.17956
Unverified 2026

Analytic Passive-Identification Monitor

Train a neural state-space model whose one-step dynamics are linear in a fixed analytic feature vector, and use the empirical feature Gram matrix to detect whether passive trajectories identify the dynamics. Add data collection or replay only when the Gram matrix is poorly conditioned; the analytic-feature assumption predicts that persistent excitation should emerge without deliberately visiting every operating mode.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: Finite Sample Identification of Analytic Nonlinear Systems arXiv:2608.29908
Unverified 2026

Null-normalized temporal prediction score

Replace raw Pearson correlation when evaluating a temporal neural predictor with a score measuring how many null standard deviations its Fisher-transformed correlation exceeds. Estimate the null scale from a small set of time-misaligned predictions, then reuse it across context lengths or checkpoints. This prevents models from being rewarded for predicting statistically easy, low-information features and gives a more comparable validation signal across datasets and targets.

Useful6/10
Difficulty3/10
Novelty8/10
Paper: Modeling and Interpreting Correlations, Null Distributions and Significance Levels in Neural Tracking of Natural Stimuli arXiv:2608.10887
Unverified 2026

Factor-Two Neural Model-Criticism Test

Use a frozen neural discrepancy score and conditional Monte Carlo replicas to test whether a generative model or learned sampler is compatible with a null data distribution, without requiring mixed chains or joint exchangeability. The resulting empirical p-value has a finite-sample false-alarm bound of at most two times the nominal level, making it safer than an ordinary Monte Carlo rank test for validation and deployment monitoring.

Useful5/10
Difficulty4/10
Novelty7/10
Paper: Monte Carlo testing: non-asymptotic guarantees without joint exchangeability arXiv:2607.23010