IDEAS home Printed from https://ideas.repec.org/a/spr/qualqt/v58y2024i5d10.1007_s11135-024-01858-1.html
   My bibliography  Save this article

Learning fused lasso parameters in portfolio selection via neural networks

Author

Listed:
  • Stefania Corsaro

    (Parthenope University of Naples)

  • Valentina De Simone

    (University of Campania “Luigi Vanvitelli”)

  • Zelda Marino

    (Parthenope University of Naples)

  • Salvatore Scognamiglio

    (Parthenope University of Naples)

Abstract

In recent years, fused lasso models are becoming popular in several fields, such as computer vision, classification and finance. In portfolio selection, they can be used to penalize active positions and portfolio turnover. Despite efficient algorithms and software for solving non-smooth optimization problems have been developed, the amount of regularization to apply is a critical issue, especially if we have to achieve a financial aim. We propose a data-driven approach for learning the regularization parameters in a fused lasso formulation of the multi-period portfolio selection problem, able to realize a given financial target. We design a neural network architecture based on recurrent networks for learning the functional dependence between the regularization parameters and the input data. In particular, the Long Short-Term Memory networks are considered for their ability to process sequential data, such as the time series of the asset returns. Numerical experiments performed on market data show the effectiveness of our approach.

Suggested Citation

  • Stefania Corsaro & Valentina De Simone & Zelda Marino & Salvatore Scognamiglio, 2024. "Learning fused lasso parameters in portfolio selection via neural networks," Quality & Quantity: International Journal of Methodology, Springer, vol. 58(5), pages 4281-4299, October.
  • Handle: RePEc:spr:qualqt:v:58:y:2024:i:5:d:10.1007_s11135-024-01858-1
    DOI: 10.1007/s11135-024-01858-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11135-024-01858-1
    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/s11135-024-01858-1?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.

    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:spr:qualqt:v:58:y:2024:i:5:d:10.1007_s11135-024-01858-1. 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.