A new method estimates protein evolutionary fields and couplings from alignments.
problem Estimating evolutionary fields and couplings from protein sequence alignments.
method Boltzmann machine with parallel, persistent Markov chain Monte Carlo method.
result Improved precision in predicting contact residue pairs.
Study infers evolutionary interactions from protein sequences using regularization methods.
problem Inferring evolutionary interactions from protein sequences.
method Regularization methods, including L2 for fields and group L1 for couplings, with parameter tuning. result Effective regularization parameters for sparse couplings improve accuracy.
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.
Protein contacts contain important information for protein structure and functional study, but contact prediction from sequence remains very challenging. Both evolutionary coupling (EC) analysis and supervised machine learning methods are developed to predict contacts, making use of different types of information, resp…
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.
Median sampling reduces the runtime of noisy evolutionary optimization problems.
problem Reduction of noise's negative effect in evolutionary optimization.
method Introducing median sampling into evolutionary algorithms and analyzing its performance.
result Median sampling reduces the expected runtime exponentially under onebit noise.
High-frequency trading models fail due to overfitting and survivor bias.
problem Failure of hybrid DRL-EC trading systems in high-frequency environments.
method Deployed a population of 500 agents in a high-frequency cryptocurrency environment, analyzing failure modes through multi-disciplinary lens.
result Increasing model complexity without information asymmetry exacerbates systemic fragility.
MTGA optimizes multiple tasks with auxiliary data.
problem Optimizing multiple tasks simultaneously.
method Evolutionary multi-tasking genetic algorithm (MTGA).
result MTGA outperforms other approaches in optimization.
Motivation. Protein contact map describes the pairwise spatial and functional relationship of residues in a protein and contains key information for protein 3D structure prediction. Although studied extensively, it remains very challenging to predict contact map using only sequence information. Most existing methods pr…
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.
Designs chiral photonic structures using machine learning for efficient optical properties.
problem Optimizing chiral photonic nanostructures for light-matter interactions.
method Evolutionary algorithm and neural network approach for rapid optimization.
result Frequency-dependent modification in reflected light's degree of circular polarization.
BS-NAS broadens and shrinks search space for optimal neural architectures.
problem Suboptimal channel numbers and model averaging effects in One-Shot NAS methods.
method Broadening with spring block for channel search, shrinking with underperforming operations removal, evolutionary algorithm for optimal architecture search.
result BS-NAS achieves state-of-the-art performance on ImageNet.
Evolutionary methods improve understanding of LLMs and their relationships.
problem Improving understanding of LLMs and their relationships.
method Relating weights to genotypes and output text to phenotypes using evolutionary methods.
result Estimated evolutionary trees reliably recover the topology of the ground-truth training tree.
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…
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.
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.
A method uses evolutionary algorithm to supervise unsupervised learning in deep neural networks.
problem Controlling unsupervised learning in deep neural networks.
method Evolutionary algorithm applied to deep neural networks for supervised unsupervised learning.
result Better accuracy in document classification compared to traditional methods.
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.
Deep learning predicts protein contacts with high accuracy.
problem Low quality contact predictions for proteins without homologs.
method Integrates evolutionary coupling and sequence conservation through an ultra-deep neural network.
result Significantly outperforms existing methods in contact prediction and ab initio folding.
We define Lie algebroids over infinite jet spaces and establish their equivalent representation through homological evolutionary vector fields.
ECL improves sequence modeling by learning evolutionary structure.
problem Ignoring evolutionary structure in sequence modeling leads to suboptimal performance.
method ECL progressively exposes models to sequences of increasing evolutionary distance.
result ECL improves performance across multiple biological domains and tasks.
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.
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.
In this note, we extend an evolutionary stochastic portfolio optimization framework to include probabilistic constraints. Both the stochastic programming-based modeling environment as well as the evolutionary optimization environment are ideally suited for an integration of various types of probabilistic constraints. W…
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.
Guided Evolutionary Strategies uses surrogate gradients to improve optimization.
problem Optimizing functions with unknown true gradients but available surrogate gradients.
method Combines random search with a search distribution elongated along surrogate gradient directions.
result Improves optimization performance over standard evolutionary strategies and first-order methods.
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.
Many biological characteristics of evolutionary interest are not scalar variables but continuous functions. Here we use phylogenetic Gaussian process regression to model the evolution of simulated function-valued traits. Given function-valued data only from the tips of an evolutionary tree and utilising independent pri…
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.
Cryptocurrencies evolve through survival of the fittest, modeled with evolutionary finance.
problem Understanding the dynamics of cryptocurrency markets.
method Evolutionary finance concepts applied to toy models of cryptocurrency data.
result Survival of the fittest in cryptofinance is explained through scaling laws.
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.
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.
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.
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.
EPFES uses evolutionary strategies for nonlinear system estimation.
problem Nonlinear system identification with unknown state vector.
method Elitist particle filter based on evolutionary strategies.
result EPFES generalizes Gaussian particle filter and improves nonlinear system estimation.
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.
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.
EA-LSTM improves LSTM for time series prediction by evolving attention.
problem LSTMs struggle with assigning varying attention to sub-windows in time series data.
method Evolutionary attention-based LSTM with competitive random search.
result EA-LSTM achieves competitive performance in multivariate time series prediction.
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.
Optimizes quantum circuits using evolutionary strategies.
problem Optimizing quantum circuits for efficiency.
method Uses evolution strategies to optimize circuits.
result Improves quantum circuit performance.
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.
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.
Improves sample efficiency in evolutionary policy search methods.
problem Worse sample efficiency in evolutionary policy search methods.
method Importance mixing to reuse more samples.
result Improves sample efficiency but still less than deep reinforcement learning.
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.