yuns

4.3 Limitations 본문

graph deep learning/#4 Vanilla Graph Neural Networks

4.3 Limitations

yuuuun 2020. 11. 7. 11:46
반응형

Four Limitations

  1. Computationally inefficient to update the hidden states of nodes iteratively to get the fixed point.
  2. uses the same parameters in the iteration while most opoular neural networks use different parameters in different layers, which serves as a hierarchical feature extraction method
  3. some informative edges(Knowledge Graph) cannot be effectively modeled in GNN.
  4. if T is pretty large, it is unsuitable to use the fixed points if we focus on the representation of nodes instead of graphs because the distribution of representation in the fixed point will be much more smooth in value and less informative for distinguishihng each node.!
반응형

'graph deep learning > #4 Vanilla Graph Neural Networks' 카테고리의 다른 글

4.2 Model  (0) 2020.11.07
4.1 Introduction  (0) 2020.11.06
GNN소개 및 내용 정리  (0) 2020.11.06
Comments