Hierarchical Optimal Transport for Document Representation
The ability to measure similarity between documents enables intelligent summarization and analysis of large corpora. Past distances between documents suffer from either an inability to incorporate semantic similarities between words or from scalability issues. As an alternative, we introduce hierarchical optimal transport as a meta-distance between documents, where documents are modeled as distributions over topics, which themselves are modeled as distributions over words. We then solve an optimal transport problem on the smaller topic space to compute a similarity score. We give conditions on the topics under which this construction defines a distance, and we relate it to the word mover's distance. We evaluate our technique for k-NN classification and show better interpretability and scalability with comparable performance to current methods at a fraction of the cost.
Code (1)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
HOTTER: Hierarchical Optimal Topic Transport with Explanatory Context Representations
Natural language processing (NLP) is often the backbone of today’s systems for user interactions, information retrieval and others. Many of such NLP applications rely on specialized learned representations (e.g. neural w…
Information RetrievalLanguage ModellingRetrievalTopic Models+1TLDW: Extreme Multimodal Summarisation of News Videos
Multimodal summarisation with multimodal output is drawing increasing attention due to the rapid growth of multimedia data. While several methods have been proposed to summarise visual-text contents, their multimodal out…
SentenceString Diagram of Optimal Transports
We present a novel hierarchical framework for optimal transport (OT) using string diagrams, namely string diagrams of optimal transports. This framework reduces complex hierarchical OT problems to standard OT problems, a…
Hierarchical Optimal Transport for Robust Multi-View Learning
Traditional multi-view learning methods often rely on two assumptions: ($i$) the samples in different views are well-aligned, and ($ii$) their representations in latent space obey the same distribution. Unfortunately, th…
ClusteringMULTI-VIEW LEARNINGOTLDA: A Geometry-aware Optimal Transport Approach for Topic Modeling
We present an optimal transport framework for learning topics from textual data. While the celebrated Latent Dirichlet allocation (LDA) topic model and its variants have been applied to many disciplines, they mainly focu…