From two-dimensional continuous maps to one-dimensional discontinuous maps: a novel reduction explaining complex bifurcation structures in piecewise-linear families of maps
arXiv:2512.02291
2025
Architecture
2 ideas extracted · analyzed Aug 29, 2026
What the math gives to ML
The paper constructs an explicit first-return reduction from a two-dimensional piecewise-affine saddle dynamics to a discontinuous one-dimensional map with infinitely many geometrically scaled linear pieces. The transferable asset is not the specific border-collision application, but the combination of logarithmic state partitioning, exact event-driven iteration counts, self-similar parameter scaling, and a controlled approximation error. This suggests neural modules that route or transform activations according to their logarithmic magnitude while sharing parameters across scales. A second opportunity is an event-driven recurrent layer that analytically skips long runs of nearly linear dynamics instead of evaluating every intermediate step.
Ideas from this paper
Unverified
Re-invented
2025
Build a recurrent or state-space layer whose latent state has a stable coordinate and an unstable coordinate, and analytically jump across long stretches of repeated dynamics until an event boundary is reached. Instead of applying the same transition k times, compute the integer return time from a logarithm and apply the closed-form powers directly.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2025
Replace a conventional scalar activation by a geometrically indexed family of affine pieces whose slope changes with the logarithmic magnitude of the input. The same two endpoint parameters are reused across all scales, giving a compact, explicitly scale-aware activation that can represent different responses for exponentially separated activation magnitudes.
Useful6/10
Difficulty4/10
Novelty7/10