# Observable-Reduced Neural World Model

- ID: 2112
- Canonical URL: https://synthcore.org/idea/2112/observable-reduced-neural-world-model
- API JSON: https://synthcore.org/api/idea/2112.json
- API Markdown: https://synthcore.org/api/idea/2112.md
- Verification status: beats_baseline
- Source: [arXiv:2608.11125](https://arxiv.org/abs/2608.11125)
- Category: dynamics
- Solves: stability, accuracy, generalization
- ML areas: world-model, ssm, rnn, training
- Math tags: dynamical-systems, control-theory, optimization, linear-algebra
- Ratings: usefulness 8/10; difficulty 5/10; novelty 7/10

## Idea description

Replace a generic first-order predictor for an aggregate observation with a second-order observable-reduced dynamics module derived by eliminating hidden active and quiescent compartments. Train a neural network only for the unknown growth function while enforcing the exact coefficient structure induced by switching rates, so the model cannot exploit a trajectory-fitting but mechanistically incorrect latent representation.

## Mathematical statement

Let a(t) be the hidden active population, q(t) the hidden quiescent population, and y(t)=a(t)+q(t) the observed aggregate. Assume da/dt=g(a)-alpha*a+beta*q and dq/dt=alpha*a-beta*q, where g is active-state growth, alpha is the active-to-quiescent rate, and beta is the quiescent-to-active rate. For an active-state observation y=a, eliminating q gives d2y/dt2=[g'(y)-alpha-beta]dy/dt+beta*g(y). For a linear active growth law g(a)=r*a, the aggregate observation satisfies d2y/dt2=(r-alpha-beta)dy/dt+beta*r*y. The neural model should predict d2y/dt2=F_theta(y,dy/dt) using features dictated by the observation reduction, while estimating nonnegative rates through softplus parameterizations. The structural invariant for the linear case is that the coefficient of y equals beta*r and the coefficient of dy/dt equals r-alpha-beta, so coefficient estimates must obey these relations across trajectories and sensor regimes.

## Key formulas

- $$\dot a=g(a)-\alpha a+\beta q,\qquad \dot q=\alpha a-\beta q,\qquad y=a+q.$$
- $$\ddot y=\bigl[g'(y)-\alpha-\beta\bigr]\dot y+\beta g(y)\quad\text{when }y=a.$$
- $$\ddot y=(r-\alpha-\beta)\dot y+\beta r y\quad\text{when }g(a)=ra\text{ and }y=a+q.$$
- $$\mathcal L=\frac{1}{N}\sum_{i=1}^{N}\left(\ddot y_i-F_\theta(y_i,\dot y_i)\right)^2+\lambda\left(c_y-\beta r\right)^2+\lambda\left(c_{\dot y}-(r-\alpha-\beta)\right)^2.$$

## Implementation notes

1. Exact integration point: use this module as the transition operator inside a recurrent state-space model or neural ODE for partially observed time series. The recurrent state is (y,v), with v=dy/dt; evolve dy/dt=v and dv/dt=F_theta(y,v). For an aggregate sensor and approximately linear growth, use F_theta(y,v)=c_y*y+c_v*v+h_theta(y,v), where h is initially zero or a small residual network. Parameterize alpha, beta, and r with softplus outputs and optionally share them across experiments. 2. Pseudocode: estimate v_i approximately by applying a Savitzky-Golay filter or differentiable local polynomial smoother to each observed trajectory, and estimate acceleration a_i approximately by differentiating v_i. Compute a_pred=F_theta(y_i,v_i), then minimize the acceleration residual plus the coefficient-relation penalty. Roll out with y_(k+1)=y_k+Delta_t*v_k and v_(k+1)=v_k+Delta_t*F_theta(y_k,v_k), preferably using RK4. 3. Computed from the paper: the second-order observable reduction and algebraic coefficient constraints. Estimated empirically: derivatives, r, alpha, beta, and residual-network parameters. 4. First cheap experiment: generate 100 synthetic trajectories from the two-compartment model with random r, alpha, and beta, retain only noisy aggregate observations at 5 to 20 time points, and compare a GRU, a generic first-order neural ODE, and this reduced model on held-out parameter combinations and rollouts five times longer than training windows. Fit both with and without the coefficient penalty. The quantitative prediction is that a first-order model will fit one-step loss but have worse long-horizon error, while the reduced model coefficients will satisfy c_y approximately beta*r and c_v approximately r-alpha-beta within 10 to 20 percent. Increasing observation sparsity should degrade derivative estimates smoothly; the reduced model should fail sharply when the sampling interval exceeds the fastest switching timescale, approximately Delta_t greater than or equal to 1/(alpha+beta).

## Verification

- Status: beats_baseline
- Mechanism evidence: yes
- Mechanism confirmed: no
- Practical verdict: helps
- Verdict: Built and verified the linear observable-reduced world-model MVP. Across 16 rate combinations, fitted coefficients obeyed c_y=beta*r and c_v=r-alpha-beta with maximum relative error 1.41e-5. The sampling sweep showed the predicted transition: mean coefficient error rose from 0.00093 for dt/tau<=0.2 to 0.108 for dt/tau>=1, while the reduced second-order rollout had much lower long-horizon tail RMSE than the first-order baseline, 0.083 versus 1.407.

### Mechanism check

- Verdict: Built and verified the linear observable-reduced world-model MVP. Across 16 rate combinations, fitted coefficients obeyed c_y=beta*r and c_v=r-alpha-beta with maximum relative error 1.41e-5. The sampling sweep showed the predicted transition: mean coefficient error rose from 0.00093 for dt/tau<=0.2 to 0.108 for dt/tau>=1, while the reduced second-order rollout had much lower long-horizon tail RMSE than the first-order baseline, 0.083 versus 1.407.
- Confidence: 9/10
- Limitations: This MVP tests the exact linear reduction rather than training the proposed neural residual network, GRU, or learned recurrent state-space model. It uses exact noiseless hidden-system simulation with only a small observation-noise perturbation in the rollout comparison, finite differences rather than Savitzky-Golay smoothing, and does not estimate all three rates from only two observable coefficients.

### Practical benchmark

- Paired seeds: 8
- Baseline mean: 0
- Idea mean: 0
- p-value: 0.0081
- Paired wins: 8/8
- Benchmark verdict: idea better (significant)

## Artifacts

- [README.md](https://synthcore.org/code/783/README.md)
- [bench_observable_reduced.py](https://synthcore.org/code/783/bench_observable_reduced.py)
- [bench_report.json](https://synthcore.org/code/783/bench_report.json)
- [observable_reduced_experiment.py](https://synthcore.org/code/783/observable_reduced_experiment.py)
- [report.md](https://synthcore.org/code/783/report.md)
- [report_bench_2026-09-01T103350.md](https://synthcore.org/code/783/report_bench_2026-09-01T103350.md)
- [results.json](https://synthcore.org/code/783/results.json)
- [Download all files as ZIP](https://synthcore.org/download/783)

## Disclaimer

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