Paper analyzes high-dimensional portfolio risks and finds empirical out-of-sample relative loss is more reliable.
problem Analyzing risks in high-dimensional portfolios using empirical variance.
method Derives asymptotic behavior of out-of-sample variance and relative loss in high-dimensional settings.
result Empirical out-of-sample relative loss is more reliable than variance in high-dimensional portfolios.
New model optimizes portfolios over multiple periods using predictive control.
problem Optimizing multi-period portfolios with risk and variance objectives.
method Model Predictive Control with Mean-Variance and Risk Parity.
result 30x faster and more robust solutions compared to single period models.
New method for estimating out-of-sample R² from gene expression data.
problem Lack of a well-defined and unbiased estimator for out-of-sample R².
method Explicitly defined out-of-sample R², provided an unbiased estimator, and calculated standard error.
result Demonstrated improved model comparison for gene expression phenotypes.
We study the out-of-sample properties of robust empirical optimization problems with smooth φ-divergence penalties and smooth concave objective functions, and develop a theory for data-driven calibration of the non-negative "robustness parameter" δ that controls the size of the deviations from the nominal model. Bu…
Proposes a new framework to optimize portfolios with reduced estimation errors.
problem Estimation errors in multiperiod mean-variance portfolio optimization.
method Reference-regulated multiperiod mean-variance (RRMV) framework.
result Improves portfolio stability and out-of-sample Sharpe ratios.
Study the impact of overfitting on linear predictive models' performance.
problem Overfitting reduces the out-of-sample performance of linear predictive trading strategies.
method Computed in- and out-of-sample means and variances of PnLs to derive replication ratios.
result Replication ratio diminishes for complex strategies with many assets.
In this paper we estimate the mean-variance portfolio in the high-dimensional case using the recent results from the theory of random matrices. We construct a linear shrinkage estimator which is distribution-free and is optimal in the sense of maximizing with probability 1 the asymptotic out-of-sample expected utilit…
The global minimum-variance portfolio is a typical choice for investors because of its simplicity and broad applicability. Although it requires only one input, namely the covariance matrix of asset returns, estimating the optimal solution remains a challenge. In the presence of high-dimensionality in the data, the samp…
A large portfolio of independent returns is optimized under the variance risk measure with a ban on short positions. The no-short selling constraint acts as an asymmetric ℓ1 regularizer, setting some of the portfolio weights to zero and keeping the out of sample estimator for the variance bounded, avoiding the di…
Random forest performance depends on SNR and covariate characteristics.
problem Understanding when random forests perform well.
method Systematic analysis of out-of-sample MSE for different SNR scenarios.
result Randomization effectiveness depends on SNR and covariate characteristics.
Improved portfolio optimization method reduces risk and improves performance.
problem Minimizing risk in large portfolios with limited data.
method Combines Tikhonov regularization and direct shrinkage of portfolio weights.
result Significantly reduces out-of-sample variance and Sharpe ratio compared to existing methods.
We study the consistency of sample mean-variance portfolios of arbitrarily high dimension that are based on Bayesian or shrinkage estimation of the input parameters as well as weighted sampling. In an asymptotic setting where the number of assets remains comparable in magnitude to the sample size, we provide a characte…
Paper proposes a method to improve prediction intervals for neural networks.
problem Improving prediction intervals for neural network models.
method Adapting extremely randomized trees to neural networks to create ensembles.
result The method yields gains in out-of-sample accuracy and is superior to existing methods.
We develop an approach to risk minimization and stochastic optimization that provides a convex surrogate for variance, allowing near-optimal and computationally efficient trading between approximation and estimation error. Our approach builds off of techniques for distributionally robust optimization and Owen's empiric…
Clustering stocks reduces estimation error in global minimum variance portfolio.
problem High estimation error in covariance matrix estimation.
method Bounded clustering to limit maximum cluster size.
result Reduction in out-of-sample volatility and gap between in-sample and out-of-sample volatility.
Sophisticated volatility models outperform naive portfolio strategies.
problem Improving mean-variance portfolio performance over the naive 1/N strategy.
method Investigated various econometric and portfolio models across multiple datasets.
result Most models achieve higher Sharpe ratios and lower portfolio volatility than the naive rule.
Optimal number of voters for a voting ensemble can be estimated from the distribution of classifier errors.
problem Finding the optimal number of voters for a voting ensemble to minimize error rate.
method Estimate the distribution of classifier errors and infer error rates for different numbers of voters.
result Lower-variance estimates of error rates can be obtained by inferring them for different numbers of voters.
This study compares three portfolio design approaches for stock selection.
problem Designing a profitable portfolio with precise stock returns and risks.
method Three portfolio design approaches: mean-variance portfolio, hierarchical risk parity, and autoencoder-based portfolio.
result Autoencoder portfolios outperform MVP on annual returns, but MVP is best on risk-adjusted returns.
Optimal data-driven formulations are found for learning and decision-making with historical data.
problem Designing optimal learning and decision-making formulations from historical data.
method Define a yardstick for measuring formulation quality, then construct an optimal formulation that is uniformly closer to the true cost.
result Existence of three distinct out-of-sample performance regimes with corresponding optimal formulations.
This paper investigates the hedging effectiveness of a dynamic moving window OLS hedging model, formed using wavelet decomposed time-series. The wavelet transform is applied to calculate the appropriate dynamic minimum-variance hedge ratio for various hedging horizons for a number of assets. The effectiveness of the dy…
Estimates error for robust M-estimators with convex penalties.
problem Estimating out-of-sample error for robust M-estimators in high-dimensional linear regression.
method Proposes a generic out-of-sample error estimate for robust M-estimators with convex penalties, using observed data and derivatives. result The out-of-sample error estimate has a relative error of order n−1/2 under certain conditions. Robustifies Markowitz portfolios to reduce transaction costs and improve performance.
problem Markowitz portfolios are unreliable due to estimation errors and extreme weights.
method Projected gradient descent and robust statistics for stable weights and costs.
result Robustified Markowitz portfolios have lower turnover and maintain or improve performance.
Bagging stabilizes linear interpolators, improving their generalization performance.
problem Unstable linear interpolators fail on noisy data.
method Introduced multiplier-bootstrap-based bagged least square estimator.
result Bagging effectively mitigates variance, leading to bounded prediction risk.
Investigates Bitcoin market risk, showing volatility and jumps impact future volatility.
problem Understanding and forecasting the risk dynamics of Bitcoin market.
method Comprehensive investigation using realized volatility and jumps analysis.
result Jumps, especially positive ones, reduce future realized variance; long-term realized variance benefits from modeling jumps.
Bayesian imputation optimizes bias-variance tradeoff in time-series data.
problem Look-ahead bias in imputation of missing time-series data.
method Wasserstein interpolation for Bayesian posterior consensus distribution.
result Optimal control of look-ahead bias and variance in imputation.
Random Forests automatically prune a latent 'true' tree, explaining their overfitting without tuning.
problem Difficulty in building bad Random Forests and overfitting without apparent consequences.
method Bootstrap aggregation and model perturbation in Random Forests.
result Randomized ensembles implicitly perform optimal early stopping out-of-sample, explaining overfitting.
Proposes deep hedging for index options using implied volatility surface.
problem Managing risk in index option portfolios with complex dynamics.
method Integrates surface-informed decisions with multiple hedging instruments, accounting for transaction costs and variance risk premium.
result Consistently outperforms traditional hedging strategies across various market conditions.
Study improves forecast accuracy of daily volatility to enhance portfolio performance.
problem Improving predictability of realized variance from market views.
method High-dimensional machine learning models and low-dimensional factor models used to forecast firm-level volatility.
result Marginal improvements in forecast error lead to significant gains in portfolio performance.
In the past decade many researchers have proposed new optimal portfolio selection strategies to show that sophisticated diversification can outperform the naïve 1/N strategy in out-of-sample benchmarks. Providing an updated review of these models since DeMiguel et al. (2009b), I test sixteen strategies across six empir…
The paper proposes a new portfolio optimization model that includes VaR risk measure.
problem Computational hardness of portfolio optimization models with VaR as a risk measure.
method Formulated as a Mixed-Integer Quadratic Programming (MIQP) problem, the model minimizes variance with constraints on expected return and VaR.
result The proposed Mean-Variance-VaR portfolios outperform traditional Mean-Variance and Mean-VaR portfolios in out-of-sample performance.
Unified framework for fast large-scale portfolio optimization.
problem Efficient portfolio optimization for large-scale financial data.
method Incorporates shrinkage and regularization techniques, addressing multiple objectives.
result AP-Trees and PCA-based factor models consistently outperform other approaches in out-of-sample portfolio performance.
Forecast stock return distributions using neural networks.
problem Accurately modeling non-Gaussian stock return features.
method Two-stage quantile neural network with spline interpolation.
result Improved mean and variance forecasts compared to standard models.
It is well known that the out-of-sample performance of Markowitz's mean-variance portfolio criterion can be negatively affected by estimation errors in the mean and covariance. In this paper we address the problem by regularizing the mean-variance objective function with a weighted elastic net penalty. We show that the…
Variant of mSSA improves time series prediction error.
problem Improve prediction error in multivariate time series.
method Introduce spatio-temporal factor model, establish prediction error scaling.
result Prediction error scales as 1 / √(min(N, T)T).
The paper predicts and explains the decay of stock anomaly performance over time.
problem Predicting and explaining the drop in risk-adjusted performance of stock anomalies.
method The authors propose ex-ante characteristics based on hypotheses of out-of-sample decay and in-sample overfitting.
result The year of publication explains 30% of the variance in Sharpe decay across factors.
CPCR mitigates bias in PCR for overparameterized models.
problem Bias in Principal Component Regression (PCR) for overparameterized models.
method Calibrated Principal Component Regression (CPCR) learns a low-variance prior in the PC subspace and calibrates the model in the original feature space.
result CPCR outperforms standard PCR in overparameterized settings, improving prediction across multiple problems.
New financial volatility models capture dynamic volatility better.
problem Traditional volatility models miss important volatility dynamics.
method Integrate recurrent neural networks into GARCH models.
result Improved in-sample and out-of-sample volatility forecasting.
Unified framework for spectral methods, kernel learning, and manifold unfolding.
problem Tackles the unification and optimization of spectral dimensionality reduction methods.
method Unified spectral methods as kernel PCA, kernel learning by SDP, and detailed explanation of MVU variants.
result Unified understanding and optimization of manifold learning techniques.
The study compares MS-GARCH and SARV models for Bitcoin volatility forecasting.
problem Analyzing Bitcoin price volatility using Markov Switching-GARCH and SARV models.
method Examined Markov Switching-GARCH and SARV models, comparing their forecasting performance.
result SARV models outperform MS-GARCH models in Bitcoin volatility forecasting.
New methods incorporate alpha signals into portfolio construction, improving performance.
problem Signal-blindness in existing portfolio construction methods.
method Introduces three methods: HRP-μ, HRP-Σμ, and CRISP. result CRISP at intermediate γ consistently outperforms other methods. In this short report, we discuss how coordinate-wise descent algorithms can be used to solve minimum variance portfolio (MVP) problems in which the portfolio weights are constrained by lq norms, where 1≤q≤2. A portfolio which weights are regularised by such norms is called a sparse portfolio (Brodie et …
Sparse modeling improves portfolio optimization by reducing errors in complex market systems.
problem Errors in multivariate modeling of markets and economy.
method L0-norm sparse elliptical modeling to reduce oversimplification, and study likelihood in- and out-of-sample for different parameter lengths.
result Sparse models lead to better portfolio performance, higher out-of-sample likelihood, and lower volatility.
We consider the problem of mean-variance portfolio optimization for a generic covariance matrix subject to the budget constraint and the constraint for the expected return, with the application of the replica method borrowed from the statistical physics of disordered systems. We find that the replica symmetry of the so…
A new method improves robustness and efficiency of Bayesian LOO-CV.
problem Computational expense and unreliability of classical LOO-CV in high-dimensional Bayesian models.
method Proposes a mixture estimator to compute Bayesian LOO-CV criteria with finite asymptotic variance.
result Improved robustness and efficiency in high-dimensional problems.
Study uses vine copulas to optimize financial portfolios during and after the financial crisis.
problem Optimizing financial portfolios during and after the financial crisis.
method Modeling dependency structures using vine copulas, testing different portfolio strategies, analyzing various copulas.
result Vine copulas reduce portfolio risk better than simple copulas, especially during the financial crisis.
Double descent in portfolio optimization shows improved performance with complexity, then declines, due to overfitting.
problem Improving portfolio optimization performance with model complexity.
method Investigates the relationship between model complexity and out-of-sample performance in mean-variance portfolio optimization.
result Performance of low-dimensional models initially improves with complexity but declines due to overfitting. High-dimensional models show double ascent Sharpe ratio curve.
The paper solves multi-period portfolio selection with constraints using a dynamic factor model.
problem Multi-period mean-variance portfolio selection with constraints.
method Dynamic factor model, dynamic programming, piecewise linear feedback policy.
result Optimal portfolio policies determined by two stochastic processes.
We estimate the global minimum variance (GMV) portfolio in the high-dimensional case using results from random matrix theory. This approach leads to a shrinkage-type estimator which is distribution-free and it is optimal in the sense of minimizing the out-of-sample variance. Its asymptotic properties are investigated a…