arXiv Computation and Language

TopiCLEAR: Adaptive embedding clustering for interpretable topic discovery from short texts

TopiCLEAR is a framework that clusters document or sentence embeddings using adaptive dimensionality reduction to uncover low‑dimensional geometric structures that correspond to human‑interpretable topics. The method is evaluated on four benchmark datasets, showing strong agreement with human annotations, especially for short and informal texts. A Twitter case study demonstrates that TopiCLEAR yields more interpretable topics than LDA, recovering both annotated topic structure and coherent sub‑topics.

arXiv Computation and Language
Sep 10

Beyond Top Words: MonoTM for Topic Modeling with Interpretable Monosemantic Features

MonoTM is an interpretable topic modeling framework that separates the estimation of document–topic mixtures from the generation of topic descriptors. It uses sparse autoencoders to extract dense, interpretable features for mixture estimation, then learns topic descriptors from a distinct set of corpus‑grounded semantic features. This approach preserves global topic structure while providing more meaningful, semantic‑unit descriptors than traditional top‑word lists.

By Una Joh, Bei Yu
Hugging Face Trending Papers
Aug 19

Comment-level Topic Drift Analysis in the Reddit Corpus

The paper introduces a new method that uses embedding-based dynamic topic modeling to detect and measure topic drift at the comment level in a large dataset. By applying pretrained language models to generate contextualized embeddings for 12.7 billion Reddit comments from 2006 to 2022, the authors identify evolving topic clusters over time using unsupervised techniques. Their approach includes scalable modifications to existing methods and a null model comparison test, revealing that politically and socially contentious topics show significant directional drift, while areas like music and sports remain relatively stable.

arXiv Machine Learning
Aug 20

BERTilda: Explainable Topic Lifecycle Tracking with Split/Merge Detection via Similarity-and-Flow Temporal Graphs

BERTilda is an explainable framework for tracking topic lifecycles in longitudinal text streams. It discovers topics independently in each time window using an embedding‑based topic model, then links topics across adjacent windows via a temporal graph that uses both semantic similarity and a bidirectional coverage signal derived from tweet‑to‑topic attribution. The graph‑based rules identify continuations, splits, merges, disappearances, and unclear transitions, and the method achieves up to 87% agreement with human annotators on a gold‑standard subset.

By Cl\'audia Oliveira, \'Alvaro Figueira
arXiv Computation and Language
Sep 7

PROMPT2BOX:Improving LLM Weakness Discovery and Specificity Estimation by Uncovering Entailment Structure among Prompts

The paper introduces Prompt2Box, a method that embeds prompts into a box embedding space to capture both semantic similarity and specificity relations, addressing the limitation of traditional vector embeddings that conflate topical similarity with specificity. Using a trained encoder on existing and synthesized datasets, Prompt2Box achieves significant improvements, reducing specificity prediction error by 45% over a prompt-length baseline and identifying 13.5% more LLM weaknesses in hierarchical clustering compared to vector baselines. The authors also present a novel dimension‑reduction technique for visualizing and comparing box embeddings, and provide the code on GitHub.

By Neeladri Bhuiya, Shib Sankar Dasgupta, Andrew McCallum, Haw-Shiuan Chang