Neural Discovery of Memory and Nonlocal Kernels in Integro-Differential Equations with Constrained Kolmogorov--Arnold Networks
arXiv:2607.11110
2026
Architecture
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The transferable asset is the hard-constrained Bernstein parameterization of positive, monotone-decreasing, convex kernels: it converts qualitative prior knowledge into coefficient inequalities that hold for every network output, rather than relying on penalty tuning. This can become a trainable causal memory head for sequence models, where the learned lag kernel determines how past value vectors are aggregated and is therefore interpretable as a nonparametric replacement for a fixed exponential or power-law decay. The most direct experiment is to add this branch to a small Transformer or SSM, compare it with unconstrained learned lag weights and exponential memory at equal parameter count, and test whether the shape constraints improve extrapolation and stability under sparse or noisy training data.
Ideas from this paper
✗ Failed on benchmark
2026
Add a causal memory branch whose lag-response function is represented by a Bernstein polynomial with coefficients constrained to produce a nonnegative, decreasing, convex kernel. The branch aggregates past hidden states using this kernel, giving the model a learnable long-memory profile while preventing oscillatory, negative, or increasing historical influence.
Useful7/10
Difficulty4/10
Novelty7/10