Proximal Relations and Maximal Equicontinuous Factors for Non-autonomous Dynamical Systems
arXiv:2607.22849
2026
Dynamics
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper provides a transfer mechanism for time-varying neural dynamics: under uniform convergence of the maps, collective convergence, and uniform rigidity, proximality relations of a non-autonomous system can be inherited from an autonomous limit system. Its most useful asset is a principled distinction between finite-time closeness and long-horizon orbit equivalence, together with a construction of the smallest closed relation invariant under every time-dependent generator. This can be used to design or monitor recurrent or state-space networks whose weights, normalization, or controllers change during training or inference while preserving a stable autonomous quotient. The key falsifiable prediction is that long-horizon pairwise orbit behavior should match the limiting autonomous model only after generator-discrepancy and rigidity diagnostics cross measurable thresholds.
Ideas from this paper
Unverified
2026
Treat each recurrent update or inference block as a time-dependent map F_n and regularize it toward a limiting autonomous map F whose long-horizon dynamics are easier to analyze. In addition to penalizing one-step map differences, impose a quotient-consistency loss so that pairs of hidden states that are asymptotically indistinguishable under F remain indistinguishable under every time-dependent generator F_n.
Useful5/10
Difficulty6/10
Novelty8/10