IDEAS home Printed from https://ideas.repec.org/a/bla/istatr/v88y2020i1p29-53.html
   My bibliography  Save this article

A Unifying Framework and Comparison of Algorithms for Non‐negative Matrix Factorisation

Author

Listed:
  • Asger Hobolth
  • Qianyun Guo
  • Astrid Kousholt
  • Jens Ledet Jensen

Abstract

Non‐negative matrix factorisation (NMF) is an increasingly popular unsupervised learning method. However, parameter estimation in the NMF model is a difficult high‐dimensional optimisation problem. We consider algorithms of the alternating least squares type. Solutions to the least squares problem fall in two categories. The first category is iterative algorithms, which include algorithms such as the majorise–minimise (MM) algorithm, coordinate descent, gradient descent and the Févotte‐Cemgil expectation–maximisation (FC‐EM) algorithm. We introduce a new family of iterative updates based on a generalisation of the FC‐EM algorithm. The coordinate descent, gradient descent and FC‐EM algorithms are special cases of this new EM family of iterative procedures. Curiously, we show that the MM algorithm is never a member of our general EM algorithm. The second category is based on cone projection. We describe and prove a cone projection algorithm tailored to the non‐negative least square problem. We compare the algorithms on a test case and on the problem of identifying mutational signatures in human cancer. We generally find that cone projection is an attractive choice. Furthermore, in the cancer application, we find that a mix‐and‐match strategy performs better than running each algorithm in isolation.

Suggested Citation

  • Asger Hobolth & Qianyun Guo & Astrid Kousholt & Jens Ledet Jensen, 2020. "A Unifying Framework and Comparison of Algorithms for Non‐negative Matrix Factorisation," International Statistical Review, International Statistical Institute, vol. 88(1), pages 29-53, April.
    • Handle: RePEc:bla:istatr:v:88:y:2020:i:1:p:29-53
    DOI: 10.1111/insr.12331
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/insr.12331
    Download Restriction: no
    File URL: https://libkey.io/10.1111/insr.12331?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
    ---><---

    References listed on IDEAS

    as
    1. Hunter D.R. & Lange K., 2004. "A Tutorial on MM Algorithms," The American Statistician, American Statistical Association, vol. 58, pages 30-37, February.
    2. Ravi Varadhan & Christophe Roland, 2008. "Simple and Globally Convergent Methods for Accelerating the Convergence of Any EM Algorithm," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 35(2), pages 335-353, June.
    3. Kenneth Lange & Eric C. Chi & Hua Zhou, 2014. "A Brief Survey of Modern Optimization for Statisticians," International Statistical Review, International Statistical Institute, vol. 82(1), pages 46-70, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xifen Huang & Jinfeng Xu & Yunpeng Zhou, 2022. "Profile and Non-Profile MM Modeling of Cluster Failure Time and Analysis of ADNI Data," Mathematics, MDPI, vol. 10(4), pages 1-21, February.
    2. Tian, Guo-Liang & Tang, Man-Lai & Liu, Chunling, 2012. "Accelerating the quadratic lower-bound algorithm via optimizing the shrinkage parameter," Computational Statistics & Data Analysis, Elsevier, vol. 56(2), pages 255-265.
    3. Yoshihiro Kanno, 2018. "Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach," Computational Optimization and Applications, Springer, vol. 71(2), pages 403-433, November.
    4. Allassonnière, Stéphanie & Chevallier, Juliette, 2021. "A new class of stochastic EM algorithms. Escaping local maxima and handling intractable sampling," Computational Statistics & Data Analysis, Elsevier, vol. 159(C).
    5. de Leeuw, Jan & Lange, Kenneth, 2009. "Sharp quadratic majorization in one dimension," Computational Statistics & Data Analysis, Elsevier, vol. 53(7), pages 2471-2484, May.
    6. Greg Lewis & Bora Ozaltun & Georgios Zervas, 2021. "Maximum Likelihood Estimation of Differentiated Products Demand Systems," Papers 2111.12397, arXiv.org.
    7. Rasmus Lentz & Jean Marc Robin & Suphanit Piyapromdee, 2018. "On Worker and Firm Heterogeneity in Wages and Employment Mobility: Evidence from Danish Register Data," 2018 Meeting Papers 469, Society for Economic Dynamics.
    8. Deng, Lifeng & Ding, Jieli & Liu, Yanyan & Wei, Chengdong, 2018. "Regression analysis for the proportional hazards model with parameter constraints under case-cohort design," Computational Statistics & Data Analysis, Elsevier, vol. 117(C), pages 194-206.
    9. Jurgen A. Doornik, 2018. "Accelerated Estimation of Switching Algorithms: The Cointegrated VAR Model and Other Applications," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 45(2), pages 283-300, June.
    10. Zhou, Wei & Zhong, Guang-Yan & Li, Jiang-Cheng, 2022. "Stability of financial market driven by information delay and liquidity in delay agent-based model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    11. Yue, Chen & Chen, Shaojie & Sair, Haris I. & Airan, Raag & Caffo, Brian S., 2015. "Estimating a graphical intra-class correlation coefficient (GICC) using multivariate probit-linear mixed models," Computational Statistics & Data Analysis, Elsevier, vol. 89(C), pages 126-133.
    12. Stéphane Chrétien & Alfred Hero & Hervé Perdry, 2012. "Space alternating penalized Kullback proximal point algorithms for maximizing likelihood with nondifferentiable penalty," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 64(4), pages 791-809, August.
    13. Robin, Stéphane & Scrucca, Luca, 2023. "Mixture-based estimation of entropy," Computational Statistics & Data Analysis, Elsevier, vol. 177(C).
    14. Green, Beth L. & Ayoub, Catherine & Bartlett, Jessica Dym & Von Ende, Adam & Furrer, Carrie & Chazan-Cohen, Rachel & Vallotton, Claire & Klevens, Joanne, 2014. "The effect of Early Head Start on child welfare system involvement: A first look at longitudinal child maltreatment outcomes," Children and Youth Services Review, Elsevier, vol. 42(C), pages 127-135.
    15. Brett Hollenbeck & Kosuke Uetake, 2021. "Taxation and market power in the legal marijuana industry," RAND Journal of Economics, RAND Corporation, vol. 52(3), pages 559-595, September.
    16. Xiaotian Zhu & David R. Hunter, 2019. "Clustering via finite nonparametric ICA mixture models," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 13(1), pages 65-87, March.
    17. Matthew Pietrosanu & Jueyu Gao & Linglong Kong & Bei Jiang & Di Niu, 2021. "Advanced algorithms for penalized quantile and composite quantile regression," Computational Statistics, Springer, vol. 36(1), pages 333-346, March.
    18. Rasmus Lentz & Suphanit Piyapromdee & Jean-Marc Robin, 2022. "The Anatomy of Sorting - Evidence from Danish Data," Working Papers hal-03869383, HAL.
    19. Takeshi Fukasawa, 2024. "Fast and simple inner-loop algorithms of static / dynamic BLP estimations," Papers 2404.04494, arXiv.org.
    20. Nguyen Thai An & Daniel Giles & Nguyen Mau Nam & R. Blake Rector, 2016. "The Log-Exponential Smoothing Technique and Nesterov’s Accelerated Gradient Method for Generalized Sylvester Problems," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 559-583, February.

    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:bla:istatr:v:88:y:2020:i:1:p:29-53. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/isiiinl.html .

    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.