A Cholesky decomposition-based asset selection heuristic for sparse tangent portfolio optimization
In practice, including large number of assets in mean-variance portfolios can lead to higher transaction costs and management fees. To address this, one common approach is to select a smaller subset of assets from the larger pool, constructing more efficient portfolios. As a solution, we propose a new asset selection heuristic which generates a pre-defined list of asset candidates using a surrogate formulation and re-optimizes the cardinality-constrained tangent portfolio with these selected assets. This method enables faster optimization and effectively constructs portfolios with fewer assets, as demonstrated by numerical analyses on historical stock returns. Finally, we discuss a quantitative metric that can provide a initial assessment of the performance of the proposed heuristic based on asset covariance.
Code (0)
등록된 구현이 없습니다.
Tasks
ManagementPortfolio OptimizationSimilar Papers 제목 키워드 기반
Novel Pivoted Cholesky Decompositions for Efficient Gaussian Process Inference
The Cholesky decomposition is a fundamental tool for solving linear systems with symmetric and positive definite matrices which are ubiquitous in linear algebra, optimization, and machine learning. Its numerical stabilit…
Gaussian ProcessesActive LearningAn Improved Modified Cholesky Decomposition Method for Precision Matrix Estimation
The modified Cholesky decomposition is commonly used for precision matrix estimation given a specified order of random variables. However, the order of variables is often not available or cannot be pre-determined. In thi…
A Streaming Sparse Cholesky Method for Derivative-Informed Gaussian Process Surrogates Within Digital Twin Applications
Digital twins are developed to model the behavior of a specific physical asset (or twin), and they can consist of high-fidelity physics-based models or surrogates. A highly accurate surrogate is often preferred over mult…
The Geometry of the Pivot: A Note on Lazy Pivoted Cholesky and Farthest Point Sampling
Low-rank approximations of large kernel matrices are ubiquitous in machine learning, particularly for scaling Gaussian Processes to massive datasets. The Pivoted Cholesky decomposition is a standard tool for this task, o…
Gaussian ProcessesInverse-Free Sparse Variational Gaussian Processes
Gaussian processes (GPs) offer appealing properties but are costly to train at scale. Sparse variational GP (SVGP) approximations reduce cost yet still rely on Cholesky decompositions of kernel matrices, ill-suited to lo…
Gaussian Processes