Эксперимент: Reduction-Robust Pole Regularization (#1153)

{ "worked": false, "confidence": 8, "verdict": "Built a reproducible toy reduction benchmark implementing low-frequency moment rho, finite-window two-state fitting, the discriminant check, and the proposed disagreement/boundary penalty. The discriminant behaved exactly as claimed: rho<4 produced Delta<0 and complex poles, while rho>=4 produced real poles. However, the sampled stable three-pole system did not reproduce the paper's opposite-side reduction (rho_moment=4.468, rho_window=4.008), and regularization reduced disagreement only from 0.460 to 0.418 (~9%) while adding task error; therefore the proposed effect was not observed.", "metrics": { "baseline": "task MSE 0.000000; rho_moment 4.4680; rho_window 4.0080; disagreement 0.4600", "idea": "task MSE 0.0000212; rho_moment 4.4256; rho_window 4.0080; disagreement 0.4176 (~9.2% lower)" }, "how_to_run": "/home/maxwelhelp/main/bin/python3 experiment.py", "files": [ "experiment.py", "results.json" ], "limitations": "This is a small deterministic transfer-function toy, not a neural SSM, gated RNN, Copy-Memory task, or damped-sine prediction experiment. The exact higher-order cascade-parallel parameters and original bacterial sampling schedule were not available in the paper excerpt, so the paper's rho=4.50 versus 3.31 pair was not exactly reproduced. The exploratory search was limited by nonlinear-fit runtime and encountered numerical overflow for some unstable optimizer candidates." }