IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-05125904.html
   My bibliography  Save this paper

Enhancing Long–Short Portfolios: A Refined Approach Using Learn-to-Rank Algorithms

Author

Listed:
  • Mathis Linger

    (LEO - Laboratoire d'Économie d'Orleans [2022-...] - UO - Université d'Orléans - UT - Université de Tours - UCA - Université Clermont Auvergne, Drakai Capital)

  • Thibaut Metz

    (Drakai Capital)

  • Khalil Sbai

    (Drakai Capital)

  • Guillaume Boulanger

    (Drakai Capital)

Abstract

This article delves into the challenges posed by ranking biases inherent to traditional learn-to-rank loss functions, particularly focusing on their impact on the construction of long–short portfolios. Through the analysis of synthetic data, the authors uncover inherent biases in these methods, particularly detrimental for long–short portfolios where equal importance lies with top- and bottom-ranked assets. To address these challenges, the authors propose enhanced versions of learn-to-rank loss functions—ListNet-Fold, ListMLE-weighted, and ListFold-weighted. These adaptations, tailored for long–short strategies, draw inspiration from pairwise approaches and adjust weighting mechanisms. Empirical results using a real-world dataset sourced from the China A-share market consistently reveal enhancements in ranking metrics, notably improving accuracy in ranking extreme assets, which are more traded in long–short portfolios. Furthermore, financial performance metrics validate the efficacy of these methods, demonstrating enhanced risk-adjusted returns, profitability, and robustness across varying numbers of assets included in the long–short strategy. This research offers valuable insights and practical remedies for mitigating biases in learn-to-rank algorithms, presenting promising tools for constructing long–short portfolios.

Suggested Citation

  • Mathis Linger & Thibaut Metz & Khalil Sbai & Guillaume Boulanger, 2025. "Enhancing Long–Short Portfolios: A Refined Approach Using Learn-to-Rank Algorithms," Post-Print hal-05125904, HAL.
  • Handle: RePEc:hal:journl:hal-05125904
    DOI: 10.3905/jfds.2024.1.173
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:hal:journl:hal-05125904. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.