English
Related papers

Related papers: Low-dimensional Embeddings for Interpretable Ancho…

200 papers

In topic modeling, many algorithms that guarantee identifiability of the topics have been developed under the premise that there exist anchor words -- i.e., words that only appear (with positive probability) in one topic. Follow-up work has…

Machine Learning · Statistics 2016-11-16 Kejun Huang , Xiao Fu , Nicholas D. Sidiropoulos

Separable Non-negative Matrix Factorization (SNMF) is an important method for topic modeling, where "separable" assumes every topic contains at least one anchor word, defined as a word that has non-zero probability only on that topic. SNMF…

Information Retrieval · Computer Science 2019-05-16 Kun He , Wu Wang , Xiaosen Wang , John E. Hopcroft

Interpretability benefits the theoretical understanding of representations. Existing word embeddings are generally dense representations. Hence, the meaning of latent dimensions is difficult to interpret. This makes word embeddings like a…

Computation and Language · Computer Science 2023-06-27 Minxue Xia , Hao Zhu

The formalism of anchor words has enabled the development of fast topic modeling algorithms with provable guarantees. In this paper, we introduce a protocol that allows users to interact with anchor words to build customized and…

Information Retrieval · Computer Science 2019-07-12 Sanjoy Dasgupta , Stefanos Poulis , Christopher Tosh

Neural embeddings are a popular set of methods for representing words, phrases or text as a low dimensional vector (typically 50-500 dimensions). However, it is difficult to interpret these dimensions in a meaningful manner, and creating…

Computation and Language · Computer Science 2018-01-10 Neil R. Smalheiser , Gary Bonifield

Learning a high-dimensional dense representation for vocabulary terms, also known as a word embedding, has recently attracted much attention in natural language processing and information retrieval tasks. The embedding vectors are typically…

Information Retrieval · Computer Science 2017-07-18 Hamed Zamani , W. Bruce Croft

Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…

Computational Geometry · Computer Science 2017-06-16 Robert Graham , Adam M. Oberman

Anchors (Ribeiro et al., 2018) is a post-hoc, rule-based interpretability method. For text data, it proposes to explain a decision by highlighting a small set of words (an anchor) such that the model to explain has similar outputs when they…

Machine Learning · Statistics 2025-10-22 Gianluigi Lopardo , Frederic Precioso , Damien Garreau

Correlated topic modeling has been limited to small model and problem sizes due to their high computational cost and poor scaling. In this paper, we propose a new model which learns compact topic embeddings and captures topic correlations…

Machine Learning · Computer Science 2017-07-04 Junxian He , Zhiting Hu , Taylor Berg-Kirkpatrick , Ying Huang , Eric P. Xing

Learning continuous representations of discrete objects such as text, users, movies, and URLs lies at the heart of many applications including language and user modeling. When using discrete objects as input to neural networks, we often…

Machine Learning · Computer Science 2021-03-12 Paul Pu Liang , Manzil Zaheer , Yuan Wang , Amr Ahmed

The rapidly growing ecosystem of Large Language Models (LLMs) makes it increasingly challenging to manage and utilize the vast and dynamic pool of models effectively. We propose LOCUS, a method that produces low-dimensional vector…

Machine Learning · Computer Science 2026-01-30 Shivam Patel , William Cocke , Gauri Joshi

In many scenarios, the interpretability of machine learning models is a highly required but difficult task. To explain the individual predictions of such models, local model-agnostic approaches have been proposed. However, the process…

Machine Learning · Statistics 2025-10-22 Gianluigi Lopardo , Frederic Precioso , Damien Garreau

We investigate the problem of inducing word embeddings that are tailored for a particular bilexical relation. Our learning algorithm takes an existing lexical vector space and compresses it such that the resulting word embeddings are good…

Computation and Language · Computer Science 2015-04-13 Pranava Swaroop Madhyastha , Xavier Carreras , Ariadna Quattoni

Embedding spaces contain interpretable dimensions indicating gender, formality in style, or even object properties. This has been observed multiple times. Such interpretable dimensions are becoming valuable tools in different areas of…

Computation and Language · Computer Science 2024-04-04 Katrin Erk , Marianna Apidianaki

In this paper, we introduce a novel interpreting framework that learns an interpretable model based on an ontology-based sampling technique to explain agnostic prediction models. Different from existing approaches, our algorithm considers…

Machine Learning · Computer Science 2020-04-02 Phung Lai , NhatHai Phan , Han Hu , Anuja Badeti , David Newman , Dejing Dou

Anchors is a popular local model-agnostic explanation technique whose applicability is limited by its computational inefficiency. To address this limitation, we propose a memorization-based framework that accelerates Anchors while…

Machine Learning · Computer Science 2026-01-29 Haonan Yu , Junhao Liu , Xin Zhang

Word embeddings are useful for a wide variety of tasks, but they lack interpretability. By rotating word spaces, interpretable dimensions can be identified while preserving the information contained in the embeddings without any loss. In…

Computation and Language · Computer Science 2019-09-16 Philipp Dufter , Hinrich Schütze

Word embedding models offer continuous vector representations that can capture rich contextual semantics based on their word co-occurrence patterns. While these word vectors can provide very effective features used in many NLP tasks such as…

Computation and Language · Computer Science 2017-02-27 Cem Safak Sahin , Rajmonda S. Caceres , Brandon Oselio , William M. Campbell

The objective of ordinal embedding is to find a Euclidean representation of a set of abstract items, using only answers to triplet comparisons of the form "Is item $i$ closer to the item $j$ or item $k$?". In recent years, numerous…

Machine Learning · Computer Science 2021-10-22 Leena Chennuru Vankadara , Siavash Haghiri , Michael Lohaus , Faiz Ul Wahab , Ulrike von Luxburg

Large collections of high-dimensional data have become nearly ubiquitous across many academic fields and application domains, ranging from biology to the humanities. Since working directly with high-dimensional data poses challenges, the…

‹ Prev 1 2 3 10 Next ›