科研速览 · Science Skim继续刷下去 · Keep skimming →
◇ arXiv2026-09-01· cond-mat.stat-mech

Pole-Zero Geometry, Model Reduction, and Identifiability in Sensory Adaptation

Gunn Kim

原始摘要(英文原文)· Original abstract
Sensory adaptation provides a concrete setting in which low-order system identification can fail qualitatively. We show that one fixed higher-order adaptive system composed entirely of real first-order relaxation modes can be reduced to opposite sides of the second-order pole boundary: low-frequency moment matching gives $ρ_{\rm moment}=4.50$, whereas finite-window fitting gives $ρ_{\rm window}=3.31$, and the inferred pole class changes further with sampling protocol. Thus the real-versus-complex classification of a reduced model is not itself reduction invariant. We then use the general two-state spectrum to connect stochastic identifiability to adaptation: for nontrivial coupling and one-state observation, cross diffusion drops out of the scalar spectrum when the hidden state has no self-relaxation. In the adaptive model, this condition is precisely the integral-memory limit that produces exact adaptation, while leaky memory restores spectral sensitivity. For the exact-adaptation model, the Gaussian path-space irreversibility nevertheless depends on the hidden cross-diffusion channel. Hence $\{H,S_x\}$ does not determine the irreversibility rate. Independently, for a specified all-even reduced two-state drift with $ρ<4$, the drift-only lower bound is $σ\ge τ_x^{-1}(4/ρ-1)$. Published \textit{E.~coli} and \textit{C.~elegans} responses provide biological examples of these limits. The distinction established here between transfer-function invariants, reduction-dependent properties, and hidden-state quantities provides a concrete framework for evaluating the limitations of low-dimensional models of adaptive biological dynamics.
读原文 · Read the paper ↗

AI 追问PRO

登录后使用 AI 追问

讨论区

登录后参与讨论

相关论文 · Related

Pole-Zero Geometry, Model Reduction, and Identifiability in Sensory Adaptation — 科研速览 Science Skim