hassan, G; clack, CD; (2009) Robustness of multiple objective GP stock-picking in unstable financial markets: real-world applications track. In: (Proceedings) Genetic and Evolutionary Computation (GECCO 2009). (pp. 1513 - 1520). ACM
Full text not available from this repository.
Multiple Objective Genetic Programming (MOGP) is a promising stock-picking technique for fund managers, because the Pareto front approximates the risk/reward Efficient Frontier and simplifies the choice of investment model for a given client's attitude to risk. Unfortunately GP solutions don't work well if used in an environment that is different from the training environment, and the financial markets are notoriously unstable, often lurching from one market context to another (e.g. "bull" to "bear"). This turns out to be a hard problem -- simple dynamic adaptation methods are insufficient and robust behaviour of solutions becomes extremely important. In this paper we provide the first known empirical results on the robustness of MOGP solutions in an unseen environment consisting of real-world financial data. We focus on two well-known mechanisms to determine which leads to the more robust solutions: Mating Restriction, and Diversity Preservation. We introduce novel metrics for Pareto front robustness, and a novel variation on Mating Restriction, both based on phenotypic cluster analysis.
|Title:||Robustness of multiple objective GP stock-picking in unstable financial markets: real-world applications track|
|Event:||Genetic and Evolutionary Computation (GECCO 2009)|
|Dates:||2009-07-08 - 2009-07-12|
|Keywords:||GP, Multiobjective optimization, robustness, portfolio optimization, finance, dynamic environment|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record