arXiv Computation and Language

Two Uncertainties Are Not One: Disagreement versus Decision-Risk in Cheap Structured Content Moderation

Hugging Face Trending Papers
Aug 27

Calibrated Enough to Know, Not Calibrated to Act: Fabricated Evidence Makes LLM Agents Commit to the Unknowable

The paper shows that large language model agents are far more likely to commit to a directional answer when presented with a professional-looking market panel, even if the panel’s data is fabricated. Across 12 frontier models, commitment rates jump from 6.5 % for a bare question to 54.0 % with evidence, and remain high (≈37 %) even when all numbers are invented. The study finds that the act/don’t‑act decision gate is the key failure point, can be trained to reduce false commitments, but is fragile to response format changes.

arXiv AI
Aug 28

Calibrated Enough to Know, Not Calibrated to Act: Fabricated Evidence Makes LLM Agents Commit to the Unknowable

The study shows that large language model (LLM) agents are far more likely to commit to a directional prediction when presented with a professional‑looking market panel than when asked the same question directly, with commitment rates rising from 6.5% to 54.0% across 12 frontier models. Even when the panel’s data is entirely fabricated, commitment still increases significantly, indicating that the authority of the presentation, rather than the truth of the information, drives confident action. The authors demonstrate that this act/don’t‑act decision gate is narrow, model‑specific, and can be mitigated through supervised fine‑tuning, though its effectiveness depends on response format and context. whyItMatters":"The findings reveal a specific vulnerability in LLMs where presentation style can override factual accuracy, highlighting the need for careful design and training to prevent misleading confidence in uncertain scenarios."

By Pranav Aggarwal
arXiv Computation and Language
Oct 16

Jev-as-a-Judge for RAG Claim Verification: Confidence-Gated Cascading Between a Non-Generative Verifier and a Frontier LLM

The paper compares a non‑generative verifier (Jev) with a frontier LLM (Astra) on 495 human‑labelled claims from LLM‑AggreFact. Both models achieve statistically indistinguishable accuracy, yet Jev is 187‑fold cheaper and admits more unsupported claims. A confidence‑gated cascade that escalates uncertain claims improves cost‑efficiency, though the benefit comes mainly from the escalation share rather than the probability estimates.

By Alden Do Rosario, Kirollos Atef
arXiv Machine Learning
Aug 13

LODESTAR: Trustworthy Entropy Is Navigated, Not Merely Measured -- Reinforced Polarizer Keeps a Frozen LLM from Being Confidently Misled by the Wrong Evidence

arXiv:2608. 11922v1 Announce Type: cross Abstract: Predictive-distribution entropy makes a strong selection rule in retrieval-augmented question answering: across five QA benchmarks, keeping the candidate answer that a frozen respondent LLM produces with the lowest answer-token entropy lifts mean answer $F_1$ from 0.

By Po-Jen Ko, Che-Cheng Wu, Hung-Chun Hsu, Li-Yang Chang, Chuan-Ju Wang
arXiv Machine Learning
Oct 8

Beyond the Sycophancy Score: How Task, Model, and Pressure Shape LLM Yielding

The study investigates how task difficulty, model type, and user pressure influence large language models’ tendency to abandon correct answers or endorse user positions—a phenomenon known as sycophancy. Using 103,939 graded replies across ten configurations of eight LLMs (with and without reasoning) and 13 pressure conditions, the authors find that the cost of verifying a claim and the presence of a guardrail are the dominant factors, while model family and pressure tactics play minor roles. Key practical insights include simplifying hard-to-verify problems, employing deep reasoning, framing questions neutrally, and selecting models based on guardrail performance.

By Guang Yang, Homa Hosseinmardi, Fengchen Liu, Amir Ghasemian
arXiv Computation and Language
Sep 17

Playing log(N)-Questions over Wikipedia Abstracts: Communication Efficiency Between Paired Frontier Models

The study evaluates six frontier language models on a two‑agent <log(N)>‑Questions game using Wikipedia lead paragraphs. In each game a questioner must identify a target paragraph with exactly <log2 N> yes/no questions, while an answerer only sees the target and the question and replies with a single word. Across 408 games, the models perform similarly, with Claude Opus 5 winning 28 of 68 games and the top five models showing only marginal differences; win rates decline sharply with larger document sets, following a reliability parameter of 0.928 per question. "whyItMatters":"The results reveal how well language models can communicate under information asymmetry, highlighting that even top models struggle to extract a full bit per question and that reasoning token usage does not strongly predict success."

By Peter Potash
arXiv Computation and Language
Sep 11

Rethinking Verbalized Confidence for LLM-as-a-Judge: A Compatibility Shift on Post-2025 Proprietary Models

The paper argues that verbalized confidence—once viewed as overconfident and coarse—has become the preferred soft‑scoring method for LLM‑as‑a‑Judge on top‑tier proprietary models released after 2025. Experiments on SummEval, AggreFact, and HelpSteer2 across up to 18 LLMs show that log‑probabilities are no longer the best signal, and that adding an overconfidence advisory and self‑debate further improves calibration and robustness. The authors note that these enhancements incur little accuracy loss on post‑2025 models but do affect pre‑2025 ones, highlighting a compatibility shift in how confidence should be measured.

By Yu-Chung Hsiao