References

D. Cajas. Entropy Pooling with CVaR and EVaR Views. Available at SSRN 7120258 (2026). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴ ↩²⁵ ↩²⁶ ↩²⁷ ↩²⁸ ↩²⁹ ↩³⁰ ↩³¹ ↩³² ↩³³ ↩³⁴ ↩³⁵ ↩³⁶ ↩³⁷ ↩³⁸ ↩³⁹ ↩⁴⁰ ↩⁴¹ ↩⁴² ↩⁴³

D. Cajas. Entropy Pooling with Relativistic Value at Risk Views. Available at SSRN 7329718 (2026). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴ ↩²⁵

G. P. Brinson and N. Fachler. Measuring non-US. equity portfolio performance. The Journal of Portfolio Management 11, 73–76 (1985). ↩¹ ↩² ↩³

B. Li and S. C. Hoi. Online portfolio selection: A survey. ACM Computing Surveys 46, 1–36 (2014). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶

T. M. Cover. An algorithm for maximizing expected log investment return. IEEE Transactions on Information Theory 30, 369–373 (1984). ↩¹ ↩² ↩³

T. M. Cover. Universal portfolios. Mathematical Finance 1, 1–29 (1991). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹

R. Zhou and D. P. Palomar. Understanding the Quintile Portfolio. IEEE Transactions on Signal Processing 68, 4030–4040 (2020). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴ ↩²⁵ ↩²⁶ ↩²⁷ ↩²⁸ ↩²⁹ ↩³⁰ ↩³¹ ↩³² ↩³³ ↩³⁴ ↩³⁵ ↩³⁶ ↩³⁷ ↩³⁸ ↩³⁹ ↩⁴⁰ ↩⁴¹ ↩⁴² ↩⁴³ ↩⁴⁴ ↩⁴⁵ ↩⁴⁶ ↩⁴⁷ ↩⁴⁸ ↩⁴⁹ ↩⁵⁰ ↩⁵¹ ↩⁵² ↩⁵³ ↩⁵⁴ ↩⁵⁵ ↩⁵⁶ ↩⁵⁷ ↩⁵⁸ ↩⁵⁹

M. Rudolf, H.-J. Wolter and H. Zimmermann. A linear model for tracking error minimization. Journal of Banking & Finance 23, 85–103 (1999). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

J. E. Beasley, N. Meade and T.-J. Chang. An evolutionary heuristic for the index tracking problem. European Journal of Operational Research 148, 621–643 (2003). ↩¹ ↩² ↩³ ↩⁴

D. Cajas. Advanced Portfolio Optimization: A Cutting-edge Quantitative Approach (Springer Nature Switzerland, 2025). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴ ↩²⁵ ↩²⁶ ↩²⁷ ↩²⁸ ↩²⁹ ↩³⁰ ↩³¹ ↩³² ↩³³ ↩³⁴ ↩³⁵ ↩³⁶ ↩³⁷ ↩³⁸ ↩³⁹ ↩⁴⁰ ↩⁴¹ ↩⁴² ↩⁴³ ↩⁴⁴ ↩⁴⁵ ↩⁴⁶ ↩⁴⁷ ↩⁴⁸ ↩⁴⁹ ↩⁵⁰ ↩⁵¹ ↩⁵² ↩⁵³ ↩⁵⁴ ↩⁵⁵ ↩⁵⁶ ↩⁵⁷ ↩⁵⁸ ↩⁵⁹ ↩⁶⁰ ↩⁶¹ ↩⁶² ↩⁶³ ↩⁶⁴ ↩⁶⁵ ↩⁶⁶ ↩⁶⁷ ↩⁶⁸ ↩⁶⁹ ↩⁷⁰ ↩⁷¹ ↩⁷² ↩⁷³ ↩⁷⁴ ↩⁷⁵ ↩⁷⁶ ↩⁷⁷ ↩⁷⁸ ↩⁷⁹ ↩⁸⁰ ↩⁸¹ ↩⁸² ↩⁸³ ↩⁸⁴ ↩⁸⁵ ↩⁸⁶ ↩⁸⁷ ↩⁸⁸ ↩⁸⁹ ↩⁹⁰ ↩⁹¹ ↩⁹² ↩⁹³ ↩⁹⁴ ↩⁹⁵ ↩⁹⁶ ↩⁹⁷ ↩⁹⁸ ↩⁹⁹ ↩¹⁰⁰ ↩¹⁰¹ ↩¹⁰² ↩¹⁰³ ↩¹⁰⁴ ↩¹⁰⁵ ↩¹⁰⁶ ↩¹⁰⁷ ↩¹⁰⁸ ↩¹⁰⁹ ↩¹¹⁰ ↩¹¹¹ ↩¹¹² ↩¹¹³ ↩¹¹⁴ ↩¹¹⁵ ↩¹¹⁶ ↩¹¹⁷ ↩¹¹⁸ ↩¹¹⁹ ↩¹²⁰ ↩¹²¹ ↩¹²² ↩¹²³ ↩¹²⁴ ↩¹²⁵ ↩¹²⁶ ↩¹²⁷ ↩¹²⁸ ↩¹²⁹ ↩¹³⁰ ↩¹³¹ ↩¹³² ↩¹³³ ↩¹³⁴ ↩¹³⁵ ↩¹³⁶ ↩¹³⁷ ↩¹³⁸ ↩¹³⁹ ↩¹⁴⁰ ↩¹⁴¹ ↩¹⁴² ↩¹⁴³ ↩¹⁴⁴ ↩¹⁴⁵ ↩¹⁴⁶ ↩¹⁴⁷ ↩¹⁴⁸ ↩¹⁴⁹ ↩¹⁵⁰ ↩¹⁵¹ ↩¹⁵² ↩¹⁵³ ↩¹⁵⁴ ↩¹⁵⁵ ↩¹⁵⁶ ↩¹⁵⁷ ↩¹⁵⁸ ↩¹⁵⁹ ↩¹⁶⁰ ↩¹⁶¹ ↩¹⁶² ↩¹⁶³ ↩¹⁶⁴ ↩¹⁶⁵ ↩¹⁶⁶ ↩¹⁶⁷ ↩¹⁶⁸ ↩¹⁶⁹ ↩¹⁷⁰ ↩¹⁷¹ ↩¹⁷² ↩¹⁷³ ↩¹⁷⁴ ↩¹⁷⁵ ↩¹⁷⁶ ↩¹⁷⁷ ↩¹⁷⁸ ↩¹⁷⁹ ↩¹⁸⁰ ↩¹⁸¹ ↩¹⁸² ↩¹⁸³ ↩¹⁸⁴ ↩¹⁸⁵ ↩¹⁸⁶ ↩¹⁸⁷ ↩¹⁸⁸ ↩¹⁸⁹ ↩¹⁹⁰ ↩¹⁹¹ ↩¹⁹² ↩¹⁹³

T. F. Chan, G. H. Golub and R. J. LeVeque. Algorithms for computing the sample variance: Analysis and recommendations. The American Statistician 37, 242–247 (1983). ↩¹ ↩² ↩³ ↩⁴

F. E. Satterthwaite. An Approximate Distribution of Estimates of Variance Components. Biometrics Bulletin 2, 110–114 (1946). ↩¹ ↩²

M. Demetrescu, C. Hanck and R. Kruse-Becher. Robust Fixed-b Inference in the Presence of Time-Varying Volatility. Econometrics and Statistics 37, 154–173 (2026). ↩¹ ↩² ↩³

W. K. Newey and K. D. West. A simple, positive semi-definite, heteroskedasticity and autocorrelation consistent covariance matrix. Econometrica 55, 703–708 (1987). ↩¹ ↩²

D. W. Andrews. Heteroskedasticity and Autocorrelation Consistent Covariance Matrix Estimation. Econometrica 59, 817–858 (1991). ↩¹

G. H. Golub and J. H. Welsch. Calculation of Gauss Quadrature Rules. Mathematics of Computation 23, 221–230 (1969). ↩¹

L. N. Trefethen. Approximation Theory and Approximation Practice, Extended Edition (SIAM, Philadelphia, 2019). ↩¹

P. J. Rousseeuw and G. Molenberghs. Transformation of non positive semidefinite correlation matrices. Communications in Statistics - Theory and Methods 22, 965–984 (1993). ↩¹ ↩²

R. Rebonato and P. Jäckel. The most general methodology for creating a valid correlation matrix for risk management and option pricing purposes. Journal of Risk 2, 17–27 (2000). ↩¹ ↩²

N. J. Higham. Computing the nearest correlation matrix—a problem from finance. IMA Journal of Numerical Analysis 22, 329–343 (2002). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

H. Qi and D. Sun. A quadratically convergent Newton method for computing the nearest correlation matrix. SIAM Journal on Matrix Analysis and Applications 28, 360–385 (2006). ↩¹

M. M. De Prado. Machine learning for asset managers (Cambridge University Press, 2020). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴ ↩²⁵ ↩²⁶

V. A. Marčenko and L. A. Pastur. Distribution of eigenvalues for some sets of random matrices. Mathematics of the USSR-Sbornik 1, 457 (1967). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹

V. Plerou, P. Gopikrishnan, B. Rosenow, L. A. Amaral, T. Guhr and H. E. Stanley. Random matrix approach to cross correlations in financial data. Phys. Rev. E 65, 066126 (2002). ↩¹ ↩² ↩³

L. Laloux, P. Cizeau, J.-P. Bouchaud and M. Potters. Noise dressing of financial correlation matrices. Phys. Rev. Lett. 83, 1467–1470 (1999). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

M. López de Prado. A robust estimator of the efficient frontier. SSRN Electronic Journal (2019). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹

D.-H. Kim and H. Jeong. Systematic analysis of group identification in stock markets. Phys. Rev. E 72, 046133 (2005). ↩¹ ↩² ↩³ ↩⁴

H. Markowitz. Modern portfolio theory. Journal of Finance 7, 77–91 (1952). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹

S. Gerber, H. Markowitz, P. Ernst, Y. Miao, P. Sargen and others. The Gerber statistic: A robust co-movement measure for portfolio optimization. Available at SSRN 3880054 (2021). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³

E. Flint and D. Polakow. Deconstructing the Gerber statistic. Finance Research Letters 56, 104144 (2023). ↩¹ ↩² ↩³

W. Smyth and D. Broby. An enhanced Gerber statistic for portfolio optimization. Finance Research Letters 49, 103229 (2022). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵

S. Gerber, W. Smyth, H. Markowitz, Y. Miao, P. Ernst and P. Sargen. Squeezing financial noise: A novel approach to covariance matrix estimation. Available at SSRN 4986939 (2025). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴ ↩²⁵ ↩²⁶ ↩²⁷ ↩²⁸ ↩²⁹ ↩³⁰

G. J. Székely, M. L. Rizzo and N. K. Bakirov. Measuring and testing dependence by correlation of distances. The Annals of Statistics 35, 2769–2794 (2007). ↩¹ ↩²

M. Sibuya. Bivariate extreme statistics, I. Annals of the Institute of Statistical Mathematics 11, 195–210 (1960). ↩¹

G. De Luca and P. Zuccolotto. A tail dependence-based dissimilarity measure for financial time series clustering. Advances in Data Analysis and Classification 5, 323–340 (2011). ↩¹ ↩² ↩³

K. H. Knuth. Optimal data-based binning for histograms and histogram-based probability density models. Digital Signal Processing 95, 102581 (2019). ↩¹ ↩² ↩³ ↩⁴

D. Freedman and P. Diaconis. On the histogram as a density estimator: L2 theory. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 57, 453–476 (1981). ↩¹ ↩² ↩³ ↩⁴

D. W. Scott. On optimal and data-based histograms. Biometrika 66, 605–610 (1979). ↩¹ ↩² ↩³ ↩⁴

A. Hacine-Gharbi, P. Ravier, R. Harba and T. Mohamadi. Low bias histogram-based estimation of mutual information for feature selection. Pattern Recognition Letters 33, 1302–1308 (2012). ↩¹

A. Hacine-Gharbi and P. Ravier. A binning formula of bi-histogram for joint entropy estimation using mean square error minimization. Pattern Recognition Letters 101, 21–28 (2018). ↩¹

C. E. Shannon. A mathematical theory of communication. The Bell System Technical Journal 27, 379–423 (1948). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

A. Meucci. Risk and Asset Allocation (Springer Berlin Heidelberg, 2005). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴

Y. Feng and D. P. Palomar. A signal processing perspective of financial engineering. Foundations and Trends in Signal Processing 9, 1–231 (2016). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

P. Jorion. Bayes-Stein estimation for portfolio analysis. The Journal of Financial and Quantitative Analysis 21, 279–292 (1986). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

T. Bodnar, O. Okhrin and N. Parolya. Optimal shrinkage estimator for high-dimensional mean vector. Journal of Multivariate Analysis 170, 63–79 (2019). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

F. Black and R. Litterman. Global portfolio optimization. Financial Analysts Journal 48, 28–43 (1992). ↩¹ ↩² ↩³ ↩⁴

D. Cajas. Convex Optimization of Portfolio Kurtosis. Available at SSRN 4202967 (2022). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰

D. Cajas. On the Spectral Decomposition of Portfolio Skewness and its Application to Portfolio Optimization. Available at SSRN 4540021 (2023). ↩¹ ↩² ↩³

J. A. Nelder and R. W. Wedderburn. Generalized linear models. Journal of the Royal Statistical Society: Series A (General) 135, 370–384 (1972). ↩¹ ↩² ↩³

M. A. Efroymson. Multiple regression analysis. In: Mathematical Methods for Digital Computers, edited by A. Ralston and H. S. Wilf (John Wiley & Sons, 1960); pp. 191–203. ↩¹ ↩² ↩³ ↩⁴ ↩⁵

R. R. Hocking. The analysis and selection of variables in linear regression. Biometrics 32, 1–49 (1976). ↩¹ ↩² ↩³

K. Pearson. On lines and planes of closest fit to systems of points in space. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 2, 559–572 (1901). ↩¹

H. Hotelling. Analysis of a complex of statistical variables into principal components. Journal of Educational Psychology 24, 417–441 (1933). ↩¹

M. E. Tipping and C. M. Bishop. Probabilistic principal component analysis. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 61, 611–622 (1999). ↩¹ ↩²

B. D. Fekedulegn, J. J. Colbert, R. R. Hicks Jr. and M. E. Schuckers. Coping with multicollinearity: an example on application of principal components regression in dendroecology. Technical Report NE-RP-721 (U.S. Department of Agriculture, Forest Service, Northeastern Research Station, 2002). ↩¹ ↩² ↩³ ↩⁴

T. G. Andersen, T. Bollerslev, P. F. Christoffersen and F. X. Diebold. Volatility and correlation forecasting. In: Handbook of Economic Forecasting, Vol. 1, edited by G. Elliott, C. W. Granger and A. Timmermann (North-Holland, Amsterdam, 2006); Chapter 15, pp. 777–878. ↩¹ ↩² ↩³ ↩⁴

B. J. Christensen and N. R. Prabhala. The relation between implied and realized volatility. Journal of Financial Economics 50, 125–150 (1998). ↩¹ ↩²

B. J. Christensen and C. S. Hansen. New evidence on the implied-realized volatility relation. The European Journal of Finance 8, 187–205 (2002). ↩¹ ↩²

T. Egbers and L. Swinkels. Can implied volatility predict returns on the currency carry trade? Journal of Banking & Finance 59, 14–26 (2015). ↩¹ ↩²

W. F. Sharpe. Capital Asset Prices: A Theory of Market Equilibrium under Conditions of Risk. The Journal of Finance 19, 425–442 (1964). ↩¹ ↩²

A. Ang, J. Chen and Y. Xing. Downside Risk. The Review of Financial Studies 19, 1191–1239 (2006). ↩¹

J. Estrada. Systematic risk in emerging markets: the D-CAPM. Emerging Markets Review 3, 365–379 (2002). ↩¹

R. C. Grinold and R. N. Kahn. Active Portfolio Management: A Quantitative Approach for Producing Superior Returns and Controlling Risk. 2 Edition (McGraw-Hill, New York, 1999). ↩¹ ↩² ↩³ ↩⁴

D. N. Joanes and C. A. Gill. Comparing measures of sample skewness and kurtosis. Journal of the Royal Statistical Society: Series D (The Statistician) 47, 183–189 (1998). ↩¹ ↩²

B. Li and S. C. Hoi. On-line portfolio selection with moving average reversion. In: Proceedings of the 29th International Conference on Machine Learning (2012). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹²

D. Huang, J. Zhou, B. Li, S. C. Hoi and S. Zhou. Robust median reversion strategy for online portfolio selection. IEEE Transactions on Knowledge and Data Engineering 28, 2480–2493 (2016). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵

Z.-R. Lai, D.-Q. Dai, C.-X. Ren and K.-K. Huang. A peak price tracking-based learning system for portfolio selection. IEEE Transactions on Neural Networks and Learning Systems 29, 2823–2832 (2018). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³

B. Li, S. C. Hoi, D. Sahoo and Z.-Y. Liu. Moving average reversion strategy for on-line portfolio selection. Artificial Intelligence 222, 104–123 (2015). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵

B. Li, D. Sahoo and S. C. Hoi. OLPS: A toolbox for on-line portfolio selection. Journal of Machine Learning Research 17, 1–5 (2016). ↩¹ ↩²

Y. Vardi and C.-H. Zhang. The multivariate L1-median and associated data depth. Proceedings of the National Academy of Sciences 97, 1423–1426 (2000). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

B. Li, J. Luo and H. Xu. A portfolio selection strategy based on the peak price involving randomness. IEEE Access 11, 52066–52074 (2023). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹

Z.-R. Lai, P.-Y. Yang, L. Fang and X. Wu. Short-term sparse portfolio optimization based on alternating direction method of multipliers. Journal of Machine Learning Research 19, 1–28 (2018). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴ ↩²⁵ ↩²⁶ ↩²⁷ ↩²⁸ ↩²⁹ ↩³⁰ ↩³¹ ↩³² ↩³³ ↩³⁴ ↩³⁵

B. Li, J. Wang, D. Huang and S. C. Hoi. Transaction cost optimization for online portfolio selection. Quantitative Finance 18, 1411–1424 (2018). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴

Z.-R. Lai, P.-Y. Yang, L. Fang and X. Wu. Reweighted price relative tracking system for automatic portfolio optimization. IEEE Transactions on Systems, Man, and Cybernetics: Systems 50, 4349–4361 (2020). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰

H.-L. Dai, C.-X. Liang, H.-M. Dai, C.-Y. Huang and R. M. Adnan. An online portfolio strategy based on trend promote price tracing ensemble learning algorithm. Knowledge-Based Systems 239, 107957 (2022). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰

X. Cai and Z. Ye. Gaussian weighting reversion strategy for accurate online portfolio selection. IEEE Transactions on Signal Processing 67, 5558–5570 (2019). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹

H. Guan and Z. An. A local adaptive learning system for online portfolio selection. Knowledge-Based Systems 186, 104958 (2019). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹

Z.-R. Lai, D.-Q. Dai, C.-X. Ren and K.-K. Huang. Radial basis functions with adaptive input and composite trend representation for portfolio selection. IEEE Transactions on Neural Networks and Learning Systems 29, 6214–6226 (2018). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶

J. Friedman, T. Hastie and R. Tibshirani. Regularization paths for generalized linear models via coordinate descent. Journal of Statistical Software 33, 1–22 (2010). ↩¹ ↩² ↩³

Z.-R. Lai, P.-Y. Yang, X. Wu and L. Fang. A kernel-based trend pattern tracking system for portfolio optimization. Data Mining and Knowledge Discovery 32, 1708–1734 (2018). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴ ↩²⁵ ↩²⁶

H. Zou and T. Hastie. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 67, 301–320 (2005). ↩¹ ↩²

Z.-R. Lai, L. Tan, X. Wu and L. Fang. Loss control with rank-one covariance estimate for short-term portfolio optimization. Journal of Machine Learning Research 21, 1–37 (2020). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵

J. Schäfer and K. Strimmer. A shrinkage approach to large-scale covariance matrix estimation and implications for functional genomics. Statistical Applications in Genetics and Molecular Biology 4, Article 32 (2005). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

R. Bhatia. Positive Definite Matrices (Princeton University Press, 2007). ↩¹

A. Musolas, S. T. Smith and Y. Marzouk. Geodesically parameterized covariance estimation. SIAM Journal on Matrix Analysis and Applications 42, 528–556 (2021). ↩¹

S. Van Dongen and A. J. Enright. Metric distances derived from cosine similarity and Pearson and Spearman correlations, arXiv preprint arXiv:1208.3145 (2012). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

M. López de Prado. Building diversified portfolios that outperform out of sample. The Journal of Portfolio Management 42, 59–69 (2016). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

M. Meilă. Comparing clusterings—an information based distance. Journal of Multivariate Analysis 98, 873–895 (2007). ↩¹ ↩²

C. Rajski. A metric space of discrete probability distributions. Information and Control 4, 371–377 (1961). ↩¹ ↩²

A. Kraskov, H. Stögbauer, R. G. Andrzejak and P. Grassberger. Hierarchical clustering using mutual information. Europhysics Letters 70, 278–284 (2005). ↩¹ ↩²

J. C. Gower. Some distance properties of latent root and vector methods used in multivariate analysis. Biometrika 53, 325–338 (1966). ↩¹ ↩²

M. S. Charikar. Similarity estimation techniques from rounding algorithms. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing (2002); pp. 380–388. ↩¹ ↩² ↩³

S. Yue, X. Wang and M. Wei. Application of two-order difference to gap statistic. Transactions of Tianjin University 14, 217–221 (2008). ↩¹

R. Tibshirani, G. Walther and T. Hastie. Estimating the number of clusters in a data set via the gap statistic. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 63, 411–423 (2001). ↩¹

P. J. Rousseeuw. Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. Journal of Computational and Applied Mathematics 20, 53–65 (1987). ↩¹

M. López de Prado and M. J. Lewis. Detection of false investment strategies using unsupervised learning methods. Quantitative Finance 19, 1555–1565 (2019). ↩¹

D. Müllner. Modern hierarchical, agglomerative clustering algorithms, arXiv preprint arXiv:1109.2378 (2011). ↩¹

P. Virtanen, R. Gommers, T. E. Oliphant, M. Haberland, T. Reddy, D. Cournapeau, E. Burovski, P. Peterson, W. Weckesser, J. Bright, S. J. van der Walt, M. Brett, J. Wilson, K. J. Millman, N. Mayorov, A. R. Nelson, E. Jones, R. Kern, E. Larson, C. J. Carey, İ. Polat, Y. Feng, E. W. Moore, J. VanderPlas, D. Laxalde, J. Perktold, R. Cimrman, I. Henriksen, E. A. Quintero, C. R. Harris, A. M. Archibald, A. H. Ribeiro, F. Pedregosa and P. van Mulbregt. SciPy 1.0: fundamental algorithms for scientific computing in Python. Nature Methods 17, 261–272 (2020). ↩¹ ↩²

S. P. Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory 28, 129–137 (1982). ↩¹

W.-M. Song, T. D. Matteo and T. Aste. Nested hierarchies in planar graphs. Discrete Applied Mathematics 159, 2135–2146 (2011). ↩¹ ↩² ↩³ ↩⁴

W.-M. Song, T. Di Matteo and T. Aste. Hierarchical information clustering by means of topologically embedded graphs. PloS one 7, e31929 (2012). ↩¹ ↩² ↩³ ↩⁴

W. Barfuss, G. P. Massara, T. Di Matteo and T. Aste. Parsimonious modeling with information filtering networks. Phys. Rev. E 94, 062306 (2016). ↩¹ ↩² ↩³ ↩⁴

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7, 48–50 (1956). ↩¹

O. Borůvka. O jistém problému minimálním. Práce Moravské Přírodovědecké Společnosti 3, 37–58 (1926). ↩¹

R. C. Prim. Shortest connection networks and some generalizations. The Bell System Technical Journal 36, 1389–1401 (1957). ↩¹

R. N. Mantegna. Hierarchical structure in financial markets. The European Physical Journal B 11, 193–197 (1999). ↩¹ ↩²

M. Tumminello, T. Aste, T. Di Matteo and R. N. Mantegna. A tool for filtering information in complex systems. Proceedings of the National Academy of Sciences 102, 10421–10426 (2005). ↩¹ ↩²

G. P. Massara, T. Di Matteo and T. Aste. Network Filtering for Big Data: Triangulated Maximally Filtered Graph. Journal of Complex Networks 5, 161–178 (2016), arXiv:https://academic.oup.com/comnet/article-pdf/5/2/161/13794756/cnw015.pdf. ↩¹ ↩²

E. Estrada. The Structure of Complex Networks: Theory and Applications (Oxford University Press, 2011). ↩¹

L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977). ↩¹

U. Brandes. A faster algorithm for betweenness centrality. The Journal of Mathematical Sociology 25, 163–177 (2001). ↩¹

L. C. Freeman. Centrality in social networks conceptual clarification. Social Networks 1, 215–239 (1979). ↩¹ ↩²

P. Bonacich. Power and centrality: a family of measures. American Journal of Sociology 92, 1170–1182 (1987). ↩¹

L. Katz. A new status index derived from sociometric analysis. Psychometrika 18, 39–43 (1953). ↩¹

S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30, 107–117 (1998). ↩¹

T. W. Valente and R. K. Foreman. Integration and radiality: measuring the extent of an individual's connectedness and reachability in a network. Social Networks 20, 89–105 (1998). ↩¹

A. Shimbel. Structural parameters of communication networks. The Bulletin of Mathematical Biophysics 15, 501–507 (1953). ↩¹

D. Cajas. A Graph Theory Approach to Portfolio Optimization. Available at SSRN 4602019 (2023). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

D. Cajas. A Graph Theory Approach to Portfolio Optimization Part II. Available at SSRN 4667426 (2023). ↩¹ ↩² ↩³ ↩⁴

F. Ricca and A. Scozzari. Portfolio optimization through a network approach: network assortative mixing and portfolio diversification. European Journal of Operational Research 312, 700–717 (2024). ↩¹ ↩²

J. Fan, Y. Fan and J. Lv. High dimensional covariance matrix estimation using a factor model. Journal of Econometrics 147, 186–197 (2008). ↩¹

J. Walters. The Black-Litterman model in detail. SSRN Electronic Journal (2011). ↩¹

T. Idzorek. A step-by-step guide to the Black-Litterman model: incorporating user-specified confidence levels. In: Forecasting Expected Returns in the Financial Markets (Academic Press, 2007); pp. 17–38. ↩¹

P. N. Kolm and G. Ritter. On the Bayesian interpretation of Black-Litterman. European Journal of Operational Research 258, 564–572 (2017). ↩¹

W. Cheung. The augmented Black-Litterman model: a ranking-free approach to factor-based portfolio construction and beyond. Quantitative Finance 13, 301–316 (2013). ↩¹

A. Meucci. Fully flexible views: theory and practice. Risk 21, 97–102 (2008). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹²

A. Vorobets. Sequential entropy pooling heuristics. Available at SSRN 3936392 (2021). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

A. Meucci, D. Ardia and S. Keel. Fully flexible extreme views. The Journal of Risk 14, 39–49 (2011). ↩¹ ↩² ↩³ ↩⁴

F. Dietrich and C. List. Probabilistic opinion pooling generalized. Part one: general agendas. Social Choice and Welfare 48, 747–786 (2017). ↩¹ ↩² ↩³ ↩⁴

C. Martini and J. Sprenger. Opinion Aggregation and Individual Expertise. In: Scientific Collaboration and Collective Knowledge (Oxford University Press, 2017). ↩¹ ↩²

I. J. Good. Rational decisions. Journal of the Royal Statistical Society: Series B (Methodological) 14, 107–114 (1952). ↩¹

K. Boudt, W. Lu and B. Peeters. Higher order comoments of multifactor models and asset allocation. Finance Research Letters 13, 225–233 (2015). ↩¹

L. Martellini and V. Ziemann. Improved estimates of higher-order comoments and implications for portfolio selection. The Review of Financial Studies 23, 1467–1502 (2010). ↩¹

W. Xi, Z. Li, X. Song and H. Ning. Online portfolio selection with predictive instantaneous risk assessment. Pattern Recognition 144, 109872 (2023). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴

M. Sousa Lobo and S. Boyd. The Worst-Case Risk of a Portfolio (Stanford University, 2000). ↩¹

F. J. Fabozzi, P. N. Kolm, D. A. Pachamanova and S. M. Focardi. Robust Portfolio Optimization and Management (John Wiley & Sons, Hoboken, NJ, 2007). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

A. Ben-Tal and A. Nemirovski. Robust Convex Optimization. Mathematics of Operations Research 23, 769–805 (1998). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹

D. Goldfarb and G. Iyengar. Robust Portfolio Selection Problems. Mathematics of Operations Research 28, 1–38 (2003). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰

D. N. Politis and J. P. Romano. The stationary bootstrap. Journal of the American Statistical Association 89, 1303–1313 (1994). ↩¹ ↩²

D. N. Politis and J. P. Romano. A circular block-resampling procedure for stationary data. In: Exploring the Limits of Bootstrap (John Wiley & Sons, 1992); pp. 263–270. ↩¹ ↩²

H. R. Künsch. The jackknife and the bootstrap for general stationary observations. The Annals of Statistics 17, 1217–1241 (1989). ↩¹ ↩²

P. Mohajerin Esfahani and D. Kuhn. Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations. Mathematical Programming 171, 115–166 (2018). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶

D. P. Palomar. Portfolio Optimization: Theory and Application (Cambridge University Press, 2025). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

S. Boyd and L. Vandenberghe. Convex Optimization (Cambridge University Press, Cambridge, UK, 2004). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

S. Diamond and S. Boyd. CVXPY: A Python-embedded modeling language for convex optimization. Journal of Machine Learning Research 17, 1–5 (2016). ↩¹ ↩² ↩³ ↩⁴

D. Cajas. A Semidefinite Programming Approach to Risk Parity Portfolio Optimization. Available at SSRN 5097869 (2025). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷

R. H. Tütüncü and M. Koenig. Robust asset allocation. Annals of Operations Research 132, 157–187 (2004). ↩¹ ↩²

P. C. Fishburn. Mean-risk analysis with risk associated with below-target returns. The American Economic Review 67, 116–126 (1977). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

H. Konno and H. Yamazaki. Mean-absolute deviation portfolio optimization model and its applications to Tokyo stock market. Management Science 37, 519–531 (1991). ↩¹ ↩²

D. Cajas. Portfolio Optimization of Even Moments using Power Cone Programming. Available at SSRN 6518258 (2026). ↩¹ ↩²

D. Cajas. Approximation of Portfolio Kurtosis through Sum of Squared Quadratic Forms. Available at SSRN 4472793 (2023). ↩¹ ↩²

A. Chekhlov, S. Uryasev and M. Zabarankin. Drawdown measure in portfolio optimization. International Journal of Theoretical and Applied Finance 8, 13–58 (2005). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵

R. T. Rockafellar and S. Uryasev. Optimization of conditional value-at-risk. Journal of Risk 2, 21–41 (2000). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰

A. Ahmadi-Javid. Entropic value-at-risk: A new coherent risk measure. Journal of Optimization Theory and Applications 155, 1105–1123 (2012). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

D. Cajas. Portfolio Optimization of Relativistic Value at Risk. Available at SSRN 4378498 (2023). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

P. A. Krokhmal. Higher moment coherent risk measures. Quantitative Finance 7, 373–387 (2007). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

D. Cajas. OWA portfolio optimization: A disciplined convex programming framework. Available at SSRN 3988927 (2021). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴

D. Cajas. Efficient Gini Mean Difference and Tail Gini Portfolio Optimization based on P-Norms. Available at SSRN 4711326 (2024). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹²

D. Cajas. Higher order moment portfolio optimization with L-moments. Available at SSRN 4393155 (2023). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹

W. Ogryczak and T. Śliwiński. On solving linear programs with the ordered weighted averaging objective. European Journal of Operational Research 148, 80–91 (2003). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

W. Ogryczak and A. Ruszczyński. Dual stochastic dominance and quantile risk measures. International Transactions in Operational Research 9, 661–680 (2002). ↩¹ ↩² ↩³

S. Yitzhaki. Stochastic dominance, mean variance, and Gini's mean difference. The American Economic Review 72, 178–185 (1982). ↩¹

M. X. Goemans. Smallest compact formulation for the permutahedron. Mathematical Programming 153, 5–11 (2015). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷

K. E. Batcher. Sorting networks and their applications. In: Proceedings of the April 30–May 2, 1968, Spring Joint Computer Conference (1968); pp. 307–314. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹

P. G. Martin and B. B. McCann. The Investor's Guide to Fidelity Funds (John Wiley & Sons, 1989). ↩¹ ↩²

D. Cajas. Portfolio Optimization of Brownian Distance Variance. Available at SSRN 4561293 (2023). ↩¹

M. R. Young. A minimax portfolio selection rule with linear programming solution. Management Science 44, 673–683 (1998). ↩¹

K. Benidis, Y. Feng and D. P. Palomar. Optimization Methods for Financial Index Tracking: From Theory to Practice. Foundations and Trends in Optimization 3, 171–279 (2018). ↩¹

D. Cajas. Semidefinite Relaxation of Higher Portfolio Moments. Available at SSRN 5284483 (2025). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

P. J. Rousseeuw and C. Croux. Alternatives to the median absolute deviation. Journal of the American Statistical Association 88, 1273–1283 (1993). ↩¹

T. Roncalli and G. Weisang. Risk Parity Portfolios with Risk Factors. Available at SSRN 2155159 (2012). ↩¹ ↩² ↩³ ↩⁴

A. Meucci. Risk Contributions from Generic User-Defined Factors. Available at SSRN 930034 (2007). ↩¹ ↩²

M. López de Prado. Advances in Financial Machine Learning (John Wiley & Sons, Hoboken, NJ, 2018). ↩¹ ↩² ↩³ ↩⁴

J. Bergstra and Y. Bengio. Random search for hyper-parameter optimization. Journal of Machine Learning Research 13, 281–305 (2012). ↩¹ ↩²

F. X. Diebold and R. S. Mariano. Comparing predictive accuracy. Journal of Business & Economic Statistics 13, 253–263 (1995). ↩¹

K. D. West. Asymptotic inference about predictive ability. Econometrica 64, 1067–1084 (1996). ↩¹

M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the 20th International Conference on Machine Learning (2003); pp. 928–936. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰

P. Cotton. Schur Complementary Allocation: A Unification of Hierarchical Risk Parity and Minimum Variance Portfolios (2024), arXiv:2411.05807 [q-fin.PM]. ↩¹ ↩²

T. Raffinot. Hierarchical clustering-based asset allocation. The Journal of Portfolio Management 44, 89–99 (2017). ↩¹

T. Raffinot. The hierarchical equal risk contribution portfolio. SSRN Electronic Journal (2018). ↩¹

J. L. Kelly. A New Interpretation of Information Rate. Bell System Technical Journal 35, 917–926 (1956). ↩¹

E. O. Thorp. The Kelly Criterion in Blackjack, Sports Betting, and the Stock Market. In: Handbook of Asset and Liability Management, Vol. 1 (North-Holland, 2008); pp. 385–428. ↩¹

R. Chares. Cones and Interior-Point Algorithms for Structured Convex Optimization Involving Powers and Exponentials. Ph.D. Thesis, Université catholique de Louvain (Louvain-la-Neuve, Belgium, 2009). ↩¹

S. Schaible and T. Ibaraki. Fractional Programming. European Journal of Operational Research 12, 325–338 (1983). ↩¹

A. Charnes and W. W. Cooper. Programming with Linear Fractional Functionals. Naval Research Logistics Quarterly 9, 181–186 (1962). ↩¹

B. Tóth, Y. Lémperière, C. Deremble, J. de Lataillade, J. Kockelkoren and J.-P. Bouchaud. Anomalous Price Impact and the Critical Nature of Liquidity in Financial Markets. Physical Review X 1, 021006 (2011). ↩¹

V. DeMiguel, L. Garlappi, F. J. Nogales and R. Uppal. A Generalized Approach to Portfolio Optimization: Improving Performance by Constraining Portfolio Norms. Management Science 55, 798–812 (2009). ↩¹ ↩² ↩³

D. Cajas. Robust Portfolio Selection with Near Optimal Centering. Available at SSRN 3572435 (2019). ↩¹

T. de Graaf. Robust Mean-Variance Optimization. Master's thesis, Leiden University (2016). ↩¹

S. Maillard, T. Roncalli and J. Teiletche. On the Properties of Equally-Weighted Risk Contributions Portfolios. Available at SSRN 1271972 (2008). ↩¹ ↩² ↩³

B. Bruder and T. Roncalli. Managing Risk Exposures Using the Risk Budgeting Approach. Available at SSRN 2009778 (2012). ↩¹ ↩² ↩³

MOSEK ApS. MOSEK Portfolio Optimization Cookbook, https://docs.mosek.com/portfolio-cookbook/index.html (2023). ↩¹

V. Gambeta and R. Kwon. Risk Return Trade-Off in Relaxed Risk Parity Portfolio Optimization. Journal of Risk and Financial Management 13, 237 (2020). ↩¹ ↩²

J.-C. Richard and T. Roncalli. Constrained Risk Budgeting Portfolios: Theory, Algorithms, Applications & Puzzles. Technical Report 1902.05710 (arXiv, 2019). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

H. Mausser and O. Romanko. Computing Equal Risk Contribution Portfolios. IBM Journal of Research and Development 58, 5:1–5:12 (2014). ↩¹

D. H. Wolpert. Stacked generalization. Neural Networks 5, 241–259 (1992). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

W. Shen and J. Wang. Portfolio selection via subset resampling. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (2017); pp. 1517–1523. ↩¹ ↩² ↩³ ↩⁴ ↩⁵

R. A. Martin. PyPortfolioOpt: portfolio optimization in Python. Journal of Open Source Software 6, 3066 (2021). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

J. Duchi, S. Shalev-Shwartz, Y. Singer and T. Chandra. Efficient projections onto the l1-ball for learning in high dimensions. In: Proceedings of the 25th International Conference on Machine Learning (2008); pp. 272–279. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

D. P. Helmbold, R. E. Schapire, Y. Singer and M. K. Warmuth. On-line portfolio selection using multiplicative updates. Mathematical Finance 8, 325–347 (1998). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴ ↩²⁵

A. Agarwal, E. Hazan, S. Kale and R. E. Schapire. Algorithms for portfolio management based on the Newton method. In: Proceedings of the 23rd International Conference on Machine Learning (2006); pp. 9–16. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷

B. Li, P. Zhao, S. C. Hoi and V. Gopalkrishnan. PAMR: Passive aggressive mean reversion strategy for portfolio selection. Machine Learning 87, 221–258 (2012). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²²

L. Zhang, S. Lu and Z.-H. Zhou. Adaptive online learning in dynamic environments. In: Advances in Neural Information Processing Systems 31 (2018); pp. 1323–1333. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵

P. Zhao, Y.-J. Zhang, L. Zhang and Z.-H. Zhou. Dynamic regret of convex and smooth functions. In: Advances in Neural Information Processing Systems 33 (2020); pp. 12510–12520. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸

T. M. Cover and E. Ordentlich. Universal portfolios with side information. IEEE Transactions on Information Theory 42, 348–363 (1996). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

J. D. Abernethy, C. Lee and A. Tewari. Fighting bandits with a new kind of smoothness. In: Advances in Neural Information Processing Systems, Vol. 28 (2015). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷

J. Zimmert and Y. Seldin. Tsallis-INF: An optimal algorithm for stochastic and adversarial bandits. Journal of Machine Learning Research 22, 1–49 (2021). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷

L. Orseau, T. Lattimore and S. Legg. Soft-Bayes: Prod for mixtures of experts with log-loss. In: Proceedings of the 28th International Conference on Algorithmic Learning Theory, Vol. 76 of Proceedings of Machine Learning Research (2017); pp. 372–399. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²²

S.-H. Moon. Empirical investigation of state-of-the-art mean reversion strategies for equity markets, arXiv preprint arXiv:1909.04327 (2019). ↩¹ ↩² ↩³

B. Li, S. C. Hoi, P. Zhao and V. Gopalkrishnan. Confidence weighted mean reversion strategy for online portfolio selection. ACM Transactions on Knowledge Discovery from Data 7, 4:1–4:38 (2013). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

B. Li, S. C. Hoi, P. Zhao and V. Gopalkrishnan. Confidence weighted mean reversion strategy for on-line portfolio selection. In: Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, Vol. 15 of Proceedings of Machine Learning Research (2011); pp. 434–442. ↩¹ ↩² ↩³ ↩⁴

A. Borodin, R. El-Yaniv and V. Gogan. Can we learn to beat the best stock. Journal of Artificial Intelligence Research 21, 579–594 (2004). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷

D. P. Helmbold, R. E. Schapire, Y. Singer and M. K. Warmuth. A comparison of new and old algorithms for a mixture estimation problem. Machine Learning 27, 97–119 (1997). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰

V. Vovk and C. Watkins. Universal portfolio selection. In: Proceedings of the 11th Annual Conference on Computational Learning Theory (1998); pp. 12–23. ↩¹ ↩² ↩³

B. Li, S. C. Hoi and V. Gopalkrishnan. CORN: Correlation-driven nonparametric learning approach for portfolio selection. ACM Transactions on Intelligent Systems and Technology 2, 21:1–21:29 (2011). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵

Y. Kalnishkan and M. V. Vyugin. The weak aggregating algorithm and weak mixability. Journal of Computer and System Sciences 74, 1228–1244 (2008). ↩¹ ↩²

X. Yang, J. He, H. Lin and Y. Zhang. Boosting exponential gradient strategy for online portfolio selection: An aggregating experts' advice method. Computational Economics 55, 231–251 (2020). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹

X. Yang, J. He and Y. Zhang. Aggregating exponential gradient expert advice for online portfolio selection. Journal of the Operational Research Society 73, 587–597 (2022). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

Y. Zhang, H. Lin, L. Zheng and X. Yang. Adaptive online portfolio strategy based on exponential gradient updates. Journal of Combinatorial Optimization 43, 672–696 (2022). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵

Y. Li, X. Zheng, C. Chen, J. Wang and S. Xu. Exponential gradient with momentum for online portfolio selection. Expert Systems with Applications 187, 115889 (2022). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹ ↩²⁰ ↩²¹ ↩²² ↩²³ ↩²⁴ ↩²⁵ ↩²⁶

A. A. Gaivoronski and F. Stella. Stochastic nonstationary optimization for finding universal portfolios. Annals of Operations Research 100, 165–188 (2000). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹

L. Györfi and D. Schäfer. Nonparametric prediction. In: Advances in Learning Theory: Methods, Models and Applications (IOS Press, 2003); pp. 339–354. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹

L. Györfi, G. Lugosi and F. Udina. Nonparametric kernel-based sequential investment strategies. Mathematical Finance 16, 337–357 (2006). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹

L. Györfi, A. Urbán and I. Vajda. Kernel-based semi-log-optimal empirical portfolio selection strategies. International Journal of Theoretical and Applied Finance 10, 505–516 (2007). ↩¹ ↩²

G. Ottucsák and I. Vajda. An asymptotic analysis of the mean-variance portfolio selection. Statistics & Decisions 25, 63–88 (2007). ↩¹ ↩²

L. Györfi and I. Vajda. Growth optimal investment with transaction costs. In: Algorithmic Learning Theory, Vol. 5254 of Lecture Notes in Computer Science (Springer, 2008); pp. 108–122. ↩¹ ↩² ↩³

L. Györfi, F. Udina and H. Walk. Nonparametric nearest neighbor based empirical portfolio selection strategies. Statistics & Decisions 26, 145–157 (2008). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹

Y. Wang, D. Wang, Y. Wang and Y. Zhang. RACORN-K: Risk-aversion pattern matching-based portfolio selection (2018), arXiv:1802.10244. ↩¹ ↩²

M. Khedmati and P. Azin. An online portfolio selection algorithm using clustering approaches and considering transaction costs. Expert Systems with Applications 159, 113546 (2020). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹

E. Hazan and S. Kale. An online portfolio selection algorithm with regret logarithmic in price variation. Mathematical Finance 25, 288–310 (2015). ↩¹ ↩² ↩³ ↩⁴

E. Hazan and C. Seshadhri. Efficient learning algorithms for changing environments. In: Proceedings of the 26th International Conference on Machine Learning (2009); pp. 393–400. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³

J. Duchi, E. Hazan and Y. Singer. Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research 12, 2121–2159 (2011). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³

C.-K. Chiang, T. Yang, C.-J. Lee, M. Mahdavi, C.-J. Lu, R. Jin and S. Zhu. Online optimization with gradual variations. In: Proceedings of the 25th Annual Conference on Learning Theory (2012); p. 6.1–6.20. ↩¹ ↩² ↩³ ↩⁴ ↩⁵

A. Nemirovski. Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM Journal on Optimization 15, 229–251 (2004). ↩¹ ↩²

A. Rakhlin and K. Sridharan. Optimization, learning, and games with predictable sequences. In: Advances in Neural Information Processing Systems 26 (2013); pp. 3066–3074. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴

A. Rakhlin and K. Sridharan. Online learning with predictable sequences. In: Proceedings of the 26th Annual Conference on Learning Theory (2013); pp. 993–1019. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷

Y. Singer. Switching portfolios. International Journal of Neural Systems 8, 445–455 (1997). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹²

M. Herbster and M. K. Warmuth. Tracking the best expert. Machine Learning 32, 151–178 (1998). ↩¹ ↩²

D. H. Bailey and M. Lopez de Prado. The Sharpe ratio efficient frontier. Journal of Risk 15, 3–44 (2012). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

D. H. Bailey and M. Lopez de Prado. The deflated Sharpe ratio: correcting for selection bias, backtest overfitting, and non-normality. The Journal of Portfolio Management 40, 94–107 (2014). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

G. Kaniadakis. Non-linear kinetics underlying generalized statistics. Physica A: Statistical Mechanics and its Applications 296, 405–425 (2001), arXiv:cond-mat/0103467. ↩¹ ↩²

D. McFadden. Conditional logit analysis of qualitative choice behavior. In: Frontiers in Econometrics, edited by P. Zarembka (Academic Press, New York, 1974); pp. 105–142. ↩¹ ↩²

D. R. Cox and E. J. Snell. Analysis of Binary Data. 2 Edition (Chapman and Hall, London, 1989). ↩¹

N. J. Nagelkerke. A note on a general definition of the coefficient of determination. Biometrika 78, 691–692 (1991). ↩¹

H. Akaike. A new look at the statistical model identification. IEEE Transactions on Automatic Control 19, 716–723 (1974). ↩¹

C. M. Hurvich and C.-L. Tsai. Regression and time series model selection in small samples. Biometrika 76, 297–307 (1989). ↩¹

G. Schwarz. Estimating the dimension of a model. The Annals of Statistics 6, 461–464 (1978). ↩¹

H. Theil. Economic Forecasts and Policy. 2 Edition (North-Holland, 1961). ↩¹

Z. Bar-Joseph, D. K. Gifford and T. S. Jaakkola. Fast optimal leaf ordering for hierarchical clustering. Bioinformatics 17, S22–S29 (2001). ↩¹ ↩²

M. Rubinov and O. Sporns. Complex network measures of brain connectivity: Uses and interpretations. NeuroImage 52, 1059–1069 (2010). ↩¹ ↩² ↩³ ↩⁴

The JuMP Developers. Modeling with cones, https://jump.dev/JuMP.jl/stable/tutorials/conic/tips_and_tricks/ (2026). Conic programming tutorial of the JuMP documentation. ↩¹ ↩² ↩³