A Framework for Online Investment Algorithms

• URL: http://arxiv.org/abs/2003.13360v1
• Date: Mon, 30 Mar 2020 11:41:53 GMT
• Title: A Framework for Online Investment Algorithms
• Authors: Andrew Paskaramoorthy (1), Terence van Zyl (1), Tim Gebbie (2)
• Abstract summary: We present and report results for an integrated, and online framework for algorithmic portfolio management. This article provides a workflow that can in-turn be embedded into a process level learning framework. Our results confirm that we can use our framework in conjunction with resampling methods to outperform naive market capitalisation benchmarks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The artificial segmentation of an investment management process into a workflow with silos of offline human operators can restrict silos from collectively and adaptively pursuing a unified optimal investment goal. To meet the investor's objectives, an online algorithm can provide an explicit incremental approach that makes sequential updates as data arrives at the process level. This is in stark contrast to offline (or batch) processes that are focused on making component level decisions prior to process level integration. Here we present and report results for an integrated, and online framework for algorithmic portfolio management. This article provides a workflow that can in-turn be embedded into a process level learning framework. The workflow can be enhanced to refine signal generation and asset-class evolution and definitions. Our results confirm that we can use our framework in conjunction with resampling methods to outperform naive market capitalisation benchmarks while making clear the extent of back-test over-fitting. We consider such an online update framework to be a crucial step towards developing intelligent portfolio selection algorithms that integrate financial theory, investor views, and data analysis with process-level learning.

Related papers

• Benchmarking Agentic Workflow Generation [80.74757493266057]
  We introduce WorFBench, a unified workflow generation benchmark with multi-faceted scenarios and intricate graph workflow structures. We also present WorFEval, a systemic evaluation protocol utilizing subsequence and subgraph matching algorithms. We observe that the generated can enhance downstream tasks, enabling them to achieve superior performance with less time during inference.
  arXiv  Detail & Related papers  (2024-10-10T12:41:19Z)
• WISE: Unraveling Business Process Metrics with Domain Knowledge [0.0]
  Anomalies in complex industrial processes are often obscured by high variability and complexity of event data. We introduce WISE, a novel method for analyzing business process metrics through the integration of domain knowledge, process mining, and machine learning. We show that WISE enhances automation in business process analysis and effectively detects deviations from desired process flows.
  arXiv  Detail & Related papers  (2024-10-06T07:57:08Z)
• Intelligent Cross-Organizational Process Mining: A Survey and New Perspectives [40.62773366902451]
  This paper advocates a specific viewpoint on the field of process mining. We first summarize the framework of process mining, common industrial applications, and the latest advances combined with artificial intelligence. This particular perspective aims to revolutionize process mining by leveraging artificial intelligence to offer sophisticated solutions for complex, multi-organizational data analysis.
  arXiv  Detail & Related papers  (2024-07-15T23:30:34Z)
• Onflow: an online portfolio allocation algorithm [0.0]
  We introduce Onflow, a reinforcement learning technique that enables online optimization of portfolio allocation policies. For log-normal assets, the strategy learned by Onflow, with transaction costs at zero, mimics Markowitz's optimal portfolio. Onflow can remain efficient in regimes where other dynamical allocation techniques do not work anymore.
  arXiv  Detail & Related papers  (2023-12-08T16:49:19Z)
• Self Optimisation and Automatic Code Generation by Evolutionary Algorithms in PLC based Controlling Processes [0.0]
  A novel approach based on evolutionary algorithms is proposed to self optimise the system logic of complex processes. The presented approach is evaluated on an industrial liquid station process subject to a multi-objective problem.
  arXiv  Detail & Related papers  (2023-04-12T06:36:54Z)
• Algorithm Design for Online Meta-Learning with Task Boundary Detection [63.284263611646]
  We propose a novel algorithm for task-agnostic online meta-learning in non-stationary environments. We first propose two simple but effective detection mechanisms of task switches and distribution shift. We show that a sublinear task-averaged regret can be achieved for our algorithm under mild conditions.
  arXiv  Detail & Related papers  (2023-02-02T04:02:49Z)
• A Modular Framework for Reinforcement Learning Optimal Execution [68.8204255655161]
  We develop a modular framework for the application of Reinforcement Learning to the problem of Optimal Trade Execution. The framework is designed with flexibility in mind, in order to ease the implementation of different simulation setups.
  arXiv  Detail & Related papers  (2022-08-11T09:40:42Z)
• Byzantine-Robust Online and Offline Distributed Reinforcement Learning [60.970950468309056]
  We consider a distributed reinforcement learning setting where multiple agents explore the environment and communicate their experiences through a central server. $alpha$-fraction of agents are adversarial and can report arbitrary fake information. We seek to identify a near-optimal policy for the underlying Markov decision process in the presence of these adversarial agents.
  arXiv  Detail & Related papers  (2022-06-01T00:44:53Z)
• Nemo: Guiding and Contextualizing Weak Supervision for Interactive Data Programming [77.38174112525168]
  We present Nemo, an end-to-end interactive Supervision system that improves overall productivity of WS learning pipeline by an average 20% (and up to 47% in one task) compared to the prevailing WS supervision approach.
  arXiv  Detail & Related papers  (2022-03-02T19:57:32Z)
• Modeling and Optimization Trade-off in Meta-learning [23.381986209234164]
  We introduce and rigorously define the trade-off between accurate modeling and ease in meta-learning. Taking MAML as a representative metalearning algorithm, we theoretically characterize the trade-off for general non risk functions as well as linear regression. We also empirically solve a trade-off for metareinforcement learning benchmarks.
  arXiv  Detail & Related papers  (2020-10-24T15:32:08Z)
• AI-based Modeling and Data-driven Evaluation for Smart Manufacturing Processes [56.65379135797867]
  We propose a dynamic algorithm for gaining useful insights about semiconductor manufacturing processes. We elaborate on the utilization of a Genetic Algorithm and Neural Network to propose an intelligent feature selection algorithm.
  arXiv  Detail & Related papers  (2020-08-29T14:57:53Z)

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.