IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1107.0036.html
   My bibliography  Save this paper

Can We Learn to Beat the Best Stock

Author

Listed:
  • A. Borodin
  • R. El-Yaniv
  • V. Gogan

Abstract

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.

Suggested Citation

  • A. Borodin & R. El-Yaniv & V. Gogan, 2011. "Can We Learn to Beat the Best Stock," Papers 1107.0036, arXiv.org.
    • Handle: RePEc:arx:papers:1107.0036
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1107.0036
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Nicolo Cesa Bianchi & Gábor Lugosi, 1998. "On prediction of individual sequences," Economics Working Papers 324, Department of Economics and Business, Universitat Pompeu Fabra.
    2. 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, October.
    3. 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.
    4. Thomas M. Cover, 1991. "Universal Portfolios," Mathematical Finance, Wiley Blackwell, vol. 1(1), pages 1-29, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chu, Gang & Zhang, Wei & Sun, Guofeng & Zhang, Xiaotao, 2019. "A new online portfolio selection algorithm based on Kalman Filter and anti-correlation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    2. Zhengyong Jiang & Jeyan Thiayagalingam & Jionglong Su & Jinjun Liang, 2023. "CAD: Clustering And Deep Reinforcement Learning Based Multi-Period Portfolio Management Strategy," Papers 2310.01319, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Seung-Hyun Moon & Yong-Hyuk Kim & Byung-Ro Moon, 2019. "Empirical investigation of state-of-the-art mean reversion strategies for equity markets," Papers 1909.04327, arXiv.org.
    2. Man Yiu Tsang & Tony Sit & Hoi Ying Wong, 2022. "Adaptive Robust Online Portfolio Selection," Papers 2206.01064, arXiv.org.
    3. R'emi J'ez'equel & Dmitrii M. Ostrovskii & Pierre Gaillard, 2022. "Efficient and Near-Optimal Online Portfolio Selection," Papers 2209.13932, arXiv.org.
    4. James Chok & Geoffrey M. Vasil, 2023. "Convex optimization over a probability simplex," Papers 2305.09046, arXiv.org.
    5. Bin Li & Steven C. H. Hoi, 2012. "On-Line Portfolio Selection with Moving Average Reversion," Papers 1206.4626, arXiv.org.
    6. Ha, Youngmin & Zhang, Hai, 2020. "Algorithmic trading for online portfolio selection under limited market liquidity," European Journal of Operational Research, Elsevier, vol. 286(3), pages 1033-1051.
    7. Roujia Li & Jia Liu, 2022. "Online Portfolio Selection with Long-Short Term Forecasting," SN Operations Research Forum, Springer, vol. 3(4), pages 1-15, December.
    8. Ting-Kam Leonard Wong, 2015. "Universal portfolios in stochastic portfolio theory," Papers 1510.02808, arXiv.org, revised Dec 2016.
    9. Yong Zhang & Xingyu Yang, 2017. "Online Portfolio Selection Strategy Based on Combining Experts’ Advice," Computational Economics, Springer;Society for Computational Economics, vol. 50(1), pages 141-159, June.
    10. Zhengyao Jiang & Dixing Xu & Jinjun Liang, 2017. "A Deep Reinforcement Learning Framework for the Financial Portfolio Management Problem," Papers 1706.10059, arXiv.org, revised Jul 2017.
    11. Shuo Sun & Rundong Wang & Bo An, 2021. "Reinforcement Learning for Quantitative Trading," Papers 2109.13851, arXiv.org.
    12. Esther Mohr & Robert Dochow, 2017. "Risk management strategies for finding universal portfolios," Annals of Operations Research, Springer, vol. 256(1), pages 129-147, September.
    13. Dmitry B. Rokhlin, 2020. "Relative utility bounds for empirically optimal portfolios," Papers 2006.05204, arXiv.org.
    14. Leonard C. MacLean & Yonggan Zhao & William T. Ziemba, 2016. "Optimal capital growth with convex shortfall penalties," Quantitative Finance, Taylor & Francis Journals, vol. 16(1), pages 101-117, January.
    15. Panpan Ren & Jiang-Lun Wu, 2017. "Foreign exchange market modelling and an on-line portfolio selection algorithm," Papers 1707.00203, arXiv.org.
    16. Xingyu Yang & Jin’an He & Hong Lin & Yong Zhang, 2020. "Boosting Exponential Gradient Strategy for Online Portfolio Selection: An Aggregating Experts’ Advice Method," Computational Economics, Springer;Society for Computational Economics, vol. 55(1), pages 231-251, January.
    17. Freund, Yoav & Schapire, Robert E., 1999. "Adaptive Game Playing Using Multiplicative Weights," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 79-103, October.
    18. Rémi Jézéquel & Dmitrii M. Ostrovskii & Pierre Gaillard, 2022. "Efficient and Near-Optimal Online Portfolio Selection," Working Papers hal-03787674, HAL.
    19. Parkes, David C. & Huberman, Bernardo A., 2001. "Multiagent Cooperative Search for Portfolio Selection," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 124-165, April.
    20. Purushottam Parthasarathy & Avinash Bhardwaj & Manjesh K. Hanawal, 2023. "Online Universal Dirichlet Factor Portfolios," Papers 2308.07763, arXiv.org, revised Nov 2023.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.