Can We Trust LLM's Logic? Quantifying Uncertainty, Coherence, and Robustness via a Graph-Based Framework
arXiv:2607.08017v1 Announce Type: new Abstract: Large-Language Models (LLMs) can be prone to flawed and unfaithful reasoning that decoding strategies like Self-Consistency (SC) fail to detect as they…
Read the full articleYou might also wanna read
Comprehensive Survey of Reasoning Failures in Large Language Models
Large Language Models (LLMs) have exhibited remarkable reasoning capabilities, achieving impressive results across a wide range of tasks. De
Metacognition as a Solution to LLM Hallucinations: Expressing Uncertainty Rather Than Answering or Abstaining
Despite significant strides in factual reliability, errors -- often termed hallucinations -- remain a major concern for generative AI, espec
CoT-PoT Ensembling: Efficient LLM Reasoning with Self-Consistency from Just Two Samples
Self-consistency (SC) is a popular technique for improving the reasoning accuracy of large language models by aggregating multiple sampled o
Study Reveals Large Reasoning Models Fail at Complex Problem-Solving Despite Strong Benchmark Performance
Large language models (LLMs) have shown significant progress in reasoning tasks. However, recent studies show that transformers and LLMs fai
LLM-as-a-Verifier: A probabilistic verification framework for scaling LLM correctness assessment
Scaling pre-training, post-training, and test-time compute have become the central paradigms for improving the capabilities of LLMs. In this
LLM-as-a-Verifier: A probabilistic verification framework for scaling LLM correctness assessment
Scaling pre-training, post-training, and test-time compute have become the central paradigms for improving the capabilities of LLMs. In this
Research Reveals Reasoning LLMs Lack Systematic Problem-Solving Capabilities
Large Language Models (LLMs) have demonstrated impressive reasoning abilities through test-time computation (TTC) techniques such as chain-o

Comments
Sign in to join the conversation.
No comments yet. Be the first.