IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v66y2025i3d10.1007_s10614-024-10770-7.html
   My bibliography  Save this article

Effective Convergence Trading of Sparse, Mean Reverting Portfolios

Author

Listed:
  • Attila Rácz

    (Budapest University of Technology and Economics)

  • Norbert Fogarasi

    (Budapest University of Technology and Economics)

Abstract

This paper introduces an effective convergence trading algorithm for mean reverting portfolios using Long Short Term Memory (LSTM) neural networks. Utilizing known techniques for selection of sparse, mean reverting portfolios from asset dynamics following the VAR(1) model, we introduce a 2-step technique to effectively trade the optimal portfolio. Sequence-to-sequence (Seq2Seq) LSTM architecture is implemented to make longer term prediction of future portfolio values and establish a trading range. In addition, a simple LSTM network is applied to predict very precisely one time step ahead. Combining these two constructions, a sophisticated convergence trading algorithm is implemented which produced Sharpe ratios around 1.0 on optimal portfolios selected from historical $$ S[NONSPACE] \& P500$$ S [ N O N S P A C E ] & P 500 stocks during $$2015-2022$$ 2015 - 2022 . This represents a very significant improvement compared to the previous convergence trading algorithms on the same set of portfolios by around $$141\%$$ 141 % on average.

Suggested Citation

  • Attila Rácz & Norbert Fogarasi, 2025. "Effective Convergence Trading of Sparse, Mean Reverting Portfolios," Computational Economics, Springer;Society for Computational Economics, vol. 66(3), pages 2367-2381, September.
    • Handle: RePEc:kap:compec:v:66:y:2025:i:3:d:10.1007_s10614-024-10770-7
    DOI: 10.1007/s10614-024-10770-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10614-024-10770-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10614-024-10770-7?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:kap:compec:v:66:y:2025:i:3:d:10.1007_s10614-024-10770-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.