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

Trend · papers per month

18375573 · Jun 202019922001200920172026
48 results for genetic programming

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.

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.

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.

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.

This paper demonstrates the use of genetic algorithms for evolving: 1) a grandmaster-level evaluation function, and 2) a search mechanism for a chess program, the parameter values of which are initialized randomly. The evaluation function of the program is evolved by learning from databases of (human) grandmaster games…

2017-11-21abs ↗pdf ↗

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.

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.

The problem of automatic software generation is known as Machine Programming. In this work, we propose a framework based on genetic algorithms to solve this problem. Although genetic algorithms have been used successfully for many problems, one criticism is that hand-crafting its fitness function, the test that aims to…

2019-08-22abs ↗pdf ↗

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.

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…

2013-05-29abs ↗pdf ↗

Ensemble learning is a powerful paradigm that has been usedin the top state-of-the-art machine learning methods like Random Forestsand XGBoost. Inspired by the success of such methods, we have devel-oped a new Genetic Programming method called Ensemble GP. The evo-lutionary cycle of Ensemble GP follows the same steps a…

2020-01-21abs ↗pdf ↗

In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function's parameters for computer chess. Our results show that using an appropriate expert (or mentor), we can evolve a program that is on par with top tournament-playing chess programs, outperforming a two-time World Com…

2017-11-18abs ↗pdf ↗

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.

The objective of this paper is to define an effective strategy for building an ensemble of Genetic Programming (GP) models. Ensemble methods are widely used in machine learning due to their features: they average out biases, they reduce the variance and they usually generalize better than single models. Despite these a…

2018-01-23abs ↗pdf ↗

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.

Sentiment analysis consists of evaluating opinions or statements from the analysis of text. Among the methods used to estimate the degree in which a text expresses a given sentiment, are those based on Gaussian Processes. However, traditional Gaussian Processes methods use a predefined kernel with hyperparameters that …

2019-04-01abs ↗pdf ↗

Genetic programming (GP) is the state-of-the-art in financial automated feature construction task. It employs reverse polish expression to represent features and then conducts the evolution process. However, with the development of deep learning, more powerful feature extraction tools are available. This paper proposes…

2019-12-26abs ↗pdf ↗

Sparse GFA identifies disease factors in FTD subgroups.

problem Heterogeneity in neurological disorders hinders understanding and treatment.
method Sparse Group Factor Analysis (GFA) with regularised horseshoe priors.
result Identified latent disease factors differentially expressed in FTD subgroups.

Meta-learning approach to learn interpretable models from human feedback.

problem Tackling the challenge of making machine learning models interpretable.
method A meta-learning approach where a model of non-trivial proxies of human interpretability is learned from human feedback, then incorporated into the ML training process to optimize for interpretability.
result The approach leads to formulas that are either significantly more or equally accurate while being more interpretable.

With the emergence of the Hospital Readmission Reduction Program of the Center for Medicare and Medicaid Services on October 1, 2012, forecasting unplanned patient readmission risk became crucial to the healthcare domain. There are tangible works in the literature emphasizing on developing readmission risk prediction m…

2018-12-11abs ↗pdf ↗

ENN method uses expectile regression for genetic data analysis of complex diseases.

problem Discover additional genetic variants contributing to complex diseases.
method Developed an expectile neural network (ENN) method integrating expectile regression and neural networks.
result ENN method outperforms existing expectile regression in discovering genetic variants predisposing to sub-populations.

Efficiently infers graph edges from genetic similarity data in landscape genetics.

problem Inferring unknown graph edges from genetic similarity data in a heterogeneous landscape.
method Developed an efficient first-order optimization method to solve the inverse landscape genetics problem.
result Our method provides fast and reliable convergence, significantly outperforming existing heuristics.