Deep Neural Network for Functional Graphical Models Structure Learning

guanqun Cao Speaker
Michigan State University
 
Monday, Aug 4: 8:35 AM - 8:55 AM
Topic-Contributed Paper Session 
Music City Center 
We propose a novel and flexible method to estimate the neighborhood of each node using a deep neural network-based functional data regression and feature selection approach with an arbitrary nonparametric form. The full graph structure is then recovered by combining the estimated neighborhoods. Our approach avoids common distributional assumptions on the random functions and circumvents the need for a well-defined precision operator, which may not exist in the functional data context. Furthermore, we establish model consistency for the proposed algorithm. The convergence rate reaches to the classical non-parametric regression rate up to a logarithmic factor. We discover a novel critical sampling frequency that governs the convergence rates of the deep neural network estimator. The empirical performance of our method is demonstrated through simulation studies and a real data application.

Keywords

Deep Neural Network

Functional graphical model

Feature selection

Functional data analysis

Non-parametric statistics