TY - GEN
T1 - ParDen
T2 - 8th International Conference on Soft Computing and Machine Intelligence, ISCMI 2021
AU - Van Zyl, T. L.
AU - Woolway, M.
AU - Paskaramoorthy, A.
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - Portfolio optimisation is a multi-objective optimisation problem (MOP), where an investor aims to optimise the conflicting criteria of maximising a portfolio's expected return whilst minimising its risk and other costs. However, selecting a portfolio is a computationally expensive problem because of the cost associated with performing multiple evaluations on test data ("backtesting") rather than solving the convex optimisation problem itself. In this research, we present ParDen, an algorithm for the inclusion of any discriminative or generative machine learning model as a surrogate to mitigate the computationally expensive backtest procedure. In addition, we compare the performance of alternative metaheuristic algorithms: NSGA-II, R-NSGA-II, NSGA-III, R-NSGA-III, U-NSGA-III, MO-CMA-ES, and COMO-CMA-ES. We measure performance using multi-objective performance indicators, including Generational Distance Plus, Inverted Generational Distance Plus and Hypervol-ume. We also consider meta-indicators, Success Rate and Average Executions to Success Rate, of the Hypervolume to provide more insight into the quality of solutions. Our results show that ParDen can reduce the number of evaluations required by almost a third while obtaining an improved Pareto front over the state-of-the-art for the problem of portfolio selection.
AB - Portfolio optimisation is a multi-objective optimisation problem (MOP), where an investor aims to optimise the conflicting criteria of maximising a portfolio's expected return whilst minimising its risk and other costs. However, selecting a portfolio is a computationally expensive problem because of the cost associated with performing multiple evaluations on test data ("backtesting") rather than solving the convex optimisation problem itself. In this research, we present ParDen, an algorithm for the inclusion of any discriminative or generative machine learning model as a surrogate to mitigate the computationally expensive backtest procedure. In addition, we compare the performance of alternative metaheuristic algorithms: NSGA-II, R-NSGA-II, NSGA-III, R-NSGA-III, U-NSGA-III, MO-CMA-ES, and COMO-CMA-ES. We measure performance using multi-objective performance indicators, including Generational Distance Plus, Inverted Generational Distance Plus and Hypervol-ume. We also consider meta-indicators, Success Rate and Average Executions to Success Rate, of the Hypervolume to provide more insight into the quality of solutions. Our results show that ParDen can reduce the number of evaluations required by almost a third while obtaining an improved Pareto front over the state-of-the-art for the problem of portfolio selection.
KW - genetic algorithms
KW - hyper-parameter optimisation
KW - metaheuristics
KW - multi-objective optimisation
KW - portfolio selection
KW - surrogate modelling
UR - http://www.scopus.com/inward/record.url?scp=85124406006&partnerID=8YFLogxK
U2 - 10.1109/ISCMI53840.2021.9654934
DO - 10.1109/ISCMI53840.2021.9654934
M3 - Conference contribution
AN - SCOPUS:85124406006
T3 - 2021 8th International Conference on Soft Computing and Machine Intelligence, ISCMI 2021
SP - 101
EP - 107
BT - 2021 8th International Conference on Soft Computing and Machine Intelligence, ISCMI 2021
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 26 November 2021 through 27 November 2021
ER -