Sign inGet started
Paper · arXiv

Understanding Latent-Dimension Scaling in Dynamical-System Learning through Spectral Reliability

In deep learning, approximation theory motivates increasing representation size. We ask whether this benefit extends to dynamics learning through autoregressive prediction. We analyze the learned time evolution through the eigenstructure of Koopman operators, using relative residuals to detect spurious eigenpairs arising even as one-step error falls. For bounded Koopman operators, we show that minimal residuals over learned dictionary spaces converge pointwise to their full-space counterparts as these spaces approximate the observable space in $L^2$. Our hypothesis is that Koopman spectral reliability helps explain how consistently rollout error decreases with increasing dimension. We com...

AuthorsItsushi Sakata, Yuta Miyauchi, Yoshinobu Kawahara
Primary categorycs.LG
Published8 October 2026
Last updated at source8 October 2026
cs.LGmath.DSnlin.CD
Embed this entry
<iframe src="https://silytics.si/embed/item/8cf824e2-ce3b-486c-8fee-fd40749e4e90" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.