IDEAS home Printed from https://ideas.repec.org/a/taf/quantf/v21y2021i9p1437-1459.html
   My bibliography  Save this article

Active and passive portfolio management with latent factors

Author

Listed:
  • A. Al-Aradi
  • S. Jaimungal

Abstract

We address a portfolio selection problem that combines active (outperformance) and passive (tracking) objectives using techniques from convex analysis. We assume a general semimartingale market model where the assets' growth rate processes are driven by a latent factor. Using techniques from convex analysis we obtain a closed-form solution for the optimal portfolio and provide a theorem establishing its uniqueness. The motivation for incorporating latent factors is to achieve improved growth rate estimation, an otherwise notoriously difficult task. To this end, we focus on a model where growth rates are driven by an unobservable Markov chain. The solution in this case requires a filtering step to obtain posterior probabilities for the state of the Markov chain from asset price information, which are subsequently used to find the optimal allocation. We show the optimal strategy is the posterior average of the optimal strategies the investor would have held in each state assuming the Markov chain remains in that state. Finally, we implement a number of historical backtests to demonstrate the performance of the optimal portfolio.

Suggested Citation

  • A. Al-Aradi & S. Jaimungal, 2021. "Active and passive portfolio management with latent factors," Quantitative Finance, Taylor & Francis Journals, vol. 21(9), pages 1437-1459, September.
  • Handle: RePEc:taf:quantf:v:21:y:2021:i:9:p:1437-1459
    DOI: 10.1080/14697688.2021.1881598
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/14697688.2021.1881598
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/14697688.2021.1881598?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.

    Citations

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


    Cited by:

    1. Sebastian Jaimungal, 2022. "Reinforcement learning and stochastic optimisation," Finance and Stochastics, Springer, vol. 26(1), pages 103-129, January.
    2. van Staden, Pieter M. & Forsyth, Peter A. & Li, Yuying, 2024. "Across-time risk-aware strategies for outperforming a benchmark," European Journal of Operational Research, Elsevier, vol. 313(2), pages 776-800.

    More about this item

    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:taf:quantf:v:21:y:2021:i:9:p:1437-1459. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RQUF20 .

    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.