2013 Asilomar Conference on Signals, Systems and Computers 2013
DOI: 10.1109/acssc.2013.6810585
|View full text |Cite
|
Sign up to set email alerts
|

Identifiability bounds for bilinear inverse problems

Abstract: A number of important inverse problems in signal processing, including blind deconvolution, dictionary learning and matrix factorization, are instances of bilinear inverse problems. This paper shows that bilinear inverse problems are identifiable with probability close to one for random inputs provided that the number of rank-2 matrices in the null space grows as o(mn) for key applications.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 19 publications
(29 reference statements)
0
1
0
Order By: Relevance
“…Only when the above three conditions are satisfied, the problem is well-conditioned, otherwise, it is ill-conditioned [8].…”
Section: Analysis Of the Ill-condition Of Ect Inverse Problemsmentioning
confidence: 99%
“…Only when the above three conditions are satisfied, the problem is well-conditioned, otherwise, it is ill-conditioned [8].…”
Section: Analysis Of the Ill-condition Of Ect Inverse Problemsmentioning
confidence: 99%