✗ Mechanism failed 2026

Entropy-Response Tuning for Recurrent Reservoirs

Implementation & benchmark of arXiv:2607.29434 — Entropy production of active matter systems as indicator for computing performance

Usefulness7/10
Difficulty5/10
Novelty8/10

Source paper: Entropy production of active matter systems as indicator for computing performance arXiv:2607.29434 ⓘ · analyzed Aug 31, 2026

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

Idea description

Tune a recurrent neural reservoir to the operating regime where an input driver produces both a strong hidden-state response and a large discrepancy between driven and innate entropy-production rates. This replaces recurrent-gain selection based only on spectral radius with a measurable non-equilibrium screening criterion. The proposed score should peak near the gain that gives the best downstream prediction accuracy, while weakly driven and excessively unstable regimes should score poorly.

Formulas

$$\sigma_{\mathrm{sys}}^{\mathrm{drv}}(g)=-\frac{1}{T}\sum_{t=0}^{T-1}\log\left|\det\left(\frac{\partial F_{\theta,g}(h_t^{\mathrm{drv}},x_t)}{\partial h_t^{\mathrm{drv}}}\right)\right|$$
$$\Delta_{\sigma}(g)=\frac{\left|\sigma_{\mathrm{sys}}^{\mathrm{drv}}(g)-\sigma_{\mathrm{sys}}^{0}(g)\right|}{\left|\sigma_{\mathrm{sys}}^{0}(g)\right|+\varepsilon},\qquad R(g)=\frac{1}{T}\sum_{t=1}^{T}\left\|h_t^{\mathrm{drv}}-h_t^{0}\right\|_2^2$$
$$S(g)=\widetilde{R}(g)\widetilde{\Delta}_{\sigma}(g),\qquad g^*=\operatorname*{arg\,max}_g S(g)$$
$$\sigma_{\mathrm{path}}=\frac{1}{T}\sum_{t=0}^{T-1}\log\frac{p(h_{t+1}\mid h_t,x_t)}{p_{\mathrm{rev}}(h_t\mid h_{t+1},x_t)}$$

Mathematical statement

Use the reservoir update h_(t+1) = F_(theta,g)(h_t,x_t) + sqrt(2D) xi_t, where h_t is the hidden state, x_t is the input, g is recurrent gain or input coupling, D is noise intensity, and xi_t is standard Gaussian noise. For a driven trajectory, estimate system entropy production from phase-space contraction as sigma_sys_drv(g) = -(1/T) sum_t log absolute determinant of J_t_drv, where J_t_drv is the Jacobian of F with respect to h_t. Run the same reservoir with zero or phase-shuffled input to obtain sigma_sys_0(g). Define the entropy-production discrepancy Delta_sigma(g) as the absolute difference divided by the magnitude of the innate entropy production plus epsilon. Define response R(g) as the average squared distance between driven and innate hidden states. Normalize both quantities across the gain scan and use S(g) = normalized R(g) times normalized Delta_sigma(g). The mechanism predicts that the maximum of S(g) identifies the useful operating regime. For stochastic reservoirs, path irreversibility can additionally be estimated from the log ratio of forward and reverse transition probabilities.

Implementation notes

Use a tanh recurrent reservoir before a linear readout: h_(t+1) = (1-a)h_t + a tanh(g W h_t + U x_t + b) + sqrt(2D) xi_t, where a is the leak rate and g is the scanned control parameter. Freeze W and U, scan g over a fixed grid, and fit only a ridge-regression readout after selecting g. For every g, roll out identical initial states on the real input sequence and on an innate baseline with x_t equal to zero or with phase-shuffled inputs. Accumulate the mean squared hidden-state response R(g). Use automatic differentiation to obtain the hidden-state Jacobian at each step and accumulate the phase-space contraction term using a stable slogdet operation. For small reservoirs compute the determinant exactly; for large reservoirs estimate the log determinant with stochastic trace or Lanczos methods and record estimator variance. Calculate Delta_sigma and the normalized score S. As a cheap first experiment, use 100 tanh units on Lorenz-63 one-step prediction, scan g from 0.1 to 2.0 at 30 points, and compare against spectral-radius tuning and random gain selection. Repeat three seeds with identical data splits and ridge penalties. The quantitative prediction is that the gain maximizing S lies within one grid interval of the minimum validation error and that the Spearman correlation between S and negative validation error exceeds 0.6. The expected curve is low at weak driving, maximal at intermediate gain, and degraded near exploding hidden trajectories. If the score peak consistently disagrees with the accuracy peak, the transfer hypothesis is falsified.

Verification

Mechanism failed

Stage 1 · Toy mechanism gate: Failed ✗

Stage 2 · Mechanism transferred to benchmark: Not tested

Stage 2 · Practical benchmark result: Not run

Methodology: Toy-system gate first; the benchmark stage runs only after a pass. How verification works

Stage 1 — Mechanism check agent confidence 9/10

Built a tanh reservoir with exact hidden-state Jacobian contractions, entropy-response score, Lorenz-63 one-step readout benchmark, and reproducible toy checks. The math sanity checks passed: finite-difference Jacobian error was 7.2e-11, the predicted stability boundary g=1/rho(W)=1.25 matched 1.25, and weak-input response scaling was approximately quadratic (slope 1.94 versus 2). However, the proposed score consistently selected the upper scan boundary g=2.0 while validation-optimal gains were 0.5-1.0; Spearman correlation between S and negative validation error was negative in every seed, so the downstream transfer hypothesis did not hold.

Agent confidence
9/10
Baseline
Spectral-radius gain g=1.0: validation MSE 0.0324, 0.0113, 0.00916 for seeds 3, 7, 19; random-gain mean MSE 0.0288, 0.0339, 0.0212.
Idea
Entropy-response score selected g=2.0 for all seeds, with validation MSE 0.0599, 0.0639, 0.0739; validation-optimal gains were 0.5, 1.0, 1.0 with MSE 0.0101, 0.0113, 0.00916. Spearman S versus negative MSE: -0.767, -0.262, -0.275.

Limitations: Only a small 40-unit deterministic reservoir and three Lorenz-63 seeds were tested. No stochastic path-irreversibility estimator, larger reservoirs, phase-shuffled innate inputs, FLOP/speed analysis, or multi-dataset evaluation was performed.

How to run: python3 experiment.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Artifacts

Implementation overview ⬇ Download all as ZIP 3 files · code, reports and structured results