Challenge: Short text clustering has gained significant prominence due to its ubiquity in real-world applications.
Approach: They propose a multi-view alignment strategy with transport-based clustering that integrates structural views to capture multi-granularity semantic features.
Outcome: Experiments show that MAST outperforms state-of-the-art methods on benchmark datasets.

Similar Papers

Improving Hierarchical Text Clustering with LLM-guided Multi-view Cluster Representation (2024.emnlp-industry)

Copied to clipboard

Challenge: a multi-stage approach to hierarchical clustering of interaction drivers in contact centers is proposed . silhouette score and human preference score are improved by 36.7% for top-level clusters compared to standard agglomerative clustering .
Approach: They propose a multi-stage approach that introduces different perspectives or views to improve the quality of hierarchical clustering of interaction drivers in a contact center.
Outcome: The proposed approach improves the quality of generated clusters on public datasets with minimal query time compared to the current state-of-the-art approaches.
Leveraging BERT and TFIDF Features for Short Text Clustering via Alignment-Promoting Co-Training (2024.emnlp-main)

Copied to clipboard

Challenge: Existing clustering methods rely on keyword information, but they lack this information.
Approach: They propose a CO**-**T**raining **C**lustering framework to make use of BERT and TFIDF features.
Outcome: The proposed framework outperforms existing SOTA methods on eight datasets.
Topic Modeling for Short Texts via Optimal Transport-Based Clustering (2025.findings-acl)

Copied to clipboard

Challenge: Existing approaches to topic modeling are based on probabilistic graphical models or non-negative matrix factorization techniques.
Approach: They propose a method that aligns global clusters with topics to discover topics and learn document representations in topic space.
Outcome: The proposed method outperforms state-of-the-art techniques in short-text topic modeling across commonly used metrics.
Contrastive Bootstrapping for Label Refinement (2023.acl-short)

Copied to clipboard

Challenge: Existing methods for fine-grained classification categorize texts into coarse-gritty classes, but they are suboptimal in real-world scenarios.
Approach: They propose a lightweight contrastive clustering-based bootstrapping method to iteratively refine the labels of passages.
Outcome: The proposed method outperforms the state-of-the-art methods by a large margin on NYT and 20News datasets.
Toward Interpretable Semantic Textual Similarity via Optimal Transport-based Contrastive Sentence Learning (2022.acl-long)

Copied to clipboard

Challenge: Existing studies have shown that a pretrained language model can capture sentence similarity but there is no interpretation method for the sentence similarities.
Approach: They propose a pretrained language model that captures sentence similarity between embeddings and a transport-based distance measure that leverages semantically-aligned token pairs.
Outcome: The proposed framework outperforms baselines on both STS and interpretable-STS benchmarks and provides interpretation consistent with human judgement.
STSPL-SSC: Semi-Supervised Few-Shot Short Text Clustering with Semantic text similarity Optimized Pseudo-Labels (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for obtaining task-specific labels require prior knowledge of clustering categories and uncontrollable clustering centers.
Approach: They propose a framework for supervised clustering using a discrete process and a robust Contrastive Learning module.
Outcome: The proposed framework outperforms state-of-the-art models on a real-world dataset with just one label per class . the proposed framework is based on k-means clustering and a robust Contrastive Learning module .
Robust Representation Learning with Reliable Pseudo-labels Generation via Self-Adaptive Optimal Transport for Short Text Clustering (2023.acl-long)

Copied to clipboard

Challenge: Existing approaches to short text clustering are prone to degenerate solutions and noisy data.
Approach: They propose a model to improve robustness against imbalanced and noisy data . they propose self-adaptive optimal transport and class-wise contrastive learning .
Outcome: The proposed model outperforms the state-of-the-art models on eight short text clustering datasets.
Re-Align: Aligning Vision Language Models via Retrieval-Augmented Direct Preference Optimization (2025.emnlp-main)

Copied to clipboard

Challenge: emergence of large Vision Language Models (VLMs) has broadened the capabilities of single-modal Large Language Model (LLM) but VLMs are prone to significant hallucinations, especially in the form of cross-modal inconsistencies.
Approach: They propose a new alignment framework that leverages image retrieval to integrate both textual and visual preference signals.
Outcome: The proposed framework mitigates hallucinations more effectively than previous methods . it maintains robustness and scalability across a wide range of VLM sizes and architectures .
Negative Matters: Multi-Granularity Hard-Negative Synthesis and Anchor-Token-Aware Pooling for Enhanced Text Embeddings (2025.acl-long)

Copied to clipboard

Challenge: Text embedding models are used for various natural language processing tasks such as sentiment analysis, text clustering, and content-based information retrieval.
Approach: They propose a synthesis framework that leverages large language models to generate diverse negative samples with varying levels of similarity with the query.
Outcome: The proposed framework achieves state-of-the-art performance surpassing existing synthesis strategies with synthetic data and when combined with public retrieval datasets.
Following the Autoregressive Nature of LLM Embeddings via Compression and Alignment (2025.emnlp-main)

Copied to clipboard

Challenge: Experimental results demonstrate that our method significantly outperforms traditional contrastive learning approaches when using the same amount of data.
Approach: They propose a new contrastive learning method built on embedding conditional probability distributions that integrates two tasks: information compression and conditional distribution alignment.
Outcome: The proposed method outperforms traditional contrastive learning approaches and achieves comparable performance to state-of-the-art models when using the same amount of data.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations