NEAT Algorithm-based Stock Trading Strategy with Multiple Technical Indicators Resonance

• URL: http://arxiv.org/abs/2501.14736v1
• Date: Wed, 11 Dec 2024 05:42:15 GMT
• Title: NEAT Algorithm-based Stock Trading Strategy with Multiple Technical Indicators Resonance
• Authors: Li-Chun Huang,
• Abstract summary: We applied the NEAT (NeuroEvolution of Augmenting Topologies) algorithm to stock trading using multiple technical indicators.<n>Our approach focused on maximizing earning, avoiding risk, and outperforming the Buy & Hold strategy.<n>The results of our study showed that the NEAT model achieved similar returns to the Buy & Hold strategy, but with lower risk exposure and greater stability.
• Score: 0.8158530638728501
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this study, we applied the NEAT (NeuroEvolution of Augmenting Topologies) algorithm to stock trading using multiple technical indicators. Our approach focused on maximizing earning, avoiding risk, and outperforming the Buy & Hold strategy. We used progressive training data and a multi-objective fitness function to guide the evolution of the population towards these objectives. The results of our study showed that the NEAT model achieved similar returns to the Buy & Hold strategy, but with lower risk exposure and greater stability. We also identified some challenges in the training process, including the presence of a large number of unused nodes and connections in the model architecture. In future work, it may be worthwhile to explore ways to improve the NEAT algorithm and apply it to shorter interval data in order to assess the potential impact on performance.

Related papers

• Do We Truly Need So Many Samples? Multi-LLM Repeated Sampling Efficiently Scales Test-Time Compute [55.330813919992465]
  This paper presents a simple, effective, and cost-efficient strategy to improve LLM performance by scaling test-time compute. Our strategy builds upon the repeated-sampling-then-voting framework, with a novel twist: incorporating multiple models, even weaker ones, to leverage their complementary strengths.
  arXiv  Detail & Related papers  (2025-04-01T13:13:43Z)
• Generalized Factor Neural Network Model for High-dimensional Regression [50.554377879576066]
  We tackle the challenges of modeling high-dimensional data sets with latent low-dimensional structures hidden within complex, non-linear, and noisy relationships.<n>Our approach enables a seamless integration of concepts from non-parametric regression, factor models, and neural networks for high-dimensional regression.
  arXiv  Detail & Related papers  (2025-02-16T23:13:55Z)
• Optimal Execution with Reinforcement Learning [0.4972323953932129]
  This study investigates the development of an optimal execution strategy through reinforcement learning. We present a custom MDP formulation followed by the results of our methodology and benchmark the performance against standard execution strategies.
  arXiv  Detail & Related papers  (2024-11-10T08:21:03Z)
• Deep Reinforcement Learning for Online Optimal Execution Strategies [49.1574468325115]
  This paper tackles the challenge of learning non-Markovian optimal execution strategies in dynamic financial markets. We introduce a novel actor-critic algorithm based on Deep Deterministic Policy Gradient (DDPG) We show that our algorithm successfully approximates the optimal execution strategy.
  arXiv  Detail & Related papers  (2024-10-17T12:38:08Z)
• EVOLvE: Evaluating and Optimizing LLMs For Exploration [76.66831821738927]
  Large language models (LLMs) remain under-studied in scenarios requiring optimal decision-making under uncertainty. We measure LLMs' (in)ability to make optimal decisions in bandits, a state-less reinforcement learning setting relevant to many applications. Motivated by the existence of optimal exploration algorithms, we propose efficient ways to integrate this algorithmic knowledge into LLMs.
  arXiv  Detail & Related papers  (2024-10-08T17:54:03Z)
• A Dynamic Weighting Strategy to Mitigate Worker Node Failure in Distributed Deep Learning [3.0468273116892752]
  This paper investigates various optimization techniques in distributed deep learning. We propose a dynamic weighting strategy to mitigate the problem of straggler nodes due to failure.
  arXiv  Detail & Related papers  (2024-09-14T00:46:51Z)
• Analysis of frequent trading effects of various machine learning models [8.975239844705415]
  The proposed algorithm employs neural network predictions to generate trading signals and execute buy and sell operations. By harnessing the power of neural networks, the algorithm enhances the accuracy and reliability of the trading strategy.
  arXiv  Detail & Related papers  (2023-09-14T05:17:09Z)
• Continual Learning Beyond a Single Model [28.130513524601145]
  We show that employing ensemble models can be a simple yet effective method to improve continual performance. We propose a computationally cheap algorithm with similar runtime to a single model yet enjoying the performance benefits of ensembles.
  arXiv  Detail & Related papers  (2022-02-20T14:30:39Z)
• Gone Fishing: Neural Active Learning with Fisher Embeddings [55.08537975896764]
  There is an increasing need for active learning algorithms that are compatible with deep neural networks. This article introduces BAIT, a practical representation of tractable, and high-performing active learning algorithm for neural networks.
  arXiv  Detail & Related papers  (2021-06-17T17:26:31Z)
• A Comparative Evaluation of Predominant Deep Learning Quantified Stock Trading Strategies [0.38073142980733]
  This study first reconstructs three deep learning powered stock trading models and their associated strategies that are representative of distinct approaches to the problem. It then seeks to compare the performance of these strategies from different perspectives through trading simulations ran on three scenarios when the benchmarks are kept at historical low points for extended periods of time. The results show that in extremely adverse market climates, investment portfolios managed by deep learning powered algorithms are able to avert accumulated losses by generating return sequences that shift the constantly negative CSI 300 benchmark return upward.
  arXiv  Detail & Related papers  (2021-03-29T03:21:40Z)
• Reparameterized Variational Divergence Minimization for Stable Imitation [57.06909373038396]
  We study the extent to which variations in the choice of probabilistic divergence may yield more performant ILO algorithms. We contribute a re parameterization trick for adversarial imitation learning to alleviate the challenges of the promising $f$-divergence minimization framework. Empirically, we demonstrate that our design choices allow for ILO algorithms that outperform baseline approaches and more closely match expert performance in low-dimensional continuous-control tasks.
  arXiv  Detail & Related papers  (2020-06-18T19:04:09Z)
• An Application of Deep Reinforcement Learning to Algorithmic Trading [4.523089386111081]
  This scientific research paper presents an innovative approach based on deep reinforcement learning (DRL) to solve the algorithmic trading problem. It proposes a novel DRL trading strategy so as to maximise the resulting Sharpe ratio performance indicator on a broad range of stock markets. The training of the resulting reinforcement learning (RL) agent is entirely based on the generation of artificial trajectories from a limited set of stock market historical data.
  arXiv  Detail & Related papers  (2020-04-07T14:57:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.