318 Hanes Hall, CB #3260 Chapel Hill, NC 27599-3260
919-962-1329
Loading Events

STOR Colloquium: Iain Carmichael, University of Washington-Seattle

September 20 @ 3:30 pm - 4:30 pm

Iain Carmichael
University of Washington

The folded concave Laplacian spectral penalty learns block diagonal sparsity patterns with the strong oracle property

Structured sparsity is an important part of the modern statistical toolkit. We say a set of model parameters has block diagonal sparsity up to permutations if its elements can be viewed as the edges of a graph that has multiple connected components. For example, a block diagonal correlation matrix with K blocks of variables corresponds to a graph with K connected components whose nodes are the variables and whose edges are the correlations. This type of sparsity captures clusters of model parameters. To learn block diagonal sparsity patterns we develop folded concave Laplacian spectral penalty and provide a majorization-minimization algorithm for the resulting non-convex problem. We show this algorithm has the appealing computational and statistical guarantee of converging to the oracle estimator after two steps with high probability, even in high-dimensional settings. The theory is then demonstrated in several classical problems including covariance estimation, linear regression, and logistic regression.

Share This Event

6062
DD
days
HH
hours
MM
min
SS
sec

Details

Date:
September 20
Time:
3:30 pm - 4:30 pm
Event Category:

Venue

120 Hanes Hall
204 East Cameron Ave
Chapel Hill, NC 27599 United States
+ Google Map