Online Program Home
My Program

Abstract Details

Activity Number: 294
Type: Topic Contributed
Date/Time: Tuesday, August 2, 2016 : 8:30 AM to 10:20 AM
Sponsor: Section on Statistical Computing
Abstract #320163
Title: Tuning-free heterogeneity pursuit in massive networks
Author(s): Zhao Ren* and Yongjian Kang and Yingying Fan and Jinchi Lv
Companies: University of Pittsburgh and University of Southern California and University of Southern California and University of Southern California
Keywords: Inference ; Group Lasso ; Tuning-free ; Sparsity ; High-dimensional ; Optimality
Abstract:

Heterogeneity is often natural in many contemporary applications involving massive data. It can play a crucial role in powering scientific discoveries through the understanding of differences among sub-populations of interest. In this talk, we exploit multiple networks with Gaussian graphs to encode the connectivity patterns of a large number of features on the subpopulations. To uncover the sub-population heterogeneity, we suggest a new framework of tuning-free heterogeneity pursuit (THP) via large-scale inference. In particular, two new tests, the chi-based test and the linear functional-based test, are introduced and their asymptotic null distributions are established. Under mild conditions, we show that both tests are optimal in achieving the testable region boundary and the sample size requirement for the latter test is minimal. Both theoretical guarantees and the tuning-free feature stem from multiple-network estimation by newly suggested approach of heterogeneous group square-root Lasso (HGSL) for multi-response regression with heterogeneous noises. To solve HGSL, we further introduce an algorithm that is scalable and enjoys provable convergence to the global optimum.


Authors who are presenting talks have a * after their name.

Back to the full JSM 2016 program

 
 
Copyright © American Statistical Association