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.
Proposes new genetic algorithm rule for market competition.
problem Market competition genetic algorithm rules.
method Econophysics kinetic market model as an evolutionary algorithm.
result New replacement rule for genetic algorithms.
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…
Deep learning improves evolutionary algorithms' adaptability.
problem Improving evolutionary algorithms' adaptability to various circumstances.
method Using deep reinforcement learning to dynamically adjust evolutionary algorithms' strategies.
result Deep learning enhances evolutionary algorithms' fitness increase and attainable fitness.
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 algorithm improves game learning with randomised optimism.
problem Learning in matrix games with unknown payoffs and bandit feedback.
method Integrates evolutionary algorithms into bandit framework for randomised optimism.
result Achieves sublinear regret, outperforming classical methods.
Evo-NAS combines neural and evolutionary methods for efficient neural architecture search.
problem Efficiently searching for optimal neural architectures in deep learning.
method Evolutionary-Neural hybrid agents that combine the strengths of neural and evolutionary algorithms.
result Evo-NAS outperforms both neural and evolutionary agents in architecture search for various classification tasks.
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 method to control results of gradient descent unsupervised learning in a deep neural network by using evolutionary algorithm is proposed. To process crossover of unsupervisedly trained models, the algorithm evaluates pointwise fitness of individual nodes in neural network. Labeled training data is randomly sampled an…
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.
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.
ESGD optimizes deep neural networks using evolutionary and stochastic gradient descent methods.
problem Optimizing deep neural networks efficiently and effectively.
method Combines SGD and evolutionary algorithms, alternating between steps to improve population fitness.
result Guarantees that the best fitness in the population never degrades and optimizes across various deep architectures.
MERL uses evolutionary and gradient-based methods to optimize sparse team-based and dense agent-specific rewards in multiagent coordination.
problem Training multiagent reinforcement learning policies on sparse team-based rewards is difficult and relying solely on agent-specific rewards is sub-optimal.
method MERL employs a split-level training platform with an evolutionary algorithm and a gradient-based optimizer, transferring skills between the two processes.
result MERL significantly outperforms state-of-the-art methods on coordination benchmarks.
Evolutionary algorithm improves DNN watermarking with fewer false positives.
problem Protecting deep learning models from piracy and proving ownership.
method Evolutionary algorithm for generating and optimizing trigger patterns.
result Reduces false positive rates in DNN watermarking.
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.
A graph-based evolutionary algorithm automates machine learning workflows.
problem Automated machine learning to reduce manual operations.
method Graph-based architecture for flexible model combinations, evolutionary algorithm with mutation and heredity operators, Bayesian hyper-parameter optimization.
result State-of-the-art performance compared to other AutoML systems.
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.
EA improves clustering efficiency using crossover and mutation.
problem Efficiently clustering data using model-based methods.
method Developed an evolutionary algorithm with crossover and mutation for model-based clustering.
result EA outperforms EM algorithm and k-means in clustering performance.
REBEC improves robustness of wind wave models using evolutionary techniques.
problem Improving the calibration of numerical wind wave models to local conditions.
method Robust evolutionary-based calibration approach (REBEC) for building stochastic ensemble of models.
result REBEC outperforms baseline SPEA2 in achieving a balance between model quality and robustness.
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.
Develops efficient algorithms for data science, tackling the curse of dimensionality.
problem Tackles the curse of dimensionality in large datasets.
method Focuses on feature extraction techniques and meta-heuristic algorithms, including evolutionary algorithms.
result Evolutionary algorithms are effective in solving optimization problems with a curse of dimensionality.
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.
New IT representation improves symbolic regression approximations.
problem Finding better approximations to real-world data sets.
method Evolutionary Algorithm with IT representation using only mutation.
result IT representation finds better approximations than traditional methods.
Paper withdrawn; AI game behavior needs diversity.
problem Creating varied human-like playing styles in games.
method Evolutionary multi-objective deep reinforcement learning.
result Generated diverse AI behaviors for games.
New approach generates black-box attacks on neural networks using swarm evolutionary algorithm.
problem Adversarial samples attack neural networks.
method Swarm evolutionary algorithm for black-box attacks.
result 100% success rate on MNIST and CIFAR-10 images.
EPNE models evolving network patterns for better predictions.
problem Capturing evolving patterns in dynamic networks.
method EPNE models temporal network evolution using causal convolutions and a temporal objective function.
result EPNE outperforms other methods in various prediction tasks.
Evolutionary Strategies optimize hyper-parameters for off-policy learning.
problem Hyper-parameter sensitivity in off-policy learning.
method Application of Evolutionary Strategies for online hyper-parameter tuning.
result Our method outperforms state-of-the-art baselines.
Study uses evolutionary deep learning to identify galaxies obscured by star densities.
problem Identifying galaxies in the Zone of Avoidance due to high star densities and extinction.
method Evolutionary algorithm to optimize CNN architecture for near-infrared images.
result Best evolved CNN outperforms other variants in identifying galaxies in the Zone of Avoidance.
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.
Trading strategies evolve in a simulated market to outperform real data.
problem Creating profitable trading strategies in diverse market conditions.
method Agent-based model of heterogeneous agents evolving deep neural networks.
result Elite trading algorithms outperform in real high-frequency foreign exchange data.
The paper proposes a method to predict the performance of data-driven algorithms using surrogate models.
problem Improving the performance prediction of data-driven knowledge discovery algorithms.
method Surrogate-assisted performance prediction using evolutionary modeling of clinical pathways.
result The proposed approach provides interpretable prediction of algorithm performance and quality.
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.
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.
PDERL improves evolutionary reinforcement learning by using learning-based variation operators.
problem Scalability issue in Genetic Algorithms when combined with Deep Neural Networks.
method Integrates evolutionary and reinforcement learning through a hierarchical approach with learning-based variation operators.
result PDERL outperforms traditional evolutionary and reinforcement learning methods in robot locomotion tasks.
New method finds coresets for faster machine learning.
problem Improving training speed and understanding results.
method Iterative optimization using multi-objective evolutionary algorithms.
result Results deliver lower error and better generalization.
A neural network-evolutionary framework estimates mechanical RUL efficiently.
problem Estimating the remaining useful life of mechanical systems.
method Multi-layer perceptron and evolutionary algorithm for optimizing data parameters, using strided time windows.
result The framework increases model efficiency and reduces complexity, leading to improved accuracy.
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.
Nature-inspired algorithms improve data analytics efficiency.
problem Efficient data analytics with reduced dimensionality.
method Nature-inspired algorithms for feature selection optimization.
result Nature-inspired algorithms enhance data analytics efficiency.
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.
EPC curriculum improves MARL performance as agent population grows.
problem Challenges in learning good policies for large multi-agent systems.
method Evolutionary Population Curriculum (EPC) for scaling MARL.
result EPC consistently outperforms baselines as agent population increases.
In this paper we present an evolutionary optimization approach to solve the risk parity portfolio selection problem. While there exist convex optimization approaches to solve this problem when long-only portfolios are considered, the optimization problem becomes non-trivial in the long-short case. To solve this problem…
A neural network and evolutionary algorithm framework designs nonlinear optical molecules.
problem Designing efficient nonlinear optical materials.
method Multi-stage Bayesian neural network (msBNN) and corrected Lewis-mode group contribution method (cLGC) combined with evolutionary algorithm (EA).
result Accurately and efficiently designs molecules with different optical properties using a small data set.
A new evolutionary algorithm improves k-means clustering by recombining the entire population.
problem Optimizing the k-means clustering problem, especially in non-convex cases.
method Recombinator-k-means uses stochastic recombination with a reweighting mechanism.
result Recombinator-k-means outperforms standard genetic algorithms in optimization objective.
DO uses DNNs to solve combinatorial optimisation problems.
problem Solving complex combinatorial optimisation problems.
method Combines evolutionary search with DNNs to learn and exploit problem structure.
result DO can solve problems like HTOP and MCparity that other algorithms cannot.
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…
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.