DOCSLIB.ORG

A Multi-Resolution Word Embedding for Document Retrieval from Large Unstructured Knowledge Bases

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Multi-Resolution Word Embedding for Document Retrieval from Large Unstructured Knowledge Bases A Multi-Resolution Word Embedding for Document Retrieval from Large Unstructured Knowledge Bases Tolgahan Cakaloglu 1 Xiaowei Xu 2 Abstract neural attention based question answering models, Yu et al. (2018), it is natural to break the task of answering a question Deep language models learning a hierarchical into two subtasks as suggested in Chen et al.(2017): representation proved to be a powerful tool for natural language processing, text mining and in- • formation retrieval. However, representations Retrieval: Retrieval of the document most likely to that perform well for retrieval must capture se- contain all the information to answer the question cor- mantic meaning at different levels of abstraction rectly. or context-scopes. In this paper, we propose a • Extraction: Utilizing one of the above question- new method to generate multi-resolution word answering models to extract the answer to the question embeddings that represent documents at multi- from the retrieved document. ple resolutions in terms of context-scopes. In order to investigate its performance,we use the In our case, we use a collection of unstructured natural lan- Stanford Question Answering Dataset (SQuAD) guage documents as our knowledge base and try to answer and the Question Answering by Search And the questions without knowing to which documents they cor- Reading (QUASAR) in an open-domain question- respond. Note that we do not benchmark the quality of the answering setting, where the first task is to find extraction phase; therefore, we do not study extracting the documents useful for answering a given ques- answer from the retrieved document but rather compare the tion. To this end, we first compare the qual- quality of retrieval methods and the feasibility of learning ity of various text-embedding methods for re- specialized neural models for retrieval purposes. Due to the trieval performance and give an extensive em- complexity of natural languages, optimal word embedding, pirical comparison with the performance of var- that represents natural language documents in a semantic ious non-augmented base embeddings with and vector space, is crucial for document retrieval. Traditional without multi-resolution representation. We argue word embedding methods learn hierarchical representations that multi-resolution word embeddings are con- of documents where each layer gives a representation that sistently superior to the original counterparts and is a high-level abstraction of the representation from a pre- deep residual neural models specifically trained vious layer. Most word embedding methods only use either for retrieval purposes can yield further significant the highest layer like Word2Vec by Mikolov et al.(2013), or gains when they are used for augmenting those an aggregated representation from the last few layers, such embeddings. as ELMo by Peters et al.(2018) as the representation for arXiv:1902.00663v7 [cs.IR] 22 May 2019 information retrieval. In this paper, we present a new word embedding approach called multi-resolution word embed- 1. Introduction ding that consists of two steps as shown in Figure1. In The goal of open domain question answering is to answer the first step, we form a mixture of weighted representa- questions posed in natural language, using a collection of tions across the whole hierarchy of a given word embedding unstructured natural language documents such as Wikipedia. model, so that all resolutions of the hierarchical representa- Given the recent successes of increasingly sophisticated tion are preserved for the next step. As the second step, we combine all mixture representations from various models 1Department of Computer Science, University of Arkansas, as an ensemble representation for the document retrieval Little Rock, Arkansas, United States 2Department of Informa- task. The proposed word embedding takes advantage of tion Science, University of Arkansas, Little Rock, Arkansas, multi-resolution power of individual word embedding mod- United States. Correspondence to: Tolgahan Cakaloglu <tx- [email protected]>. els, where each model is trained with a complementary strength due to the diversity of models and corpora. Taking Copyright 2019 by the author(s). the example of ”··· java ··· ” in Figure1, different level of A Multi-Resolution Word Embedding for Document Retrieval from Large Unstructured Knowledge Bases representation of ”java” including word level (word sense) 2. Related work and concept level (abstract meaning like coffee, island, and programming) are aggregated to form a mixture of represen- In order to express the importance of a word or a token to tations. In the second step, all these mixture representations a document in a document collection, a numerical statistic from different word embedding models are aggregated to is used in information retrieval. The TF-IDF, by Salton & form an ensemble representation, which takes advantage of McGill(1986), stands for term frequency-inverse document the complementary strength of individual models and cor- frequency which is proposed to calculate a weighting factor pora. Consequently, our multi-resolution word embedding in searches of information retrieval, text mining, and user delivers the power of multi-resolution with the strength of modeling. Parallel to the advances in the field, new methods individual models. that are intended to understand the natural language, are get- ting proposed. One of the major contributions is called word As another contribution of the paper, we improve the qual- embedding. There are various types of word embedding in ity of the target document retrieval task by introducing a the literature that is well covered by Perone et al.(2018). convolutional residual retrieval network (ConvRR) over the The influential Word2Vec by Mikolov et al.(2013) is one embedding vectors. The proposed ConvRR model further of the first popular approaches of word embedding based improves the retrieval performance by employing triplet on neural networks that are built upon the guiding work by learning with (semi-)hard negative mining on the target cor- Bengio et al.(2003) on the neural language model for dis- pus. tributed word representations. This type of implementation is able to conserve semantic relationships between words and their context; or in other terms, surrounding neighboring words. Two different approaches are proposed in Word2Vec to compute word representations. One of the approaches is called Skip-gram that predicts surrounding words, given a target word. The other approach is called Continuous Bag-of-Words that predicts target word, using a bag-of- words context. Global Vectors (GloVe) by Pennington et al. (2014), aims to reduce some limitations of Word2Vec by focusing on the global context instead of surrounding words for learning the representations. The global context is cal- culated by utilizing the word co-occurrences in a corpus. During this calculation, a count-based approach is func- tioned, unlike the prediction-based method in Word2Vec. On the other hand, fastText, by Mikolov et al.(2018), is also announced recently. It is based on the same principles as others that focus on extracting word embedding from a large corpus. fastText is very similar to Word2Vec except they train high-quality word vector representations by using Figure 1. The illustration of multi-resolution word embedding a combination of known tricks that are, however, rarely used method using an example of ”··· java ··· ” together, which accelerates fastText to learn representations more efficiently. Our paper is structured as follows: First, we start with a The important question still remains on extracting high- review of recent advances in text embedding in Section quality and more meaningful representations—how to seize 2. In Section3 we describe the details of our approach. the semantic, syntactic and the different meanings in differ- More specifically, we describe our multi-resolution word ent context—embedding from Language Models (ELMo),by embedding followed by an introduction of a specific deep Peters et al.(2018), is newly-proposed in order to tackle residual retrieval model that is used to augment text, using that question. ELMo extracts representations from a bi- the proposed word embedding model for document retrieval. directional Long Short Term Memory (LSTM),by Hochre- We present an empirical study and compare the proposed iter & Schmidhuber(1997), that is trained with a language method to the baselines that utilize non-augmented word model (LM) objective on a very large text corpus. ELMo embedding models. In Section4, we provide a detailed de- representations are a function of the internal layers of the scription of our experiments, including datasets, evaluation bi-directional Language Model (biLM) that outputs good metrics, and an implementation. Then, results are reported and diverse representations about the words/token (a con- in Section5. The paper is concluded with some future work volutional neural network over characters). ELMo is also in Section6. incorporating character n-grams, as in fastText, but there A Multi-Resolution Word Embedding for Document Retrieval from Large Unstructured Knowledge Bases are some constitutional differences between ELMo and its to lose the meaning and the knowledge of the pre-trained predecessors. Likewise, BERT, by Devlin et al.(2018), is multi-resolution embedding but make some adjustments on a method of pre-training language representations that is its knowledge with a limited additional training data. A final trained,using
Load more

Recommended publications
  • Ranked List Loss for Deep Metric Learning
    IEEE TRANSACTIONS ON PATTERN ANALYSIS & MACHINE INTELLIGENCE, VOL. XX, NO. XX, MONTH 20XX 1 Ranked List Loss for Deep Metric Learning Xinshao Wang1;2; , Yang Hua1; , Elyor Kodirov, and Neil M. Robertson1, Senior Member, IEEE Abstract—The objective of deep metric learning (DML) is to learn embeddings that can capture semantic similarity and dissimilarity information among data points. Existing pairwise or tripletwise loss functions used in DML are known to suffer from slow convergence due to a large proportion of trivial pairs or triplets as the model improves. To improve this, ranking-motivated structured losses are proposed recently to incorporate multiple examples and exploit the structured information among them. They converge faster and achieve state-of-the-art performance. In this work, we unveil two limitations of existing ranking-motivated structured losses and propose a novel ranked list loss to solve both of them. First, given a query, only a fraction of data points is incorporated to build the similarity structure. Consequently, some useful examples are ignored and the structure is less informative. To address this, we propose to build a set-based similarity structure by exploiting all instances in the gallery. The learning setting can be interpreted as few-shot retrieval: given a mini-batch, every example is iteratively used as a query, and the rest ones compose the gallery to search, i.e., the support set in few-shot setting. The rest examples are split into a positive set and a negative set. For every mini-batch, the learning objective of ranked list loss is to make the query closer to the positive set than to the negative set by a margin.
    [Show full text]
  • The Group Loss for Deep Metric Learning
    The Group Loss for Deep Metric Learning Ismail Elezi1, Sebastiano Vascon1, Alessandro Torcinovich1, Marcello Pelillo1, and Laura Leal-Taix´e2 1 Ca' Foscari University of Venice 2 Technical University of Munich Abstract. Deep metric learning has yielded impressive results in tasks such as clustering and image retrieval by leveraging neural networks to obtain highly discriminative feature embeddings, which can be used to group samples into different classes. Much research has been devoted to the design of smart loss functions or data mining strategies for training such networks. Most methods consider only pairs or triplets of samples within a mini-batch to compute the loss function, which is commonly based on the distance between embeddings. We propose Group Loss, a loss function based on a differentiable label-propagation method that enforces embedding similarity across all samples of a group while promot- ing, at the same time, low-density regions amongst data points belonging to different groups. Guided by the smoothness assumption that \similar objects should belong to the same group", the proposed loss trains the neural network for a classification task, enforcing a consistent labelling amongst samples within a class. We show state-of-the-art results on clus- tering and image retrieval on several datasets, and show the potential of our method when combined with other techniques such as ensembles. To facilitate further research, we make available the code and the models at https://github.com/dvl-tum/group_loss. Keywords: Deep Metric Learning, Image Retrieval, Image Clustering 1 Introduction Measuring object similarity is at the core of many important machine learning problems like clustering and object retrieval.
    [Show full text]
  • Accelerating Deep Metric Learning Via Cross Sample Similarities Transfer
    DarkRank: Accelerating Deep Metric Learning via Cross Sample Similarities Transfer Yuntao Chen1;5 Naiyan Wang2 Zhaoxiang Zhang1;3;4;5;∗ 1Research Center for Brain-inspired Intelligence, CASIA 2TuSimple 3National Laboratory of Pattern Recognition, CASIA 4Center for Excellence in Brain Science and Intelligence Technology, CAS 5University of Chinese Academy of Sciences fchenyuntao2016, [email protected] [email protected] Abstract it requires (more than) real-time responses. This constraint prevents us from benefiting from the latest developments in We have witnessed rapid evolution of deep neural network architecture design in the past years. These latest progresses network design. greatly facilitate the developments in various areas such as To mitigate this problem, many model acceleration met- computer vision and natural language processing. However, al- hods have been proposed. They can be roughly categori- ong with the extraordinary performance, these state-of-the-art zed into three types: network pruning(LeCun, Denker, and models also bring in expensive computational cost. Directly Solla 1989; Han et al. 2015), model quantization(Hubara deploying these models into applications with real-time re- et al. 2016; Rastegari et al. 2016) and knowledge trans- quirement is still infeasible. Recently, Hinton et al. (Hinton, fer(Zagoruyko and Komodakis 2017; Romero et al. 2015; Vinyals, and Dean 2014) have shown that the dark knowledge Hinton, Vinyals, and Dean 2014). Network pruning iterati- within a powerful teacher model can significantly help the vely removes the neurons or weights that are less important to training of a smaller and faster student network. These know- ledge are vastly beneficial to improve the generalization ability the final prediction; model quantization decreases the repre- of the student model.
    [Show full text]
  • Arxiv:2003.08505V3 [Cs.CV] 16 Sep 2020
    A Metric Learning Reality Check Kevin Musgrave1, Serge Belongie1, Ser-Nam Lim2 1Cornell Tech 2Facebook AI Abstract. Deep metric learning papers from the past four years have consistently claimed great advances in accuracy, often more than dou- bling the performance of decade-old methods. In this paper, we take a closer look at the field to see if this is actually true. We find flaws in the experimental methodology of numerous metric learning papers, and show that the actual improvements over time have been marginal at best. Code is available at github.com/KevinMusgrave/powerful-benchmarker. Keywords: Deep metric learning 1 Metric Learning Overview 1.1 Why metric learning is important Metric learning attempts to map data to an embedding space, where similar data are close together and dissimilar data are far apart. In general, this can be achieved by means of embedding and classification losses. Embedding losses operate on the relationships between samples in a batch, while classification losses include a weight matrix that transforms the embedding space into a vector of class logits. In cases where a classification loss is applicable, why are embeddings used during test time, instead of the logits or the subsequent softmax values? Typ- ically, embeddings are preferred when the task is some variant of information retrieval, where the goal is to return data that is most similar to a query. An ex- ample of this is image search, where the input is a query image, and the output is the most visually similar images in a database. Open-set classification is a vari- ant of this, where test set and training set classes are disjoint.
    [Show full text]
  • Deep Metric Learning to Rank
    Deep Metric Learning to Rank Fatih Cakir∗1, Kun He∗2, Xide Xia2, Brian Kulis2, and Stan Sclaroff2 1FirstFuel, [email protected] 2Boston University, fhekun,xidexia,bkulis,[email protected] Abstract FastAP We propose a novel deep metric learning method by re- visiting the learning to rank approach. Our method, named FastAP, optimizes the rank-based Average Precision mea- 2 (n ) pairs sure, using an approximation derived from distance quan- tization. FastAP has a low complexity compared to exist- ing methods, and is tailored for stochastic gradient descent. To fully exploit the benefits of the ranking formulation, we 3 also propose a new minibatch sampling scheme, as well as (n ) triplets a simple heuristic to enable large-batch training. On three few-shot image retrieval datasets, FastAP consistently out- performs competing methods, which often involve complex optimization heuristics or costly model ensembles. Figure 1: We propose FastAP, a novel deep metric learning method that optimizes Average Precision over ranked lists 1. Introduction of examples. This solution avoids a high-order explosion of the training set, which is a common problem in existing Metric learning [3, 18] is concerned with learning dis- losses defined on pairs or triplets. FastAP is optimized using tance functions that conform to a certain definition of simi- SGD, and achieves state-of-the-art results. larity. Often, in pattern recognition problems, the definition of similarity is task-specific, and the success of metric learn- has two primary advantages over many other approaches: ing hinges on aligning its learning objectives with the task. we avoid the high-order explosion of the training set, and In this paper, we focus on what is arguably the most im- focus on orderings that are invariant to distance distortions.
    [Show full text]
  • Deep Metric Learning with Spherical Embedding
    Deep Metric Learning with Spherical Embedding Dingyi Zhang1, Yingming Li1∗, Zhongfei Zhang2 1College of Information Science & Electronic Engineering, Zhejiang University, China 2Department of Computer Science, Binghamton University, USA {dyzhang, yingming}@zju.edu.cn, [email protected] Abstract Deep metric learning has attracted much attention in recent years, due to seamlessly combining the distance metric learning and deep neural network. Many endeavors are devoted to design different pair-based angular loss functions, which decouple the magnitude and direction information for embedding vectors and ensure the training and testing measure consistency. However, these traditional angular losses cannot guarantee that all the sample embeddings are on the surface of the same hypersphere during the training stage, which would result in unstable gradient in batch optimization and may influence the quick convergence of the embedding learning. In this paper, we first investigate the effect of the embedding norm for deep metric learning with angular distance, and then propose a spherical embedding constraint (SEC) to regularize the distribution of the norms. SEC adaptively adjusts the embeddings to fall on the same hypersphere and performs more balanced direction update. Extensive experiments on deep metric learning, face recognition, and contrastive self-supervised learning show that the SEC-based angular space learning strategy significantly improves the performance of the state-of-the-art. 1 Introduction The objective of distance metric learning is to learn an embedding space where semantically similar instances are encouraged to be closer than semantically different instances [1, 2]. In recent years, with the development of deep learning, deep metric learning (DML) demonstrates evident improvements by employing a neural network as the embedding mapping.
    [Show full text]