Pages that link to "Item:Q3179269"

The following pages link to Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization (Q3179269):

Displaying 19 items.

• Learning semidefinite regularizers (Q1740575) (← links)
• Combinatorial rigidity of incidence systems and application to dictionary learning (Q1745767) (← links)
• A geometric analysis of phase retrieval (Q1785008) (← links)
• Structured overcomplete sparsifying transform learning with convergence guarantees and applications (Q1799975) (← links)
• Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← links)
• Fast overcomplete dictionary construction with probabilistic guarantees (Q2198175) (← links)
• Compressed dictionary learning (Q2310825) (← links)
• Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods (Q2330648) (← links)
• Efficient Matrix Sensing Using Rank-1 Gaussian Measurements (Q2835614) (← links)
• (Q4558493) (← links)
• Accelerated Alternating Projections for Robust Principal Component Analysis (Q4633028) (← links)
• (Q4969112) (← links)
• Identifiability of Complete Dictionary Learning (Q5025788) (← links)
• $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials (Q5088657) (← links)
• (Q5149225) (← links)
• (Q5214233) (← links)
• The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems (Q5737722) (← links)
• Sharp global convergence guarantees for iterative nonconvex optimization with random data (Q6046308) (← links)
• A new complexity metric for nonconvex rank-one generalized matrix completion (Q6608034) (← links)