Volume 2 Number 1 (Feb. 2007)
Home > Archive > 2007 > Volume 2 Number 1 (Feb. 2007) >
JCP 2007 Vol.2(1): 12-19 ISSN: 1796-203X
doi: 10.4304/jcp.2.1.12-19

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

Nicolas Chapados, Yoshua Bengio
1Computer Science and Operations Research University of Montreal P.O. Box 6128, Montr´eal Qu´ebec, H3C 3J7, Canada

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.

[PDF]

Cite: Nicolas Chapados, Yoshua Bengio, "Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization," Journal of Computers vol. 2, no. 1, pp. 12-19, 2007.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Monthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Jul 19, 2019 News!

    Vol 14, No 7 has been published with online version   [Click]

  • Jun 21, 2019 News!

    Vol 14, No 6 has been published with online version   [Click]

  • Apr 28, 2019 News!

    Vol 14, No 5 has been published with online version 7 papers are published in this issue after peer review   [Click]

  • Mar 20, 2019 News!

    Vol 14, No 3 has been published with online version   [Click]

  • Read more>>