LoCoV: low dimension covariance voting algorithm for portfolio optimization
JunTao Duan, Ionel Popescu

TL;DR
This paper introduces LoCoV, a novel low-dimensional covariance voting algorithm that improves portfolio optimization accuracy by reducing sample covariance errors, outperforming classical methods significantly.
Contribution
The paper presents LoCoV, a new algorithm that mitigates covariance estimation errors in portfolio optimization, addressing limitations of sample covariance matrices.
Findings
LoCoV reduces error in covariance estimation.
LoCoV outperforms classical methods in experiments.
Portfolio risk is better estimated with LoCoV.
Abstract
Minimum-variance portfolio optimizations rely on accurate covariance estimator to obtain optimal portfolios. However, it usually suffers from large error from sample covariance matrix when the sample size is not significantly larger than the number of assets . We analyze the random matrix aspects of portfolio optimization and identify the order of errors in sample optimal portfolio weight and show portfolio risk are underestimated when using samples. We also provide LoCoV (low dimension covariance voting) algorithm to reduce error inherited from random samples. From various experiments, LoCoV is shown to outperform the classical method by a large margin.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Target Tracking and Data Fusion in Sensor Networks · Blind Source Separation Techniques
