Are You Sure YouWant To Do That? Classification with Interpretable QueriesDownload PDF


Oct 16, 2018 (edited Sep 10, 2019)NIPS 2018 Workshop IRASL Blind SubmissionReaders: Everyone
  • Abstract: Classification systems typically act in isolation, meaning they are required to implicitly memorize the characteristics of all candidate classes in order to classify. The cost of this is increased memory usage and poor sample efficiency. We propose a model which instead verifies using reference images during the classification process, reducing the burden of memorization. The model uses iterative non-differentiable queries in order to classify an image. We demonstrate that such a model is feasible to train and can match baseline accuracy while being more parameter efficient. However, we show that finding the correct balance between image recognition and verification is essential to pushing the model towards desired behavior, suggesting that a pipeline of recognition followed by verification is a more promising approach towards designing more powerful networks with simpler architectures.
  • TL;DR: Image classification via iteratively querying for reference image from a candidate class with a RNN and use CNN to compare to the input image
  • Keywords: Image Classification, Knowledge Base, Verification, Query model, Gumbel-Softmax, Non-differentiable Model, Few Shot learning
3 Replies