event

ARC Colloquium: Tong Zhang, Rutgers University

Primary tabs

Abstract:

I will talk about recovery results for some sparsity related regularization problems under stochastic noise.

First, I will discuss standard sparsity, and focus on results under different conditions for relaxation methods (including Lasso) versus greedy algorithms (including orthogonal matching pursuit). 

Second, I will discuss results for more complexity vector regularization formulations with structured sparsity.
Third, I will present some recent results for mixed sparsity and low-rank matrix regularization.

Groups

Status

  • Workflow Status:Published
  • Created By:Elizabeth Ndongi
  • Created:11/16/2011
  • Modified By:Fletcher Moore
  • Modified:10/07/2016

Keywords

  • No keywords were submitted.