🤖 AI Summary
To address semantic redundancy in large language model (LLM) inference-time computation scaling, this paper proposes an external-model-free implicit semantic clustering method. The approach constructs a lightweight, context-aware semantic similarity metric directly from intermediate hidden states of the generator LLM, and integrates dynamic thresholding with hierarchical clustering for end-to-end semantic consistency modeling. Its core contribution lies in the first use of LLM internal hidden representations—without any auxiliary embedding models or post-hoc modules—as the sole basis for semantic clustering. Evaluated across multiple LLMs and diverse benchmark tasks, the method achieves an average 2.3× reduction in inference-time computational cost while matching or surpassing state-of-the-art methods in both clustering accuracy and uncertainty calibration.
📝 Abstract
Scaling test-time computation--generating and analyzing multiple or sequential outputs for a single input--has become a promising strategy for improving the reliability and quality of large language models (LLMs), as evidenced by advances in uncertainty quantification and multi-step reasoning. A key shared component is semantic clustering, which groups outputs that differ in form but convey the same meaning. Semantic clustering enables estimation of the distribution over the semantics of outputs and helps avoid redundant exploration of reasoning paths. However, existing approaches typically rely on external models, which introduce substantial computational overhead and often fail to capture context-aware semantics. We propose Latent Semantic Clustering (LSC), a lightweight and context-sensitive method that leverages the generator LLM's internal hidden states for clustering, eliminating the need for external models. Our extensive experiment across various LLMs and datasets shows that LSC significantly improves the computational efficiency of test-time scaling while maintaining or exceeding the performance of existing methods.