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

112225337449 · Jun 202019922001200920172026
48 results for natural evolution strategies

Algorithm learns which weights to share in deep multi-task learning.

problem Difficulty in deciding which weights to share between tasks in deep learning models.
method Combines natural evolution strategy and stochastic gradient descent to learn optimal weight sharing.
result Task-specific networks achieve lower test errors than existing methods on multi-task learning datasets.

NES optimizes discrete structured VAEs effectively without gradient propagation.

problem Learning high-dimensional discrete latent spaces in generative models.
method Natural Evolution Strategies (NES) for gradient-free optimization of discrete structures.
result NES effectively optimizes discrete structured VAEs, comparable to gradient-based methods.

This paper presents Natural Evolution Strategies (NES), a recent family of algorithms that constitute a more principled approach to black-box optimization than established evolutionary algorithms. NES maintains a parameterized distribution on the set of solution candidates, and the natural gradient is used to update th…

2011-06-22abs ↗pdf ↗

Investment strategies in financial markets can lead to instability due to market impacts.

problem Market impacts make it impossible for investors to accurately optimize their strategies.
method Built an agent-based model with technical analysis strategy agents to investigate optimization instability.
result Investment strategies' parameters never converged but continued to change, leading to unstable market price evolution.

PES method reduces bias in gradient estimation for unrolled graphs.

problem High variance and bias in gradient estimation for unrolled computation graphs.
method Divide graph into unrolls, apply ES update, accumulate correction terms.
result PES provides unbiased, low-variance gradient estimates.

New method for portfolio management learns from past wealth evolution.

problem Optimizing portfolio selection based on past performance.
method Simulated annealing clustering for asset selection, considering past wealth evolution.
result Strategy effectively learns from past performance and performs well in practice.

Since the debut of Evolution Strategies (ES) as a tool for Reinforcement Learning by Salimans et al. 2017, there has been interest in determining the exact relationship between the Evolution Strategies gradient and the gradient of a similar class of algorithms, Finite Differences (FD).(Zhang et al. 2017, Lehman et al. …

2019-12-27abs ↗pdf ↗

This tutorial introduces the CMA Evolution Strategy (ES), where CMA stands for Covariance Matrix Adaptation. The CMA-ES is a stochastic, or randomized, method for real-parameter (continuous domain) optimization of non-linear, non-convex functions. We try to motivate and derive the algorithm from intuitive concepts and …

2016-04-04abs ↗pdf ↗

Evolution Strategies (ES) emerged as a scalable alternative to popular Reinforcement Learning (RL) techniques, providing an almost perfect speedup when distributed across hundreds of CPU cores thanks to a reduced communication overhead. Despite providing large improvements in wall-clock time, ES is data inefficient whe…

2018-11-12abs ↗pdf ↗

Algorithm improves vanilla option pricing accuracy during and before COVID-19.

problem Improving vanilla option pricing accuracy during and before the pandemic.
method Combinational Mutation Strategy of Differential Evolution (CmDE) algorithm for bi-objective optimization.
result Algorithm approximates real market vanilla option prices more accurately than Black-Scholes.

AI simplifies trading strategies, potentially making markets more efficient.

problem Efficient market hypothesis (EMH) relies on traders optimising trading strategies based on information.
method Generalised notion of market efficiency, distinguishing model complexity through investor beliefs and trading strategies.
result Increased availability of low-cost AI systems may push towards more advanced trading strategies, potentially harder for inefficient traders.

NVA combines variational posteriors, annealing, and natural-gradient learning for multimodal optimization.

problem Finding multiple global and local modes in nonconvex objectives.
method NVA integrates variational posteriors, annealing, and natural-gradient learning.
result NVA outperforms gradient descent and evolution strategies on simulations and real-world problems.

We analyze the sectoral dynamics of startup venture financing. Based on a dataset of 52000 start-ups and 110000 funding rounds in the United States from 2000 to 2017, and by applying both Principal Component Analysis (PCA) and Tensor Component Analysis (TCA) in sector space, we visualize and measure the evolution of th…

2019-06-05abs ↗pdf ↗

Variational Optimization forms a differentiable upper bound on an objective. We show that approaches such as Natural Evolution Strategies and Gaussian Perturbation, are special cases of Variational Optimization in which the expectations are approximated by Gaussian sampling. These approaches are of particular interest …

2018-09-13abs ↗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.

We propose a methodology for clustering financial time series of stocks' returns, and a graphical set-up to quantify and visualise the evolution of these clusters through time. The proposed graphical representation allows for the application of well known algorithms for solving classical combinatorial graph problems, w…

2011-11-14abs ↗pdf ↗

This paper explores the problem of unknotting closed braids and classical knots in mathematical knot theory. We apply evolutionary computation methods to learn sequences of moves that simplify knot diagrams, and show that this can be effective both when the evolution is carried out for individual knots and when a gener…

2013-02-04abs ↗pdf ↗

ES-Single uses ES to estimate gradients in unrolled graphs, reducing variance and improving performance.

problem Estimating gradients in unrolled computation graphs with low variance and stability.
method Evolution strategies (ES) applied to unrolled graphs, with a single perturbation per particle.
result ES-Single reduces variance compared to PES, leading to better performance in various tasks.

Study torsion parallel spinors on Lorentzian 4-manifolds and their evolution flows.

problem Investigate torsion parallel spinors on Lorentzian four-manifolds.
method Geometric study via spinorial polyforms and supersymmetric NS-NS system.
result Globally hyperbolic evolution flow determined by supersymmetric solutions.

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 ↗

In this paper we introduce a new geometric flow --- the hyperbolic gradient flow for graphs in the (n+1)(n+1)-dimensional Euclidean space Rn+1\mathbb{R}^{n+1}. This kind of flow is new and very natural to understand the geometry of manifolds. We particularly investigate the global existence of the evolution of convex hypers…

2010-09-21abs ↗pdf ↗

New methods improve global optimisation for expensive functions using lookahead strategies.

problem Optimising expensive functions without gradient info in high dimensions.
method Nonmyopic acquisition strategies based on approximate dynamic programming.
result Nonmyopic methods outperform myopic approaches in various applications.

Study evolution equations on Lie groupoids using Fourier integral operators.

problem Solving evolution equations on Lie groupoids.
method Developed calculus of Fourier integral operators and used them to study the fundamental solution of the evolution equation.
result Developed a method to find the fundamental solution of the evolution equation on Lie groupoids.

Word evolution refers to the changing meanings and associations of words throughout time, as a byproduct of human language evolution. By studying word evolution, we can infer social trends and language constructs over different periods of human history. However, traditional techniques such as word representation learni…

2017-03-02abs ↗pdf ↗

We present a dynamical model for the price evolution of financial assets. The model is based in a two level structure. In the first stage one finds an agent-based model that describes the present state of the investors' beliefs, perspectives or strategies. The dynamics is inspired by a model for describing predator-pre…

2008-10-27abs ↗pdf ↗

ESAC combines genetic methods with RL to improve scalability and efficiency.

problem Combining genetic scalability with RL's data efficiency and optimal control.
method Combines Evolution Strategies (ES) with Soft Actor-Critic (SAC) to enable skill transfer and reduce hyperparameter sensitivity.
result Demonstrates improved performance and sample efficiency in challenging tasks.

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.

Study curves evolving on hypersurfaces with free boundaries, preserving length.

problem Evolution of curves on hypersurfaces with free boundaries.
method Nonlocal evolution equation with nonlinear boundary conditions, short-time existence, uniqueness, and parabolic energy estimates.
result Global existence and convergence to critical points proved.

For a scalar evolution equation ut=K(t,x,u,ux,,un),n2u_t=K(t,x,u,u_x,\ldots, u_n), n\geq 2 the cohomology spaces H1,s(R)H^{1,s}({\mathcal R}^\infty) vanishes for s3s\geq 3 while the space H1,2(R)H^{1,2}({\mathcal R}^\infty) is isomorphic to the space of variational operators. The cohomology space H1,2(R)H^{1,2}({\mathcal R}^\infty) is also shown to be …

2019-02-08abs ↗pdf ↗

Theoretical model for iterative user discovery in recommender systems.

problem Iterative feedback loops in recommender systems and their biases.
method Theoretical framework to model system evolution and convergence properties.
result Theoretical bounds and convergence properties on user discovery and blind spots.

A new method for portfolio optimization using signature signatures to incorporate path-dependencies.

problem Traditional portfolio optimization models struggle with path-dependencies and exogenous signals.
method Signature Trading framework using rough path signatures to represent trading strategies.
result Efficient incorporation of exogenous signals and drawdown control in optimal strategies.