Abstract
In this paper, we are interested in studying and solving the portfolio selection problem by means of a machine learning method. Particularly, we use a \(\chi \)-armed bandit algorithm called Hierarchical Optimistic Optimization (HOO). HOO is an optimization approach that can be used for finding optima of box constrained nonlinear and nonconvex functions. Under some restrictions, such as locally Lipschitz condition, HOO can provide global solutions. Our idea consists in using HOO for solving some NP-hard variants of the portfolio selection problem. We test this approach on some data sets and report the results. In order to verify the quality of the solutions, we compare them with the best known solutions, provided by a derivative-free approach, called DIRECT. The preliminary numerical experiments give promising results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bubeck, S., Munos, R., Stoltz, G., Szepesvàri, C.: \(\chi \)-Armed bandits. J. Mach. Learn. Res. 12, 1655–1695 (2011)
Bartholomew-Biggs, M.C.: Nonlinear Optimization with Financial Applications, 1st edn. Kluwer Academic Publishers, Dordrecht (2005)
Bartholomew-Biggs, M.C., Kane, S.J.: A global optimization problem in portfolio selection. Comput. Manag. Sci. 6, 329–345 (2009)
Fernández, A., Gómez, S.: Portfolio selection using neural networks. Comput. Oper. Res. 34, 1177–1191 (2007)
Jobst, N., Horniman, M., Lucas, C., Mitra, G.: Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints. Quant. Finance 1, 1–13 (2001)
Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the lipschitz constant. J. Optim. Theor. Appl. 79(1), 157–181 (1992)
Jones, D.R.: The DIRECT global optimization algorithm. In: Floudas, C.A., Pardolos, P.M. (eds.) Encyclopaedia of Optimization, pp. 431–440. Kluwer, Dordrecht (2001)
Markowitz, H.M.: Portfolio selection. J. Finance 7(1), 77–91 (1952)
Markowitz, H.M.: Portfolio Selection. Wiley, New York (1959)
Mitchell, J.E., Braun, S.: Rebalancing an investment portfolio in the presence of convex transaction costs. Rensselaer Polytechnic Institute (2004)
Le Thi, H.A., Moeini, M.: Portfolio selection under buy-in threshold constraints using DC programming and DCA. In: International Conference on Service Systems and Service Management (IEEE/SSSM 2006), pp. 296–300 (2006)
Le Thi, H.A., Moeini, M.: Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm. J. Optim. Theor. Appl. 161(1), 199–224 (2014)
Robbins, H.: Some aspects of the sequential design of experiments. Bull. Am. Math. Soc. 58, 527–535 (1952)
Shen, W., Wang, J., Jiang, Y.-G., Zha, H.: Portfolio choices with orthogonal bandit learning. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015), pp. 974–980 (2015)
Acknowledgements
The authors acknowledge the chair of Business Information Systems and Operations Research (BISOR) at the TU-Kaiserslautern (Germany) for the financial support, through the research program “CoVaCo”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moeini, M., Wendt, O., Krumrey, L. (2016). Portfolio Optimization by Means of a \(\chi \)-Armed Bandit Algorithm. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49390-8_60
Download citation
DOI: https://doi.org/10.1007/978-3-662-49390-8_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49389-2
Online ISBN: 978-3-662-49390-8
eBook Packages: Computer ScienceComputer Science (R0)