Vu thanh, Olivier ; Université de Mons - UMONS > Recherche > Service ERC Unit - Matrix Theory and Optimization
Gillis, Nicolas ; Université de Mons - UMONS > Faculté Polytechnique > Service de Mathématique et Recherche opérationnelle
Language :
English
Title :
Minimum-Volume Nonnegative Matrix Completion
Publication date :
August 2024
Event name :
European Signal Processing Conference
Event place :
Lyon, France
Event date :
26-30 août 2024
Audience :
International
Journal title :
European Signal Processing Conference
Peer review/Selection committee :
Peer reviewed
Research unit :
F151 - Mathématique et Recherche opérationnelle
Research institute :
R450 - Institut NUMEDIART pour les Technologies des Arts Numériques R300 - Institut de Recherche en Technologies de l'Information et Sciences de l'Informatique
European Projects :
HE - 101085607 - eLinoR - Beyond Low-Rank Factorizations
Y. Koren, R. Bell, and C. Volinsky, “Matrix factorization techniques for recommender systems,” Computer, vol. 42, no. 8, pp. 30–37, 2009.
E. J. Candes and Y. Plan, “Matrix completion with noise,” Proceedings of the IEEE, vol. 98, no. 6, pp. 925–936, 2010.
D. Gross, “Recovering low-rank matrices from few coefficients in any basis,” IEEE Transactions on Information Theory, vol. 57, no. 3, pp. 1548–1566, 2011.
E. Candes and B. Recht, “Exact matrix completion via convex optimization,” Communications of the ACM, vol. 55, no. 6, pp. 111–119, 2012.
M. Udell and A. Townsend, “Why are big data matrices approximately low rank?” SIAM Journal on Mathematics of Data Science, vol. 1, no. 1, pp. 144–160, 2019.
D. D. Lee and H. S. Seung, “Learning the parts of objects by nonnegative matrix factorization,” Nature, vol. 401, pp. 788–791, 1999.
V. Leplat, N. Gillis, and M. S. Ang, “Blind audio source separation with minimum-volume beta-divergence NMF,” IEEE Trans. Signal Process., vol. 68, pp. 3400–3410, 2020.
X. Fu, W.-K. Ma, K. Huang, and N. D. Sidiropoulos, “Blind separation of quasi-stationary sources: Exploiting convex geometry in covariance domain,” IEEE Trans. Signal Process., vol. 63 (9), pp. 2306–2320, 2015.
X. Fu, K. Huang, and N. D. Sidiropoulos, “On identifiability of nonnegative matrix factorization,” IEEE Signal Processing Letters, vol. 25, no. 3, pp. 328–332, 2018.
X. Fu, K. Huang, B. Yang, W.-K. Ma, and N. D. Sidiropoulos, “Robust volume minimization-based matrix factorization for remote sensing and document clustering,” IEEE Trans. Signal Process., vol. 64 (23), pp. 6254–6268, 2016.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review, vol. 52, no. 3, pp. 471–501, 2010.
N. Srebro, J. Rennie, and T. S. Jaakkola, “Maximum-margin matrix factorization,” in Advances in Neural Information Processing Systems (NIPS), 2005, pp. 1329–1336.
S. Rendle, W. Krichene, L. Zhang, and Y. Koren, “Revisiting the performance of ials on item recommendation benchmarks,” in Proceedings of the 16th ACM Conference on Recommender Systems, 2022, pp. 427–435.
G. Liu, Q. Liu, and X. Yuan, “A new theory for matrix completion,” in Advances in Neural Information Processing Systems, 2017.
V. Leplat, A. M. Ang, and N. Gillis, “Minimum-volume rank-deficient nonnegative matrix factorizations,” in IEEE Int. Conf. Acoust. Speech Signal Process. (ICASSP). IEEE, 2019, pp. 3402–3406.
O. Vu Thanh, A. Ang, N. Gillis et al., “Inertial majorization-minimization algorithm for minimum-volume nmf,” in European Signal Processing Conference (EUSIPCO), 2021, pp. 1065–1069.
L. Condat, “Fast projection onto the simplex and the l 1 ball,” Mathematical Programming, vol. 158, no. 1-2, pp. 575–585, 2016.
D. T. Nguyen and E. C. Chi, “Towards tuning-free minimum-volume nonnegative matrix factorization,” arXiv:2309.13733, 2023.
