Search arXiv⌕ Search

arXiv · 2610.02845

An Arrow of Time in Stable Autonomous Generation

Abstract

Does stable autonomous generation select a direction of time? This question matters both for learning models that autonomously generate prescribed dynamics and for designing controllers that make an invariant set attracting without changing its dynamics. Periodic motion and quasiperiodic torus rotations admit stable generation in either direction. For a chaotic attractor, however, reversing the equations reproduces its backward trajectories while turning attraction into repulsion. Can additional latent variables or autonomous feedback restore attraction without changing the reversed motion? We prove an obstruction to such exact generation by finite-dimensional autonomous systems with $C^2$ vector fields, compact attracting sets, and continuous readouts. The result applies to the classical Lorenz attractor and, more generally, to dynamics with an ergodic invariant measure of positive metric entropy whose intrinsic local stable fibers are totally disconnected on a set of positive measure. The proof connects this geometry to an entropy contradiction: a hypothetical attracting realization would force the output entropy to vanish, contrary to the prescribed chaotic dynamics. We use reservoir-computing examples to illustrate the difficulty of stable autonomous generation for time-reversed chaos: both time directions are closely tracked while the networks are driven by data, but only the forward example retains Lorenz geometry during autonomous generation. The theorem identifies a class of dynamics that cannot be learned for exact, stable autonomous generation by finite-dimensional smooth models satisfying the stated assumptions, regardless of the learning procedure or the number of latent variables.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhixin Lu. 2026-10-02. An Arrow of Time in Stable Autonomous Generation. https://arxiv.org/abs/2610.02845

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Slow-spectrum preshaping for reservoir computing: Attractor reconstruction in attracting submanifolds under partial observation

Data-driven reproduction of chaotic dynamics under partial observation remains a challenge despite its practical importance. Reservoir computing (RC) and other data-driven approaches often succeed in short-term prediction but are sensitive to hyperparameters and frequently fail to reproduce the long-term statistical properties of the system. As recently shown, a major cause of this failure is spurious slow modes induced by training, which render the reconstructed invariant set transversally unstable in the representation space. To address this, a design principle called Attractor Reconstruction in Attracting Submanifolds (ARAS) was proposed, which requires the reconstruction to lie in a low-dimensional, transversally attracting submanifold. Under full observation, ARAS was realized by an input-layer design that limits the number of slow modes perturbed during training and anchors the remaining modes to stay fast, thereby suppressing spurious slow modes. However, under partial observation, this design alone fails because the submanifold designed to be attracting cannot retain the observation history needed to unfold the observed data into a faithful reconstruction. In this study, we propose slow-spectrum preshaping, which introduces a slow spectrum into the reservoir prior to feeding input data. The induced slow modes then retain a memory of past observations within the submanifold, while the input-layer design makes the submanifold transversally attracting, so that ARAS is realized under partial observation. Through numerical experiments on various chaotic systems, we show that our approach enables reliable short-term prediction and long-term reproduction of chaos over a wide range of hyperparameters without a posteriori tuning.

nlin.CD↗

On a cross-coupling of Rulkov neural maps

We introduce a novel coupling of Rulkov neural maps, proposing a heuristic biological interpretation for the transition to non-small values of the perturbations acting on the slow variables. We analytically prove that the coupling of two identical neurons preserves the emergence of Devaney chaos through the existence of a generalized snap-back repeller, provided that a snap back repeller exists for the original system. We present numerical simulations for the coupling of two different neurons showing the arising of a potential global strange attractor, whose fractal structure is strongly suggested by the computation of a non-integer Kaplan-Yorke dimension. Furthermore, we perform standard numerical studies concerning time series, Lyapunov exponents spectra, bifurcation diagrams and basins of attraction. Finally, we briefly propose a generalization of the coupling to an arbitrary number of neurons.

nlin.CD↗

A Renormalization-Group Hierarchy of Stochastic Effective Dynamics Learned through Path Integrals

This study combines a stochastic renormalization group (RG) in space with a path-integral description of the time evolution, giving a spatial hierarchy of coarse-grained dynamics together with the distribution over spatiotemporal paths. The RG is defined as a diffusion process that applies scale-dependent Laplacian damping together with additive Gaussian noise. The time evolution at each spatial scale is formulated as an Onsager--Machlup action, with a drift (i.e., the predictor) and white noise whose amplitude is fixed by the RG. The predictor of these dynamics is optimized by minimizing the Kullback--Leibler divergence between the path distributions from the RG and from the path-integral description. The optimal predictor contains the score function that connects the spatial scales, so the predictor and the score are two aspects of the same multiscale path formulation. The formulation unifies simulation using the predictor, unconditional generation using the score, and super-resolution using both. The predictor has no closed form, so it is computed by a neural network in two realizations that differ only in how the score is computed. The first realization obtains the score by automatic differentiation of the path distribution, remaining faithful to that formulation. The second obtains the score as an additional network output trained by denoising, at a lower computational cost. These two realizations are validated through numerical experiments on two representative multiscale systems, the Kolmogorov flow and the two-timescale Lorenz-96 model.

nlin.CD↗