`

Timezone: »

 
Poster
Detecting Interactions from Neural Networks via Topological Analysis
Zirui Liu · Qingquan Song · Kaixiong Zhou · Ting-Hsiang Wang · Ying Shan · Xia Hu

Thu Dec 10 09:00 AM -- 11:00 AM (PST) @ Poster Session 5 #1676
in Poster Session 6 »

Detecting statistical interactions between input features is a crucial and challenging task. Recent advances demonstrate that it is possible to extract learned interactions from trained neural networks. It has also been observed that, in neural networks, any interacting features must follow a strongly weighted connection to common hidden units. Motivated by the observation, in this paper, we propose to investigate the interaction detection problem from a novel topological perspective by analyzing the connectivity in neural networks. Specially, we propose a new measure for quantifying interaction strength, based upon the well-received theory of persistent homology. Based on this measure, a Persistence Interaction Dection (PID) algorithm is developed to efficiently detect interactions. Our proposed algorithm is evaluated across a number of interaction detection tasks on several synthetic and real-world datasets with different hyperparameters. Experimental results validate that the PID algorithm outperforms the state-of-the-art baselines.

Keywords: Learning Theory · Exploration · Reinforcement Learning and Planning · Algorithms -> Bandit Algorithms; Reinforcement Learning and Planning -> Reinforcement Learning; Theory
[ Paper ]

Author Information

Zirui Liu (Texas A&M University)

I am a Ph.D. student in Texas A&M University

Qingquan Song (Texas A&M University)
Kaixiong Zhou (Texas A&M University)
Ting-Hsiang Wang (Texas A&M University)
Ying Shan (Tencent)
Xia Hu (Texas A&M University)

More from the Same Authors