Coder Social home page Coder Social logo

luisfredgs / litegt Goto Github PK

View Code? Open in Web Editor NEW

This project forked from chaofantao/litegt

0.0 1.0 0.0 539 KB

[CIKM-21] Pytorch implementation of LiteGT: Efficient and Lightweight Graph Transformers

License: MIT License

Python 87.27% Shell 5.85% Jupyter Notebook 6.89%

litegt's Introduction

[CIKM-2021] LiteGT: Efficient and Lightweight Graph Transformers

Source code for the paper "LiteGT: Efficient and Lightweight Graph Transformers".

We propose a three-level efficient graph transformer architecture called LiteGT to learn on arbitrary graphs, which saves computation, memory and model size altogether.

  • Instance-level A novel Kullback-Leibler divergence-base sampling to consider top-logN important nodes for attention value computation
  • Relation-level Two versions of two-branch attention paradigm that one branch considers sampling nodes with regularized softmax attention, and another branch adopts a lightweight kernel that use subtraction only, or fixed graph-specific Jaccard information.
  • Vector-level We reduce the hidden dimensions at several block intervals. The pyramid-shape transformer architecture is found to be effective.

Another important property is that our method effectively alleviates the over-smoothing problem when the layers go deep. Specifically, the nodes are updated with different attention schemes during training, thus avoiding all node features converging to a single representation.


LiteGT Architecture LiteGT Attention Block
Figure: Left depicts the proposed LiteGT model. Right shows the two formats of the lite attention block. The two branches of the lite attention block employ different attention kernels. The first branch would always employ regularized softmax-kernel, while the second branch employs either Jaccard or Subtracter kernel.

1. Repo installation

This project is based on the benchmarking-gnns repository.

Follow these instructions to install the benchmark and setup the environment.


2. Download datasets

Proceed as follows to download the datasets used to evaluate Graph Transformer.


3. Reproducibility

Use this page to run the codes and reproduce the published results.


4. Citation

@inproceedings{chen2021litegt,
  title={LiteGT: Efficient and Lightweight Graph Transformers},
  author={Chen, Cong and Tao, Chaofan and Wong, Ngai},
  journal={The Conference on Information and Knowledge Management (CIKM)},
  year={2021}
}




litegt's People

Contributors

chaofantao avatar dylancchan avatar

Watchers

James Cloos avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.