Showing cs.ITShow all
2 papers · 1 filter
cs.IT2025
Infinite families of graphs and stable completion of arbitrary matrices, Part I
Augustin Cosse
We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the c…
cs.IT2024
Sparse recovery from quadratic equations, part II: hardness and incoherence
Augustin Cosse
We study the square root bottleneck in the recovery of sparse vectors from quadratic equations. It is acknowledged that a sparse vector , $\| \mathbf…