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

Trend · papers per month

200399599798 · Jun 202019922001200920172026
48 results for evolutionary optimization

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.

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.

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.

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.

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.

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).

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 ↗

BoGA combines evolutionary search with Bayesian optimization for efficient protein design.

problem Designing novel proteins with specific characteristics is challenging due to sequence space complexity.
method BoGA integrates a genetic algorithm with Bayesian optimization to efficiently explore sequence space.
result BoGA accelerates discovery of high-confidence binders for diverse protein design objectives.

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.

Evolutionary algorithm finds optimal pixel perturbations to improve neural network generalization.

problem Minimal data corruption by pixel modifications causes overfitting in neural networks.
method Evolutionary algorithm with a novel cost function to maximize generalization gap and domain divergence.
result Method outperforms previous pixel-based data distribution shift methods on CNNs.

Multi-stage financial decision optimization under uncertainty depends on a careful numerical approximation of the underlying stochastic process, which describes the future returns of the selected assets or asset categories. Various approaches towards an optimal generation of discrete-time, discrete-state approximations…

2009-12-08abs ↗pdf ↗

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.

The paper proposes a technique to speed up evolutionary algorithms by using lower-cost approximations of the objective function.

problem Evolutionary algorithms require many evaluations to solve computationally expensive black-box optimization problems.
method The paper introduces a technique to choose an appropriate approximate function cost during the execution of the optimization algorithm.
result The proposed approach can reach the same objective value in less than half the time in certain cases.

The choice of activation function can have a large effect on the performance of a neural network. While there have been some attempts to hand-engineer novel activation functions, the Rectified Linear Unit (ReLU) remains the most commonly-used in practice. This paper shows that evolutionary algorithms can discover novel…

2020-02-17abs ↗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 real-time federated neural architecture search approach reduces costs and improves performance.

problem High communication and computational demands in federated learning for large models.
method Evolutionary approach with double-sampling technique to optimize model performance and reduce costs.
result Effective real-time federated neural architecture search for deep models on edge devices.

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 ↗

It is known that evolution strategies in continuous domains might not converge in the presence of noise. It is also known that, under mild assumptions, and using an increasing number of resamplings, one can mitigate the effect of additive noise and recover convergence. We show new sufficient conditions for the converge…

2014-04-09abs ↗pdf ↗

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.

A new approach for efficient batch multiobjective optimization using Thompson sampling.

problem Inefficient batch multiobjective optimization due to expensive oracles and hard inner optimization.
method Proposes a Thompson sampling approach (qextttPOTSq exttt{POTS}) that chooses Pareto optimal candidates sequentially.
result Empirically superior performance compared to classical evolutionary approaches and MOBO.

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

Most decision tree induction algorithms are based on a greedy top-down recursive partitioning strategy for tree growth. In this paper, we propose several methods for induction of decision trees and their ensembles based on evolutionary algorithms. The main difference of our approach is using real-valued vector represen…

2020-02-03abs ↗pdf ↗

Evolutionary methods improve neural network loss functions, reducing overfitting.

problem Improving neural network performance and preventing overfitting.
method Evolutionary computation to optimize loss functions, balancing error pull and overfitting push.
result Evolved loss functions effectively reduce overfitting, leading to better performance and robustness.

Optimizes master faces for 2D and 3D face verification using evolutionary algorithms and neural networks.

problem Impersonation attacks using master faces for face-based identity authentication.
method Evolutionary algorithm in latent space of StyleGAN, neural network to direct search, 2D and 3D face reconstruction.
result Obtains high impersonation rates with fewer master faces for 2D and 3D face verification.

Deep neural network learning can be formulated as a non-convex optimization problem. Existing optimization algorithms, e.g., Adam, can learn the models fast, but may get stuck in local optima easily. In this paper, we introduce a novel optimization algorithm, namely GADAM (Genetic-Evolutionary Adam). GADAM learns deep …

2018-05-19abs ↗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.

Multi-task learning uses auxiliary data or knowledge from relevant tasks to facilitate the learning in a new task. Multi-task optimization applies multi-task learning to optimization to study how to effectively and efficiently tackle multiple optimization problems simultaneously. Evolutionary multi-tasking, or multi-fa…

2018-12-15abs ↗pdf ↗