Bilinear Attention Networks

Code

• github.com/jnhwkim/ban-vqa
  Officialpytorch★ 0
• github.com/facebookresearch/mmf
  pytorch★ 5,624
• github.com/ZephyrZhuQi/ssbaseline
  pytorch★ 57
• github.com/Cyanogenoid/vqa-counting
  pytorch★ 0
• github.com/allenai/pythia
  pytorch★ 0
• github.com/jackroos/pythia
  pytorch★ 0
• github.com/facebookresearch/pythia
  pytorch★ 0
• github.com/ronghanghu/pythia
  pytorch★ 0

Abstract

Attention networks in multimodal learning provide an efficient way to utilize given visual information selectively. However, the computational cost to learn attention distributions for every pair of multimodal input channels is prohibitively expensive. To solve this problem, co-attention builds two separate attention distributions for each modality neglecting the interaction between multimodal inputs. In this paper, we propose bilinear attention networks (BAN) that find bilinear attention distributions to utilize given vision-language information seamlessly. BAN considers bilinear interactions among two groups of input channels, while low-rank bilinear pooling extracts the joint representations for each pair of channels. Furthermore, we propose a variant of multimodal residual networks to exploit eight-attention maps of the BAN efficiently. We quantitatively and qualitatively evaluate our model on visual question answering (VQA 2.0) and Flickr30k Entities datasets, showing that BAN significantly outperforms previous methods and achieves new state-of-the-arts on both datasets.

Tasks

Benchmark Results

Reproductions