@inproceedings{kim-dieng-2026-vendi,
title = "Vendi Clustering for Diversity-Preserving Topic Reduction",
author = "Kim, Sean and
Dieng, Adji Bousso",
editor = "Lee, Hung-Yi and
Dev, Sunipa and
Li, Jessy and
Elliott, Desmond",
booktitle = "Findings of the {A}ssociation for {C}omputational {L}inguistics: {EMNLP} 2026",
month = oct,
year = "2026",
address = "Budapest, Hungary",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2026.findings-emnlp.1364/",
pages = "28964--28980",
ISBN = "979-8-89176-462-0",
abstract = "Embedding-based topic models such as BERTopic routinely produce hundreds of fine-grained, overlapping topics that must be reduced before downstream use. Existing approaches couple reduction with outlier rejection, rely on local geometric linkage, or use costly and stochastic LLM prompting. We introduce Vendi Clustering (VC), a topic reduction method that reframes the problem as global diversity-preserving compression: at each step, VC selects the merge that induces the smallest loss in the Vendi Score, a spectral measure of diversity. A naive implementation of this global criterion is prohibitive at $O(n^6)$; we derive algebraic update rules at order $q = 2$ that evaluate each candidate merge in $O(1)$ via cached row-square sums and a lookahead Gram matrix, reducing total complexity to a tractable $O(n^3)$. On 20 Newsgroups and AG News, VC outperforms standard reduction baselines on coherence and diversity, surpasses LLM-prompted reduction on the majority of metrics against both an open-weight model and a frontier API model, with topic diversity gains of up to 35{\%} while running over $40 \times$ faster."
}<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="kim-dieng-2026-vendi">
<titleInfo>
<title>Vendi Clustering for Diversity-Preserving Topic Reduction</title>
</titleInfo>
<name type="personal">
<namePart type="given">Sean</namePart>
<namePart type="family">Kim</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Adji</namePart>
<namePart type="given">Bousso</namePart>
<namePart type="family">Dieng</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2026-10</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Findings of the Association for Computational Linguistics: EMNLP 2026</title>
</titleInfo>
<name type="personal">
<namePart type="given">Hung-Yi</namePart>
<namePart type="family">Lee</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Sunipa</namePart>
<namePart type="family">Dev</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Jessy</namePart>
<namePart type="family">Li</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Desmond</namePart>
<namePart type="family">Elliott</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Budapest, Hungary</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
<identifier type="isbn">979-8-89176-462-0</identifier>
</relatedItem>
<abstract>Embedding-based topic models such as BERTopic routinely produce hundreds of fine-grained, overlapping topics that must be reduced before downstream use. Existing approaches couple reduction with outlier rejection, rely on local geometric linkage, or use costly and stochastic LLM prompting. We introduce Vendi Clustering (VC), a topic reduction method that reframes the problem as global diversity-preserving compression: at each step, VC selects the merge that induces the smallest loss in the Vendi Score, a spectral measure of diversity. A naive implementation of this global criterion is prohibitive at O(n⁶); we derive algebraic update rules at order q = 2 that evaluate each candidate merge in O(1) via cached row-square sums and a lookahead Gram matrix, reducing total complexity to a tractable O(n³). On 20 Newsgroups and AG News, VC outperforms standard reduction baselines on coherence and diversity, surpasses LLM-prompted reduction on the majority of metrics against both an open-weight model and a frontier API model, with topic diversity gains of up to 35% while running over 40 \times faster.</abstract>
<identifier type="citekey">kim-dieng-2026-vendi</identifier>
<location>
<url>https://aclanthology.org/2026.findings-emnlp.1364/</url>
</location>
<part>
<date>2026-10</date>
<extent unit="page">
<start>28964</start>
<end>28980</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Vendi Clustering for Diversity-Preserving Topic Reduction
%A Kim, Sean
%A Dieng, Adji Bousso
%Y Lee, Hung-Yi
%Y Dev, Sunipa
%Y Li, Jessy
%Y Elliott, Desmond
%S Findings of the Association for Computational Linguistics: EMNLP 2026
%D 2026
%8 October
%I Association for Computational Linguistics
%C Budapest, Hungary
%@ 979-8-89176-462-0
%F kim-dieng-2026-vendi
%X Embedding-based topic models such as BERTopic routinely produce hundreds of fine-grained, overlapping topics that must be reduced before downstream use. Existing approaches couple reduction with outlier rejection, rely on local geometric linkage, or use costly and stochastic LLM prompting. We introduce Vendi Clustering (VC), a topic reduction method that reframes the problem as global diversity-preserving compression: at each step, VC selects the merge that induces the smallest loss in the Vendi Score, a spectral measure of diversity. A naive implementation of this global criterion is prohibitive at O(n⁶); we derive algebraic update rules at order q = 2 that evaluate each candidate merge in O(1) via cached row-square sums and a lookahead Gram matrix, reducing total complexity to a tractable O(n³). On 20 Newsgroups and AG News, VC outperforms standard reduction baselines on coherence and diversity, surpasses LLM-prompted reduction on the majority of metrics against both an open-weight model and a frontier API model, with topic diversity gains of up to 35% while running over 40 \times faster.
%U https://aclanthology.org/2026.findings-emnlp.1364/
%P 28964-28980
Markdown (Informal)
[Vendi Clustering for Diversity-Preserving Topic Reduction](https://aclanthology.org/2026.findings-emnlp.1364/) (Kim & Dieng, Findings 2026)
ACL