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

Constructing long-short stock portfolio with a new listwise learn-to-rank algorithm

Author

Listed:
  • Xin Zhang
  • Lan Wu
  • Zhixue Chen

Abstract

Factor strategies have gained growing popularity in industry with the fast development of machine learning. Usually, multi-factors are fed to an algorithm for some cross-sectional return predictions, which are then further used to construct a long-short portfolio. Instead of predicting the value of the stock return, emerging studies predict a ranked stock list using the mature learn-to-rank technology. In this study, we propose a new listwise learn-to-rank loss function which aims to emphasize both the top and the bottom of a rank list. Our loss function, motivated by the long-short strategy, is endogenously shift-invariant and can be viewed as a direct generalization of ListMLE. Under different transformation functions, our loss can lead to consistency with binary classification loss or permutation level 0-1 loss. A probabilistic explanation for our model is also given as a generalized Plackett-Luce model. Based on a dataset of 68 factors in the China A-share market from 2006 to 2019, our empirical study has demonstrated the strength of our method which achieves an out-of-sample annual return of 38% with Sharpe ratio 2.

Suggested Citation

  • Xin Zhang & Lan Wu & Zhixue Chen, 2022. "Constructing long-short stock portfolio with a new listwise learn-to-rank algorithm," Quantitative Finance, Taylor & Francis Journals, vol. 22(2), pages 321-331, February.
  • Handle: RePEc:taf:quantf:v:22:y:2022:i:2:p:321-331
    DOI: 10.1080/14697688.2021.1939117
    as

    Download full text from publisher

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

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

    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:22:y:2022:i:2:p:321-331. 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.