TY - JOUR
T1 - High-dimensional interactions detection with sparse principal hessian matrix
AU - Tang, Cheng Yong
AU - Fang, Ethan X.
AU - Dong, Yuexiao
N1 - Funding Information:
We are grateful to the Editor, Action Editor and two reviewers for their helpful comments, which lead to a significant improvement of the earlier version of this paper. Tang is partially supported by NSF grant IIS-1546087 and ES-1533956. Fang is partially supported by NSF grant DMS 1820702.
Publisher Copyright:
© 2020 Cheng Yong Tang, Ethan X. Fang, and Yuexiao Dong. License: CC-BY 4.0, see https://creativecommons.org/licenses/by/4.0/. Attribution requirements are provided at http://jmlr.org/papers/v21/19-071.html.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - In statistical learning framework with regressions, interactions are the contributions to the response variable from the products of the explanatory variables. In high-dimensional problems, detecting interactions is challenging due to combinatorial complexity and limited data information. We consider detecting interactions by exploring their connections with the principal Hessian matrix. Specifically, we propose a one-step synthetic approach for estimating the principal Hessian matrix by a penalized M-estimator. An alternating direction method of multipliers (ADMM) is proposed to efficiently solve the encountered regularized optimization problem. Based on the sparse estimator, we detect the interactions by identifying its nonzero components. Our method directly targets at the interactions, and it requires no structural assumption on the hierarchy of the interactions effects. We show that our estimator is theoretically valid, computationally efficient, and practically useful for detecting the interactions in a broad spectrum of scenarios.
AB - In statistical learning framework with regressions, interactions are the contributions to the response variable from the products of the explanatory variables. In high-dimensional problems, detecting interactions is challenging due to combinatorial complexity and limited data information. We consider detecting interactions by exploring their connections with the principal Hessian matrix. Specifically, we propose a one-step synthetic approach for estimating the principal Hessian matrix by a penalized M-estimator. An alternating direction method of multipliers (ADMM) is proposed to efficiently solve the encountered regularized optimization problem. Based on the sparse estimator, we detect the interactions by identifying its nonzero components. Our method directly targets at the interactions, and it requires no structural assumption on the hierarchy of the interactions effects. We show that our estimator is theoretically valid, computationally efficient, and practically useful for detecting the interactions in a broad spectrum of scenarios.
UR - http://www.scopus.com/inward/record.url?scp=85086801869&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85086801869&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:85086801869
SN - 1532-4435
VL - 21
JO - Journal of Machine Learning Research
JF - Journal of Machine Learning Research
ER -