The paper proposes pruning techniques for improving ensemble GP models.
problem Improving the generalization ability and reducing computational burden of GP ensemble models.
method Combining syntax and semantics-based GP models, and using pruning criteria based on correlation and entropy.
result Pruning criteria based on correlation and entropy can improve the generalization ability of the ensemble model.
The paper proposes using semantic neighbors to decide when to stop learning.
problem Stopping point in iterative learning algorithms to avoid overfitting.
method Semantic stopping criteria based on inductive semantic stochastic methods.
result The proposed criteria detect stopping points leading to competitive generalization.
Improved genetic programming by optimizing mutation operators for continuous program search.
problem Small syntactic mutations in genetic programming can lead to unpredictable behavioral shifts.
method Learned a compact trading-strategy DSL, created a block-factorized embedding, and designed geometry-compiled mutation operators.
result Geometry-compiled mutation operators discover strong strategies using fewer evaluations and achieve higher Sharpe ratios.
New heuristics improve genetic programming's parent selection for classification problems.
problem Improving genetic programming's parent selection for classification tasks.
method Proposed three heuristics inspired by specific classifiers' characteristics, using similarity measures.
result Combination of agreement-based selection and random selection outperforms classical and state-of-the-art schemes.
Genetic algorithms improve computer chess programs to grandmaster level.
problem Improving computer chess programs to match human grandmaster performance.
method Evolved a grandmaster-level evaluation function and search mechanism using genetic algorithms.
result The evolved program outperforms a world champion and matches other top programs.
This paper improves dynamic hedging accuracy using genetic programming to forecast implied volatilities.
problem Improving the accuracy of dynamic hedging using implied volatilities.
method The paper uses genetic programming to forecast implied volatilities and tests the performance of these forecasts in dynamic hedging strategies.
result Genetic programming-generated implied volatilities improve hedging accuracy compared to static training methods.
Ensemble GP improves genetic programming by achieving better results with smaller models.
problem Improving genetic programming for binary classification problems.
method Ensemble GP uses an evolved population structure, fitness evaluation, and genetic operators inspired by ensemble learning methods.
result Ensemble GP outperformed standard GP on eight binary classification problems, achieving better results with smaller models.
EvoNUDGE uses graph neural networks to improve genetic programming performance.
problem Efficiency in evolutionary computation for problem solving.
method Graph neural network to elicit additional knowledge from symbolic regression problems.
result EvoNUDGE significantly outperforms conventional and neural genetic programming methods.
Optimizes control of synchronization in networked oscillators using genetic programming.
problem Optimizing control of synchronization in complex networked systems.
method Multi-objective genetic programming-based symbolic regression.
result Learned interpretable control functions for driving systems from synchronized to non-synchronized states.
Enhances genetic programming for stock alpha discovery with warm start and structural constraints.
problem Overwhelming search space and computational burden in traditional genetic programming for alpha factor discovery.
method Proposes a new GP framework with warm start and structural constraints to enhance search performance and interpretability.
result Superior out-of-sample prediction results and higher portfolio returns compared to benchmarks.
Framework uses neural networks to learn fitness functions for machine programming.
problem Automatic software generation and crafting effective fitness functions.
method Genetic algorithms augmented with neural networks and a search heuristic.
result Framework discovers more correct programs with fewer candidate generations.
A new probabilistic LGP method improves symbolic regression performance.
problem Traditional LGP's random search limits its effectiveness.
method Integrates SCFG with LGP, updating grammar based on selected individuals.
result Statistically better results on symbolic regression benchmarks.
Zoetrope Genetic Programming improves symbolic regression performance.
problem Evolutionary symbolic regression for complex mathematical expressions.
method Zoetropic representation, repeated fusion operations, linear combination, crossover, mutation, selection.
result Zoetrope Genetic Programming achieves state-of-the-art performance and low computational time.
Expert-driven genetic algorithms improve chess evaluation functions.
problem Creating efficient evaluation functions for complex systems.
method Using genetic algorithms with expert guidance to evolve evaluation functions.
result Evolved programs outperform top chess programs with fewer parameters.
Genetic algorithms optimize chess evaluation functions with mentor assistance.
problem Optimizing complex evaluation functions for superior performance.
method Genetic algorithms with mentor-assisted evolution.
result Programs evolved with mentors outperform top chess champions.
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.
Genetic programming optimizes Gaussian kernels for better sentiment analysis.
problem Improving accuracy of sentiment analysis in text.
method Genetic Programming applied to evolve more effective Gaussian kernels.
result The evolved kernels outperform traditional Gaussian Processes in sentiment analysis.
Genetic Programming constructs features for physics experiments, improving classification accuracy.
problem Lack of interpretable feature construction for experimental physics.
method Combining Genetic Programming with dimensional consistency constraints.
result Constructed features improve classification accuracy by a significant margin.
GP-CNAS uses genetic programming to automatically design CNN architectures.
problem Designing optimal CNN architectures is laborious and error-prone.
method GP-CNAS uses a tree-based representation of CNNs and dynamic crossover operators to search for optimal architectures.
result GP-CNAS finds optimal CNN architectures with balanced depth and width in limited trials.
DL/FBF improves GPSR solutions by selecting compact, generalising expressions.
problem Overfitting and structural bloat in symbolic regression with genetic programming.
method Description length (DL) and fractional Bayes factor (FBF) criteria for selecting compact, generalising expressions.
result DL/FBF post-selection improves test performance compared to AIC/BIC baseline.
GP-HD uses genetic programming to generate personalized health models.
problem Creating accurate, personalized health models from large health data.
method Genetic Programming framework to generate parameterized dynamical systems models.
result GP-HD models perform similarly to models based on domain knowledge and outperform LSTM models.
TPOT uses genetic programming to automatically find optimal imputation and classification pipelines for missing data.
problem Finding optimal imputation and classification pipelines for datasets with missing data.
method Genetic programming applied to TPOT to automatically discover the best combinations of imputation and classification algorithms.
result Genetic programming can automatically find better pipelines that include effective combinations of imputation methods, feature pre-processing, and classifiers.
This research develops an evolutionary approach to discover non-Gaussian stochastic dynamical systems.
problem Discovering explicit governing equations of stochastic dynamical systems with Lévy noise from data.
method ESSR approach using genetic programming, sparse regression, and nonlocal Kramers-Moyal formulas.
result The approach effectively extracts non-Gaussian stochastic dynamical systems from sample path data.
This paper presents performance analysis of hybrid model comprise of concordance and Genetic Programming (GP) to forecast financial market with some existing models. This scheme can be used for in depth analysis of stock market. Different measures of concordances such as Kendalls Tau, Ginis Mean Difference, Spearmans R…
TPOT-MDR uses genetic programming to automatically design machine learning pipelines for bioinformatics studies.
problem Efficiently analyzing complex diseases in genome-wide association studies.
method Genetic programming combined with Multifactor Dimensionality Reduction (MDR) and expert knowledge-guided feature selector.
result TPOT-MDR significantly outperforms modern machine learning methods and produces high-accuracy, interpretable solutions.
Combines RL and MML to learn programs from indirect supervision.
problem Learning programs from indirect supervision without spurious solutions.
method Connects RL and MML, uses systematic search and randomized exploration.
result Significant gains over state-of-the-art semantic parsers.
Hedging in the presence of transaction costs leads to complex optimization problems. These problems typically lack closed-form solutions, and their implementation relies on numerical methods that provide hedging strategies for specific parameter values. In this paper we use a genetic programming algorithm to derive exp…
In this contribution we describe an approach to evolve composite covariance functions for Gaussian processes using genetic programming. A critical aspect of Gaussian processes and similar kernel-based models such as SVM is, that the covariance function should be adapted to the modeled data. Frequently, the squared expo…
This paper improves volatility forecasting using dynamic subset selection in genetic programming.
problem Improving accuracy of implied volatility forecasting.
method Dynamic training-subset selection methods applied to genetic programming.
result Dynamic subset selection improves predictive accuracy of genetic programming models.
Paper evolves a grandmaster-level chess evaluation function.
problem Creating a chess program that can play at grandmaster level.
method Combining supervised and unsupervised learning with genetic algorithms.
result The evolved program outperforms a two-time World Computer Chess Champion.
New method extracts patterns from program logs and embeds them for detection.
problem Real-world malicious software detection.
method Extract patterns from behavior graph, embed into continuous space using autoencoder.
result Embedding captures interpretable structures in pattern parts.
COSET benchmarks neural program embeddings using diverse source-code datasets.
problem Evaluating neural program embeddings is challenging due to lack of straightforward metrics.
method COSET framework with labeled programs, transformations, and a pilot study.
result COSET identifies strengths and weaknesses of neural models and program characteristics.
PATOIS synthesizes code from natural language using learned code idioms.
problem Synthesizing general-purpose source code from natural language specifications is challenging.
method PATOIS uses a neural synthesizer that interleaves high-level and low-level reasoning, incorporating learned code idioms from a corpus.
result Using learned code idioms improves the synthesizer's accuracy on semantic parsing datasets.
System identifies health risks using semantic and machine learning.
problem Identifying risk factors associated with health conditions in subpopulations.
method Developed a combined semantic and machine learning system using a health risk ontology and knowledge graph.
result Dynamic discovery of risk factors and their subpopulations.
Guaranteed bounds for posterior inference in probabilistic programs.
problem Approximating the posterior distribution of probabilistic programs with provable correctness.
method Interval-based trace semantics, soundness and completeness proofs, weight-aware interval type system.
result Guaranteed bounds on the posterior distribution of probabilistic programs are computed and proven to be correct.
SlicStan improves Stan's usability and efficiency.
problem Stan's block syntax sacrifices usability for scalability.
method Formalized Stan, introduced SlicStan with compositional syntax and flexible functions.
result SlicStan facilitates better code reuse and abstraction.
Paper proposes a new method to learn code semantics using an Intermediate Representation (IR) and embeddings.
problem Lack of robust methods to comprehend program semantics robustly.
method Defines an embedding space (inst2vec) based on IR of code, leveraging both data- and control-flow.
result A single RNN architecture and fixed inst2vec embeddings outperform specialized approaches on various tasks.
ADNN uses prior knowledge to construct financial features.
problem Feature construction in financial trading.
method Tailored neural network structure with domain knowledge.
result ADNN constructs more informative features than genetic programming.
A method based on wavelet transform and genetic programming is proposed for characterizing and modeling variations at multiple scales in non-stationary time series. The cyclic variations, extracted by wavelets and smoothened by cubic splines, are well captured by genetic programming in the form of dynamical equations. …
Develops a GP framework for age and year-specific mortality surfaces.
problem Learning the covariance structure of age and year-specific mortality surfaces.
method Genetic programming algorithm to search for the most expressive GP kernel.
result Reveals the presence/absence of cohort effects in different populations.
A hybrid algorithm combines optimization and enumeration for symbolic regression.
problem Finding any function from a set of operators without prior specification.
method Mixed-integer nonlinear optimization with explicit enumeration and constraints.
result The hybrid algorithm is competitive with state-of-the-art methods.
Improves neural program synthesis by addressing aliasing and syntax issues.
problem Ignoring program aliasing and syntax in neural program synthesis.
method Reinforcement learning and direct syntax maximization training.
result Improved accuracy, especially with limited training data.
Neural network identifies undeclared variables and infers their types.
problem Undeclared variable errors in programs.
method Trained on structural semantic details of AST, identifies and infers types of undeclared variables.
result Correctly identified and inferred types for 80% of programs with undeclared variable errors.
Method evolves spatial features from satellite imagery for regional modeling.
problem Regional summaries from high-resolution satellite data for geospatial phenomena.
method Induces spatial aggregations using Genetic Programming to optimize model performance.
result Genetic Programming synthesizes effective spatial aggregations and improves model predictions.
New loss function optimization improves training speed and accuracy.
problem Optimizing neural network performance through loss functions.
method Genetic Loss-function Optimization (GLO) using genetic programming and CMA-ES.
result GLO loss functions lead to better performance with fewer training steps.
Symbolic regression constructs simple equations for complex systems.
problem Creating accurate yet simple models for dynamic systems.
method Employing symbolic regression with two genetic programming algorithms.
result Analytic models outperform neural networks and local regression.
Agents learn to execute programs grounded in their environment.
problem Executing programs with unknown objects.
method Deep RL agents that ground program terms in environment.
result Agents generalize to new, unseen objects.
Enhances Bayesian learning with rule-based evolutionary techniques.
problem Improving Bayesian inference with expert knowledge and data patterns.
method Combines Bayesian inference with rule-based systems and grammatical evolution.
result Automatically derives rules from data, improving point predictions and uncertainty quantification.