Statistics Department Seminar Series: Han Liu, Assistant Professor, Statistical Machine Learning Lab, Princeton University
Friday, February 17, 2017
11:30 AM-1:00 PM
411 West Hall Map
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing of Euclidean parameters, combinatorial inference aims at testing the global structure of the underlying graph. Examples include testing the graph connectivity, the presence of a cycle of certain size, or the maximum degree of the graph. To begin with, we develop a unified theory for the fundamental limits of a large family of combinatorial inference problems. We propose new structural packing entropies to characterize how the complexity of combinatorial graph structures impacts the corresponding minimax lower bounds. On the other hand, we propose a family of practical structural testing algorithms to match the obtained lower bounds. We use a case study of brain network analysis to illustrate the usefulness of these proposed methods.
|Event Type:||Workshop / Seminar|
|Source:||Happening @ Michigan from Department of Statistics, Department of Statistics Seminar Series|