Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization

Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths 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. We further show that using a non-additive criterion (incremental Sharpe Ratio) yields a noisy K-best-paths extraction problem, that can give substantially improved performance.

• Type: Journal
• Year: 2007
• Where: JCP
• Authors: Nicolas Chapados, Yoshua Bengio
• Keywords: Incremental Sharpe Ratio, JCP 2007, Sequential Decision Problem, Sharpe Ratio