Challenge: Large language models (LLMs) have enabled impressive progress across a range of language tasks, but they are steep computational cost.
Approach: They propose a semantic consensus mechanism for reliable deferral by combining model outputs with semantic consensus.
Outcome: Evaluated from 500M to 70B-parameter models, semantic cascades improve deferral accuracy, match or surpass target-model quality at 40% of the cost and reduce latency by up to 60%.

Similar Papers

Harnessing Consistency for Robust Test-Time LLM Ensemble (2026.findings-eacl)

Copied to clipboard

Challenge: Existing efforts to improve LLM ensemble quality have focused on model consistency, but failures are often due to heterogeneous tokenization schemes and varying model expertise.
Approach: They propose a plug-and-play technique that harnesses model consistency for robust LLM ensemble.
Outcome: The proposed technique improves ensemble performance and robustness against erroneous signals.
Integrate the Essence and Eliminate the Dross: Fine-Grained Self-Consistency for Free-Form Language Generation (2024.acl-long)

Copied to clipboard

Challenge: Existing methods to improve output quality without aggregating input tokens are limited by the complexity of aggregation of responses.
Approach: They propose to extract and integrate segment-level commonalities from candidate samples to enhance performance of LLMs in open-ended and reasoning tasks.
Outcome: The proposed method improves performance on reasoning, code generation and mathematical reasoning tasks without requiring additional models and overlooking the knowledge present among the candidates.
Have Your Text and Use It Too! End-to-End Neural Data-to-Text Generation with Semantic Fidelity (2020.coling-main)

Copied to clipboard

Challenge: End-to-end neural data-totext generation has faced challenges generalizing to new domains and generating semantically consistent text.
Approach: They propose a neural data-to-text generation system that makes minimal assumptions about the data representation and target domain.
Outcome: The proposed system achieves state of the art results on four major D2T datasets with better semantic fidelity than the state-of-the-art methods.
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.
LLM-Guided Semantic Bootstrapping for Interpretable Text Classification with Tsetlin Machines (2026.findings-acl)

Copied to clipboard

Challenge: Pretrained language models (PLMs) provide strong semantic representations but are costly and opaque.
Approach: They propose a framework that transfers pretrained language models into symbolic form and integrates them into symbolic models.
Outcome: The proposed framework improves interpretability and accuracy across multiple text classification tasks while remaining fully symbolic and efficient.
DIVKNOWQA: Assessing the Reasoning Ability of LLMs via Open-Domain Question Answering over Knowledge Base and Text (2024.findings-naacl)

Copied to clipboard

Challenge: Retrievalaugmented LLMs have been used to ground LLM in external knowledge . a gap exists in the current landscape regarding the effectiveness of grounding LLM on heterogeneous knowledge sources.
Approach: They propose a model that uses symbolic language to generate symbolic queries . they use a dataset that is generated using predefined reasoning chains and human annotation .
Outcome: The proposed model outperforms previous approaches by a significant margin in QA tasks over text.
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.
Harmonizing Diverse Models: A Layer-wise Merging Strategy for Consistent Generation (2025.emnlp-industry)

Copied to clipboard

Challenge: RAG systems often generate inconsistent outputs for semantically equivalent inputs . this unpredictability undermines the reliability of RAG and poses challenges for adoption in high-stakes or knowledge-sensitive domains such as finance, healthcare, and scientific research.
Approach: They propose a method that integrates knowledge from specialized models into a single model to improve output consistency.
Outcome: The proposed model significantly improves output consistency, achieving approximately 47.5% improvement in response similarity over baseline.
FedProxy: Federated Fine-Tuning of LLMs via Proxy SLMs and Heterogeneity-Aware Fusion (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for fine-tuning Large Language Models (LLMs) suffer from a performance bottleneck . Existing approaches like Offsite-Tuning (OT) secure the LLMs IP .
Approach: They propose a framework that replaces weak adapters with a unified, powerful Proxy Small Language Model (SLM) they propose 'resource-friendly' compression and 'robust optimization' to handle data heterogeneity.
Outcome: Experiments show that FedProxy outperforms OT and centralized fine-tuning methods.
When Models Hesitate: Answer Instability as a Label-Free Uncertainty Signal for LLMs (2026.acl-srw)

Copied to clipboard

Challenge: Existing approaches to uncertainty estimation typically require access to internals, additional supervision, or computationally intensive pipelines.
Approach: They propose to use a label-free uncertainty signal to predict the variability of a model's final answer across repeated stochastic generations of the same prompt to achieve performance competitive with semantic entropy.
Outcome: The proposed method achieves performance competitive with semantic entropy while requiring no similarity model.

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