Hierarchy-preserving regularization solution paths for identifying interactions in high dimensional data

Add to your list(s) Download to your calendar using vCal

• Helen Zhang (University of Arizona)
• Thursday 06 July 2017, 09:00-09:45
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact INI IT.

This talk has been canceled/deleted

Co-authors: Ning Hao (University of Arizona), Yang Feng (Columbia University)

Interaction screening for high-dimensional settings has recently drawn much attention in the literature. A variety of interaction screening approaches have been proposed for regression and classification problems. However, most of existing regularization methods for interaction selections are limited to low or moderate dimensional data analysis, due to their complex programing with inequality constraints and demanded prohibitive storage and computational cost when handling high dimensional data. This talk will present our recent work on scalable regularization methods to interaction selection under hierarchical constraints for high dimensional regression and classification. We first consider two-stage LASSO methods and establish their theoretical properties. Then a new regularization method, called Regularization Algorithm under Marginality Principle (RAMP), is developed to compute hierarchy-preserving regularization solution paths efficiently. In contrast to existing regular ization methods, the proposed methods avoid storing the entire design matrix and sidestep complex constraints and penalties, making them feasible to ultra-high dimensional data analysis. The new methods are further extended to handling binary responses. Extensive numerical results will be presented as well. 

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.