Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (Q5230407): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q129143393, #quickstatements; #temporary_batch_1723945101418
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: WSABIE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ADMiRA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1606.03168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The learnability of quantum states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Implicitly Restarted Lanczos Bidiagonalization Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical guarantees for the EM algorithm: from population to sample-based analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: NESTA: A Fast and Accurate First-Order Method for Sparse Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Templates for convex cone problems with applications to sparse signal recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local minima and convergence in low-rank semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Retrieval via Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Approximate Matrix Product in Terms of Stable Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Bit matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Algorithms with Orthogonality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-rank matrix completion using alternating minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Optimization on the Cone of Positive Semidefinite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Desingularization of Bounded-Rank Matrix Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-rank tensor completion by Riemannian optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix recipes for hard thresholding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADMiRA: Atomic Decomposition for Minimum Rank Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: ARPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Framework for kernel regularization with application to protein clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-rank matrix factorizations and Riemannian low-rank optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted strong convexity and weighted matrix completion: Optimal bounds with noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalized Iterative Hard Thresholding for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Principal Component Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase recovery, MaxCut and complex semidefinite programming / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129143393 / rank
 
Normal rank

Latest revision as of 02:58, 18 August 2024

scientific article; zbMATH DE number 7097240
Language Label Description Also known as
English
Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
scientific article; zbMATH DE number 7097240

    Statements

    Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 August 2019
    0 references
    nonconvex optimization
    0 references
    matrix factorization
    0 references
    low-rank minimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references