Conformal Predictive Portfolio Selection

• URL: http://arxiv.org/abs/2410.16333v1
• Date: Sat, 19 Oct 2024 15:42:49 GMT
• Title: Conformal Predictive Portfolio Selection
• Authors: Masahiro Kato,
• Abstract summary: We propose a framework for predictive portfolio selection using conformal inference, called Conformal Predictive Portfolio Selection ( CPPS) Our approach predicts future portfolio returns, computes corresponding prediction intervals, and selects the desirable portfolio based on these intervals. We demonstrate the effectiveness of our CPPS framework using an AR model and validate its performance through empirical studies.
• Score: 10.470114319701576
• License:
• Abstract: This study explores portfolio selection using predictive models for portfolio returns. Portfolio selection is a fundamental task in finance, and various methods have been developed to achieve this goal. For example, the mean-variance approach constructs portfolios by balancing the trade-off between the mean and variance of asset returns, while the quantile-based approach optimizes portfolios by accounting for tail risk. These traditional methods often rely on distributional information estimated from historical data. However, a key concern is the uncertainty of future portfolio returns, which may not be fully captured by simple reliance on historical data, such as using the sample average. To address this, we propose a framework for predictive portfolio selection using conformal inference, called Conformal Predictive Portfolio Selection (CPPS). Our approach predicts future portfolio returns, computes corresponding prediction intervals, and selects the desirable portfolio based on these intervals. The framework is flexible and can accommodate a variety of predictive models, including autoregressive (AR) models, random forests, and neural networks. We demonstrate the effectiveness of our CPPS framework using an AR model and validate its performance through empirical studies, showing that it provides superior returns compared to simpler strategies.

Related papers

• SePPO: Semi-Policy Preference Optimization for Diffusion Alignment [67.8738082040299]
  We propose a preference optimization method that aligns DMs with preferences without relying on reward models or paired human-annotated data. We validate SePPO across both text-to-image and text-to-video benchmarks.
  arXiv  Detail & Related papers  (2024-10-07T17:56:53Z)
• Bridging and Modeling Correlations in Pairwise Data for Direct Preference Optimization [75.1240295759264]
  We propose an effective framework for Bridging and Modeling Correlations in pairwise data, named BMC. We increase the consistency and informativeness of the pairwise preference signals through targeted modifications. We identify that DPO alone is insufficient to model these correlations and capture nuanced variations.
  arXiv  Detail & Related papers  (2024-08-14T11:29:47Z)
• Large-scale Time-Varying Portfolio Optimisation using Graph Attention Networks [4.2056926734482065]
  This is the first study to incorporate risky firms and use all the firms in portfolio optimisation. We propose and empirically test a novel method that leverages Graph Attention networks (GATs) GATs are deep learning-based models that exploit network data to uncover nonlinear relationships.
  arXiv  Detail & Related papers  (2024-07-22T10:50:47Z)
• DeepClair: Utilizing Market Forecasts for Effective Portfolio Selection [29.43115584494825]
  We introduce DeepClair, a novel framework for portfolio selection. DeepClair leverages a transformer-based time-series forecasting model to predict market trends.
  arXiv  Detail & Related papers  (2024-07-18T11:51:03Z)
• Mean-Variance Portfolio Selection in Long-Term Investments with Unknown Distribution: Online Estimation, Risk Aversion under Ambiguity, and Universality of Algorithms [0.0]
  This paper adopts a perspective where data gradually and continuously reveal over time. The performance of these proposed strategies is guaranteed under specific markets. In stationary and ergodic markets, the so-called Bayesian strategy utilizing true conditional distributions, based on observed past market information during investment, almost surely does not perform better than the proposed strategies in terms of empirical utility, Sharpe ratio, or growth rate, which, in contrast, do not rely on conditional distributions.
  arXiv  Detail & Related papers  (2024-06-19T12:11:42Z)
• Rejection via Learning Density Ratios [50.91522897152437]
  Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions. We propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance. Our framework is tested empirically over clean and noisy datasets.
  arXiv  Detail & Related papers  (2024-05-29T01:32:17Z)
• Ensemble Modeling for Multimodal Visual Action Recognition [50.38638300332429]
  We propose an ensemble modeling approach for multimodal action recognition. We independently train individual modality models using a variant of focal loss tailored to handle the long-tailed distribution of the MECCANO [21] dataset.
  arXiv  Detail & Related papers  (2023-08-10T08:43:20Z)
• Prediction-Oriented Bayesian Active Learning [51.426960808684655]
  Expected predictive information gain (EPIG) is an acquisition function that measures information gain in the space of predictions rather than parameters. EPIG leads to stronger predictive performance compared with BALD across a range of datasets and models.
  arXiv  Detail & Related papers  (2023-04-17T10:59:57Z)
• Distributionally Robust End-to-End Portfolio Construction [0.0]
  We show how to learn the risk-tolerance parameter and the degree of robustness directly from data. We propose an end-to-end distributionally robust system for portfolio construction.
  arXiv  Detail & Related papers  (2022-06-10T14:16:22Z)
• Deep Learning for Portfolio Optimization [5.833272638548154]
  Instead of selecting individual assets, we trade Exchange-Traded Funds (ETFs) of market indices to form a portfolio. We compare our method with a wide range of algorithms with results showing that our model obtains the best performance over the testing period.
  arXiv  Detail & Related papers  (2020-05-27T21:28:43Z)
• Meta-Learned Confidence for Few-shot Learning [60.6086305523402]
  A popular transductive inference technique for few-shot metric-based approaches, is to update the prototype of each class with the mean of the most confident query examples. We propose to meta-learn the confidence for each query sample, to assign optimal weights to unlabeled queries. We validate our few-shot learning model with meta-learned confidence on four benchmark datasets.
  arXiv  Detail & Related papers  (2020-02-27T10:22:17Z)

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.