Identifiability of a dissipative knowledge-dynamics model: exact recovery under designed excitation, degeneration on observational data
Abstract
Human learning is a dissipative dynamical process: mastery accumulates through practice, decays through forgetting, and propagates across interdependent concepts. We model it as a nonlinear dissipative system of ordinary differential equations whose parameters are mechanistically meaningful (a transfer-of-practice matrix, per-concept forgetting rates, and a saturating practice-response gain), and we study when those parameters can actually be recovered from data. For two concepts, we prove a constructive structural identifiability theorem for the associated inverse problem under explicit excitation conditions, together with monotonicity, robustness and L-stability results. We derive an implicit L-stable scheme and a batched solver numerically equivalent to the per-trajectory formulation yet two orders of magnitude faster. The empirical study is two-sided. Under the theorem's excitation conditions, synthetic recovery is exact. On large observational benchmarks it is not. An apparently strong recovery, with forgetting rates correlating with topic error rates at Spearman ρ= 0.83, is refuted by four controls: it survives destroying the temporal order of the data, is matched by a classical Bayesian baseline, and is unaffected by removing real timestamps. A single shared forgetting rate attains the same accuracy, and replaying the real schedule with identical true rates reproduces most of the correlation. A positive control shows that the controls detect forgetting where it is observable. We trace the effect to the stationary structure of the model and show that it is consistent with the degeneration anticipated by the theory in the absence of designed excitation.
Related
- Excitation and Identifiability in the 2D Navier-Stokes equations
- A Tutorial on Structural Identifiability of Epidemic Models Using StructuralIdentifiability.jl
- Generic Local Identifiability Does Not Imply Generic Global Identifiability in Linear Networks
- Identifiability Guarantees for Drivers and Dynamics of Delayed Physical Systems
- Multirate Data-Driven Predictive Control: Rank Obstructions, Identifiability, and Noise Conditioning
BibTeX
@misc{kostanian2026identifiability,
title = {{Identifiability of a dissipative knowledge-dynamics model: exact recovery under designed excitation, degeneration on observational data}},
author = {Arman Kostanian and Armen Beklaryan},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.09889},
eprint = {2610.09889},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.09889},
}
RIS
TY - UNPB
TI - Identifiability of a dissipative knowledge-dynamics model: exact recovery under designed excitation, degeneration on observational data
AU - Arman Kostanian
AU - Armen Beklaryan
PY - 2026
DA - 2026/10/15
PB - arXiv
DO - 10.48550/arxiv.2610.09889
UR - https://arxiv.org/abs/2610.09889
AB - Human learning is a dissipative dynamical process: mastery accumulates through practice, decays through forgetting, and propagates across interdependent concepts. We model it as a nonlinear dissipative system of ordinary differential equations whose parameters are mechanistically meaningful (a transfer-of-practice matrix, per-concept forgetting rates, and a saturating practice-response gain), and we study when those parameters can actually be recovered from data. For two concepts, we prove a constructive structural identifiability theorem for the associated inverse problem under explicit excitation conditions, together with monotonicity, robustness and L-stability results. We derive an implicit L-stable scheme and a batched solver numerically equivalent to the per-trajectory formulation yet two orders of magnitude faster. The empirical study is two-sided. Under the theorem's excitation conditions, synthetic recovery is exact. On large observational benchmarks it is not. An apparently strong recovery, with forgetting rates correlating with topic error rates at Spearman ρ= 0.83, is refuted by four controls: it survives destroying the temporal order of the data, is matched by a classical Bayesian baseline, and is unaffected by removing real timestamps. A single shared forgetting rate attains the same accuracy, and replaying the real schedule with identical true rates reproduces most of the correlation. A positive control shows that the controls detect forgetting where it is observable. We trace the effect to the stationary structure of the model and show that it is consistent with the degeneration anticipated by the theory in the absence of designed excitation.
ER -