← Core Methods
Machine Learning › Core Methods ›

Matrix Factorization

383 directly classified papers

Papers per year

Papers

Generalized Nonconvex Nonsmooth Low-Rank Minimization CVPR 2014
Generalized Higher-Order Orthogonal Iteration for Tensor Decomposition and Completion NIPS 2014
Probabilistic low-rank matrix completion on finite alphabets NIPS 2014
Intersecting singularities for multi-structured estimation ICML 2013
Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization ICML 2013
A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion JMLR 2013
Learning Bilinear Model for Matching Queries and Documents JMLR 2013
Improving CUR Matrix Decomposition and the Nystrom Approximation via Adaptive Sampling JMLR 2013
Automatic Kronecker Product Model Based Detection of Repeated Patterns in 2D Urban Images ICCV 2013
Partial Sum Minimization of Singular Values in RPCA for Low-Level Vision ICCV 2013
Distributed Low-Rank Subspace Segmentation ICCV 2013
Unifying Nuclear Norm and Bilinear Factorization Approaches for Low-Rank Matrix Decomposition ICCV 2013
A Generalized Low-Rank Appearance Model for Spatio-temporally Correlated Rain Streaks ICCV 2013
Robust Matrix Factorization with Unknown Noise ICCV 2013
Convex Collective Matrix Factorization AISTATS 2013
Multi-target Tracking by Rank-1 Tensor Approximation CVPR 2013
Exact and Stable Recovery of Pairwise Interaction Tensors NIPS 2013
Excess risk bounds for multitask learning with trace norm regularization COLT 2013
Provable Subspace Clustering: When LRR meets SSC NIPS 2013
Speedup Matrix Completion with Side Information: Application to Multi-Label Learning NIPS 2013
A New Convex Relaxation for Tensor Completion NIPS 2013
Matrix Completion From any Given Set of Observations NIPS 2013
Near-Optimal Entrywise Sampling for Data Matrices NIPS 2013
Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion NIPS 2013
Learning Multi-level Sparse Representations NIPS 2013