The VQA-Machine: Learning How to Use Existing Vision Algorithms to Answer New Questions
This approach addresses the scalability and data efficiency problem in VQA for researchers and practitioners by leveraging pre-existing algorithms.
The paper tackles the challenge of unpredictable questions in Visual Question Answering (VQA) by proposing a method that learns to use existing vision algorithms instead of training new ones from scratch, achieving state-of-the-art results on Visual Genome and VQA datasets.
One of the most intriguing features of the Visual Question Answering (VQA) challenge is the unpredictability of the questions. Extracting the information required to answer them demands a variety of image operations from detection and counting, to segmentation and reconstruction. To train a method to perform even one of these operations accurately from {image,question,answer} tuples would be challenging, but to aim to achieve them all with a limited set of such training data seems ambitious at best. We propose here instead a more general and scalable approach which exploits the fact that very good methods to achieve these operations already exist, and thus do not need to be trained. Our method thus learns how to exploit a set of external off-the-shelf algorithms to achieve its goal, an approach that has something in common with the Neural Turing Machine. The core of our proposed method is a new co-attention model. In addition, the proposed approach generates human-readable reasons for its decision, and can still be trained end-to-end without ground truth reasons being given. We demonstrate the effectiveness on two publicly available datasets, Visual Genome and VQA, and show that it produces the state-of-the-art results in both cases.