# Path-Space Boundary Screening Regularizer

- ID: 861
- Canonical URL: https://synthcore.org/idea/861/path-space-boundary-screening-regularizer
- API JSON: https://synthcore.org/api/idea/861.json
- API Markdown: https://synthcore.org/api/idea/861.md
- Verification status: mech_ok_no_baseline
- Source: [arXiv:2607.13391](https://arxiv.org/abs/2607.13391)
- Category: regularization
- Solves: stability, generalization, sample-efficiency
- ML areas: rnn, ssm, world-model, regularization
- Math tags: probability, information-theory, stochastic-processes
- Ratings: usefulness 8/10; difficulty 5/10; novelty 6/10

## Idea description

Train a sequential model with an explicit boundary state B so that exterior history Y and interior history X become conditionally independent given the entire boundary history, not merely given the current boundary value. Penalize estimated conditional mutual information from conditional sequence likelihoods; this should remove hidden temporal feedback and improve modular long-horizon prediction.

## Mathematical statement

Let P be the joint law of exterior, boundary, and interior trajectories (Y_0:T, B_0:T, X_0:T). The desired path-space boundary property is P(dy_0:T, dx_0:T | b_0:T) = P(dy_0:T | b_0:T) P(dx_0:T | b_0:T). Its violation is conditional mutual information I(Y_0:T; X_0:T | B_0:T) = E[log p(y_0:T, x_0:T | b_0:T) - log p(y_0:T | b_0:T) - log p(x_0:T | b_0:T)], equivalently a conditional KL divergence. Optimize prediction loss plus lambda times this quantity. The key property is that the penalty detects delayed feedback, hidden innovations, and memory variables even when instantaneous I(Y_t; X_t | B_t) is small.

## Key formulas

- $$P(dy_{0:T},dx_{0:T}\mid b_{0:T})=P(dy_{0:T}\mid b_{0:T})P(dx_{0:T}\mid b_{0:T})$$
- $$I(Y_{0:T};X_{0:T}\mid B_{0:T})=\mathbb{E}\left[\log\frac{p(y_{0:T},x_{0:T}\mid b_{0:T})}{p(y_{0:T}\mid b_{0:T})p(x_{0:T}\mid b_{0:T})}\right]$$
- $$\mathcal{L}(\theta)=\mathcal{L}_{\mathrm{pred}}(\theta)+\lambda\widehat{I}_{\theta}(Y_{0:T};X_{0:T}\mid B_{0:T})$$

## Implementation notes

Use a recurrent state-space model or transformer with three designated streams. The boundary stream B_t receives the information intended to pass between exterior stream Y_t and interior stream X_t. Implement three conditional likelihood heads: a joint head for p_theta(Y_0:T, X_0:T | B_0:T), an exterior head for p_theta(Y_0:T | B_0:T), and an interior head for p_theta(X_0:T | B_0:T). The marginal heads must not access the opposite stream. For each teacher-forced trajectory, compute log_joint, log_y, and log_x, then set cmi_hat = mean(log_joint - log_y - log_x) and loss = prediction_loss + lambda times cmi_hat. Use a slowly updated copy of the marginal heads or stop-gradient through their targets if optimization is unstable. The paper supplies the factorization and KL/CMI identity; the sequence likelihoods are estimated by the neural models. As a first cheap experiment, create a synthetic delayed-channel system where Y_t and X_t are independent given B_t but X_{t-1} influences Y_t. Compare a GRU with instantaneous CMI regularization against path-CMI regularization. Sweep sequence length T and lambda. The prediction is that instantaneous CMI remains near zero while path CMI is positive, and path CMI decreases monotonically with lambda. On a genuinely screened system, estimated path CMI should reach the finite-sample noise floor; on the delayed system it should remain positive without the regularizer. Long-horizon error should correlate with residual path CMI.

## Verification

- Status: mech_ok_no_baseline
- Mechanism evidence: yes
- Mechanism confirmed: yes
- Practical verdict: no_effect
- Verdict: Built a reproducible analytic MVP of path-space boundary screening for a delayed Gaussian channel, with exact and empirical CMI checks plus regularization and long-horizon-risk sweeps. The mechanism manifested clearly: instantaneous CMI was approximately 1.7e-6 versus exact 0, path CMI was 9.983 versus exact 9.976, and path CMI grew linearly with horizon with observed slope 1.24706 matching prediction 1.24706. The half-suppression transition followed the predicted 1/T scaling within about 0.5%; however, suppressing the genuine delayed dependency worsened forecast MSE, so this demonstrates the screening mechanism rather than a predictive win.

### Mechanism check

- Verdict: Built a reproducible analytic MVP of path-space boundary screening for a delayed Gaussian channel, with exact and empirical CMI checks plus regularization and long-horizon-risk sweeps. The mechanism manifested clearly: instantaneous CMI was approximately 1.7e-6 versus exact 0, path CMI was 9.983 versus exact 9.976, and path CMI grew linearly with horizon with observed slope 1.24706 matching prediction 1.24706. The half-suppression transition followed the predicted 1/T scaling within about 0.5%; however, suppressing the genuine delayed dependency worsened forecast MSE, so this demonstrates the screening mechanism rather than a predictive win.
- Confidence: 9/10
- Limitations: This is an analytically controlled scalar toy and not a neural recurrent model with separately parameterized joint, exterior, and interior likelihood heads. It does not test optimization stability, finite-sample neural CMI estimation, genuinely screened systems, FLOPs, or a learned boundary stream; the forecast comparison intentionally reveals the cost of penalizing real delayed feedback.

### Practical benchmark

- Paired seeds: 8
- Baseline mean: 0
- Idea mean: 0
- p-value: 0.52005
- Paired wins: 4/8
- Benchmark verdict: no measurable effect

## Artifacts

- [bench_report.json](https://synthcore.org/code/160/bench_report.json)
- [math_sanity.json](https://synthcore.org/code/160/math_sanity.json)
- [path_screen_bench.py](https://synthcore.org/code/160/path_screen_bench.py)
- [path_screening_experiment.py](https://synthcore.org/code/160/path_screening_experiment.py)
- [report.md](https://synthcore.org/code/160/report.md)
- [report_bench_2026-08-30T182622.md](https://synthcore.org/code/160/report_bench_2026-08-30T182622.md)
- [results.json](https://synthcore.org/code/160/results.json)
- [Download all files as ZIP](https://synthcore.org/download/160)

## Disclaimer

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