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

Competitive Online Strategy Based on Improved Exponential Gradient Expert and Aggregating Method

Author

Listed:
  • Yong Zhang

    (Guangdong University of Technology)

  • Jiahao Li

    (Guangdong University of Technology)

  • Xingyu Yang

    (Guangdong University of Technology)

  • Jianliang Zhang

    (Guangdong University of Technology)

Abstract

In recent years, online portfolio selection (OLPS) has received more and more attention from quantitative investment and artificial intelligence communities. This paper first improves a classic OLPS strategy Exponential Gradient (EG) (Helmbold in MF 8:325–347, 1998) by fully exploiting multi-period price information via the $$L_{1}$$ L 1 -median estimator, and further designs a novel strategy named Aggregating Improved Exponential Gradient (AIEG) by using Weak Aggregating Algorithm (WAA) to aggregate an infinite number of Improved EG (IEG) expert advice. The universality of the proposed strategy is proved. This paper empirically evaluates the proposed strategy through a wide range of experiments. Promising empirical results verify that the proposed AIEG strategy performs well in terms of different aspects and can resist reasonable transaction costs.

Suggested Citation

  • Yong Zhang & Jiahao Li & Xingyu Yang & Jianliang Zhang, 2024. "Competitive Online Strategy Based on Improved Exponential Gradient Expert and Aggregating Method," Computational Economics, Springer;Society for Computational Economics, vol. 64(2), pages 789-814, August.
    • Handle: RePEc:kap:compec:v:64:y:2024:i:2:d:10.1007_s10614-023-10430-2
    DOI: 10.1007/s10614-023-10430-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10614-023-10430-2
    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-10430-2?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. Suleyman Basak & Georgy Chabakauri, 2010. "Dynamic Mean-Variance Asset Allocation," The Review of Financial Studies, Society for Financial Studies, vol. 23(8), pages 2970-3016, August.
    2. Patrick O'Sullivan & David Edelman, 2015. "Adaptive universal portfolios," The European Journal of Finance, Taylor & Francis Journals, vol. 21(4), pages 337-351, March.
    3. 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.
    4. 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.
    5. Xingyu Yang & Jin'an He & Yong Zhang, 2022. "Aggregating exponential gradient expert advice for online portfolio selection," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(3), pages 587-597, March.
    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. 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.
    8. 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. Jin’an He & Fangping Peng & Xiuying Xie, 2024. "Risk-adjusted exponential gradient strategies for online portfolio selection," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-25, August.
    2. 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.
    3. 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.
    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. MohammadAmin Fazli & Mahdi Lashkari & Hamed Taherkhani & Jafar Habibi, 2022. "A Novel Experts Advice Aggregation Framework Using Deep Reinforcement Learning for Portfolio Management," Papers 2212.14477, 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. 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).
    8. James Chok & Geoffrey M. Vasil, 2023. "Convex optimization over a probability simplex," Papers 2305.09046, arXiv.org.
    9. 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.
    10. 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.
    11. Shuo Sun & Rundong Wang & Bo An, 2021. "Reinforcement Learning for Quantitative Trading," Papers 2109.13851, arXiv.org.
    12. James DiLellio, 2015. "A Kalman filter control technique in mean-variance portfolio management," Journal of Economics and Finance, Springer;Academy of Economics and Finance, vol. 39(2), pages 235-261, April.
    13. 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.
    14. Yong Zhang & Jingting Wu & Wenxiong Lin & Muyu Hou, 2022. "Competitive analysis for two-option online leasing problem under sharing economy," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 670-689, August.
    15. 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.
    16. 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.
    17. Gaivoronski, Alexei A. & Stella, Fabio, 2003. "On-line portfolio selection using stochastic programming," Journal of Economic Dynamics and Control, Elsevier, vol. 27(6), pages 1013-1043, April.
    18. Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October.
    19. Xiang Meng, 2019. "Dynamic Mean-Variance Portfolio Optimisation," Papers 1907.03093, arXiv.org.
    20. Luca De Gennaro Aquino & Sascha Desmettre & Yevhen Havrylenko & Mogens Steffensen, 2024. "Equilibrium control theory for Kihlstrom-Mirman preferences in continuous time," Papers 2407.16525, arXiv.org, revised Oct 2024.

    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:64:y:2024:i:2:d:10.1007_s10614-023-10430-2. 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.