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

9182635 · Oct 202519922001200920172026
48 results for evolutionary finance

MadEvolve optimizes trading algorithms using LLMs, achieving significant improvements in feature generation and trading strategy optimization.

problem Optimizing trading algorithms for better performance and feature generation.
method A framework inspired by Alpha-Evolve, using LLMs to evolve trading strategies and feature pipelines.
result Significant improvements in trading performance across various tasks, including feature generation and trading strategy optimization.

This paper reviews digital transformation research from 2011-2024, focusing on corporate finance.

problem Lack of systematic review in digital transformation from corporate finance perspective.
method Combines bibliometric and content analysis methods.
result Emerging and rapidly growing focus on digital transformation, particularly in developed countries.

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 ↗

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.

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.

EAP clusters evolving data, promoting temporal smoothness and automatic cluster tracking.

problem Clustering time-evolving data with temporal smoothness and automatic cluster identification.
method Evolutionary Affinity Propagation (EAP) on a factor graph exchanging messages between adjacent data snapshots.
result EAP clusters data with temporal smoothness and automatically tracks clusters, outperforming existing methods.

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.

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.

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.

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.

In many applications of finance, biology and sociology, complex systems involve entities interacting with each other. These processes have the peculiarity of evolving over time and of comprising latent factors, which influence the system without being explicitly measured. In this work we present latent variable time-va…

2018-02-12abs ↗pdf ↗

Combines variational and evolutionary optimization for generative models.

problem Optimizing generative models with discrete latent variables.
method Truncated posteriors as variational distributions, evolutionary algorithms applied to variational parameters.
result Evolutionary algorithms effectively optimize variational bounds for generative models.

Evolutionary algorithms improve decision tree ensembles.

problem Improving predictive performance of decision trees.
method Real-valued vector representation of decision trees, evolutionary algorithms (Differential evolution, Evolution strategies).
result Proposed methods outperform classical decision tree induction algorithms.

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.

An evolutionary game model analyzes e-commerce and traditional retail trends during the pandemic.

problem Understanding the dynamics between e-commerce and traditional retail during the pandemic.
method Developed an evolutionary game model to study consumer-producer interactions on e-commerce platforms.
result Investment in logistics and warehouses in e-commerce led to faster delivery and consumer trends.

This research proposes the econophysics kinetic market model as an evolutionary algorithm's instance. The immediate results from this proposal is a new replacement rule for family competition genetic algorithms. It also represents a starting point to adding evolvable entities to kinetic market models.

2019-06-04abs ↗pdf ↗

Enhanced evolutionary algorithms solve NP-hard portfolio optimization with cardinality constraints.

problem Portfolio optimization under cardinality constraints with real-world conditions.
method Strengthened multi-objective evolutionary algorithms with new representations, operators, and repair mechanisms.
result The proposed algorithms converge faster and provide better approximations with no performance loss.

Proposes Genetic Thompson Sampling for multi-armed bandits, improving performance in nonstationary settings.

problem Improving sequential decision making tasks of online learning agents using multi-armed bandits.
method Integrates genetic principles into Thompson Sampling for multi-armed bandits.
result Significantly outperforms baselines in nonstationary settings.

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 ↗

Unified method for analyzing evolving manifolds using de Rham-Hodge theory.

problem Analysis of evolving geometric and topological properties of manifolds.
method Evolutionary de Rham-Hodge method applied to filtration-induced families of de Rham complexes.
result Three sets of topology-preserving singular spectra reveal topological persistence and geometric progression.

Time series prediction with deep learning methods, especially long short-term memory neural networks (LSTMs), have scored significant achievements in recent years. Despite the fact that the LSTMs can help to capture long-term dependencies, its ability to pay different degree of attention on sub-window feature within mu…

2018-11-09abs ↗pdf ↗

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 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 ↗

Simplicial learning improves classification by generating compact sparse representations.

problem Difficulty in distinguishing classes on the same subspace.
method Evolutionary simplicial learning approach to sparse representations.
result Evolutionary simplicial learning outperforms other methods in multi-class classification.

VisEvol uses evolutionary optimization to find optimal hyperparameters for machine learning models.

problem Finding the best hyperparameters for complex machine learning models is computationally intensive and challenging.
method VisEvol employs evolutionary optimization, storing performant models and improving others through crossover and mutation processes.
result VisEvol generates a voting ensemble of models with improved predictive performance.

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.

Paper proposes deep learning model for dynamic stock repurchase forecasting.

problem Complex temporal dependencies in corporate financial conditions.
method Hybrid Temporal Convolutional Network (TCN) and Attention-based LSTM.
result Model significantly outperforms static baselines in stock repurchase forecasting.