IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v457y2023ics0096300323003533.html
   My bibliography  Save this article

Bi-level algorithm for optimizing hyperparameters in penalized nonnegative matrix factorization

Author

Listed:
  • Del Buono, Nicoletta
  • Esposito, Flavia
  • Selicato, Laura
  • Zdunek, Rafał

Abstract

Learning approaches rely on hyperparameters that impact the algorithm’s performance and affect the knowledge extraction process from data. Recently, Nonnegative Matrix Factorization (NMF) has attracted a growing interest as a learning algorithm. This technique captures the latent information embedded in large datasets while preserving feature properties. NMF can be formalized as a penalized optimization task in which tuning the penalty hyperparameters is an open issue. The current literature does not provide any general framework addressing this task. This study proposes to express the penalty hyperparameters problem in NMF in terms of a bi-level optimization. We design a novel algorithm, named Alternating Bi-level (AltBi), which incorporates the hyperparameters tuning procedure into the updates of NMF factors. Results of the existence and convergence of numerical solutions, under appropriate assumptions, are studied, and numerical experiments are provided.

Suggested Citation

  • Del Buono, Nicoletta & Esposito, Flavia & Selicato, Laura & Zdunek, Rafał, 2023. "Bi-level algorithm for optimizing hyperparameters in penalized nonnegative matrix factorization," Applied Mathematics and Computation, Elsevier, vol. 457(C).
    • Handle: RePEc:eee:apmaco:v:457:y:2023:i:c:s0096300323003533
    DOI: 10.1016/j.amc.2023.128184
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323003533
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128184?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:eee:apmaco:v:457:y:2023:i:c:s0096300323003533. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.