false

DeepUnifiedMom: Unified Time-series Momentum Portfolio Construction via Multi-Task Learning with Multi-Gate Mixture of Experts

DeepUnifiedMom: Unified Time-series Momentum Portfolio Construction via Multi-Task Learning with Multi-Gate Mixture of Experts ArXiv ID: 2406.08742 “View on arXiv” Authors: Unknown Abstract This paper introduces DeepUnifiedMom, a deep learning framework that enhances portfolio management through a multi-task learning approach and a multi-gate mixture of experts. The essence of DeepUnifiedMom lies in its ability to create unified momentum portfolios that incorporate the dynamics of time series momentum across a spectrum of time frames, a feature often missing in traditional momentum strategies. Our comprehensive backtesting, encompassing diverse asset classes such as equity indexes, fixed income, foreign exchange, and commodities, demonstrates that DeepUnifiedMom consistently outperforms benchmark models, even after factoring in transaction costs. This superior performance underscores DeepUnifiedMom’s capability to capture the full spectrum of momentum opportunities within financial markets. The findings highlight DeepUnifiedMom as an effective tool for practitioners looking to exploit the entire range of momentum opportunities. It offers a compelling solution for improving risk-adjusted returns and is a valuable strategy for navigating the complexities of portfolio management. ...

June 13, 2024 · 2 min · Research Team

Simulation-based approach for Multiproject Scheduling based on composite priority rules

Simulation-based approach for Multiproject Scheduling based on composite priority rules ArXiv ID: 2406.02102 “View on arXiv” Authors: Unknown Abstract This paper presents a simulation approach to enhance the performance of heuristics for multi-project scheduling. Unlike other heuristics available in the literature that use only one priority criterion for resource allocation, this paper proposes a structured way to sequentially apply more than one priority criterion for this purpose. By means of simulation, different feasible schedules are obtained to, therefore, increase the probability of finding the schedule with the shortest duration. The performance of this simulation approach was validated with the MPSPLib library, one of the most prominent libraries for resource-constrained multi-project scheduling. These results highlight the proposed method as a useful option for addressing limited time and resources in portfolio management. ...

June 4, 2024 · 2 min · Research Team

A Geometric Approach To Asset Allocation With Investor Views

A Geometric Approach To Asset Allocation With Investor Views ArXiv ID: 2406.01199 “View on arXiv” Authors: Unknown Abstract In this article, a geometric approach to incorporating investor views in portfolio construction is presented. In particular, the proposed approach utilizes the notion of generalized Wasserstein barycenter (GWB) to combine the statistical information about asset returns with investor views to obtain an updated estimate of the asset drifts and covariance, which are then fed into a mean-variance optimizer as inputs. Quantitative comparisons of the proposed geometric approach with the conventional Black-Litterman model (and a closely related variant) are presented. The proposed geometric approach provides investors with more flexibility in specifying their confidence in their views than conventional Black-Litterman model-based approaches. The geometric approach also rewards the investors more for making correct decisions than conventional BL based approaches. We provide empirical and theoretical justifications for our claim. ...

June 3, 2024 · 2 min · Research Team

Exploring Sectoral Profitability in the Indian Stock Market Using Deep Learning

Exploring Sectoral Profitability in the Indian Stock Market Using Deep Learning ArXiv ID: 2407.01572 “View on arXiv” Authors: Unknown Abstract This paper explores using a deep learning Long Short-Term Memory (LSTM) model for accurate stock price prediction and its implications for portfolio design. Despite the efficient market hypothesis suggesting that predicting stock prices is impossible, recent research has shown the potential of advanced algorithms and predictive models. The study builds upon existing literature on stock price prediction methods, emphasizing the shift toward machine learning and deep learning approaches. Using historical stock prices of 180 stocks across 18 sectors listed on the NSE, India, the LSTM model predicts future prices. These predictions guide buy/sell decisions for each stock and analyze sector profitability. The study’s main contributions are threefold: introducing an optimized LSTM model for robust portfolio design, utilizing LSTM predictions for buy/sell transactions, and insights into sector profitability and volatility. Results demonstrate the efficacy of the LSTM model in accurately predicting stock prices and informing investment decisions. By comparing sector profitability and prediction accuracy, the work provides valuable insights into the dynamics of the current financial markets in India. ...

May 28, 2024 · 2 min · Research Team

Tackling Decision Processes with Non-Cumulative Objectives using Reinforcement Learning

Tackling Decision Processes with Non-Cumulative Objectives using Reinforcement Learning ArXiv ID: 2405.13609 “View on arXiv” Authors: Unknown Abstract Markov decision processes (MDPs) are used to model a wide variety of applications ranging from game playing over robotics to finance. Their optimal policy typically maximizes the expected sum of rewards given at each step of the decision process. However, a large class of problems does not fit straightforwardly into this framework: Non-cumulative Markov decision processes (NCMDPs), where instead of the expected sum of rewards, the expected value of an arbitrary function of the rewards is maximized. Example functions include the maximum of the rewards or their mean divided by their standard deviation. In this work, we introduce a general mapping of NCMDPs to standard MDPs. This allows all techniques developed to find optimal policies for MDPs, such as reinforcement learning or dynamic programming, to be directly applied to the larger class of NCMDPs. Focusing on reinforcement learning, we show applications in a diverse set of tasks, including classical control, portfolio optimization in finance, and discrete optimization problems. Given our approach, we can improve both final performance and training time compared to relying on standard MDPs. ...

May 22, 2024 · 2 min · Research Team

Constructing an Investment Fund through Stock Clustering and Integer Programming

Constructing an Investment Fund through Stock Clustering and Integer Programming ArXiv ID: 2407.05912 “View on arXiv” Authors: Unknown Abstract This paper focuses on the application of quantitative portfolio management by using integer programming and clustering techniques. Investors seek to gain the highest profits and lowest risk in capital markets. A data-oriented analysis of US stock universe is used to provide portfolio managers a device to track different Exchange Traded Funds. As an example, reconstructing of NASDAQ 100 index fund is presented. ...

April 27, 2024 · 1 min · Research Team

Robust Utility Optimization via a GAN Approach

Robust Utility Optimization via a GAN Approach ArXiv ID: 2403.15243 “View on arXiv” Authors: Unknown Abstract Robust utility optimization enables an investor to deal with market uncertainty in a structured way, with the goal of maximizing the worst-case outcome. In this work, we propose a generative adversarial network (GAN) approach to (approximately) solve robust utility optimization problems in general and realistic settings. In particular, we model both the investor and the market by neural networks (NN) and train them in a mini-max zero-sum game. This approach is applicable for any continuous utility function and in realistic market settings with trading costs, where only observable information of the market can be used. A large empirical study shows the versatile usability of our method. Whenever an optimal reference strategy is available, our method performs on par with it and in the (many) settings without known optimal strategy, our method outperforms all other reference strategies. Moreover, we can conclude from our study that the trained path-dependent strategies do not outperform Markovian ones. Lastly, we uncover that our generative approach for learning optimal, (non-) robust investments under trading costs generates universally applicable alternatives to well known asymptotic strategies of idealized settings. ...

March 22, 2024 · 2 min · Research Team

DiffSTOCK: Probabilistic relational Stock Market Predictions using Diffusion Models

DiffSTOCK: Probabilistic relational Stock Market Predictions using Diffusion Models ArXiv ID: 2403.14063 “View on arXiv” Authors: Unknown Abstract In this work, we propose an approach to generalize denoising diffusion probabilistic models for stock market predictions and portfolio management. Present works have demonstrated the efficacy of modeling interstock relations for market time-series forecasting and utilized Graph-based learning models for value prediction and portfolio management. Though convincing, these deterministic approaches still fall short of handling uncertainties i.e., due to the low signal-to-noise ratio of the financial data, it is quite challenging to learn effective deterministic models. Since the probabilistic methods have shown to effectively emulate higher uncertainties for time-series predictions. To this end, we showcase effective utilisation of Denoising Diffusion Probabilistic Models (DDPM), to develop an architecture for providing better market predictions conditioned on the historical financial indicators and inter-stock relations. Additionally, we also provide a novel deterministic architecture MaTCHS which uses Masked Relational Transformer(MRT) to exploit inter-stock relations along with historical stock features. We demonstrate that our model achieves SOTA performance for movement predication and Portfolio management. ...

March 21, 2024 · 2 min · Research Team

Can a GPT4-Powered AI Agent Be a Good Enough Performance Attribution Analyst?

Can a GPT4-Powered AI Agent Be a Good Enough Performance Attribution Analyst? ArXiv ID: 2403.10482 “View on arXiv” Authors: Unknown Abstract Performance attribution analysis, defined as the process of explaining the drivers of the excess performance of an investment portfolio against a benchmark, stands as a significant feature of portfolio management and plays a crucial role in the investment decision-making process, particularly within the fund management industry. Rooted in a solid financial and mathematical framework, the importance and methodologies of this analytical technique are extensively documented across numerous academic research papers and books. The integration of large language models (LLMs) and AI agents marks a groundbreaking development in this field. These agents are designed to automate and enhance the performance attribution analysis by accurately calculating and analyzing portfolio performances against benchmarks. In this study, we introduce the application of an AI Agent for a variety of essential performance attribution tasks, including the analysis of performance drivers and utilizing LLMs as calculation engine for multi-level attribution analysis and question-answering (QA) tasks. Leveraging advanced prompt engineering techniques such as Chain-of-Thought (CoT) and Plan and Solve (PS), and employing a standard agent framework from LangChain, the research achieves promising results: it achieves accuracy rates exceeding 93% in analyzing performance drivers, attains 100% in multi-level attribution calculations, and surpasses 84% accuracy in QA exercises that simulate official examination standards. These findings affirm the impactful role of AI agents, prompt engineering and evaluation in advancing portfolio management processes, highlighting a significant development in the practical application and evaluation of Generative AI technologies within the domain. ...

March 15, 2024 · 2 min · Research Team

Optimizing Portfolio Management and Risk Assessment in Digital Assets Using Deep Learning for Predictive Analysis

Optimizing Portfolio Management and Risk Assessment in Digital Assets Using Deep Learning for Predictive Analysis ArXiv ID: 2402.15994 “View on arXiv” Authors: Unknown Abstract Portfolio management issues have been extensively studied in the field of artificial intelligence in recent years, but existing deep learning-based quantitative trading methods have some areas where they could be improved. First of all, the prediction mode of stocks is singular; often, only one trading expert is trained by a model, and the trading decision is solely based on the prediction results of the model. Secondly, the data source used by the model is relatively simple, and only considers the data of the stock itself, ignoring the impact of the whole market risk on the stock. In this paper, the DQN algorithm is introduced into asset management portfolios in a novel and straightforward way, and the performance greatly exceeds the benchmark, which fully proves the effectiveness of the DRL algorithm in portfolio management. This also inspires us to consider the complexity of financial problems, and the use of algorithms should be fully combined with the problems to adapt. Finally, in this paper, the strategy is implemented by selecting the assets and actions with the largest Q value. Since different assets are trained separately as environments, there may be a phenomenon of Q value drift among different assets (different assets have different Q value distribution areas), which may easily lead to incorrect asset selection. Consider adding constraints so that the Q values of different assets share a Q value distribution to improve results. ...

February 25, 2024 · 2 min · Research Team