Sentiment and Knowledge Based Algorithmic Trading with Deep Reinforcement Learning

• URL: http://arxiv.org/abs/2001.09403v1
• Date: Sun, 26 Jan 2020 05:27:53 GMT
• Title: Sentiment and Knowledge Based Algorithmic Trading with Deep Reinforcement Learning
• Authors: Abhishek Nan, Anandh Perumal, Osmar R. Zaiane
• Abstract summary: Algorithmic trading, due to its inherent nature, is a difficult problem to tackle; there are too many variables involved in the real world which make it almost impossible to have reliable algorithms for automated stock trading. The lack of reliable labelled data that considers physical and physiological factors that dictate the ups and downs of the market, has hindered the supervised learning attempts for dependable predictions. We formulate an approach using reinforcement learning which uses traditional time series stock price data and combines it with news headline sentiments, while leveraging knowledge graphs for exploiting news about implicit relationships.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Algorithmic trading, due to its inherent nature, is a difficult problem to tackle; there are too many variables involved in the real world which make it almost impossible to have reliable algorithms for automated stock trading. The lack of reliable labelled data that considers physical and physiological factors that dictate the ups and downs of the market, has hindered the supervised learning attempts for dependable predictions. To learn a good policy for trading, we formulate an approach using reinforcement learning which uses traditional time series stock price data and combines it with news headline sentiments, while leveraging knowledge graphs for exploiting news about implicit relationships.

Related papers

• Learnability Gaps of Strategic Classification [68.726857356532]
  We focus on addressing a fundamental question: the learnability gaps between strategic classification and standard learning. We provide nearly tight sample complexity and regret bounds, offering significant improvements over prior results. Notably, our algorithm in this setting is of independent interest and can be applied to other problems such as multi-label learning.
  arXiv  Detail & Related papers  (2024-02-29T16:09:19Z)
• Data Cross-Segmentation for Improved Generalization in Reinforcement Learning Based Algorithmic Trading [5.75899596101548]
  We propose a Reinforcement Learning (RL) algorithm that trades based on signals from a learned predictive model. We test our algorithm on 20+ years of equity data from Bursa Malaysia.
  arXiv  Detail & Related papers  (2023-07-18T16:00:02Z)
• Graph Enabled Cross-Domain Knowledge Transfer [1.52292571922932]
  Cross-Domain Knowledge Transfer is an approach to mitigate the gap between good representation learning and the scarce knowledge in the domain of interest. From the machine learning perspective, the paradigm of semi-supervised learning takes advantage of large amount of data without ground truth and achieves impressive learning performance improvement.
  arXiv  Detail & Related papers  (2023-04-07T03:02:10Z)
• Improving CNN-base Stock Trading By Considering Data Heterogeneity and Burst [1.6637373649145604]
  We propose to use CNN as the core functionality of such framework, because it is able to learn the spatial dependency (i.e., between rows and columns) of the input data. We then develop novel normalization process to prepare the stock data. Experiment results show that our approach can outperform other comparing approaches.
  arXiv  Detail & Related papers  (2023-03-14T01:05:17Z)
• Augmented Bilinear Network for Incremental Multi-Stock Time-Series Classification [83.23129279407271]
  We propose a method to efficiently retain the knowledge available in a neural network pre-trained on a set of securities. In our method, the prior knowledge encoded in a pre-trained neural network is maintained by keeping existing connections fixed. This knowledge is adjusted for the new securities by a set of augmented connections, which are optimized using the new data.
  arXiv  Detail & Related papers  (2022-07-23T18:54:10Z)
• Denoised Labels for Financial Time-Series Data via Self-Supervised Learning [5.743034166791607]
  This work takes inspiration from image classification in trading and success in self-supervised learning. We investigate the idea of applying computer vision techniques to financial time-series to reduce the noise exposure. Our results show that our denoised labels improve the performances of the downstream learning algorithm.
  arXiv  Detail & Related papers  (2021-12-19T12:54:20Z)
• Knowledge-driven Active Learning [70.37119719069499]
  Active learning strategies aim at minimizing the amount of labelled data required to train a Deep Learning model. Most active strategies are based on uncertain sample selection, and even often restricted to samples lying close to the decision boundary. Here we propose to take into consideration common domain-knowledge and enable non-expert users to train a model with fewer samples.
  arXiv  Detail & Related papers  (2021-10-15T06:11:53Z)
• Low-Regret Active learning [64.36270166907788]
  We develop an online learning algorithm for identifying unlabeled data points that are most informative for training. At the core of our work is an efficient algorithm for sleeping experts that is tailored to achieve low regret on predictable (easy) instances.
  arXiv  Detail & Related papers  (2021-04-06T22:53:45Z)
• Taking Over the Stock Market: Adversarial Perturbations Against Algorithmic Traders [47.32228513808444]
  We present a realistic scenario in which an attacker influences algorithmic trading systems by using adversarial learning techniques. We show that when added to the input stream, our perturbation can fool the trading algorithms at future unseen data points.
  arXiv  Detail & Related papers  (2020-10-19T06:28:05Z)
• Adversarial Attacks on Machine Learning Systems for High-Frequency Trading [55.30403936506338]
  We study valuation models for algorithmic trading from the perspective of adversarial machine learning. We introduce new attacks specific to this domain with size constraints that minimize attack costs. We discuss how these attacks can be used as an analysis tool to study and evaluate the robustness properties of financial models.
  arXiv  Detail & Related papers  (2020-02-21T22:04:35Z)

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.