IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v63y2024i6d10.1007_s10614-023-10411-5.html
   My bibliography  Save this article

Weak aggregating specialist algorithm for online portfolio selection

Author

Listed:
  • Jin’an He

    (Sun Yat-sen University)

  • Shicheng Yin

    (Sun Yat-sen University)

  • Fangping Peng

    (Sun Yat-sen University)

Abstract

This paper proposes a novel online learning algorithm, named weak aggregating specialist algorithm (WASA), and presents its theoretical bound. This algorithm has a flexible feature, which is to allow abandoning some expert advice according to pre-set rules. Based on this algorithm, a new online portfolio strategy named weak aggregating specialized CRP (WASC) is designed, which only aggregates awake specialized expert advice. Firstly, a pool of special constant rebalanced portfolios $$\text {CRP}({\textbf{b}})$$ CRP ( b ) strategies is employed to construct the index set of specialized experts. Secondly, a distance function is exploited to measure the distance between the current adjusted portfolio and each specialized expert advice, and the index set of awake specialized experts is constructed. Finally, the portfolio is updated by aggregating all awake specialized expert advice. Furthermore, theoretical and experimental analyses are established to illustrate the performance of the proposed strategy WASC. Theoretical results guarantee that WASC performs as well as the best specialized expert. Experimental results show that WASC outperforms some existing strategies in terms of the return and risk metrics, which illustrates its effectiveness in various real financial markets.

Suggested Citation

  • Jin’an He & Shicheng Yin & Fangping Peng, 2024. "Weak aggregating specialist algorithm for online portfolio selection," Computational Economics, Springer;Society for Computational Economics, vol. 63(6), pages 2405-2434, June.
    • Handle: RePEc:kap:compec:v:63:y:2024:i:6:d:10.1007_s10614-023-10411-5
    DOI: 10.1007/s10614-023-10411-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10614-023-10411-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10614-023-10411-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yong Zhang & Xingyu Yang & Weiguo Zhang & Weiwei Chen, 2020. "Online ordering rules for the multi-period newsvendor problem with quantity discounts," Annals of Operations Research, Springer, vol. 288(1), pages 495-524, May.
    2. Niels Wesselhöfft & Wolfgang K. Härdle, 2020. "Risk-Constrained Kelly Portfolios Under Alpha-Stable Laws," Computational Economics, Springer;Society for Computational Economics, vol. 55(3), pages 801-826, March.
    3. László Györfi & Gábor Lugosi & Frederic Udina, 2006. "Nonparametric Kernel‐Based Sequential Investment Strategies," Mathematical Finance, Wiley Blackwell, vol. 16(2), pages 337-357, April.
    4. Esther Mohr & Robert Dochow, 2017. "Risk management strategies for finding universal portfolios," Annals of Operations Research, Springer, vol. 256(1), pages 129-147, September.
    5. Sergio Albeverio & LanJun Lao & XueLei Zhao, 2001. "On-line portfolio selection strategy with prediction in the presence of transaction costs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 54(1), pages 133-161, October.
    6. Alexei Gaivoronski & Fabio Stella, 2000. "Stochastic Nonstationary Optimization for Finding Universal Portfolios," Annals of Operations Research, Springer, vol. 100(1), pages 165-188, December.
    7. E. Fagiuoli & F. Stella & A. Ventura, 2007. "Constant rebalanced portfolios and side-information," Quantitative Finance, Taylor & Francis Journals, vol. 7(2), pages 161-173.
    8. Elad Hazan & Satyen Kale, 2015. "An Online Portfolio Selection Algorithm With Regret Logarithmic In Price Variation," Mathematical Finance, Wiley Blackwell, vol. 25(2), pages 288-310, April.
    9. 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.
    10. Bin Li & Jialei Wang & Dingjiang Huang & Steven C. H. Hoi, 2018. "Transaction cost optimization for online portfolio selection," Quantitative Finance, Taylor & Francis Journals, vol. 18(8), pages 1411-1424, August.
    11. Patrick O'Sullivan & David Edelman, 2015. "Adaptive universal portfolios," The European Journal of Finance, Taylor & Francis Journals, vol. 21(4), pages 337-351, March.
    12. 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.
    13. 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.
    14. Györfi László & Udina Frederic & Walk Harro, 2008. "Nonparametric nearest neighbor based empirical portfolio selection strategies," Statistics & Risk Modeling, De Gruyter, vol. 26(2), pages 145-157, March.
    15. Paolo Guasoni & Marko Hans Weber, 2020. "Nonlinear price impact and portfolio choice," Mathematical Finance, Wiley Blackwell, vol. 30(2), pages 341-376, April.
    16. 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)

    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. 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.
    2. 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.
    3. Guo, Sini & Gu, Jia-Wen & Fok, Christopher H. & Ching, Wai-Ki, 2023. "Online portfolio selection with state-dependent price estimators and transaction costs," European Journal of Operational Research, Elsevier, vol. 311(1), pages 333-353.
    4. Guo, Sini & Gu, Jia-Wen & Ching, Wai-Ki, 2021. "Adaptive online portfolio selection with transaction costs," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1074-1086.
    5. Man Yiu Tsang & Tony Sit & Hoi Ying Wong, 2022. "Adaptive Robust Online Portfolio Selection," Papers 2206.01064, arXiv.org.
    6. Yong Zhang & Hong Lin & Lina Zheng & Xingyu Yang, 2022. "Adaptive online portfolio strategy based on exponential gradient updates," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 672-696, April.
    7. 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.
    8. Fereydooni, Ali & Barak, Sasan & Asaad Sajadi, Seyed Mehrzad, 2024. "A novel online portfolio selection approach based on pattern matching and ESG factors," Omega, Elsevier, vol. 123(C).
    9. James Chok & Geoffrey M. Vasil, 2023. "Convex optimization over a probability simplex," Papers 2305.09046, arXiv.org.
    10. 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.
    11. Ting-Kam Leonard Wong, 2015. "Universal portfolios in stochastic portfolio theory," Papers 1510.02808, arXiv.org, revised Dec 2016.
    12. 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.
    13. Shuo Sun & Rundong Wang & Bo An, 2021. "Reinforcement Learning for Quantitative Trading," Papers 2109.13851, arXiv.org.
    14. Esther Mohr & Robert Dochow, 2017. "Risk management strategies for finding universal portfolios," Annals of Operations Research, Springer, vol. 256(1), pages 129-147, September.
    15. J. D. M. Yamim & C. C. H. Borges & R. F. Neto, 2023. "Portfolio Optimization Via Online Gradient Descent and Risk Control," Computational Economics, Springer;Society for Computational Economics, vol. 62(1), pages 361-381, June.
    16. Vajda, István & Ottucsák, György, 2006. "Empirikus portfólióstratégiák [Empirical portfolio strategies]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(7), pages 624-640.
    17. Guy Uziel & Ran El-Yaniv, 2017. "Growth-Optimal Portfolio Selection under CVaR Constraints," Papers 1705.09800, arXiv.org.
    18. Bin Li & Steven C. H. Hoi, 2012. "Online Portfolio Selection: A Survey," Papers 1212.2129, arXiv.org, revised May 2013.
    19. Zhong, Yannan & Xu, Weijun & Li, Hongyi & Zhong, Weiwei, 2024. "Distributed mean reversion online portfolio strategy with stock network," European Journal of Operational Research, Elsevier, vol. 314(3), pages 1143-1158.
    20. Fabio Stella & Alfonso Ventura, 2011. "Defensive online portfolio selection," International Journal of Financial Markets and Derivatives, Inderscience Enterprises Ltd, vol. 2(1/2), pages 88-105.

    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:kap:compec:v:63:y:2024:i:6:d:10.1007_s10614-023-10411-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.