ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1908.10776
  4. Cited By
A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind
  Deconvolution
v1v2v3 (latest)

A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution

Neural Information Processing Systems (NeurIPS), 2019
28 August 2019
Qing Qu
Xiao Li
Zhihui Zhu
ArXiv (abs)PDFHTML

Papers citing "A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution"

17 / 17 papers shown
Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings
Evan Markou
Thalaiyasingam Ajanthan
Stephen Gould
360
0
0
10 Jun 2025
The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing
The Power of Preconditioning in Overparameterized Low-Rank Matrix SensingInternational Conference on Machine Learning (ICML), 2023
Xingyu Xu
Yandi Shen
Yuejie Chi
Cong Ma
575
47
0
02 Feb 2023
Resource-Efficient Invariant Networks: Exponential Gains by Unrolled
  Optimization
Resource-Efficient Invariant Networks: Exponential Gains by Unrolled Optimization
Sam Buchanan
Jingkai Yan
Ellie Haber
John N. Wright
230
3
0
09 Mar 2022
Efficient Sparse Coding using Hierarchical Riemannian Pursuit
Efficient Sparse Coding using Hierarchical Riemannian PursuitIEEE Transactions on Signal Processing (IEEE TSP), 2021
Ye Xue
Vincent K. N. Lau
Songfu Cai
413
4
0
21 Apr 2021
Convolutional Normalization: Improving Deep Convolutional Network
  Robustness and Training
Convolutional Normalization: Improving Deep Convolutional Network Robustness and TrainingNeural Information Processing Systems (NeurIPS), 2021
Sheng Liu
Xiao Li
Yuexiang Zhai
Chong You
Zhihui Zhu
C. Fernandez‐Granda
Qing Qu
235
28
0
01 Mar 2021
Stochastic Approximation for Online Tensorial Independent Component
  Analysis
Stochastic Approximation for Online Tensorial Independent Component AnalysisAnnual Conference Computational Learning Theory (COLT), 2020
C. J. Li
Sai Li
300
3
0
28 Dec 2020
Recent Theoretical Advances in Non-Convex Optimization
Recent Theoretical Advances in Non-Convex Optimization
Marina Danilova
Pavel Dvurechensky
Alexander Gasnikov
Eduard A. Gorbunov
Sergey Guminov
Dmitry Kamzolov
Innokentiy Shibaev
433
111
0
11 Dec 2020
Deep Networks from the Principle of Rate Reduction
Deep Networks from the Principle of Rate Reduction
Kwan Ho Ryan Chan
Yaodong Yu
Chong You
Haozhi Qi
John N. Wright
Yi-An Ma
231
22
0
27 Oct 2020
Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy
  Blind Deconvolution under Random Designs
Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution under Random Designs
Yuxin Chen
Jianqing Fan
B. Wang
Yuling Yan
449
17
0
04 Aug 2020
From Symmetry to Geometry: Tractable Nonconvex Problems
From Symmetry to Geometry: Tractable Nonconvex Problems
Yuqian Zhang
Qing Qu
John N. Wright
416
48
0
14 Jul 2020
Complete Dictionary Learning via $\ell_p$-norm Maximization
Complete Dictionary Learning via ℓp\ell_pℓp​-norm MaximizationConference on Uncertainty in Artificial Intelligence (UAI), 2020
Yifei Shen
Ye Xue
Jun Zhang
Khaled B. Letaief
Vincent K. N. Lau
299
17
0
24 Feb 2020
Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and
  Applications
Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications
Qing Qu
Zhihui Zhu
Xiao Li
M. Tsakiris
John N. Wright
René Vidal
188
23
0
20 Jan 2020
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
272
10
0
05 Dec 2019
Manifold Gradient Descent Solves Multi-Channel Sparse Blind
  Deconvolution Provably and Efficiently
Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and EfficientlyIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2019
Laixi Shi
Yuejie Chi
476
26
0
25 Nov 2019
Weakly Convex Optimization over Stiefel Manifold Using Riemannian
  Subgradient-Type Methods
Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods
Xiao Li
Shixiang Chen
Zengde Deng
Qing Qu
Zhihui Zhu
Anthony Man-Cho So
549
15
0
12 Nov 2019
Short-and-Sparse Deconvolution -- A Geometric Approach
Short-and-Sparse Deconvolution -- A Geometric ApproachInternational Conference on Learning Representations (ICLR), 2019
Yenson Lau
Qing Qu
Han-Wen Kuo
Pengcheng Zhou
Yuqian Zhang
John N. Wright
227
30
0
28 Aug 2019
Convolutional Phase Retrieval via Gradient Descent
Convolutional Phase Retrieval via Gradient Descent
Qing Qu
Yuqian Zhang
Yonina C. Eldar
John N. Wright
295
31
0
03 Dec 2017
1
Page 1 of 1