Planning under the Uncertainty of the Technical Analysis of Stock Markets

The stock market can be considered a nondeterministic and partially observable domain, because investors never know all information that affects prices and the result of an investment is always uncertain. Technical Analysis methods demand only data that are easily available, i.e. the series of prices and trade volumes, and are then very useful to predict current price trends. Analysts have however to deal with the fact that the indications of these methods are uncertain, having different interpretations. In this work, we assume the hypothesis that an investment context can be modeled as a Partially Observable Markov Decision Process (POMDP) and partial observations of price trends can be provided by Technical Analysis methods. A metamodel is proposed to specify POMDP problems, embedding formal interpretations of Technical Analysis methods. Planning algorithms can then try to create investment policies to maximize profits. Due to the complexity for solving POMDPs, algorithms that generate only approximate solutions have to be applied. Nevertheless, the results obtained by an implemented prototype are promising.

[1]  William Hamilton,et al.  The Stock Market Barometer; a Study of its Forecast Value Based on Charles H. Dow's Theory of the Price Movement. With an Analysis of the Market and its History Since 1897 , 1989 .

[2]  Edward J. Sondik,et al.  The Optimal Control of Partially Observable Markov Processes over a Finite Horizon , 1973, Oper. Res..

[3]  C. D. Tilakaratne,et al.  Predicting Stock Market Index Trading Signals Using Neural Networks , 2007 .

[4]  Leslie Pack Kaelbling,et al.  Acting Optimally in Partially Observable Stochastic Domains , 1994, AAAI.

[5]  Michael Kearns,et al.  Reinforcement learning for optimized trade execution , 2006, ICML.

[6]  Ken'ichi Kamijo,et al.  Stock price pattern recognition-a recurrent neural network approach , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[7]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[8]  J. Wilder New Concepts in Technical Trading Systems , 1978 .

[9]  Shingo Mabu,et al.  Trading rules on stock markets using genetic network programming with reinforcement learning and importance index , 2007 .

[10]  Joelle Pineau,et al.  Point-based value iteration: An anytime algorithm for POMDPs , 2003, IJCAI.

[11]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

[12]  A. Cassandra,et al.  Exact and approximate algorithms for partially observable markov decision processes , 1998 .

[13]  Pat Langley,et al.  Editorial: On Machine Learning , 1986, Machine Learning.

[14]  David Hsu,et al.  SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces , 2008, Robotics: Science and Systems.

[15]  David R. Thompson,et al.  Generating Exponentially Smaller POMDP Models Using Conditionally Irrelevant Variable Abstraction , 2007, ICAPS.

[16]  Reid G. Simmons,et al.  Heuristic Search Value Iteration for POMDPs , 2004, UAI.

[17]  C. Kirkpatrick,et al.  Technical Analysis: The Complete Resource for Financial Market Technicians , 2006 .