Matrix Factorization
Overview
Matrix factorization studies how to represent a matrix as products of smaller factors, revealing latent structure while reducing storage or supporting inference from missing and noisy entries. Core families include low-rank matrix completion and sensing, nonnegative and Boolean factorization, tensor and other structured decompositions, and latent-factor models; methods use alternating least squares, projected or manifold optimization, Bayesian inference, and spectral initialization. Applications range from recommendation and single-cell or connectome analysis to image recognition, categorical data completion, and compressing language-model and mixture-of-experts weights. A central challenge is balancing rank and sparsity assumptions, interpretability and robustness, and optimization speed against fidelity, while ensuring that the chosen structure and optimizer recover useful, stable factors.
Latest papers
58 papers5 papers in the last four weeks, down 17% on the four weeks before. 0.0% of all new papers.