The K best-paths approach to approximate dynamic programming with application to portfolio optimization

  • Authors:
  • Nicolas Chapados;Yoshua Bengio

  • Affiliations:
  • Dept. IRO, Université de Montréal, Montréal, Québec, Canada;Dept. IRO, Université de Montréal, Montréal, Québec, Canada

  • Venue:
  • AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe a general method to transform a non-markovian sequential decision problem into a supervised learning problem using a K-best-paths algorithm. We consider an application in financial portfolio management where we can train a controller to directly optimize a Sharpe Ratio (or other risk-averse non-additive) utility function. We illustrate the approach by demonstrating experimental results using a kernel-based controller architecture that would not normally be considered in traditional reinforcement learning or approximate dynamic programming.