ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1911.11167
  4. Cited By
Manifold Gradient Descent Solves Multi-Channel Sparse Blind
  Deconvolution Provably and Efficiently

Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently

25 November 2019
Laixi Shi
Yuejie Chi
ArXivPDFHTML

Papers citing "Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently"

4 / 4 papers shown
Title
Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled
  Gradient Descent, Even with Overparameterization
Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization
Cong Ma
Xingyu Xu
Tian Tong
Yuejie Chi
16
9
0
09 Oct 2023
Unique sparse decomposition of low rank matrices
Unique sparse decomposition of low rank matrices
Dian Jin
Xin Bing
Yuqian Zhang
12
4
0
14 Jun 2021
Efficient Sparse Coding using Hierarchical Riemannian Pursuit
Efficient Sparse Coding using Hierarchical Riemannian Pursuit
Ye Xue
Vincent K. N. Lau
Songfu Cai
23
3
0
21 Apr 2021
Analysis of the Optimization Landscapes for Overcomplete Representation
  Learning
Analysis of the Optimization Landscapes for Overcomplete Representation Learning
Qing Qu
Yuexiang Zhai
Xiao Li
Yuqian Zhang
Zhihui Zhu
18
9
0
05 Dec 2019
1