CORTEXA
← Browse
arxivmath.NAcs.LGmath.DS2026-06-27

Residual-Guided Dictionary Learning for Spectrally Accurate Koopman Approximation

George Coote, Matthew J. Colbrook

Koopman theory promises linear structure in nonlinear dynamics, but numerical Koopman spectra are easy to compute and hard to trust. A finite EDMD matrix always has eigenvalues; the problem is that many of them may have nothing to do with the infinite-dimensional operator. In this paper we make spectral reliability the objective of dictionary learning. We train neural-network dictionaries not merely to predict the next snapshot, but to minimize Residual Dynamic Mode Decomposition residuals: operator-level a posteriori errors that test whether computed eigenvalues and modes are genuine Koopman spectral objects. To keep the learned observables from collapsing into an unstable coordinate system, the loss also penalizes the condition number of the lifted data matrix. Thus the method couples two requirements that should not be separated: small Koopman residuals and a well-conditioned representation. The result is a learned dictionary that is expressive, numerically stable, and spectrally disciplined. Across conservative and dissipative benchmark systems, the method sharply reduces spectral pollution, improves residual pseudospectral inclusion, and lowers forecast error relative to standard fixed dictionaries. On sea-surface temperature data, it gives cleaner Koopman diagnostics and substantially better one-step forecasts from noisy observations with no governing equations. The message is simple: neural Koopman learning should be judged not by prediction alone, but by whether its spectral claims can be certified. Residuals provide the certificate; conditioning makes it computable.

View free PDFSource page

Related papers

arxivmath.NAcs.LGmath.DS2026-07-17

A zero-one law for one-shot system identification

Nicolas Boullé, Diana Halikias, Samuel E. Otto, Alex Townsend

Can a model be identified from one experiment? We study analytic systems that are linearly parameterized by a combination of prescribed dictionary terms, such as partial differential operators and dynamical systems. For a single input-response pair, recovery is possible exactly w…

View free PDFSource page
arxivcs.LGmath.DS2026-07-20

fSRD: Fuzzy Spectral Region Decomposition -- Automated Multi Operator Koopman Representations via an Adaptive Spectral Learning Architecture

Charles Bokor, Mark Cary, Denise Morrey, Fabrizio Bonatesta

Highly nonlinear chaotic dynamical systems remain difficult to model due to fundamental trade-offs between complexity, expressivity, and data efficiency. Modern machine learning methods achieve strong predictive performance but often rely on a-priori system knowledge or curated d…

View free PDFSource page
arxivstat.MLcs.LGmath.NA2026-07-01

From Spectral Methods to Sample Complexity Bounds for Fourier Neural Operators

Nisha Chandramoorthy, Daniel Sanz-Alonso, Nathan Waniorek

We establish approximation and learning guarantees for Fourier neural operators (FNOs) applied to time-$T$ solution operators of dissipative evolution equations. The analysis builds on the premise that FNOs can efficiently approximate and learn solution operators whenever these o…

View free PDFSource page
arxivmath.NAcs.AIcs.CEcs.LG2026-07-15

Spectral-Informed Neural Networks Outperform Spectral Methods in High-dimensional PDEs

Tianchi Yu, Ivan Oseledets

For low-dimensional problems ($d\leq3$), spectral methods can achieve exceptionally high accuracy. For middle-dimensional problems ($4 \leq d \lesssim 10$), spectral methods remain feasible through specific techniques such as sparse grids or hyperbolic cross. However, for high-di…

View free PDFSource page