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

Relative utility bounds for empirically optimal portfolios

Author

Listed:
  • Dmitry B. Rokhlin

Abstract

We consider a single-period portfolio selection problem for an investor, maximizing the expected ratio of the portfolio utility and the utility of a best asset taken in hindsight. The decision rules are based on the history of stock returns with unknown distribution. Assuming that the utility function is Lipschitz or H\"{o}lder continuous (the concavity is not required), we obtain high probability utility bounds under the sole assumption that the returns are independent and identically distributed. These bounds depend only on the utility function, the number of assets and the number of observations. For concave utilities similar bounds are obtained for the portfolios produced by the exponentiated gradient method. Also we use statistical experiments to study risk and generalization properties of empirically optimal portfolios. Herein we consider a model with one risky asset and a dataset, containing the stock prices from NYSE.

Suggested Citation

  • Dmitry B. Rokhlin, 2020. "Relative utility bounds for empirically optimal portfolios," Papers 2006.05204, arXiv.org.
    • Handle: RePEc:arx:papers:2006.05204
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Gotoh, Jun-ya & Takeda, Akiko, 2012. "Minimizing loss probability bounds for portfolio selection," European Journal of Operational Research, Elsevier, vol. 217(2), pages 371-380.
    2. Giorgio Consigli & Daniel Kuhn & Paolo Brandimarte, 2017. "Optimal Financial Decision Making Under Uncertainty," International Series in Operations Research & Management Science, in: Giorgio Consigli & Daniel Kuhn & Paolo Brandimarte (ed.), Optimal Financial Decision Making under Uncertainty, chapter 0, pages 255-290, Springer.
    3. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, March.
    4. Jun-ya Gotoh & Akiko Takeda, 2011. "On the role of norm constraints in portfolio selection," Computational Management Science, Springer, vol. 8(4), pages 323-353, November.
    5. James E. Smith & Robert L. Winkler, 2006. "The Optimizer's Curse: Skepticism and Postdecision Surprise in Decision Analysis," Management Science, INFORMS, vol. 52(3), pages 311-322, March.
    6. Sujin Kim & Raghu Pasupathy & Shane G. Henderson, 2015. "A Guide to Sample Average Approximation," International Series in Operations Research & Management Science, in: Michael C Fu (ed.), Handbook of Simulation Optimization, edition 127, chapter 0, pages 207-243, Springer.
    7. Victor DeMiguel & Lorenzo Garlappi & Francisco J. Nogales & Raman Uppal, 2009. "A Generalized Approach to Portfolio Optimization: Improving Performance by Constraining Portfolio Norms," Management Science, INFORMS, vol. 55(5), pages 798-812, May.
    8. Ghosal,Subhashis & van der Vaart,Aad, 2017. "Fundamentals of Nonparametric Bayesian Inference," Cambridge Books, Cambridge University Press, number 9780521878265.
    9. Gah-Yi Ban & Noureddine El Karoui & Andrew E. B. Lim, 2018. "Machine Learning and Portfolio Optimization," Management Science, INFORMS, vol. 64(3), pages 1136-1154, March.
    10. 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.
    11. 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. Dmitry B. Rokhlin, 2021. "Relative utility bounds for empirically optimal portfolios," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 437-462, June.
    2. Takano, Yuichi & Gotoh, Jun-ya, 2023. "Dynamic portfolio selection with linear control policies for coherent risk minimization," Operations Research Perspectives, Elsevier, vol. 10(C).
    3. Bernardo K. Pagnoncelli & Domingo Ramírez & Hamed Rahimian & Arturo Cifuentes, 2023. "A Synthetic Data-Plus-Features Driven Approach for Portfolio Optimization," Computational Economics, Springer;Society for Computational Economics, vol. 62(1), pages 187-204, June.
    4. Kobayashi, Ken & Takano, Yuichi & Nakata, Kazuhide, 2023. "Cardinality-constrained distributionally robust portfolio optimization," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1173-1182.
    5. Giovanni Bonaccolto & Massimiliano Caporin & Sandra Paterlini, 2018. "Asset allocation strategies based on penalized quantile regression," Computational Management Science, Springer, vol. 15(1), pages 1-32, January.
    6. Keliang Wang & Leonardo Lozano & Carlos Cardonha & David Bergman, 2023. "Optimizing over an Ensemble of Trained Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 652-674, May.
    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. Viet Anh Nguyen & Fan Zhang & Shanshan Wang & Jose Blanchet & Erick Delage & Yinyu Ye, 2021. "Robustifying Conditional Portfolio Decisions via Optimal Transport," Papers 2103.16451, arXiv.org, revised Apr 2024.
    9. Man Yiu Tsang & Tony Sit & Hoi Ying Wong, 2022. "Adaptive Robust Online Portfolio Selection," Papers 2206.01064, arXiv.org.
    10. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    11. Ken Kobayashi & Yuichi Takano & Kazuhide Nakata, 2021. "Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 493-528, October.
    12. Adam N. Elmachtoub & Paul Grigas, 2022. "Smart “Predict, then Optimize”," Management Science, INFORMS, vol. 68(1), pages 9-26, January.
    13. Christian Mandl & Selvaprabu Nadarajah & Stefan Minner & Srinagesh Gavirneni, 2022. "Data‐driven storage operations: Cross‐commodity backtest and structured policies," Production and Operations Management, Production and Operations Management Society, vol. 31(6), pages 2438-2456, June.
    14. R'emi J'ez'equel & Dmitrii M. Ostrovskii & Pierre Gaillard, 2022. "Efficient and Near-Optimal Online Portfolio Selection," Papers 2209.13932, arXiv.org.
    15. Yu Zheng & Timothy M. Hospedales & Yongxin Yang, 2018. "Diversity and Sparsity: A New Perspective on Index Tracking," Papers 1809.01989, arXiv.org, revised Feb 2020.
    16. Lioui, Abraham & Tarelli, Andrea, 2022. "Chasing the ESG factor," Journal of Banking & Finance, Elsevier, vol. 139(C).
    17. James Chok & Geoffrey M. Vasil, 2023. "Convex optimization over a probability simplex," Papers 2305.09046, arXiv.org.
    18. Theodoros Tsagaris & Ajay Jasra & Niall Adams, 2012. "Robust and adaptive algorithms for online portfolio selection," Quantitative Finance, Taylor & Francis Journals, vol. 12(11), pages 1651-1662, November.
    19. Bin Li & Steven C. H. Hoi, 2012. "On-Line Portfolio Selection with Moving Average Reversion," Papers 1206.4626, arXiv.org.
    20. 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.

    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:2006.05204. 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.