Difference between revisions of "Graph Structure of Neural Networks"

From statwiki
Jump to: navigation, search
(Major Conclusions (Section 5 in the paper))
(1. Neural networks performance depends on its structure)
Line 26: Line 26:
  
 
== 1. Neural networks performance depends on its structure ==
 
== 1. Neural networks performance depends on its structure ==
 +
 +
$$f(x)=x^2$$
  
 
== 2. Sweet spot where performance is significantly improved ==
 
== 2. Sweet spot where performance is significantly improved ==

Revision as of 20:11, 10 November 2020

Presented By

Xiaolan Xu, Robin Wen, Yue Weng, Beizhen Chang

Introduction

We develop a new way of representing a neural network as a graph, which we call relational graph. Our key insight is to focus on message exchange, rather than just on directed data flow. As a simple example, for a fixedwidth fully-connected layer, we can represent one input channel and one output channel together as a single node, and an edge in the relational graph represents the message exchange between the two nodes (Figure 1(a)).

Relational Graph

Parameter Definition

(1) Clustering Coefficient

(2) Average Path Length

Experimental Setup (Section 4 in the paper)

Discussions and Conclusions

1. Neural networks performance depends on its structure

$$f(x)=x^2$$

2. Sweet spot where performance is significantly improved

3. Relationship between neural network’s performance and parameters

4. Consistency among many different tasks and datasets

5. top architectures can be identified efficiently

6. well-performing neural networks have graph structure surprisingly similar to those of real biological neural networks

Critique