Skip to content

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

Oct 2026 · 0 citations · 32 references
Computer Science Mathematics

TL;DR

For two concepts, this work proves a constructive structural identifiability theorem for the associated inverse problem under explicit excitation conditions, together with monotonicity, robustness and L-stability results.

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 $\rho = 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.

View source

Similar papers

#machine learning Preprint Sep 2026

One Intervention per Component is Enough: Towards Identifiability in Linear Stochastic Dynamics from Steady State

A recursive learning algorithm is proposed that orders SCCs topologically and, for each component, isolates its marginal dynamics and solves a linear system derived from the steady-state moment equations, leveraging parameters recovered for upstream components.

Saber Salehkaleybar · 2 citations · ⚡1
#machine learning Preprint Aug 2026

Generalization as a robust performance property of learning-enabled dynamical systems

This work provides a system-theoretic interpretation of generalization in learning-enabled dynamical systems arising in data-driven optimization and feedback control approximation, and establishes a matrix inequality-based certificate and a uniform stability bound that separates the one-sample sensitivity of the learne...

Filippo Fabiani · 0 citations
Preprint Sep 2026

Learning Dissipative Dynamics with Dissipativity-by-Construction Discrete-Time Neural Networks

Dissipativity is a fundamental system-theoretic property closely related to stability, passivity, and input--output stability, and is particularly important in robotics, where learned dynamics models are often embedded within feedback control loops. However, most existing approaches for learning dissipative dynamics ar...

T. Luong, Hyungpil Moon · 0 citations
Preprint Aug 2026

The role of parameter Jacobians in the stability of network outputs

This work shows that the corresponding linearized dynamics leads naturally to a semigroup formulation, and proves norm-bounds on the corresponding semigroup perturbations, in the form of explicit finite-time perturbation estimates.

Halyun Jeong, Palle E. T. Jorgensen, Hyun-Kyoung Kwon et al. · 0 citations
Open access Sep 2026

Learning stochasticity via a nonparametric approach to state-dependent noise estimation

Modeling stochastic dynamical systems remains a central challenge across disciplines. Incomplete knowledge of nonlinear interactions and state-dependent fluctuations often renders bottom-up approaches ineffective, motivating methods that infer governing equations directly from data. However, parametric models struggle...

G. Pillonetto, A. Giaretta, M. Bisiacco · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.