跳到正文
arXiv:cs.LG· Arman Kostanian, Armen Beklaryan·· 4 小时前AI 评分32

耗散型知识动力学模型的可辨识性:设计激励下的精确恢复与观测数据上的退化

Identifiability of a dissipative knowledge-dynamics model: exact recovery under designed excitation, degeneration on observational data

AI 导读

研究者为人类学习建立了一个非线性耗散常微分方程组模型,参数包含概念迁移矩阵、逐概念遗忘率与饱和练习响应增益,并证明了在显式激励条件下该逆问题的结构可辨识性定理,两个概念时给出闭式恢复。

正文

View PDF HTML (experimental)

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 concept-transfer matrix encoding prerequisite coupling, per-concept forgetting rates, and a saturating practice-response gain), and we study when those parameters can actually be recovered from data. We prove a structural identifiability theorem for the associated inverse problem under explicit excitation conditions, with constructive closed-form recovery for the two-concept case, together with monotonicity, robustness and L-stability results. We derive a semi-implicit L-stable scheme for the dissipative subsystem and a batched solver numerically equivalent to the per-trajectory formulation (bit-exact predictions, gradients to $10^{-10}$) yet two orders of magnitude faster, making estimation feasible on cohorts of $10^5$ learners. The empirical study is two-sided. Under the theorem's excitation conditions, synthetic recovery is exact: parameters to machine precision, prerequisite structure at $F_1 = 1.0$. On large observational benchmarks it is not. An apparently strong recovery, with forgetting rates correlating with topic difficulty at Spearman $\rho = 0.83$, is refuted by four independent controls: it survives destroying the temporal order of the data, is matched by a classical Bayesian baseline, and is unaffected by removing real timestamps. We trace this to the stationary structure of the model and show that it is the degeneration the theorem predicts in the absence of designed excitation. The result delineates a sharp boundary between identifiable and unidentifiable regimes and yields a validation protocol for interpretability claims.
Subjects: Machine Learning (cs.LG); Optimization and Control (math.OC); Machine Learning (stat.ML)
MSC classes: 93B30, 34A55, 62P15
ACM classes: I.2.6; G.1.7
Cite as: arXiv:2610.09889 [cs.LG]
  (or arXiv:2610.09889v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2610.09889

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Arman Kostanian [view email]
[v1] Wed, 7 Oct 2026 11:50:29 UTC (51 KB)

来源:arXiv:cs.LG · arxiv.org