Unifying Visual-Semantic Embeddings with Multimodal Neural Language Models

# Unifying Visual-Semantic Embeddings with Multimodal Neural Language Models

## Abstract

Inspired by recent advances in multimodal learning and machine translation, we introduce an encoder-decoder pipeline that learns (a): a multimodal joint embedding space with images and text and (b): a novel language model for decoding distributed representations from our space. Our pipeline effectively unifies joint image-text embedding models with multimodal neural language models. We introduce the structure-content neural language model that disentangles the structure of a sentence to its content, conditioned on representations produced by the encoder. The encoder allows one to rank images and sentences while the decoder can generate novel descriptions from scratch. Using LSTM to encode sentences, we match the state-of-the-art performance on Flickr8K and Flickr30K without using object detections. We also set new best results when using the 19-layer Oxford convolutional network. Furthermore we show that with linear encoders, the learned embedding space captures multimodal regularities in terms of vector space arithmetic e.g. *image of a blue car* - “blue” + “red” is near images of red cars. Sample captions generated for 800 images are made available for comparison.

## 1Introduction

Generating descriptions for images has long been regarded as a challenging perception task integrating vision, learning and language understanding. One not only needs to correctly recognize what appears in images but also incorporate knowledge of spatial relationships and interactions between objects. Even with this information, one then needs to generate a description that is relevant and grammatically correct. With the recent advances made in deep neural networks, tasks such as object recognition and detection have made significant breakthroughs in only a short time. The task of describing images is one that now appears tractable and ripe for advancement. Being able to append large image databases with accurate descriptions for each image would significantly improve the capabilities of content-based image retrieval systems. Moreover, systems that can describe images well, could in principle, be fine-tuned to answer questions about images also.

This paper describes a new approach to the problem of image caption generation, casted into the framework of encoder-decoder models. For the encoder, we learn a joint image-sentence embedding where sentences are encoded using long short-term memory (LSTM) recurrent neural networks [1]. Image features from a deep convolutional network are projected into the embedding space of the LSTM hidden states. A pairwise ranking loss is minimized in order to learn to rank images and their descriptions. For decoding, we introduce a new neural language model called the structure-content neural language model (SC-NLM). The SC-NLM differs from existing models in that it disentangles the structure of a sentence to its content, conditioned on distributed representations produced by the encoder. We show that sampling from an SC-NLM allows us to generate realistic image captions, significantly improving over the generated captions produced by [2]. Furthermore, we argue that this combination of approaches naturally fits into the experimentation framework of [3], that is, a good encoder can be used to rank images and captions while a good decoder can be used to generate new captions from scratch. Our approach effectively unifies image-text embedding models (encoder phase) [4] with multimodal neural language models (decoder phase) [2] [7]. Furthermore, our method builds on analogous approaches being used in machine translation [8].

While the application focus of our work is on image description generation and ranking, we also qualitatively analyse properties of multimodal vector spaces learned using images and sentences. We show that using a linear sentence encoder, linguistic regularities [12] also carry over to multimodal vector spaces. For example, *image of a blue car* - “blue” + “red” results in a vector that is near images of red cars. We qualitatively examine several types of analogies and structures with PCA projections. Consequently, even with a global image-sentence training objective the encoder can still be used to retrieve locally (e.g. individual words). This is analogous to pairwise ranking methods used in machine translation [13].

### 1.1Multimodal representation learning

A large body of work has been done on learning multimodal representations of images and text. Popular approaches include learning joint image-word embeddings [4] as well as embedding images and sentences into a common space [6]. Our proposed pipeline makes direct use of these ideas. Other approaches to multimodal learning include the use of deep Boltzmann machines [16], log-bilinear neural language models [2], autoencoders [17], recurrent neural networks [7] and topic-models [18]. Several bi-directional approaches to ranking images and captions have also been proposed, based off of kernel CCA [3], normalized CCA [19] and dependency tree recursive networks [6]. From an architectural standpoint, our encoder-decoder model is most similar to [20], who proposed a two-step embedding and generation procedure for semantic parsing.

### 1.2Generating descriptions of images

We group together approaches to generation into three types of methods, each described here in more detail:

Template-based methods.

Template-based methods involve filling in sentence templates, such as triplets, based on the results of object detections and spatial relationships [21]. While these approaches can produce accurate descriptions, they are often more ‘robotic’ in nature and do not generalize to the fluidity and naturalness of captions written by humans.

Composition-based methods.

These approaches aim to harness existing image-caption databases by extracting components of related captions and composing them together to generate novel descriptions [26]. The advantage of these approaches are that they allow for a much broader and more expressive class of captions that are more fluent and human-like then template-based approaches.

Neural network methods.

These approaches aim to generate descriptions by sampling from conditional neural language models. The initial work in this area, based off of multimodal neural language models [2], generated captions by conditioning on feature vectors from the output of a deep convolutional network. These ideas were recently extended to multimodal recurrent networks with significant improvements [7]. The methods described in this paper produce descriptions that at least qualitatively on par with current state-of-the-art composition-based methods [27].

Description generation systems have been plagued with issues of evaluation. While Bleu and Rouge have been used in the past, [3] has argued that such automated evaluation methods are unreliable and do not match human judgements. These authors instead proposed that the problem of ranking images and captions can be used as a proxy for generation. Since any generation system requires a scoring function to access how well a caption and image match, optimizing this task should naturally carry over to an improvement in generation. Many recent methods have since used this approach for evaluation. None the less, the question on how to transfer improvements on ranking to generating new descriptions remained. We argue that encoder-decoder methods naturally fit into this experimentation framework. That is, the encoder gives us a way to rank images and captions and develop good scoring functions, while the decoder can use the representations learned to optimize the scoring functions as a way of generating and scoring new descriptions.

### 1.3Encoder-decoder methods for machine translation

Our proposed pipeline, while new to caption generation, has already experienced several successes in Neural Machine Translation (NMT). The goal of NMT is to develop an end-to-end translation system with a large neural network, as opposed to using a neural network as an additional feature function to an existing phrase-based system. NMT methods are based on the encoder-decoder principle. That is, an encoder is used to map an English sentence to a distributed vector. A decoder is then conditioned on this vector to generate a French translation from the source text. Current methods include using a convolutional encoder and RNN decoder [8], RNN encoder and RNN decoder [9] and LSTM encoder with LSTM decoder [11]. While still a young research area, these methods have already achieved performance on par with strong phrase-based systems and have improved on the start-of-the-art when used for rescoring.

We argue that it is natural to think of image caption generation as a translation problem. That is, our goal is to translate an image into a description. This point of view has also been used by [28] and allows us to make use of existing ideas in the machine translation literature. Furthermore, there is a natural correspondence between the concept of scoring functions (how well does a caption and image match) and alignments (which parts of a description correspond to which parts of an image) that can naturally be exploited for generating descriptions.

## 2An encoder-decoder model for ranking and generation

In this section we describe our image caption generation pipeline. We first review LSTM RNNs which are used for encoding sentences, followed by how to learn multimodal distributed representations. We then review log-bilinear neural language models [29], multiplicative neural language models [30] and then introduce our structure-content neural language model.

### 2.1Long short-term memory RNNs

Long short-term memory [1] is a recurrent neural network that incorporates a built in memory cell to store information and exploit long range context. LSTM memory cells are surrounded by gating units for the purpose of reading, writing and reseting information. LSTMs have been used to achieve state-of-the-art performance in several tasks such as handwriting recognition [31], sequence generation [32] speech recognition [33] and machine translation [11] among others. Dropout [34] strategies have also been proposed to prevent overfitting in deep LSTMs. [35]

Let denote a matrix of training instances at time . In our case, is used to denote a matrix of word representations for the -th word of each sentence in the training batch. Let denote the input, forget, cell, output and hidden states of the LSTM at time step . The LSTM architecture in this work is implemented using the following equations:

where () denotes the sigmoid activation function, () indicates matrix multiplication and () indicates component-wise multiplication. 1

### 2.2Multimodal distributed representations

Suppose for training we are given image-description pairs each corresponding to an image and a description that correctly describes the image. Images are represented as the top layer (before the softmax) of a convolutional network trained on the ImageNet classification task [36].

Let be the dimensionality of an image feature vector (e.g. 4096 for AlexNet [36]), the dimensionality of the embedding space and let be the number of words in the vocabulary. Let and be the image embedding matrix and word embedding matrices, respectively. Given an image description with words , 2 let denote the corresponding word representations to words (entries in the matrix ). The representation of a sentence is the hidden state of the LSTM at time step (i.e. the vector ). We note that other approaches for computing sentence representations for image-text embeddings have been proposed, including dependency tree RNNs [6] and bags of dependency parses [15]. Let denote an image feature vector (for the image corresponding to description ) and let be the image embedding. We define a scoring function , where and are first scaled to have unit norm (making equivalent to cosine similarity). Let denote all the parameters to be learned ( and all the LSTM weights) 3. We optimize the following pairwise ranking loss:

where is a contrastive (non-descriptive) sentence for image embedding , and vice-versa with . For all of our experiments, we initialize the word embeddings to be pre-computed dimensional vectors learned using a continuous bag-of-words model [37]. The contrastive terms are chosen randomly from the training set and resampled every epoch.

### 2.3Log-bilinear neural language models

The log-bilinear language model (LBL) [29] is a deterministic model that may be viewed as a feed-forward neural network with a single linear hidden layer. Each word in the vocabulary is represented as a -dimensional real-valued vector , as in the case of the encoder. Let denote a matrix of word representation vectors 4 where is the vocabulary size. Let be a tuple of words where is the context size. The LBL model makes a linear prediction of the next word representation as

where are context parameter matrices. Thus, is the predicted representation of . The conditional probability of given is

where is a bias vector. Learning is done with stochastic gradient descent.

### 2.4Multiplicative neural language models

Suppose now we are given a vector from the multimodal vector space, which has an association with a word sequence . For example, may be the embedded representation of an image whose description is given by . A multiplicative neural language model [30] models the distribution of a new word given context from the previous words and the vector . A multiplicative model has the additional property that the word embedding matrix is instead replaced with a tensor where is the number of slices. Given , we can compute a word representation matrix as a function of as i.e. word representations with respect to are computed as a linear combination of slices weighted by each component of . Here, the number of slices is equal to , the dimensionality of .

It is often unnecessary to use a fully unfactored tensor. As in e.g. [38], we re-represent in terms of three matrices , and , such that

where denotes the matrix with its argument on the diagonal. These matrices are parametrized by a pre-chosen number of factors . In [30], the conditioning vector is referred to as an attribute and using a third-order model of words allows one to model conditional similarity: how meanings of words change as a function of the attributes they’re conditioned on.

Let denote a ‘folded’ matrix of word embeddings. Given the context , the predicted next word representation is given by:

where denotes the column of for the word representation of and are context matrices. Given a predicted next word representation , the factor outputs are , where is a component-wise product. The conditional probability of given and can be written as

where denotes the column of corresponding to word . In contrast to the log-bilinear model, the matrix of word representations from before is replaced with the factored tensor that we have derived. We compared the multiplicative model against an additive variant [2] and found on large datasets, such as the SBU Captioned Photo dataset [40], the multiplicative variant significantly outperforms its additive counterpart. Thus, the SC-NLM is derived from the multiplicative variant.

### 2.5Structure-content neural language models

We now describe the structure-content neural language model. Suppose that, along with a description , we are also given a sequence of word-specific structure variables . Throughout our experiments, each corresponds to the part-of-speech for word , although other possibilities can be used instead. Given an embedding (the content vector), our goal is to model the distribution from previous word context and forward structure context , where is the forward context size. Figure gives an illustration of the model and prediction problem. Intuitively, the structure variables help guide the model during the generation phrase and can be thought of as a soft template to help avoid the model from generating grammatical nonsense. Note that this model shares a resemblance with the NNJM of [41] for machine translation, where the previous word context are predicted words in the target language, and the forward context are words in the source language.

Our model can be interpreted as a multiplicative neural language model but where the attribute vector is no longer but instead an additive function of and the structure variables . Let be embedding vectors for the structure variables . These are obtained from a learned lookup table in the same way as words are. We introduce a sequence of structure context matrices which play the same role as the word context matrices . Let denote a context matrix for the multimodal vector . The attribute vector of combined structure and content information is computed as

where is a ReLU non-linearity and is a bias vector. The vector now plays the same role as the vector for the multiplicative model previously described and the remainder of the model remains unchanged. Our experiments use and factors .

The SC-NLM is trained on a large collection of image descriptions (e.g. Flickr30K). There are several choices available for representing the conditioning vectors . One choice would be to use the embedding of the corresponding image. An alternative choice, which is the approach we take, is to condition on the embedding vector for the description computed with the LSTM. The advantage of this approach is that the SC-NLM can be trained purely on text alone. This allows us to make use of large amounts of monolingual text (e.g. non image captions) to improve the quality of the language model. Since the embedding vectors of share a joint space with the image embeddings, we can also condition the SC-NLM on image embeddings (e.g. at test time, when no description is available) after the model has been trained. This is a significant advantage over a conditional language model that explicitly requires image-caption pairs for training and highlights the strength of a multimodal encoding space.

Due to space limitations, we leave the full details of our caption generation procedure to the supplementary material.

## 3Experiments

### 3.1Image-sentence ranking

Our main quantitative results is to establish the effectiveness of using an LSTM sentence encoder for ranking image and descriptions. We perform the same experimental procedure as done by [15] on the Flickr8K [3] and Flickr30K [42] datasets. These datasets come with 8,000 and 30,000 images respectively with each image annotated using 5 sentences by independent annotators. As with [15], we did not do any explicit text preprocessing. We used two convolutional network architectures for extracting 4096 dimensional image features: the Toronto ConvNet 5 as well as the 19-layer OxfordNet [43] which finished 2nd place in the ILSVRC 2014 classification competition. Following the protocol of [15], 1000 images are used for validation, 1000 for testing and the rest are used for training. Evaluation is performed using Recall@K, namely the mean number of images for which the correct caption is ranked within the top-K retrieved results (and vice-versa for sentences). We also report the median rank of the closest ground truth result from the ranked list. We compare our results to each of the following methods:

DeViSE. The deep visual semantic embedding model [5] was proposed as a way of performing zero-shot object recognition and was used as a baseline by [15]. In this model, sentences are represented as the mean of their word embeddings and the objective function optimized matches ours.

SDT-RNN. The semantic dependency tree recursive neural network [6] is used to learn sentence representations for embedding into a joint image-sentence space. The same objective is used.

DeFrag. Deep fragment embeddings [15] were proposed as an alternative to embedding full-frame image features and take advantage of object detections from the R-CNN [44] detector. Descriptions are represented as a bag of dependency parses. Their objective incorporates both a global and fragment objectives, for which their global objective matches ours.

m-RNN. The multimodal recurrent neural network [7] is a recently proposed method that uses perplexity as a bridge between modalities, as first introduced by [2]. Unlike all other methods, the m-RNN does not use a ranking loss and instead optimizes the log-likelihood of predicting the next word in a sequence conditioned on an image.

Our LSTMs use 1 layer with 300 units and weights initialized uniformly from [-0.08, 0.08]. The margin was set to , which we found performed well on both datasets. Training is done using stochastic gradient descent with an initial learning rate of 1 and was exponentially decreased. We used minibatch sizes of 40 on Flickr8K and 100 on Flickr30K. No momentum was used. The same hyperparameters are used for the OxfordNet experiments.

#### Results

Tables and illustrate our results on Flickr8K and Flickr30K respectively. The performance of our model is comparable to that of the m-RNN. For some metrics we outperform or match existing results while on others m-RNN outperforms our model. The m-RNN does not learn an explicit embedding between images and sentences and relies on perplexity as a means of retrieval. Methods that learn explicit embedding spaces have a significant speed advantage over perplexity-based retrieval methods, since retrieval is easily done with a single matrix multiply of stored embedding vectors from the dataset with the query vector. Thus explicit embedding methods are much better suited for scaling to large datasets.

Perhaps more interestingly is the fact that both our method and the m-RNN outperform existing models that integrate object detections. This is contradictory to [6], where recurrent networks are the worst performing models. This highlights the effectiveness of LSTM cells for encoding dependencies across descriptions and learning meaningful distributed sentence representations. Integrating object detections into our framework should almost surely improve performance as well as allow for interpretable retrievals, as in the case of DeFrag.

Using image features from the OxfordNet model results in a significant performance boost across all metrics, giving new state-of-the-art numbers on these evaluation tasks.

### 3.2Multimodal linguistic regularities

Word embeddings learned with skip-gram [37] or neural language models [45] were shown by [12] to exhibit linguistic regularities that allow these models to perform analogical reasoning. For instance, “man” is to “woman” as “king” is to ? can be answered by finding the closest vector to “king” - “man” + “woman”. A natural question we ask is whether multimodal vector spaces exhibit the same phenomenon. Would *image of a blue car* - “blue” + “red” be near images of red cars?

Suppose that we train an embedding model with a linear encoder, namely for word vectors and sentence vector (where both and the image embedding are normalized to unit length). Using our example above, let , and denote the word embeddings for blue, red and car respectively. Let and denote embeddings of images with blue and red cars. After training a linear encoder, the model has the property that and . It follows that

Thus given a query image , a negative word and a positive word (all with unit norm), we seek an image such that:

The supplementary material contains qualitative evidence that the above holds for several types of regularities and images. 6 In our examples, we consider retrieving the top-4 nearest images. Occasionally we observed that a poor result would be obtained within the top-4 among good results. We found a simple strategy for removing these cases is to first retrieve the top N nearest images, then re-sort these based on their distance to the mean of the N images.

It is worth noting that these kinds of regularities are not well observed with an LSTM encoder, since sentences are no longer just a sum of their words. The linear encoder is roughly equivalent to the DeViSE baselines in tables and , which perform significantly worse for retrieval than an LSTM encoder. So while these regularities are interesting the learned multimodal vector space is not well apt for ranking sentences and images.

### 3.3Image caption generation

We generated image descriptions for roughly 800 images from the SBU captioned photo dataset [40]. These are the same images used to display results by the current state-of-the-art composition based approach, TreeTalk [27]. 7 Our LSTM encoder and SC-NLM decoder were trained by concatenating the Flickr30K dataset with the recently released Microsoft COCO dataset [46], which combined give us over 100,000 images and over 500,000 descriptions for training. The SBU dataset contains 1 million images each with a single description and was used by [27] for training their model. While the SBU dataset is larger, the annotated descriptions are noisier and more personalized.

The generated results can be found at http://www.cs.toronto.edu/\textasciitilde rkiros/lstm_scnlm.html 8. For each image we show the original caption, the nearest neighbour sentence from the training set, the top-5 generated samples from our model and the best generated result from TreeTalk. The nearest neighbour sentence is displayed to demonstrate that our model has not simply learned to copy the training data. Our generated descriptions are arguably the nicest ones to date.

## 4Discussion

When generating a description, it is often the case that only a small region is relevant at any given time. We are developing an attention-based model that jointly learns to align parts of captions to images and use these alignments to determine where to attend next, thus dynamically modifying the vectors used for conditioning the decoder. We also plan on experimenting with LSTM decoders as well as deep and bidirectional LSTM encoders.

#### Acknowledgments

We would like to thank Nitish Srivastava for assistance with his ConvNet package as well as preparing the Oxford convolutional network. We also thank the anonymous reviewers from the NIPS 2014 deep learning workshop for their comments and suggestions.

## 5Supplementary material: Additional experimentation and details

### 5.1Multimodal linguistic regularities

Figure illustrates sample results using a model trained on the SBU dataset. All queries were downloaded online and retrieved images are from the SBU images used for training. What is of interest to note is that the resulting images depend highly on the image used for the query. For example, searching for the word ‘night’ retrieves arbitrary images taken at night. On the other hand, an image with a building predominantly as its focus will return night images when ‘day’ is subtracted and ‘night’ is added. A similar phenomenon occurs with the example of cats, bowls and boxes. As additional visualizations, we computed PCA projections of cars and their corresponding colors as well as images and the weather occurrences in Figure . These results give us strong evidence for the regularities apparent in multimodal vector spaces trained with linear encoders. Of course, sensible results are only likely to be obtained if (a) the content of the image is correctly recognized, (b) the subtraction word is relevant to the image and (c) an image exists that is sensible for the corresponding query.

### 5.2Image description generation

The SC-NLM was trained on the concatenation of training sentences from both Flickr30K and Microsoft COCO. Given an image, we first map it into the multimodal space. From this embedding, we define 2 sets of candidate conditioning vectors to the SC-NLM:

Image embedding.

The embedded image itself. Note that the SC-NLM was not trained with images but can be conditioned on images since the embedding space is multimodal.

top- nearest words and sentences.

After first computing the image embedding, we obtain the top- nearest neighbour words and training sentences using cosine similarity. These retrievals are treated as a ‘bag of concepts’ for which we compute an embedding vector as the mean of each concept. All of our results use .

Along with the candidate conditioning vectors, we also compute candidate POS sequences used by the SC-NLM. For this, we obtain a set of all POS sequences from the training set whose lengths were between 4 and 12, inclusive. Captions are generated by first sampling a conditioning vector, next sampling a POS sequence, then computing a MAP estimate from the SC-NLM. We generate a large list of candidate descriptions (1000 for each image in our results) and rank these candidates using a scoring function. Our scoring function consists of two feature functions:

Translation model.

The candidate description is embedded into the multimodal space using the LSTM. We then compute a translation score as the cosine similarity between the image embedding and the embedding of the candidate description. This scores how relevant the content of the candidate is to the image. We also augment to this score a multiplicative penalty to non-stopwords that appear too frequently in the description. 9

Language model.

We trained a Kneser-Ney trigram model on a large corpus and compute the log-probability of the candidate under the model. This scores how reasonable of an English sentence is the candidate.

The total score of a caption is then the weighted sum of the translation and language models. Due to the challenge of quantitatively evaluating generated descriptions, we tuned the weights by hand on qualitative results alone. All of the candidate descriptions are ranked by their scores, and the top-5 captions are returned.

### Footnotes

1. For additional details on LSTM: http://people.idsia.ch/~juergen/rnn.html.
2. As a slight abuse of notation, we refer to as both a word and an index into the word embedding matrix.
3. We keep the word embedding matrix fixed.
4. Note that this is a different matrix then that used by the encoder. We use the same vocabulary throughout both models.
5. https://github.com/TorontoDeepLearning/convnet
6. For this model we finetune the word representations.
7. http://ilp-cky.appspot.com/generation
8. These results use features from the Toronto ConvNet.
9. For instance, given an image of a car, we would want a candidate to be ranked low if each noun in the description was ‘car’.

### References

1. Long short-term memory.
Sepp Hochreiter and Jürgen Schmidhuber. Neural computation, 1997.
2. Multimodal neural language models.
Ryan Kiros, Richard S Zemel, and Ruslan Salakhutdinov. ICML, 2014.
3. Framing image description as a ranking task: Data, models and evaluation metrics.
Micah Hodosh, Peter Young, and Julia Hockenmaier. JAIR, 2013.
4. Large scale image annotation: learning to rank with joint word-image embeddings.
Jason Weston, Samy Bengio, and Nicolas Usunier. Machine learning, 2010.
5. Devise: A deep visual-semantic embedding model.
Andrea Frome, Greg S Corrado, Jon Shlens, Samy Bengio, Jeffrey Dean, and Tomas Mikolov MarcAurelio Ranzato. NIPS, 2013.
6. Grounded compositional semantics for finding and describing images with sentences.
Richard Socher, Q Le, C Manning, and A Ng. In TACL, 2014.
7. Explain images with multimodal recurrent neural networks.
Junhua Mao, Wei Xu, Yi Yang, Jiang Wang, and Alan L Yuille. arXiv preprint arXiv:1410.1090, 2014.
8. Recurrent continuous translation models.
Nal Kalchbrenner and Phil Blunsom. In EMNLP, 2013.
9. Learning phrase representations using rnn encoder-decoder for statistical machine translation.
Kyunghyun Cho, Bart van Merrienboer, Caglar Gulcehre, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. EMNLP, 2014.
10. Neural machine translation by jointly learning to align and translate.
Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. arXiv preprint arXiv:1409.0473, 2014.
11. Sequence to sequence learning with neural networks.
Ilya Sutskever, Oriol Vinyals, and Quoc V Le. NIPS, 2014.
12. Linguistic regularities in continuous space word representations.
Tomas Mikolov, Wen-tau Yih, and Geoffrey Zweig. In NAACL-HLT, 2013.
13. Multilingual distributed representations without word alignment.
Karl Moritz Hermann and Phil Blunsom. ICLR, 2014.
14. Multilingual models for compositional distributional semantics.
Karl Moritz Hermann and Phil Blunsom. In ACL, 2014.
15. Deep fragment embeddings for bidirectional image sentence mapping.
Andrej Karpathy, Armand Joulin, and Li Fei-Fei. NIPS, 2014.
16. Multimodal learning with deep boltzmann machines.
Nitish Srivastava and Ruslan Salakhutdinov. In NIPS, 2012.
17. Multimodal deep learning.
Jiquan Ngiam, Aditya Khosla, Mingyu Kim, Juhan Nam, Honglak Lee, and Andrew Ng. In ICML, 2011.
18. Learning cross-modality similarity for multinomial data.
Yangqing Jia, Mathieu Salzmann, and Trevor Darrell. In ICCV, 2011.
19. Improving image-sentence embeddings using large weakly annotated photo collections.
Yunchao Gong, Liwei Wang, Micah Hodosh, Julia Hockenmaier, and Svetlana Lazebnik. In ECCV. 2014.
20. A deep architecture for semantic parsing.
Phil Blunsom, Nando de Freitas, Edward Grefenstette, Karl Moritz Hermann, et al. In ACL 2014 Workshop on Semantic Parsing, 2014.
21. Baby talk: Understanding and generating simple image descriptions.
Girish Kulkarni, Visruth Premraj, Sagnik Dhar, Siming Li, Yejin Choi, Alexander C Berg, and Tamara L Berg. In CVPR, 2011.
22. Every picture tells a story: Generating sentences from images.
Ali Farhadi, Mohsen Hejrati, Mohammad Amin Sadeghi, Peter Young, Cyrus Rashtchian, Julia Hockenmaier, and David Forsyth. In ECCV. 2010.
23. Composing simple image descriptions using web-scale n-grams.
Siming Li, Girish Kulkarni, Tamara L Berg, Alexander C Berg, and Yejin Choi. In CONLL, 2011.
24. Corpus-guided sentence generation of natural images.
Yezhou Yang, Ching Lik Teo, Hal Daumé III, and Yiannis Aloimonos. In EMNLP, 2011.
25. Midge: Generating image descriptions from computer vision detections.
Margaret Mitchell, Xufeng Han, Jesse Dodge, Alyssa Mensch, Amit Goyal, Alex Berg, Kota Yamaguchi, Tamara Berg, Karl Stratos, and Hal Daumé III. In EACL, 2012.
26. Collective generation of natural image descriptions.
Polina Kuznetsova, Vicente Ordonez, Alexander C Berg, Tamara L Berg, and Yejin Choi. ACL, 2012.
27. Treetalk : Composition and compression of trees for image descriptions.
Polina Kuznetsova, Vicente Ordonez, Tamara L. Berg, and Yejin Choi. TACL, 2014.
28. Translating video content to natural language descriptions.
Marcus Rohrbach, Wei Qiu, Ivan Titov, Stefan Thater, Manfred Pinkal, and Bernt Schiele. In ICCV, 2013.
29. Three new graphical models for statistical language modelling.
Andriy Mnih and Geoffrey Hinton. In ICML, pages 641–648, 2007.
30. A multiplicative model for learning distributed text-based attribute representations.
Ryan Kiros, Richard S Zemel, and Ruslan Salakhutdinov. NIPS, 2014.
31. A novel connectionist system for unconstrained handwriting recognition.
Alex Graves, Marcus Liwicki, Santiago Fernández, Roman Bertolami, Horst Bunke, and Jürgen Schmidhuber. TPAMI, 2009.
32. Generating sequences with recurrent neural networks.
Alex Graves. arXiv preprint arXiv:1308.0850, 2013.
33. Hybrid speech recognition with deep bidirectional lstm.
Alex Graves, Navdeep Jaitly, and Abdel-rahman Mohamed. In IEEE Workshop on ASRU, 2013.
34. Dropout: A simple way to prevent neural networks from overfitting.
Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. JMLR, 2014.
35. Recurrent neural network regularization.
Wojciech Zaremba, Ilya Sutskever, and Oriol Vinyals. arXiv preprint arXiv:1409.2329, 2014.
36. Imagenet classification with deep convolutional neural networks.
Alex Krizhevsky, Ilya Sutskever, and Geoff Hinton. In NIPS, 2012.
37. Efficient estimation of word representations in vector space.
Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. arXiv preprint arXiv:1301.3781, 2013.
38. Unsupervised learning of image transformations.
Roland Memisevic and Geoffrey Hinton. In CVPR, pages 1–8, 2007.
39. Factored 3-way restricted boltzmann machines for modeling natural images.
Alex Krizhevsky, Geoffrey E Hinton, et al. In AISTATS, pages 621–628, 2010.
40. Im2text: Describing images using 1 million captioned photographs.
Vicente Ordonez, Girish Kulkarni, and Tamara L Berg. In NIPS, 2011.
41. Fast and robust neural network joint models for statistical machine translation.
Jacob Devlin, Rabih Zbib, Zhongqiang Huang, Thomas Lamar, Richard Schwartz, and John Makhoul. ACL, 2014.
42. From image descriptions to visual denotations: New similarity metrics for semantic inference over event descriptions.
Peter Young Alice Lai Micah Hodosh and Julia Hockenmaier. TACL, 2014.
43. Very deep convolutional networks for large-scale image recognition.
Karen Simonyan and Andrew Zisserman. arXiv preprint arXiv:1409.1556, 2014.
44. Rich feature hierarchies for accurate object detection and semantic segmentation.
Ross Girshick, Jeff Donahue, Trevor Darrell, and Jitendra Malik. CVPR, 2014.
45. A neural probabilistic language model.
Yoshua Bengio, Réjean Ducharme, Pascal Vincent, and Christian Janvin. JMLR, 2003.
46. Microsoft coco: Common objects in context.
Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollár, and C Lawrence Zitnick. arXiv preprint arXiv:1405.0312, 2014.
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minumum 40 characters