Table of Contents
Fetching ...

Innovation Capacity of Dynamical Learning Systems

Anthony M. Polloreno

TL;DR

The paper investigates why the classical information-processing capacity $C_{ m ip}$ can fall short of the readout covariance rank in noisy reservoirs. It introduces the innovation capacity $C_{ m i}$ via a basis-free Doob decomposition and proves the exact conservation law $C_{ m ip}+C_{ m i}= ext{rank}(oldsymbol{\Sigma}_{XX})\le d$, meaning missing input-focused capacity is reallocated to orthogonal innovation tasks. In linear-Gaussian Johnson-Nyquist settings the split reduces to generalized-eigenvalue shrinkage, yielding an explicit monotone tradeoff between temperature and $C_{ m ip}$; geometrically, the predictable and innovation parts form complementary ellipsoids in whitened space. The authors show that a large innovation budget drives a high-dimensional innovation subspace with a positive variance floor, leading to extensive block entropy and exponentially many distinguishable histories, and prove information-theoretic hardness for learning the induced innovation-law from data, underscoring the generative utility of noisy physical reservoirs for exploring rich histories.

Abstract

In noisy physical reservoirs, the classical information-processing capacity $C_{\mathrm{ip}}$ quantifies how well a linear readout can realize tasks measurable from the input history, yet $C_{\mathrm{ip}}$ can be far smaller than the observed rank of the readout covariance. We explain this ``missing capacity'' by introducing the innovation capacity $C_{\mathrm{i}}$, the total capacity allocated to readout components orthogonal to the input filtration (Doob innovations, including input-noise mixing). Using a basis-free Hilbert-space formulation of the predictable/innovation decomposition, we prove the conservation law $C_{\mathrm{ip}}+C_{\mathrm{i}}=\mathrm{rank}(Σ_{XX})\le d$, so predictable and innovation capacities exactly partition the rank of the observable readout dimension covariance $Σ_{XX}\in \mathbb{R}^{\rm d\times d}$. In linear-Gaussian Johnson-Nyquist regimes, $Σ_{XX}(T)=S+T N_0$, the split becomes a generalized-eigenvalue shrinkage rule and gives an explicit monotone tradeoff between temperature and predictable capacity. Geometrically, in whitened coordinates the predictable and innovation components correspond to complementary covariance ellipsoids, making $C_{\mathrm{i}}$ a trace-controlled innovation budget. A large $C_{\mathrm{i}}$ forces a high-dimensional innovation subspace with a variance floor and under mild mixing and anti-concentration assumptions this yields extensive innovation-block differential entropy and exponentially many distinguishable histories. Finally, we give an information-theoretic lower bound showing that learning the induced innovation-block law in total variation requires a number of samples that scales with the effective innovation dimension, supporting the generative utility of noisy physical reservoirs.

Innovation Capacity of Dynamical Learning Systems

TL;DR

The paper investigates why the classical information-processing capacity can fall short of the readout covariance rank in noisy reservoirs. It introduces the innovation capacity via a basis-free Doob decomposition and proves the exact conservation law , meaning missing input-focused capacity is reallocated to orthogonal innovation tasks. In linear-Gaussian Johnson-Nyquist settings the split reduces to generalized-eigenvalue shrinkage, yielding an explicit monotone tradeoff between temperature and ; geometrically, the predictable and innovation parts form complementary ellipsoids in whitened space. The authors show that a large innovation budget drives a high-dimensional innovation subspace with a positive variance floor, leading to extensive block entropy and exponentially many distinguishable histories, and prove information-theoretic hardness for learning the induced innovation-law from data, underscoring the generative utility of noisy physical reservoirs for exploring rich histories.

Abstract

In noisy physical reservoirs, the classical information-processing capacity quantifies how well a linear readout can realize tasks measurable from the input history, yet can be far smaller than the observed rank of the readout covariance. We explain this ``missing capacity'' by introducing the innovation capacity , the total capacity allocated to readout components orthogonal to the input filtration (Doob innovations, including input-noise mixing). Using a basis-free Hilbert-space formulation of the predictable/innovation decomposition, we prove the conservation law , so predictable and innovation capacities exactly partition the rank of the observable readout dimension covariance . In linear-Gaussian Johnson-Nyquist regimes, , the split becomes a generalized-eigenvalue shrinkage rule and gives an explicit monotone tradeoff between temperature and predictable capacity. Geometrically, in whitened coordinates the predictable and innovation components correspond to complementary covariance ellipsoids, making a trace-controlled innovation budget. A large forces a high-dimensional innovation subspace with a variance floor and under mild mixing and anti-concentration assumptions this yields extensive innovation-block differential entropy and exponentially many distinguishable histories. Finally, we give an information-theoretic lower bound showing that learning the induced innovation-block law in total variation requires a number of samples that scales with the effective innovation dimension, supporting the generative utility of noisy physical reservoirs.
Paper Structure (13 sections, 15 theorems, 105 equations, 3 figures)

This paper contains 13 sections, 15 theorems, 105 equations, 3 figures.

Key Result

Proposition 3.1

Assume $\Sigma_{XX}(T)=S+T\,N_0$ with $S,N_0\succeq 0$ and $T\ge 0$. Let $r:=\mathop{\mathrm{rank}}\nolimits\Sigma_{XX}(T)$, assumed constant on an interval $T\in[T_1,T_2]$, and let $r_S:=\mathop{\mathrm{rank}}\nolimits S$. Then there exist nonnegative finite generalized eigenvalues $\lambda_1,\dots In particular, $C_{\mathrm{ip}}(T)$ is nonincreasing and $C_{\mathrm{i}}(T)$ is nondecreasing in $T

Figures (3)

  • Figure 1: RLC temperature sweep: data-driven $C_{\mathrm{ip}}$ (blue $\cdot$) and $C_{\mathrm{i}}$ (orange $\cdot$) versus analytic predictions (solid) from Proposition \ref{['prop:temperature-clean']}. The sum tracks $\mathop{\mathrm{rank}}\nolimits \Sigma_{XX}(T)$.
  • Figure 2: Simulated capacities over $(\beta,T)$ using the demodulate-LPF protocol \ref{['eq:duff-demod']}-\ref{['eq:duff-readout']} for a Duffing oscillator. Top: total IPC and total innovation. Bottom: IPC constituents (linear/cubic) and innovation constituents (noise/mixed).
  • Figure 3: Covariance-fit validation for the Duffing oscillator. Deterministic linear and cubic capacities versus $T$ for representative $\beta$ values. Markers denote direct simulation estimates of the deterministic sector; curves are covariance-model predictions from Eq. \ref{['eq:duff-gT']} with fitted nonnegative $\{a_k(\beta)\}$ in the isotropic correction of Eq. \ref{['eq:duff-add-fit']}.

Theorems & Definitions (30)

  • Proposition 3.1: Johnson-Nyquist temperature tradeoff
  • proof
  • Definition 4.1: Projection capacity and sector capacities
  • Lemma 4.2: Trace representation of summed capacities
  • proof
  • Lemma 4.3: Readout dimension equals covariance rank
  • proof
  • Theorem 4.4: Conservation of observable rank
  • proof
  • Corollary 4.5: Innovation allocation in high-rank stochastic reservoirs
  • ...and 20 more