Reactive global minimum variance portfolios withk-BAHC covariance cleaning
提出一种适用于资产数量远多于数据点的高维协方差清洗方法k-BAHC，用于构建反应性全局最小方差投资组合，在交易成本后夏普比率优于其他方法。
We introduce a covariance cleaning method which works well in the very high-dimensional regime, i.e. when there are many more assets than data points per asset. This opens the way to unconditional reactive portfolio optimization when there are not enough points to calibrate dynamical conditional covariance models, which happens, for example, when new assets appear in a market. The method is a k-fold boosted version of the Bootstrapped Average Hierarchical Clustering cleaning procedure for correlation and covariance matrices. We apply this method to global minimum variance portfolios and find that k should increase with the calibration window length. We compare the performance of k-BAHC with other state-of-the-art covariance cleaning methods, including dynamical conditional covariance (DCC) with non-linear shrinkage. Generally, we find that our method yields better Sharpe ratios after transaction costs than competing unconditional covariance filtering methods, despite requiring a larger turnover. Finally, k-BAHC yields better Global Minimum Variance portfolios with long–short positions than DCC in a non-stationary investment universe.