Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

2735468191,092 · Jun 202019922001200920172026
48 results for deep attractor networks

Deep learning methods improve overlapping speaker separation across languages and noise.

problem Overlapping speaker separation in realistic scenarios.
method Deep clustering and deep attractor networks.
result Deep learning methods are effective for a broad range of languages and can handle untrained languages with common features.

In human perception and cognition, a fundamental operation that brains perform is interpretation: constructing coherent neural states from noisy, incomplete, and intrinsically ambiguous evidence. The problem of interpretation is well matched to an early and often overlooked architecture, the attractor network---a recur…

2019-06-08abs ↗pdf ↗

A central challenge faced by memory systems is the robust retrieval of a stored pattern in the presence of interference due to other stored patterns and noise. A theoretically well-founded solution to robust retrieval is given by attractor dynamics, which iteratively clean up patterns during recall. However, incorporat…

2018-11-23abs ↗pdf ↗

Study analyzes Echo State Network parameters for Rossler attractor dynamics.

problem Understanding the influence of network type on Echo State Network performance.
method Experimental analysis of Echo State Network parameters using Rossler attractor.
result Exploration of how network type affects Echo State Network performance.

Identifying computational mechanisms for memorization and retrieval of data is a long-standing problem at the intersection of machine learning and neuroscience. Our main finding is that standard overparameterized deep neural networks trained using standard optimization methods implement such a mechanism for real-valued…

2019-09-26abs ↗pdf ↗

We study the problem of learning associative memory -- a system which is able to retrieve a remembered pattern based on its distorted or incomplete version. Attractor networks provide a sound model of associative memory: patterns are stored as attractors of the network dynamics and associative retrieval is performed by…

2019-10-07abs ↗pdf ↗

Learning three data points can generate all types of periodic orbits in a neural network.

problem Can learning three data points generate all types of periodic orbits in a neural network?
method Investigated a continuous one-dimensional map with period three in a random neural network in its thermodynamic limit.
result Almost all learned periods are unstable, and each network has its own characteristic attractors.

Paper analyzes coexisting hidden and self-excited attractors in an economic system.

problem Existence of coexisting hidden and self-excited attractors in economic systems.
method Integer and fractional order analysis of an economic system.
result Integer-order system exhibits multiple combinations of coexisting hidden and self-excited attractors.

This paper studies closed 3-manifolds which are the attractors of a system of finitely many affine contractions that tile R3\mathbb{R}^3. Such attractors are called self-affine tiles. Effective characterization and recognition theorems for these 3-manifolds as well as theoretical generalizations of these results to hig…

2014-02-12abs ↗pdf ↗

The paper is focused on the existence problem of attractors for foliations. Since the existence of an attractor is a transversal property of the foliation, it is natural to consider foliations admitting transversal geometric structures. As transversal structures are chosen Cartan geometries due to their universality. T…

2017-03-22abs ↗pdf ↗

Isolating individual instruments in a musical mixture has a myriad of potential applications, and seems imminently achievable given the levels of performance reached by recent deep learning methods. While most musical source separation techniques learn an independent model for each instrument, we propose using a common…

2018-11-07abs ↗pdf ↗

Machine learning classifiers are often trained to recognize a set of pre-defined classes. However, in many applications, it is often desirable to have the flexibility of learning additional concepts, with limited data and without re-training on the full training set. This paper addresses this problem, incremental few-s…

2018-10-16abs ↗pdf ↗

This paper classifies expanding attractors and non-transitive Anosov flows on specific knot and manifold spaces.

problem Classifying expanding attractors and non-transitive Anosov flows on specific knot and manifold spaces.
method Using the derived Anosov (DA) expanding attractor and the Franks-Williams manifold, the paper proves the uniqueness of these structures.
result The DA expanding attractor and the Franks-Williams non-transitive Anosov flow are the unique structures supported by N0N_0 and M0M_0 respectively.

Neural networks can model chaos efficiently by becoming geometrically chaotic.

problem Lack of theoretical understanding of how neural networks learn chaos.
method Employed a geometric perspective to show neural networks can model chaotic dynamics.
result Neural networks can reconstruct strange attractors and accurately predict local divergence rates.

Unified Bayesian framework predicts cryptocurrency market dynamics and volatility.

problem Predicting cryptocurrency market trends and volatility.
method Bayesian framework based on potential field theory and Gaussian Process.
result Attractors and repellers from the potential field are reliable market indicators.

Researchers analyze how RNNs solve intent detection tasks using dynamical systems theory.

problem Understanding the internal mechanisms of RNNs in intent detection.
method Investigating RNN architectures through a dynamical systems perspective.
result Identified fixed point topology and limited number of attractors in RNN dynamics.

The paper studies dimensions of attractors for modified Leray-alpha equation on various surfaces.

problem Investigate attractor dimensions of the modified Leray-alpha equation.
method Existence and uniqueness of weak solutions, global attractor existence, estimates for vorticity scalar equations, Kolmogorov flows.
result Established upper and lower bounds for Hausdorff and fractal dimensions of global attractors on S2\mathbb{S}^2 and T2\mathbb{T}^2.

It has been argued in the past that high-dimensional neural networks do not exhibit local minima capable of trapping an optimisation algorithm. However, the relationship between loss surface modality and the neural architecture parameters, such as the number of hidden neurons per layer and the number of hidden layers, …

2019-05-24abs ↗pdf ↗

ERDMD discovers sparse, nonuniformly timed DMD models from chaotic attractors.

problem Discovering high-fidelity, nonuniformly timed DMD models from chaotic data.
method Entropic regression for nonlinear information flow detection, combined with multi-step DMD.
result ERDMD produces highly efficient and robust models with minimal complexity.

A new method for analyzing high-dimensional time-series data using deep neural networks.

problem Challenges in modeling high-dimensional time-series data with explicit state and observation processes.
method Deep Direct Discriminative Decoders (D4) for high-dimensional observation processes.
result D4 outperforms traditional SSMs and RNNs in various time-series data applications.

In this paper we focus on compacta KR3K \subseteq \mathbb{R}^3 which possess a neighbourhood basis that consists of nested solid tori TiT_i. We call these sets toroidal. In \cite{hecyo1} we defined the genus of a toroidal set as a generalization of the classical notion of genus from knot theory. Here we introduce the se…

2019-09-18abs ↗pdf ↗

Sigmoid autoencoders can implement associative memory with certain conditions.

problem Implementing associative memory in neural networks.
method Theoretical analysis of overparameterized sigmoid autoencoders using the NTK and iterative maps.
result Overparameterized sigmoid autoencoders can have attractors in the NTK limit, leading to associative memory.

ESNs with transfer learning predict long-term chaotic patterns in spatiotemporal dynamical systems.

problem Predicting long-term statistical patterns of spatiotemporally chaotic dynamical systems.
method Echo state networks (ESNs) with transfer learning.
result ESNs with transfer learning accurately predict long-term statistical properties of spatiotemporally chaotic PDEs.

New theory explains how chaotic training improves neural network generalization.

problem Understanding how chaotic training improves neural network generalization.
method Representing stochastic optimizers as random dynamical systems and introducing a new dimension concept.
result Generalization in chaotic training depends on the complete Hessian spectrum and partial determinants.

In this paper we consider the realization of DE attractors by self-diffeomorphisms of manifolds. For any expanding self-map φ:MMφ:M\to M of a connected, closed pp-dimensional manifold MM, one can always realize a (p,q)(p,q)-type attractor derived from φφ by a compactly-supported self-diffeomorphsm of $\RR^{p+q}$, as long…

2008-11-25abs ↗pdf ↗

Motivated by the study in Morse theory and Smale's work in dynamics, the following questions are studied and answered: (1) When does a 3-manifold admit an automorphism having a knotted Smale solenoid as an attractor? (2) When does a 3-manifold admit an automorphism whose non-wandering set consists of Smale solenoids? T…

2004-03-25abs ↗pdf ↗

In this paper we study the Lorenz equations using the perspective of the Conley index theory. More specifically, we examine the evolution of the strange set that these equations posses throughout the different values of the parameter. We also analyze some natural Morse decompositions of the global attractor of the syst…

2018-12-12abs ↗pdf ↗

The loss surface of deep neural networks has recently attracted interest in the optimization and machine learning communities as a prime example of high-dimensional non-convex problem. Some insights were recently gained using spin glass models and mean-field approximations, but at the expense of strongly simplifying th…

2016-11-04abs ↗pdf ↗

In this paper we study the cohomological Conley index of arbitrary isolated invariant continua for continuous maps f ⁣:URdRdf \colon U \subseteq \mathbb{R}^d \to \mathbb{R}^d by analyzing the topological structure of their unstable manifold. We provide a simple dynamical interpretation for the first cohomological Conley index…

2018-02-07abs ↗pdf ↗

New study shows min-max algorithms can converge to non-stationary points.

problem Challenges in min-max optimization due to periodic cycles and spurious attractors.
method Analyzed state-of-the-art algorithms and heuristics in non-convex/non-concave problems.
result Spurious attractors can prevent min-max algorithms from reaching true optima.

We analyze the dynamical properties of a tetrahedron transformation on the space of non-degenerate tetrahedra which can be identified with the non-compact globally symmetric 88-dimensional space $\mbox{Sl}(3,\mathbb{R}) / \mbox{So}(3,\mathbb{R})$. We establish the existence of a local attractor which coincides with th…

2017-08-28abs ↗pdf ↗

The OGY method is one of control methods for a chaotic system. In the method, we have to calculate a stabilizing periodic orbit embedded in its chaotic attractor. Thus, we cannot use this method in the case where a precise mathematical model of the chaotic system cannot be identified. In this case, the delayed feedback…

2019-07-16abs ↗pdf ↗

An iterated function system ΦΦ consisting of contractive similarity mappings has a unique attractor FRdF \subseteq \mathbb{R}^d which is invariant under the action of the system, as was shown by Hutchinson [Hut]. This paper shows how the action of the function system naturally produces a tiling T\mathcal{T} of the con…

2006-06-05abs ↗pdf ↗

Let MM be a manifold or (more generally) a locally compact, metrizable ANR. If KK is an attractor for a flow in MM, with basin of attraction A(K)\mathcal{A}(K), it is well known that the inclusion i:KA(K)i : K \subseteq \mathcal{A}(K) is always a shape equivalence. In this paper we investigate to what extent this generaliz…

2015-11-20abs ↗pdf ↗