No article text was recorded for this version.
low-rank matrix factorization
Version 2 of 2293 papers349 conceptsfrozen 2026-10-04
Papers in this version
- Blog: An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity
- Blog: Smoothed analysis of the low-rank approach for smooth semidefinite programs
- Blog: Dropping Convexity for Faster Semi-definite Optimization
- Blog: Efficient Low Rank Convex Bounds for Pairwise Discrete Graphical Models
- Blog: Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming
- Blog: Improved Global Guarantees for the Nonconvex Burer-Monteiro Factorization via Rank Overparameterization
- Blog: Faster Algorithms for Binary Matrix Factorization
- Blog: A Hybrid Algorithm for Convex Semidefinite Optimization
- Blog: A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion
- Blog: Distributed Synchronous and Asynchronous Algorithms for Semidefinite Programming With Diagonal Constraints
- Blog: Factorization Approach to Structured Low-Rank Approximation with Applications
- Blog: Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form
- Blog: Rank Optimality for the Burer-Monteiro Factorization
- Blog: Scalable Semidefinite Relaxation for Maximum A Posterior Estimation
- Blog: Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
- Blog: A Fast Factorization-Based Approach to Robust PCA
- Blog: An Efficient Dataset Condensation Plugin and Its Application to Continual Learning
- Blog: Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization
- Blog: Dropping Convexity for Faster Semi-definite Optimization
- Blog: A Conditional Gradient-Based Augmented Lagrangian Framework
- Blog: Statistically Optimal $K$-means Clustering via Nonnegative Low-rank Semidefinite Programming
- Blog: ALPCAH: Subspace Learning for Sample-Wise Heteroscedastic Data
- Blog: Smoothed analysis of the low-rank approach for smooth semidefinite programs
- Blog: Scalable Large-Margin Mahalanobis Distance Metric Learning
- Blog: Social Recommendation Using Low-Rank Semidefinite Program
- Blog: Inference in Graphical Models via Semidefinite Programming Hierarchies
- Blog: A Decomposition Augmented Lagrangian Method for Low-rank Semidefinite Programming
- Blog: Low-Rank Riemannian Optimization on Positive Semidefinite Stochastic Matrices with Applications to Graph Clustering
- Blog: Bilinear Factorization For Low-Rank SDP Learning
- Blog: Learning Structured Low-Rank Representation via Matrix Factorization
- Blog: A Unified Convex Surrogate for the Schatten-p Norm
- Blog: Efficient SDP inference for fully-connected CRFs based on low-rank decomposition
- Blog: A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
- Blog: Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization
- Blog: Likelihood Adjusted Semidefinite Programs for Clustering Heterogeneous Data
- Blog: Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
- Blog: Robust Learning from Noisy Side-information by Semidefinite Programming
- Blog: Multi-Image Matching via Fast Alternating Minimization
- Blog: Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
- Blog: Structured Low-Rank Matrix Factorization with Missing and Grossly Corrupted Observations
- Blog: Low-Rank Modeling and Its Applications in Image Analysis
- Blog: Harnessing Structures in Big Data via Guaranteed Low-Rank Matrix Estimation
- Blog: Provable non-convex projected gradient descent for a class of constrained matrix optimization problems
- Blog: Biconvex Relaxation for Semidefinite Programming in Computer Vision
- Blog: Fast Low-Rank Semidefinite Programming for Embedding and Clustering
- Blog: The Mixing method: coordinate descent for low-rank semidefinite programming
- Blog: Fast Graph Laplacian Regularized Kernel Learning via Semidefinite-Quadratic-Linear Programming
- Blog: Unified Scalable Equivalent Formulations for Schatten Quasi-Norms
- Blog: Low-Rank Tensor Thresholding Ridge Regression
- Blog: Fast Nonconvex SDP Solvers for Large-scale Power System State Estimation
- Blog: Conic Descent Redux for Memory-Efficient Optimization
- Blog: Scalable Attributed-Graph Subspace Clustering
- Blog: Efficient Stochastic Optimization for Low-Rank Distance Metric Learning
- Blog: Inference in Graphical Models via Semidefinite Programming Hierarchies
- Blog: Single-Pass PCA of Large High-Dimensional Data
- Blog: Deep Learning of Graph Matching
- Blog: Efficient Structured Matrix Rank Minimization
- Blog: Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations
- Blog: Provable compressed sensing quantum state tomography via non-convex methods
- Blog: Adversarial robustness via robust low rank representations
Showing 60 of 293 papers.
History & citation
Current · Permanent link
- spurious local minima (non-convex optimization traps) split from this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_low_rank_matrix_factorization_b6889bc4,
title = {low-rank matrix factorization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/low-rank-matrix-factorization/rdr_b6889bc46a474360bbf3229bbd52e0d6},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_low_rank_matrix_factorization_b6889bc4_v2,
title = {low-rank matrix factorization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/low-rank-matrix-factorization/rdr_b6889bc46a474360bbf3229bbd52e0d6/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}