PyTorchKR Papers

최신 논문

총 428편
태그·기간 등 상세 필터

카테고리 탐색

로그인 후 이 태그 구독

arXiv:2410.10239

Sample Average Approximation for Portfolio Optimization under CVaR constraint in an (re)insurance context

We consider optimal allocation problems with Conditional Value-At-Risk (CVaR) constraint. We prove, under very mild assumptions, the convergence of the Sample Average Approximation method (SAA) applied to this problem, and we also exhibit a convergence rate and discuss the uniqueness of the solution. These results give (re)insurers a practical solution to portfolio optimization under market regulatory constraints, i.e. a certain level of risk.

arXiv:2410.04459

Two-fund separation under hyperbolically distributed returns and concave utility function

Portfolio selection problems that optimize expected utility are usually difficult to solve. If the number of assets in the portfolio is large, such expected utility maximization problems become even harder to solve numerically. Therefore, analytical expressions for optimal portfolios are always preferred. In our work, we study portfolio optimization problems under the expected utility criterion for a wide range of utility functions, assuming return vectors follow hyperbolic distributions. Our main result demonstrates that under this setup, the two-fund monetary separation holds. Specifically, an individual with any utility function from this broad class will always choose to hold the same portfolio of risky assets, only adjusting the mix between this portfolio and a riskless asset based on their initial wealth and the specific utility function used for decision making. We provide explicit expressions for this mutual fund of risky assets. As a result, in our economic model, an individual's optimal portfolio is expressed in closed form as a linear combination of the riskless asset and the mutual fund of risky assets. Additionally, we discuss expected utility maximization problems under exponential utility functions over any domain of the portfolio set. In this part of our work, we show that the optimal portfolio in any given convex domain of the portfolio set either lies on the boundary of the domain or is the unique globally optimal portfolio within the entire domain.

arXiv:2410.01864

Dynamic Portfolio Rebalancing: A Hybrid new Model Using GNNs and Pathfinding for Cost Efficiency

This paper introduces a novel approach to optimizing portfolio rebalancing by integrating Graph Neural Networks (GNNs) for predicting transaction costs and Dijkstra's algorithm for identifying cost-efficient rebalancing paths. Using historical stock data from prominent technology firms, the GNN is trained to forecast future transaction costs, which are then applied as edge weights in a financial asset graph. Dijkstra's algorithm is used to find the least costly path for reallocating capital between assets. Empirical results show that this hybrid approach significantly reduces transaction costs, offering a powerful tool for portfolio managers, especially in high-frequency trading environments. This methodology demonstrates the potential of combining advanced machine learning techniques with classical optimization algorithms to improve financial decision-making processes. Future research will explore expanding the asset universe and incorporating reinforcement learning for continuous portfolio optimization.

arXiv:2410.05932

Quantum-Inspired Portfolio Optimization In The QUBO Framework

A quantum-inspired optimization approach is proposed to study the portfolio optimization aimed at selecting an optimal mix of assets based on the risk-return trade-off to achieve the desired goal in investment. By integrating conventional approaches with quantum-inspired methods for penalty coefficient estimation, this approach enables faster and accurate solutions to portfolio optimization which is validated through experiments using a real-world dataset of quarterly financial data spanning over ten-year period. In addition, the proposed preprocessing method of two-stage search further enhances the effectiveness of our approach, showing the ability to improve computational efficiency while maintaining solution accuracy through appropriate setting of parameters. This research contributes to the growing body of literature on quantum-inspired techniques in finance, demonstrating its potential as a useful tool for asset allocation and portfolio management.

arXiv:2410.04217공식 코드 · Papers with Code

Improving Portfolio Optimization Results with Bandit Networks

In Reinforcement Learning (RL), multi-armed Bandit (MAB) problems have found applications across diverse domains such as recommender systems, healthcare, and finance. Traditional MAB algorithms typically assume stationary reward distributions, which limits their effectiveness in real-world scenarios characterized by non-stationary dynamics. This paper addresses this limitation by introducing and evaluating novel Bandit algorithms designed for non-stationary environments. First, we present the Adaptive Discounted Thompson Sampling (ADTS) algorithm, which enhances adaptability through relaxed discounting and sliding window mechanisms to better respond to changes in reward distributions. We then extend this approach to the Portfolio Optimization problem by introducing the Combinatorial Adaptive Discounted Thompson Sampling (CADTS) algorithm, which addresses computational challenges within Combinatorial Bandits and improves dynamic asset allocation. Additionally, we propose a novel architecture called Bandit Networks, which integrates the outputs of ADTS and CADTS, thereby mitigating computational limitations in stock selection. Through extensive experiments using real financial market data, we demonstrate the potential of these algorithms and architectures in adapting to dynamic environments and optimizing decision-making processes. For instance, the proposed bandit network instances present superior performance when compared to classic portfolio optimization approaches, such as capital asset pricing model, equal weights, risk parity, and Markovitz, with the best network presenting an out-of-sample Sharpe Ratio 20% higher than the best performing classical model.

arXiv:2409.13608

A Krasnoselskii-Mann Proximity Algorithm for Markowitz Portfolios with Adaptive Expected Return Level

Markowitz's criterion aims to balance expected return and risk when optimizing the portfolio. The expected return level is usually fixed according to the risk appetite of an investor, then the risk is minimized at this fixed return level. However, the investor may not know which return level is suitable for her/him and the current financial circumstance. It motivates us to find a novel approach that adaptively optimizes this return level and the portfolio at the same time. It not only relieves the trouble of deciding the return level during an investment but also gets more adaptive to the ever-changing financial market than a subjective return level. In order to solve the new model, we propose an exact, convergent, and efficient Krasnoselskii-Mann Proximity Algorithm based on the proximity operator and Krasnoselskii-Mann momentum technique. Extensive experiments show that the proposed method achieves significant improvements over state-of-the-art methods in portfolio optimization. This finding may contribute a new perspective on the relationship between return and risk in portfolio optimization.

arXiv:2409.20534공식 코드 · Papers with Code

End-to-End Conformal Calibration for Optimization Under Uncertainty

Machine learning can significantly improve performance for decision-making under uncertainty in a wide range of domains. However, ensuring robustness guarantees requires well-calibrated uncertainty estimates, which can be difficult to achieve in high-capacity prediction models such as deep neural networks. Moreover, in high-dimensional settings, there may be many valid uncertainty estimates, each with their own performance profile - i.e., not all uncertainty is equally valuable for downstream decision-making. To address this problem, this paper develops an end-to-end framework to learn the uncertainty estimates for conditional robust optimization, with robustness and calibration guarantees provided by conformal prediction. In addition, we propose to represent arbitrary convex uncertainty sets with partially input-convex neural networks, which are learned as part of our framework. Our approach consistently improves upon two-stage estimate-then-optimize baselines on concrete applications in energy storage arbitrage and portfolio optimization.

arXiv:2409.19610공식 코드 · Papers with Code

Federated Learning from Vision-Language Foundation Models: Theoretical Analysis and Method

Integrating pretrained vision-language foundation models like CLIP into federated learning has attracted significant attention for enhancing generalization across diverse tasks. Typically, federated learning of vision-language models employs prompt learning to reduce communication and computational costs, i.e., prompt-based federated learning. However, there is limited theoretical analysis to understand the performance of prompt-based federated learning. In this work, we construct a theoretical analysis framework for prompt-based federated learning via feature learning theory. Specifically, we monitor the evolution of signal learning and noise memorization in prompt-based federated learning, demonstrating that performance can be assessed by the ratio of task-relevant to task-irrelevant coefficients. Furthermore, we draw an analogy between income and risk in portfolio optimization and the task-relevant and task-irrelevant terms in feature learning. Leveraging inspiration from portfolio optimization that combining two independent assets will maintain the income while reducing the risk, we introduce two prompts: global prompt and local prompt to construct a prompt portfolio to balance the generalization and personalization. Consequently, we showed the performance advantage of the prompt portfolio and derived the optimal mixing coefficient. These theoretical claims have been further supported by empirical experiments.

arXiv:2409.18735공식 코드 · Papers with Code

Autoregressive Policy Optimization for Constrained Allocation Tasks

Allocation tasks represent a class of problems where a limited amount of resources must be allocated to a set of entities at each time step. Prominent examples of this task include portfolio optimization or distributing computational workloads across servers. Allocation tasks are typically bound by linear constraints describing practical requirements that have to be strictly fulfilled at all times. In portfolio optimization, for example, investors may be obligated to allocate less than 30\% of the funds into a certain industrial sector in any investment period. Such constraints restrict the action space of allowed allocations in intricate ways, which makes learning a policy that avoids constraint violations difficult. In this paper, we propose a new method for constrained allocation tasks based on an autoregressive process to sequentially sample allocations for each entity. In addition, we introduce a novel de-biasing mechanism to counter the initial bias caused by sequential sampling. We demonstrate the superior performance of our approach compared to a variety of Constrained Reinforcement Learning (CRL) methods on three distinct constrained allocation tasks: portfolio optimization, computational workload distribution, and a synthetic allocation benchmark. Our code is available at: https://github.com/niklasdbs/paspo

arXiv:2409.17266공식 코드 · Papers with Code

Empirical Asset Pricing with Large Language Model Agents

In this study, we introduce a novel asset pricing model leveraging the Large Language Model (LLM) agents, which integrates qualitative discretionary investment evaluations from LLM agents with quantitative financial economic factors manually curated, aiming to explain the excess asset returns. The experimental results demonstrate that our methodology surpasses traditional machine learning-based baselines in both portfolio optimization and asset pricing errors. Notably, the Sharpe ratio for portfolio optimization and the mean magnitude of $|\alpha|$ for anomaly portfolios experienced substantial enhancements of 10.6\% and 10.0\% respectively. Moreover, we performed comprehensive ablation studies on our model and conducted a thorough analysis of the method to extract further insights into the proposed approach. Our results show effective evidence of the feasibility of applying LLMs in empirical asset pricing.

arXiv:2409.09684

Anatomy of Machines for Markowitz: Decision-Focused Learning for Mean-Variance Portfolio Optimization

Markowitz laid the foundation of portfolio theory through the mean-variance optimization (MVO) framework. However, the effectiveness of MVO is contingent on the precise estimation of expected returns, variances, and covariances of asset returns, which are typically uncertain. Machine learning models are becoming useful in estimating uncertain parameters, and such models are trained to minimize prediction errors, such as mean squared errors (MSE), which treat prediction errors uniformly across assets. Recent studies have pointed out that this approach would lead to suboptimal decisions and proposed Decision-Focused Learning (DFL) as a solution, integrating prediction and optimization to improve decision-making outcomes. While studies have shown DFL's potential to enhance portfolio performance, the detailed mechanisms of how DFL modifies prediction models for MVO remain unexplored. This study aims to investigate how DFL adjusts stock return prediction models to optimize decisions in MVO, addressing the question: "MSE treats the errors of all assets equally, but how does DFL reduce errors of different assets differently?" Answering this will provide crucial insights into optimal stock return prediction for constructing efficient portfolios.

arXiv:2408.14476

A new approach to the theory of optimal income tax

The Nobel-price winning Mirrlees' theory of optimal taxation inspired a long sequence of research on its refinement and enhancement. However, an issue of concern has been always the fact that, as was shown in many publications, the optimal schedule in Mirrlees' paradigm of maximising the total utility (constructed from individually optimised individual ones) usually did not lead to progressive taxation (contradicting the ethically supported practice in developed economies), and often even assigned minimal tax rates to the higher paid strata of society. The first objective of this paper is to support this conclusion by proving a theorem on optimal tax schedule in (practically most exploited) piecewise-linear environment under a simplest natural utility function. The second objective is to suggest a new paradigm for optimal taxation, where instead of just total average utility maximization one introduces a standard deviation of utility as a second parameter (in some analogy with Marcowitz portfolio optimization). We show that this approach leads to transparent and easy interpreted optimality criteria for income tax.

arXiv:2408.08866

High-Frequency Options Trading | With Portfolio Optimization

This paper explores the effectiveness of high-frequency options trading strategies enhanced by advanced portfolio optimization techniques, investigating their ability to consistently generate positive returns compared to traditional long or short positions on options. Utilizing SPY options data recorded in five-minute intervals over a one-month period, we calculate key metrics such as Option Greeks and implied volatility, applying the Binomial Tree model for American options pricing and the Newton-Raphson algorithm for implied volatility calculation. Investment universes are constructed based on criteria like implied volatility and Greeks, followed by the application of various portfolio optimization models, including Standard Mean-Variance and Robust Methods. Our research finds that while basic long-short strategies centered on implied volatility and Greeks generally underperform, more sophisticated strategies incorporating advanced Greeks, such as Vega and Rho, along with dynamic portfolio optimization, show potential in effectively navigating the complexities of the options market. The study highlights the importance of adaptability and responsiveness in dynamic portfolio strategies within the high-frequency trading environment, particularly under volatile market conditions. Future research could refine strategy parameters and explore less frequently traded options, offering new insights into high-frequency options trading and portfolio management.

arXiv:2408.07879

On Accelerating Large-Scale Robust Portfolio Optimization

Solving large-scale robust portfolio optimization problems is challenging due to the high computational demands associated with an increasing number of assets, the amount of data considered, and market uncertainty. To address this issue, we propose an extended supporting hyperplane approximation approach for efficiently solving a class of distributionally robust portfolio problems for a general class of additively separable utility functions and polyhedral ambiguity distribution set, applied to a large-scale set of assets. Our technique is validated using a large-scale portfolio of the S&P 500 index constituents, demonstrating robust out-of-sample trading performance. More importantly, our empirical studies show that this approach significantly reduces computational time compared to traditional concave Expected Log-Growth (ELG) optimization, with running times decreasing from several thousand seconds to just a few. This method provides a scalable and practical solution to large-scale robust portfolio optimization, addressing both theoretical and practical challenges.

arXiv:2407.19848공식 코드 · Papers with Code

Generative model for financial time series trained with MMD using a signature kernel

Generating synthetic financial time series data that accurately reflects real-world market dynamics holds tremendous potential for various applications, including portfolio optimization, risk management, and large scale machine learning. We present an approach for training generative models for financial time series using the maximum mean discrepancy (MMD) with a signature kernel. Our method leverages the expressive power of the signature transform to capture the complex dependencies and temporal structures inherent in financial data. We employ a moving average model to model the variance of the noise input, enhancing the model's ability to reproduce stylized facts such as volatility clustering. Through empirical experiments on S&P 500 index data, we demonstrate that our model effectively captures key characteristics of financial time series and outperforms a comparable GAN-based approach. In addition, we explore the application of the synthetic data generated to train a reinforcement learning agent for portfolio management, achieving promising results. Finally, we propose a method to add robustness to the generative model by tweaking the noise input so that the generated sequences can be adjusted to different market environments with minimal data.

arXiv:2408.02899

SETN: Stock Embedding Enhanced with Textual and Network Information

Stock embedding is a method for vector representation of stocks. There is a growing demand for vector representations of stock, i.e., stock embedding, in wealth management sectors, and the method has been applied to various tasks such as stock price prediction, portfolio optimization, and similar fund identifications. Stock embeddings have the advantage of enabling the quantification of relative relationships between stocks, and they can extract useful information from unstructured data such as text and network data. In this study, we propose stock embedding enhanced with textual and network information (SETN) using a domain-adaptive pre-trained transformer-based model to embed textual information and a graph neural network model to grasp network information. We evaluate the performance of our proposed model on related company information extraction tasks. We also demonstrate that stock embeddings obtained from the proposed model perform better in creating thematic funds than those obtained from baseline methods, providing a promising pathway for various applications in the wealth management industry.

arXiv:2408.01499

NeuralFactors: A Novel Factor Learning Approach to Generative Modeling of Equities

The use of machine learning for statistical modeling (and thus, generative modeling) has grown in popularity with the proliferation of time series models, text-to-image models, and especially large language models. Fundamentally, the goal of classical factor modeling is statistical modeling of stock returns, and in this work, we explore using deep generative modeling to enhance classical factor models. Prior work has explored the use of deep generative models in order to model hundreds of stocks, leading to accurate risk forecasting and alpha portfolio construction; however, that specific model does not allow for easy factor modeling interpretation in that the factor exposures cannot be deduced. In this work, we introduce NeuralFactors, a novel machine-learning based approach to factor analysis where a neural network outputs factor exposures and factor returns, trained using the same methodology as variational autoencoders. We show that this model outperforms prior approaches both in terms of log-likelihood performance and computational efficiency. Further, we show that this method is competitive to prior work in generating realistic synthetic data, covariance estimation, risk analysis (e.g., value at risk, or VaR, of portfolios), and portfolio optimization. Finally, due to the connection to classical factor analysis, we analyze how the factors our model learns cluster together and show that the factor exposures could be used for embedding stocks.

arXiv:2407.19936

Risk management in multi-objective portfolio optimization under uncertainty

In portfolio optimization, decision makers face difficulties from uncertainties inherent in real-world scenarios. These uncertainties significantly influence portfolio outcomes in both classical and multi-objective Markowitz models. To address these challenges, our research explores the power of robust multi-objective optimization. Since portfolio managers frequently measure their solutions against benchmarks, we enhance the multi-objective min-regret robustness concept by incorporating these benchmark comparisons. This approach bridges the gap between theoretical models and real-world investment scenarios, offering portfolio managers more reliable and adaptable strategies for navigating market uncertainties. Our framework provides a more nuanced and practical approach to portfolio optimization under real-world conditions.

arXiv:2407.19858공식 코드 · Papers with Code

AI-Powered Energy Algorithmic Trading: Integrating Hidden Markov Models with Neural Networks

In quantitative finance, machine learning methods are essential for alpha generation. This study introduces a new approach that combines Hidden Markov Models (HMM) and neural networks, integrated with Black-Litterman portfolio optimization. During the COVID period (2019-2022), this dual-model approach achieved a 83% return with a Sharpe ratio of 0.77. It incorporates two risk models to enhance risk management, showing efficiency during volatile periods. The methodology was implemented on the QuantConnect platform, which was chosen for its robust framework and experimental reproducibility. The system, which predicts future price movements, includes a three-year warm-up to ensure proper algorithm function. It targets highly liquid, large-cap energy stocks to ensure stable and predictable performance while also considering broker payments. The dual-model alpha system utilizes log returns to select the optimal state based on the historical performance. It combines state predictions with neural network outputs, which are based on historical data, to generate trading signals. This study examined the architecture of the trading system, data pre-processing, training, and performance. The full code and backtesting data are available under the QuantConnect terms.

arXiv:2407.18687

Set risk measures

We introduce the concept of set risk measures (SRMs), which are real-valued maps defined on the space of all non-empty, closed, and bounded sets of almost surely bounded random variables. Traditional risk measures typically operate on spaces of random variables, but SRMs extend this framework to sets of random variables. We establish an axiom scheme for SRMs, similar to classical risk measures but adapted for set operations. The main technical contribution is an axiomatic dual representation of convex SRMs by using regular, finitely additive measures on the unit ball of the dual space of essentially bounded random variables. We explore worst-case SRMs, which evaluate risk as the supremum of individual risks within a set, and provide a collection of examples illustrating the applicability of our framework to systemic risk, portfolio optimization, and decision-making under uncertainty. This work extends the theory of risk measures to a more general and flexible setup, accommodating a broader range of financial and mathematical applications.