Efficient Latent Semantic Clustering for Scaling Test-Time Computation of LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for scaling test-time computation rely on external models that introduce substantial computational overhead and fail to capture context-aware semantics. |
| Approach: | They propose a method that leverages the generator LLM’s internal hidden states for clustering, eliminating the need for external models. |
| Outcome: | The proposed method improves the computational efficiency of test-time scaling while maintaining or exceeding the performance of existing methods. |
Similar Papers
Semantic Token Clustering for Efficient Uncertainty Quantification in Large Language Models (2026.eacl-short)
Copied to clipboard
| Challenge: | Large language models have limited truthfulness and tendency toward overconfidence constrain reliability in factual tasks. |
| Approach: | They propose an efficient method that leverages semantic information encoded in LLMs to quantify uncertainty. |
| Outcome: | The proposed method achieves comparable performance to baselines while significantly reducing computational overhead. |
AGSC: Adaptive Granularity and Semantic Clustering for Uncertainty Quantification in Long-text Generation (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for aggregating large-form outputs overlook the nuance of neutral information and suffer from the high computational cost of fine-grained decomposition. |
| Approach: | They propose a UQ framework that uses NLI neutral probabilities as triggers to distinguish irrelevance from uncertainty, reducing computation costs. |
| Outcome: | Experiments on BIO and LongFact show that the proposed framework reduces inference time by 60% compared to full atomic decomposition. |
Faster and Better LLMs via Latency-Aware Test-Time Scaling (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing research has overlooked the efficiency of TTS from a latency-sensitive perspective. |
| Approach: | They propose two approaches to achieve latency-optimal TTS by branch-wise parallelism and sequence-wise parallelism. |
| Outcome: | The proposed approach achieves latency-optimal TTS for large models . branch-wise parallelism and sequence-wise parallelism are key approaches . |
How Large Language Models Encode Context Knowledge? A Layer-Wise Probing Study (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing studies have focused on enhancing the factualness of large language models using context knowledge. |
| Approach: | They propose to use ChatGPT to construct probing datasets that provide diverse and coherent evidence corresponding to various facts. |
| Outcome: | The proposed model can encode knowledge across different layers, and it is compared with existing models. |
S*: Test Time Scaling for Code Generation (2025.findings-emnlp)
Copied to clipboard
Dacheng Li, Shiyi Cao, Chengkun Cao, Xiuyu Li, Shangyin Tan, Kurt Keutzer, Jiarong Xing, Joseph E. Gonzalez, Ion Stoica
| Challenge: | S* is the first hybrid test-time scaling framework that significantly improves the coverage and selection accuracy of generated code. |
| Approach: | They propose a hybrid test-time scaling framework that augments parallel scaling with sequential scaling to further increase the performance. |
| Outcome: | The proposed framework outperforms existing scaling approaches in large-scale modeling and reasoning models. |
Beyond Semantic Entropy: Boosting LLM Uncertainty Quantification with Pairwise Semantic Similarity (2025.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) generate long one-sentence responses that are less effective because they overlook two crucial factors: intra-cluster similarity and inter-c cluster similarity. |
| Approach: | They propose a method that generalizes semantic entropy and uses token probabilities to quantify uncertainty in large language models. |
| Outcome: | The proposed method can be extended to white-box settings by incorporating token probabilities. |
Semantic Accuracy in Natural Language Generation: A Thesis Proposal (2023.acl-srw)
Copied to clipboard
| Challenge: | Using large pre-trained language models, it is essential to research their reliability . if a human does not know the answer to a question, the socially acceptable behavior is to say 'I do not know' failing to fulfill this expectation can lead to distrust, or spread of misinformation. |
| Approach: | They propose a method for evaluating semantic accuracy and a benchmark for NLG metrics. |
| Outcome: | The proposed method evaluates semantic accuracy and provides a benchmark for NLG metrics. |
Out-of-Context Reasoning in Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | a lightweight technique trains only new token embeddings on axioms and evaluates them on unseen tasks. |
| Approach: | They propose a lightweight technique that trains only new token embeddings on axioms . they train only new embeddables and evaluate them on unseen tasks . |
| Outcome: | The proposed technique trains only new token embeddings on axioms and evaluates them on unseen tasks. |
Parallel Test-Time Scaling for Latent Reasoning Models (2026.acl-long)
Copied to clipboard
| Challenge: | Parallel test-time scaling is a pivotal approach for enhancing large language models. |
| Approach: | They propose two uncertainty-inspired stochastic strategies for parallel test-time scaling for latent reasoning models and a Latent Reward Model for aggregation. |
| Outcome: | The proposed model scales well with compute and enables effective trajectory selection. |
Less is More: Improving LLM Reasoning with Minimal Test-Time Intervention (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have focused on test-time scaling to improve reasoning quality but at the cost of efficiency. |
| Approach: | They propose a training-free framework that enhances reasoning accuracy and stability with minimal overhead. |
| Outcome: | The proposed framework yields consistent gains across general, coding, and STEM tasks while remaining highly efficient. |