Search arXivSearch

arXiv · 2506.06492

Data-driven Identification of Attractors Using Machine Learning

Abstract

In this paper we explore challenges in developing a topological framework in which machine learning can be used to robustly characterize global dynamics. Specifically, we focus on learning a useful discretization of the phase space of a flow on compact, hyperrectangle in $\mathbb{R}^n$ from a neural network trained on labeled orbit data. A characterization of the structure of the global dynamics is obtained from approximations of attracting neighborhoods provided by the phase space discretization. The perspective that motivates this work is based on Conley's topological approach to dynamics, which provides a means to evaluate the efficacy and efficiency of our approach.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcio Gameiro, Brittany Gelb, William Kalies, Miroslav Kramar, Konstantin Mischaikow, Paul Tatasciore. 2025-12-16. Data-driven Identification of Attractors Using Machine Learning. https://arxiv.org/abs/2506.06492

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

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS