Skip to main content

Two Algorithms with Logarithmic Regret for Online Portfolio Selection

  • Conference paper
  • First Online:
Proceedings of the Fifth Euro-China Conference on Intelligent Data Analysis and Applications (ECC 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 891))

  • 734 Accesses

Abstract

In online portfolio selection, an online investor needs to distribute her wealth iteratively and hopes to maximize her final wealth. To model the behavior of the prices of assets in a financial market, we consider two measures of the price relative vectors: quadratic variability and deviation. There exist algorithms which achieve good performance in terms of these two measures. However, the theoretical guarantees depend on an additional parameter, which may not be available before the investor chooses her strategies. In this paper, the performances of the algorithms are tested using real stock market data to understand the influence of this additional parameter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agarwal, A., Hazan, E., Kale, S., Schapire, R.E.: Algorithms for portfolio management based on the Newton method. In: ICML, pp. 9–16 (2006)

    Google Scholar 

  2. Chiang, C.K., Yang, T., Lee, C.J., Mahdavi, M., Lu, C.J., Jin, R., Zhu, S.: Online optimization with gradual variations. J. Mach. Learn. Res. Proceedings Track 23, 6.1–6.20 (2012)

    Google Scholar 

  3. Cover, T.: Universal portfolios. Math. Financ. 1, 1–19 (1991)

    Article  MathSciNet  Google Scholar 

  4. Das, P., Banerjee, A.: Meta optimization and its application to portfolio selection. In: Proceedings of International Conference on Knowledge Discovery and Data Mining (2011)

    Google Scholar 

  5. Hazan, E., Kale, S.: An online portfolio selection algorithm with regret logarithmic in price variation. Math. Financ. 25(2), 288–310 (2015)

    Article  MathSciNet  Google Scholar 

  6. Helmbold, D.P., Schapire, R.E., Singer, Y., Warmuth, M.K.: On-line portfolio selection using multiplicative updates. In: ICML, pp. 243–251 (1996)

    Google Scholar 

  7. Li, B., Hoi, S.C.H.: Online portfolio selection: a survey. ACM Comput. Surv. 46(3), 35 (2014)

    MATH  Google Scholar 

  8. Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: ICML, pp. 928–936 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chia-Jung Lee .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lee, CJ. (2019). Two Algorithms with Logarithmic Regret for Online Portfolio Selection. In: Krömer, P., Zhang, H., Liang, Y., Pan, JS. (eds) Proceedings of the Fifth Euro-China Conference on Intelligent Data Analysis and Applications. ECC 2018. Advances in Intelligent Systems and Computing, vol 891. Springer, Cham. https://doi.org/10.1007/978-3-030-03766-6_45

Download citation

Publish with us

Policies and ethics