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,695 papers · 148 categories

Trend · papers per month

72143215286 · Jun 202019922001200920172026
48 results for evolutionary dynamics

Momentum speeds up evolutionary processes in machine learning.

problem Accelerating convergence in evolutionary dynamics.
method Combining momentum from machine learning with evolutionary dynamics using information divergences as Lyapunov functions.
result Momentum accelerates convergence of evolutionary dynamics, including the replicator equation and Euclidean gradient descent.

New research connects evolutionary dynamics to Bayesian learning.

problem Connecting evolutionary biology and Bayesian learning.
method Rigorous mathematical proof using Kushner-Stratonovich equation and gradient flows.
result Discrete time filtering equations converge to Stratonovich interpretation of Kushner-Stratonovich equation.

Proves FR-NGD optimally approximates evolutionary dynamics and continuous Bayesian inference.

problem Optimizing continuous time replicator equations and continuous Bayesian inference.
method Fisher-Rao natural gradient descent (FR-NGD) and its correspondence with evolutionary dynamics.
result FR-NGD optimally approximates continuous time replicator equations and continuous Bayesian inference.

The paper analyzes cryptocurrency and equity markets using advanced statistical methods.

problem Comparing dynamics and strategies between cryptocurrency and equity markets.
method Random matrix theory, PCA, spectral dynamics, structural break analysis, portfolio simulation.
result Cryptocurrency and equity markets exhibit distinct evolutionary dynamics and time-varying sector behaviors.

A family of replicator-like dynamics, called the escort replicator equation, is constructed using information-geometric concepts and generalized information entropies and diverenges from statistical thermodynamics. Lyapunov functions and escort generalizations of basic concepts and constructions in evolutionary game th…

2009-11-09abs ↗pdf ↗

The accurate and interpretable prediction of future events in time-series data often requires the capturing of representative patterns (or referred to as states) underpinning the observed data. To this end, most existing studies focus on the representation and recognition of states, but ignore the changing transitional…

2019-05-10abs ↗pdf ↗

This research develops an evolutionary approach to discover non-Gaussian stochastic dynamical systems.

problem Discovering explicit governing equations of stochastic dynamical systems with Lévy noise from data.
method ESSR approach using genetic programming, sparse regression, and nonlocal Kramers-Moyal formulas.
result The approach effectively extracts non-Gaussian stochastic dynamical systems from sample path data.

DyHATR learns dynamic heterogeneous networks for better link prediction.

problem Learning effective representations of dynamic heterogeneous networks for link prediction.
method Hierarchical attention for heterogeneous information and temporal RNN for evolutionary patterns.
result DyHATR significantly outperforms state-of-the-art baselines on link prediction tasks.

Evolution and learning are two of the fundamental mechanisms by which life adapts in order to survive and to transcend limitations. These biological phenomena inspired successful computational methods such as evolutionary algorithms and deep learning. Evolution relies on random mutations and on random genetic recombina…

2019-05-08abs ↗pdf ↗

A new MFG framework for evolving clusters from Gaussian mixtures.

problem Evolutionary clustering of time-dependent Gaussian mixtures.
method Control-theoretic framework based on Mean Field Games (MFG) with coupled HJB and Fokker-Planck systems.
result MFG dynamics recover classical EM algorithm trajectories with mass conservation.

LRSAO uses RL to dynamically select and unlearn auxiliary objectives for EA optimization.

problem Optimizing complex landscapes with evolutionary algorithms.
method Local Reinforcement Learning (RL) to dynamically select and unlearn auxiliary objectives.
result Improved optimization complexity from O(n2log(n)/)O(n^2 \log(n) / \ell) to Θ(n2/2+nlog(n))Θ(n^2 / \ell^2 + n \log(n)).

The aim of this work is to establish the personal income distribution from the elementary constituents of a free market; products of a representative good and agents forming the economic network. The economy is treated as a self-organized system. Based on the idea that the dynamics of an economy is governed by slow mod…

2012-03-29abs ↗pdf ↗

Model financial network dynamics to avoid systemic risk.

problem Avoid systemic risk in financial networks.
method Model financial network as random liability graph, agents adapt strategies based on learning, analyze using ODE.
result Emerging strategies converge to evolutionary stable strategies (all risky or all less risky agents).
Quantum Econophysicsphysics.soc-ph

The relationships between game theory and quantum mechanics let us propose certain quantization relationships through which we could describe and understand not only quantum but also classical, evolutionary and the biological systems that were described before through the replicator dynamics. Quantum mechanics could be…

2006-09-28abs ↗pdf ↗

Model shows how heterogeneity in strategies and risk tolerance affects financial market stability.

problem Understanding how heterogeneity impacts financial market dynamics.
method Agent-based model incorporating heterogeneous investment strategies and risk tolerance.
result Heterogeneity in strategies and risk tolerance suppresses price fluctuations.

Financial volatility risk and its relation to a business cycle-related intrinsic time is addressed through a multiple round evolutionary quantum game equilibrium leading to turbulence and multifractal signatures in the financial returns and in the risk dynamics. The model is simulated and the results are compared with …

2011-07-13abs ↗pdf ↗

Model financial network dynamics to avoid systemic risk.

problem Emergence of systemic risk in financial networks.
method Derive solutions of random fixed point equations, analyze replicator dynamics, derive conditions for evolutionary stable strategies, verify with simulations.
result Emerging strategies converge to an attractor of an ODE, avoiding systemic risk.

In many practical applications of clustering, the objects to be clustered evolve over time, and a clustering result is desired at each time step. In such applications, evolutionary clustering typically outperforms traditional static clustering by producing clustering results that reflect long-term trends while being ro…

2011-04-11abs ↗pdf ↗

Develops a new GLM framework for claims reserving with adaptive estimation.

problem Accurate assessment of claims reserves with dynamic and dependent claim activity.
method Multivariate evolutionary GLM framework with adaptive particle filtering algorithm.
result Adaptive estimation of evolving factors improves claims reserve accuracy.

An interesting toy model has recently been proposed on Schumpeterian economic dynamics by Thurner {\it et al.} following the idea of economist Joseph Schumpeter. Punctuated equilibrium dynamics is shown to emerge from this model and some detail analyses of the time series indicate SOC kind of behaviours. The focus in t…

2010-12-29abs ↗pdf ↗

evo-RL combines evolutionary computation with reinforcement learning for better adaptability.

problem Improving reinforcement learning algorithms' adaptability and performance in environments with rewardless states.
method Embedding reinforcement learning in an evolutionary cycle, distinguishing instinctive from learnable behavior.
result evo-RL leads to state-of-the-art performance on OpenAI Gym control problems with rewardless states.

Learning network representations is a fundamental task for many graph applications such as link prediction, node classification, graph clustering, and graph visualization. Many real-world networks are interpreted as dynamic networks and evolve over time. Most existing graph embedding algorithms were developed for stati…

2019-10-04abs ↗pdf ↗

Proposes an evolutionary approach to fitting acyclic VAR models.

problem Cycles in multivariate time series systems obscure hierarchical analysis.
method Evolutionary approach to fitting acyclic VAR processes with hierarchical representation.
result Outperforms unconstrained models and captures key structural properties.

Learning latent representations of nodes in graphs is an important and ubiquitous task with widespread applications such as link prediction, node classification, and graph visualization. Previous methods on graph representation learning mainly focus on static graphs, however, many real-world graphs are dynamic and evol…

2018-12-22abs ↗pdf ↗

This work learns effective dynamics from short-term data of stochastic systems.

problem Learning effective dynamics from short-term data of stochastic systems.
method Proposes a novel algorithm using a neural network (Auto-SDE) to learn invariant slow manifold from data.
result Validated through numerical experiments to be accurate, stable, and effective.

We are often interested in clustering objects that evolve over time and identifying solutions to the clustering problem for every time step. Evolutionary clustering provides insight into cluster evolution and temporal changes in cluster memberships while enabling performance superior to that achieved by independently c…

2019-12-27abs ↗pdf ↗

A co-evolutionary approach for Heston model calibration reduces overfitting with diverse datasets.

problem Overfitting and lack of generalization in Heston model calibration.
method Coupling a genetic algorithm with an evolving neural inverse map, using both GA-history sampling and Latin hypercube sampling.
result Diverse datasets improve out-of-sample stability and calibration accuracy.

The paper improves evolutionary computation by optimizing selection rates.

problem Choosing the right selection rate in evolutionary computation.
method The paper proves mathematically that a selection rate of μ/λ leads to better progress rates and provides a theoretical basis for this.
result The theoretical selection rate μ/λ leads to a better progress rate of order O(λ^-1) compared to O(λ^-2/d).

Novel evolutionary strategy solves stochastic constrained optimization problems.

problem Optimizing objective functions with stochastic constraints in reinforcement learning.
method Design of a novel optimization algorithm with a sufficient decrease mechanism for stochastic constrained problems.
result Demonstrated convergence of the algorithm on control tasks and constrained optimization problems.

The economical world consists of a highly interconnected and interdependent network of firms. Here we develop temporal and structural network tools to analyze the state of the economy. Our analysis indicates that a strong clustering can be a warning sign. Reduction in diversity, which was an essential aspect of the dyn…

2013-01-24abs ↗pdf ↗

CoNES optimizes blackbox functions using convex optimization and information geometry.

problem Optimizing high-dimensional blackbox functions efficiently.
method Formulated as a convex program that adapts evolutionary strategies gradient estimates.
result Vastly outperforms conventional blackbox optimization methods on benchmarks and MuJoCo tasks.

These are the proceedings of the workshop "Math in the Black Forest", which brought together researchers in shape analysis to discuss promising new directions. Shape analysis is an inter-disciplinary area of research with theoretical foundations in infinite-dimensional Riemannian geometry, geometric statistics, and geo…

2018-11-04abs ↗pdf ↗

New method learns population dynamics from snapshots using JKO scheme and inverse optimization.

problem Recovering underlying process governing particle evolution from discrete time samples.
method Combines JKO scheme with inverse optimization techniques for end-to-end adversarial training.
result Improved performance over prior JKO-based methods with theoretical guarantees.

Neural Architecture Search has shown potential to automate the design of neural networks. Deep Reinforcement Learning based agents can learn complex architectural patterns, as well as explore a vast and compositional search space. On the other hand, evolutionary algorithms offer higher sample efficiency, which is criti…

2018-11-24abs ↗pdf ↗

Evolutionary algorithms improve neural network performance by discovering better activation functions.

problem The choice of activation function affects neural network performance, but ReLU remains dominant.
method Defined a tree-based search space of candidate activation functions and used evolutionary algorithms (mutation, crossover, exhaustive search) to explore and discover better functions.
result Replacing ReLU with evolved activation functions statistically significantly increases network accuracy.