Can We Learn to Beat the Best Stock
A novel algorithm for actively trading stocks is presented. While traditional expert advice and "universal" algorithms (as well as standard technical trading heuristics) attempt to predict winners or trends, our approach relies on predictable statistical relations between all pairs of stocks in the market. Our empirical results on historical markets provide strong evidence that this type of technical trading can "beat the market" and moreover, can beat the best stock in the market. In doing so we utilize a new idea for smoothing critical parameters in the context of expert learning.
|Date of creation:||Jun 2011|
|Publication status:||Published in Journal Of Artificial Intelligence Research, Volume 21, pages 579-594, 2004|
|Contact details of provider:|| Web page: http://arxiv.org/|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- David P. Helmbold & Robert E. Schapire & Yoram Singer & Manfred K. Warmuth, 1998. "On-Line Portfolio Selection Using Multiplicative Updates," Mathematical Finance, Wiley Blackwell, vol. 8(4), pages 325-347.
- Nicolo Cesa Bianchi & Gábor Lugosi, 1998. "On prediction of individual sequences," Economics Working Papers 324, Department of Economics and Business, Universitat Pompeu Fabra.
- Brock, William & Lakonishok, Josef & LeBaron, Blake, 1992.
" Simple Technical Trading Rules and the Stochastic Properties of Stock Returns,"
Journal of Finance,
American Finance Association, vol. 47(5), pages 1731-1764, December.
- Brock, W. & Lakonishok, J. & Lebaron, B., 1991. "Simple Technical Trading Rules And The Stochastic Properties Of Stock Returns," Working papers 90-22, Wisconsin Madison - Social Systems.
- Thomas M. Cover, 1991. "Universal Portfolios," Mathematical Finance, Wiley Blackwell, vol. 1(1), pages 1-29. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1107.0036. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators)
If references are entirely missing, you can add them using this form.