Bilinear Attention Based Learning on Graphs
The attention mechanism is a core module in today’s well-established models like Transformers and Graph Attention Networks (GAT). The attention coefficients needed typically requires heavy computational resources for stability and better predictions. This requirement limits the size of the sequence or graph a model can learn from, leading to separating connected graphs or sequences to ease training. In this paper, we introduce an attention mechanism that leverages Bilinear forms to handle sequences of arbitrary length, offering greater flexibility and scalability. This improvement not only optimizes computational resources but also offers better model performance. Furthermore, our Bilinear Attention Mechanism (BAM) can capture more complex relationships between nodes for less parameters count.
Authors
- Adrien Njanko (ORCID: https://orcid.org/0009-0003-4902-4572)
- Danda B. Rawat
Institutions
- Howard University (US)
Publication Details
- Published
- 2024-12-15
- DOI
- https://doi.org/10.1109/bigdata62323.2024.10825196
- Primary Topic
- Advanced Graph Neural Networks
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Howard University