Systems | Information | Learning | Optimization
 

An optimal architecture for poset-causal systems | Computable Bounds on Sparsity Recovery

Gongguo’s talk: Title: Computable Bounds on Sparsity Recovery Abstract: The performance of sparsity recovery depends on the structures of the sensing matrices. The quality of these matrices in the context of signal recovery is usually quantified by the restricted isometry constant and its variants. However, the restricted isometry constant and …