Seminars

ML/Statistics Seminar by Xiaodong Li on “Convex Relaxation for Community Detection”

Machine Learning/Statistics Seminar Series

Date/Time: Thursday Sep 7 2017, 11:00 pm – 12:00 pm

Location: Advisory Boardroom, #402 Groseclose

Speaker: Xiaodong Li

Title: Convex Relaxation for Community Detection

Abstract: Cluster structures are ubiquitous for large data, and community detection has recently attracted much research attention in applied physics, sociology, computer science and statistics due to its broad applicability in various network datasets. A variety of approaches distinct in essence have thus been proposed, among which convex relaxation have not been extensively explored due to the lack of knowledge of its statistical advantages over other methods, either theoretical or empirical. In this talk, I will focus on explaining the benefits of convex community detection in two aspects: robustness against adversarial nodes and efficacy in networks with heterogeneous degrees. For the robustness, I will show that convex relaxation is able to detect the hidden communities in presence of a portion of arbitrary or even adversarial nodes with strong theoretical guarantees, while standard spectral clustering may fail due to a small fraction of outliers; For networks with heterogenous degrees, I will show that a convex optimization enjoys desirable theoretical properties under the degree-corrected stochastic block model as well as competitive empirical performances compared to the state-of-the-art tractable methods in the literature. The talk consists of my collaborative works with T. Tony Cai, Yudong Chen, and Jiaming Xu.

Bio: Dr. Xiaodong Li is an assistant professor in the statistics department at UC Davis. Prior to that, he worked in the statistics department of Wharton School at University of Pennsylvania for two years. He got Ph.D of mathematics at Stanford University in 2013, and BS at Peking University in 2008. He works on theory and methods in in the intersection of statistics, applied math and machine learning, with current research interests including dimension reduction, randomized algorithms, network data, convex and nonconvex optimization, etc. He has published a series of papers regarding low-rank recovery, matrix completion, phase retrieval and community detection in various journals of statistics, mathematics and engineering such as JACM, IEEE TIT, AoS, ACHA, FOCM, etc.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s