Search: “truthfulqa”

When Should LLMs Abstain? Chain-of-Self-Questioning for Selective Risk Control

Chain-of-Self-Questioning prompting cuts LLM wrong-answer commitments 32% relative while raising answered accuracy, holding across eleven model families.

The paper introduces Chain-of-Self-Questioning (CoSQ), a prompt-only framework that makes LLM answer commitment conditional on an explicit assessment of the information required to answer. On an 817-item TruthfulQA multiple-choice set, Grounded-CoSQ at τ=0.90 reduced mean unconditional wrong-commitment rate from 13.1% under chain-of-thought to 8.9% (a 32.1% relative reduction), while raising answered accuracy from 86.9% to 89.7% at 87.6% coverage. Improvements held across eleven open-weight and hosted model families and at every evaluated threshold, with convergent evidence from a Natural Questions short-answer evaluation.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:52 UTC · 1d agoAI research

WearableQA: A Benchmark for Health Reasoning over Real-World Wearable Data

WearableQA benchmark introduces 4,084 questions over real longitudinal wearable data, showing 14 LLMs score 19.6-72.9% on health reasoning, far from solved.

WearableQA is a benchmark of 4,084 10-option multiple-choice questions built from wearable time series, blood biomarkers, and demographics of 200 real users with up to 500 days of daily measurements. It defines 16 question types along two axes: data versus health reasoning, and single- versus cross-signal reasoning, using a dual-grounding framework combining literature and population-validated patterns. Evaluations of 14 proprietary and open-source LLMs show accuracy ranging from 19.6% to 72.9% against a 10% chance baseline, with most models below 60%.

Hugging Face daily papers·Sep 3, 20:00 UTC · 13d agoAI research

WearableQA: A Benchmark for Health Reasoning over Real-World Wearable Data

WearableQA benchmark tests LLM health reasoning over longitudinal wearable data; the best of 14 evaluated LLMs reaches 72.9% accuracy.

WearableQA comprises 4,084 ten-option multiple-choice questions built from wearable time series, blood biomarkers, and demographics of 200 real users with up to 500 days of daily measurements. It defines 16 question types along two axes: data versus health reasoning, and single- versus cross-signal reasoning. Evaluation of 14 proprietary and open-source LLMs shows performance from 19.6% to 72.9% against a 10% chance baseline, with most models below 60%.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:52 UTC · 12d agoAI research

HyQuant: Hybrid-Precision Quantization for LLM Attention

HyQuant keeps most LLM attention states low-bit while preserving vertical-line tokens and local windows in high precision, maintaining near-lossless accuracy.

HyQuant is a hybrid-precision quantization framework for LLM attention that quantizes most attention states to low bits while keeping accuracy-critical vertical-line tokens and local-window states in full precision, selected via lightweight attention-pattern signals. In the prefill stage it uses a hybrid-precision attention operator, and in the decode stage it applies the same principle to KV-cache compression with fused dequantization and attention computation. Across diverse tasks, models, and datasets it maintains nearly lossless accuracy; code is available on GitHub.

Hugging Face daily papers·Aug 27, 20:00 UTC · 20d agoAI tools & infra1

A new open standard locks AI weights to approved hardware

OPAQUE releases Weight Custody Manifest, an open standard keeping AI model weights encrypted until receiving hardware cryptographically attests to builder-specified conditions.

OPAQUE, a confidential computing company, released the Weight Custody Manifest (WCM) standard as a developer-preview specification with a Python SDK and a public test suite of 91 cases. WCM keeps model weights encrypted until the receiving infrastructure proves via CPU/GPU attestation that it matches builder-signed conditions, and decryption access can be revoked later if conditions change. OPAQUE says it ran the attestation exchange on an NVIDIA H100 and on AMD and Intel confidential servers hosted on Azure and Google Cloud, with two independent SDK builds producing identical output across 5,948 files. The public quickstart only exercises protocol logic on synthetic evidence and skips GPU cryptographic verification, and the standard cannot distinguish an authorized key from one physically extracted from hardware.

Help Net Security·Sep 10, 04:10 UTC · 6d agoAI safety & security

Benchmarking Qwen3.8 27B quantizations: 4-bit holds up, 1-bit collapses

Quesma benchmarks Qwen3.8 27B quantizations: 4-bit Q4_K_M matches BF16 on key benchmarks while 1-bit collapses to random chance.

Quesma spent roughly $3,000 on Modal GPUs testing Unsloth GGUF quantizations of Qwen3.8 27B across GPQA Diamond, IFBench, and Terminal-Bench 2.1. The 17 GB Q4_K_M quantization matched the 55 GB BF16 model on Terminal-Bench 2.1 and showed little degradation down to 4-bit, while the 2-bit UD-Q2_K_XL dropped noticeably. At 1-bit, scores on GPQA Diamond fell to random-guess levels, with longer reasoning making results worse, and reasoning effort settings significantly affected outcomes.

Hacker News · AI·Sep 8, 14:49 UTC · 8d agoAI researchHN 56↑ · 30 comments1

Accountability in Certificate Transparency and Variants

Formal Dolev-Yao analysis shows plain Certificate Transparency requires an honest log, SCT Auditing removes that assumption, and Gossiping does not.

The paper analyzes accountability in Certificate Transparency and its SCT Auditing and Gossiping extensions in the Dolev-Yao model, starting from a vanilla PKI. It finds plain CT provides accountability only under the assumption of an honest log. The SCT Auditing extension can eliminate that assumption, while the Gossiping extension cannot. CT is supported by all major browsers and obliges Certificate Authorities to record issued certificates in public, monitored logs.

arXiv cs.CR·Sep 10, 13:45 UTC · 6d agoResearch

Approval Integrity and Recovery in LLM Answer Publication

Study measures approval integrity in Lightcap LLM answer publication, finding the 14B response-act checker accepts 291 of 302 unsupported answers.

The study evaluates exact-content binding, authorization freshness, and checkpoint recovery in Lightcap's publication enforcement using 3,600 assessments over 900 human-annotated RAGTruth responses from three Ministral models. The production 14B response-act checker accepts 291 of 302 unsupported answers versus 41 for a direct-grounding baseline, with supported-answer retention of 95.2% versus 66.9%. A stateful recheck-recovery policy increases exact-match error by 9.23 percentage points relative to initial checkpoints, and controlled evidence-fingerprint changes expose asymmetric freshness enforcement between publication and recovery. A separate BIPIA prompt-injection experiment records zero target insertions among 266 valid editor outputs.

arXiv cs.CR·Sep 14, 13:48 UTC · 2d agoAI safety & security

Atlas: Efficient Verifiable Semantic Search

Atlas delivers zero-knowledge proofs for HNSW semantic search, verifying RAG retrieval in under a second on SIFT1M and 2.0 seconds at 100M vectors.

Atlas lets a search provider prove that a query was answered correctly against a committed HNSW index without revealing the index, addressing provider deviations like truncation or bias. It combines offline preprocessing, a fixed-size-state restructuring of HNSW with a correctness proof, and timestep-tagged batching of per-step arguments. The system proves queries in under a second on SIFT1M and 2.0 seconds at 100 million vectors while preserving plaintext HNSW recall, and proven retrieval maintains end-to-end RAG answer quality at lower cost than prior verifiable retrieval systems.

arXiv cs.CR·Sep 10, 17:30 UTC · 6d agoResearch1

You've Got a BUD in Me: Authenticated Reads from Per-Block Write Logs

Researchers propose BUD, per-block write-log digests enabling blockchain validators to serve historical membership and exclusion proofs far cheaper than state-wide tries.

The paper introduces Block Update Digests (BUD), which authenticate each block's write log with predecessor pointers, plus a SuperBUD and exponential hierarchy to turn long unchanged intervals into short proofs. Soundness against adversarial provers and up to f Byzantine validators is proven under archive, attestation, and committee evidence assumptions. Benchmarks show a 50x state-size increase raises the base-BUD path only 1.24x versus 3.1x for in-memory and 69.5x for disk-backed Merkle Patricia tries, with read payloads below 800 bytes and p99 warm verification at 146 microseconds.

arXiv cs.CR·Sep 10, 08:46 UTC · 6d agoResearch

Quantization-Aware Healing: a compressed, 4-bit model that outperforms its full-precision original

Multiverse Computing details quantization-aware healing, producing a 4-bit compressed model that reportedly outperforms its full-precision original.

A Hugging Face blog post by Multiverse Computing's CAI team introduces quantization-aware healing for compressed models. The post claims the resulting 4-bit model outperforms the original full-precision model. No additional details or benchmarks were available in the provided text.

Hugging Face Blog·Aug 25, 11:39 UTC · 22d agoAI research

Keepit AI Truth Cloud protects the data behind enterprise AI

Help Net Security·Aug 7, 00:00 UTC · Aug 7, 2026AI tools & infra

Safety for Whom? Boundary-Aware Self-Distillation for Controlled LLM Safety Refusal

A self-distillation safety framework tunes narrow-boundary refusals in Qwen3-8B, raising target-domain refusal to 84.75% while cutting over-refusal from 15.20% to 5.20%.

The paper formulates narrow-boundary safety, where deployments need refusals within specific topics rather than whole subjects, and proposes an offline self-generated framework with controlled topic generation, escalating retries, and harmful-benign boundary pairs. On political persuasion with Qwen3-8B, the method raised target-domain refusal from 9.47% to 84.75% and cut the mean unsafe-response rate across three broader benchmarks from 26.26% to 0.14%. Verified target-model responses reduced over-refusal from 15.20% to 5.20%, and boundary-pair data cut comply-side over-refusal on held-out pairs from 32.94% to 4.16%. Results show data composition controls the safety-usability trade-off and alignment should be evaluated on both sides of the refusal boundary.

Hugging Face daily papers·Sep 2, 20:00 UTC · 14d agoAI safety & security1

Nuha-Speech: Building General-Purpose Arabic Speech-LLMs

Nuha-Speech initiative builds general-purpose Arabic speech-LLMs using a 1.5M-sample speech QA corpus and fine-tuned Qwen-Omni variants.

The paper introduces Nuha-Speech, an initiative covering dataset construction, model training, and evaluation for Arabic speech large language models. The authors built an Arabic Speech Question-Answering corpus of over 1.5 million training samples and used it for supervised fine-tuning of Qwen-Omni model variants at multiple scales. A tailored evaluation framework with diverse tasks and metrics is designed to assess Arabic speech capabilities under limited resource constraints.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:50 UTC · 6d agoAI research1

Safety for Whom? Refusing the Right Subset of a Topic, Not the Whole Topic

Multiverse Computing's Hugging Face post argues language models should refuse only the relevant subset of a topic instead of over-refusing whole subjects.

A Hugging Face blog post by Multiverse Computing examines refusal granularity in language models, arguing models should refuse the relevant subset of a topic rather than the entire topic. No full article text was available for additional technical detail.

Hugging Face Blog·Sep 8, 14:23 UTC · 8d agoAI safety & security

Verifiable by Construction: Claim-Level Evaluation of Verbatim Citation in Clinical Question Answering

Evaluation of twelve LLMs on 222 clinical questions shows verbatim quotes rarely substantiate claims; claude-opus-5 fully substantiates only 37.1%.

The authors build a standardized harness over four clinical practice guidelines and evaluate twelve LLMs on 222 synthetic clinical questions, measuring citation attachment, verbatim quote production, and claim substantiation. Most models attach verbatim quotes to over 90% of claims from prompting alone, though lightweight models like claude-haiku-4.5 struggle. Quotes frequently fail to substantiate claims: claude-opus-5 quotes 98.0% of claims but fully substantiates only 37.1%, exposing a capability gap for verifiable clinical QA.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 17:53 UTC · 2d agoAI research

unsloth/Qwen3.8-Flash-Next-GGUF — new model trending #21 on Hugging Face

Qwen released Qwen3.8-Flash-Next, an experimental 125B-parameter open-weight MoE previewing the Qwen4 architecture, with Unsloth shipping optimized GGUF quants.

Qwen released Qwen3.8-Flash-Next, an experimental open-weight preview of the architecture planned to underpin Qwen4. The model has 125B parameters with 6B activated, 512 experts (10 routed plus 1 shared), Qwen Sparse Attention (QSA), Gated DeltaNet, Gated Residual, and n-gram embeddings, with 262,144-token native context extendable to 1,000,000 tokens. Unsloth provides Dynamic 3.0 GGUF quantizations, and multi-token prediction (MTP) delivers 1.3-1.7x faster inference via llama.cpp or Unsloth Desktop.

Hugging Face trending models·Aug 26, 12:29 UTC · 21d agoModel release1

Future-Proofing the Internet: Akamai Achieves End-to-End PQC

Akamai says it achieved end-to-end post-quantum cryptography across its network to future-proof internet traffic.

Akamai announced it has achieved end-to-end post-quantum cryptography (PQC) across its services. The company frames the move as future-proofing the internet against quantum decryption threats. No article text was available; details are limited to the announcement title.

Akamai Blog·Aug 19, 08:00 UTC · 28d agoIndustry

Ambient @ EgoLongQA 2026: Distilling Long-Video perception into a Sub-2B Model

Ambient team wins EgoLongQA 2026 sub-2B division by distilling an agentic long-video perception pipeline into a 2B vision-language model.

Ambient's entry to the EgoLongQA track of the Wearable-AI Challenge at ECCV 2026 placed first in the <=2B parameter division with 0.8279 on the held-out test set. The system distills the junior perception module of a tool-using agentic pipeline into a 2B student, reaching 89% of the pipeline's accuracy with 1.1% of its parameters and lifting a 27.1% base model to 81.4%. To meet the division limit, the multilingual embedding table is pruned from 248,320 to 143,469 rows, reaching 1.9985B parameters with provably identical logits on retained rows.

Hugging Face daily papers·Sep 9, 20:00 UTC · 7d agoAI research

Don't Send What You Don't Need: Question-Guided Token Pruning as a Privacy Defense for Vision-Language Models

QPriv-VL prunes privacy-sensitive visual tokens in federated/split VQA, cutting membership-inference success on VQA-RAD from 0.99 to 0.76-0.79 using ~40% of tokens.

The paper proposes QPriv-VL, a question-guided token-pruning framework for federated, split, and U-shaped split learning that suppresses privacy-sensitive visual patches before transmission. Its Dynamic Threshold Predictor combines cross-modal question relevance with frozen DINOv2-derived sensitivity to compute a per-sample pruning ratio and retention mask in one forward pass, without sensitivity labels. Evaluated on GQA, OK-VQA, VQAv2, SLAKE, VQA-RAD, and PathVQA against FSHA, FORA, iDLG, and attribute-inference membership inference attacks, it matches or beats fixed-ratio pruning. On VQA-RAD it reduces membership-inference success from 0.99 to 0.76-0.79 while preserving competitive accuracy with about 40% of the original token budget.

arXiv cs.CR·Sep 14, 14:48 UTC · 2d agoResearch

18 ways to check whether data can be trusted for AI

ETSI published TR 104 180 defining 18 data quality metrics, including fairness and privacy, to assess whether datasets are fit for AI.

ETSI's technical report TR 104 180 defines 18 metrics across four groups - intrinsic quality, usability and lineage, fairness, and privacy - each with calculation formulas, plus an open-source tool that scores datasets. Testing on an aircraft engine sensor dataset and a US census dataset revealed a roughly threefold gender gap in high earners (about 31% of men versus 11% of women) and two privacy failures: re-identification via age, race, sex, and country, and sensitive fields stored in plaintext. The working group included Sejong University, EGM, TTA, Daejeon University, and CNIT.

Help Net Security·Sep 7, 00:00 UTC · 9d agoAI policy

Tables Decoded: DELTA for Structure, TARQA for Understanding

DELTA extracts tables into compact OTSL text and TARQA fine-tunes LLMs on it, beating VLM baselines on table QA.

DELTA separates physical structure recognition, logical structure recognition, and OCR to output tables in Optimised Table Structure Language (OTSL), a compact unified format encoding cell arrangements and content. It achieves TEDS-Structure scores comparable to state-of-the-art methods across FinTabNet, PubTabNet, and PubTables-1M, with robustness tested on a curated Hindi benchmark, TORQUE. TARQA, an LLM fine-tuned on OTSL sequences, gains 9.3 percentage points on WTQ TabQA and 9.2 points on FinTabNetQA TabVQA; code, models, and the benchmark are released on GitHub.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 16:59 UTC · 1d agoAI research

How Hugging Face Inference Endpoints, Jobs, and Buckets Power Search on Papers with Code

Hugging Face explains how Inference Endpoints, Jobs, and Buckets power semantic search on Papers with Code.

Hugging Face describes the infrastructure behind search on Papers with Code, built on its Inference Endpoints, Jobs, and Buckets services. The post is a product-focused engineering walkthrough with no security impact.

Hugging Face Blog·Aug 21, 00:00 UTC · 26d agoAI tools & infra

E2A-Bench: Benchmarking Evidence-to-Action Reliability in Financial Chart Reasoning

E2A-Bench, a 969-query financial chart reasoning benchmark, finds VLMs fail evidence-to-action consistency, with fine-tuning amplifying BUY:SELL bias 4-6x.

E2A-Bench is a 969-query benchmark built from 323 HS300 constituents across three input modalities with deterministic OHLCV-derived evidence anchors, evaluating grounding, reasoning-action consistency, evidence-confidence calibration, and directional coverage via UCR, RCI, ECI, and NDR metrics. Testing 20 VLMs showed the lowest-hallucination model ranked near the bottom on coverage with only 6.4% directional coverage, and oracle-aided verification reduced unsupported claims but could collapse coverage. Financial fine-tuning amplified the BUY:SELL ratio by factors of 4.21 to 4.68 across base-fine-tuned pairs.

Hugging Face daily papers·Sep 12, 20:00 UTC · 4d agoAI research

An Empirical Analysis of CodeQL False Positives and Query Refinements for Java Vulnerabilities

Study of 167 Java CVE instances finds CodeQL false positives follow recurring patterns; query refinements remove 81.8% of reviewed ones.

Researchers ran CodeQL's Java security query suite on 167 CVE instances from 110 projects, manually reviewing 500 sampled false-positive paths and building a five-category taxonomy led by Missed Path Constraint or Sanitization (36.6%), Benign Execution Context (29.4%), and Missing Trust Boundary Modeling (27.6%). Guided by the taxonomy, query-level refinements removed 81.8% of reviewed false positives and 15.8% of reported paths across the selected queries while retaining 7 of 8 true positives. To address generalization, agentic coding tools given the refinement patterns as templates adapted them to new projects successfully in 56% and 62% of tasks, versus 28% without guidance.

arXiv cs.CR·Sep 3, 22:48 UTC · 12d agoResearch1

CertiFlash: A Formal Verification Framework for Flash Translation Layers in Computational Solid State Drives

CertiFlash provides machine-checked formal verification of SSD flash translation layers, proving isolation, integrity, and ownership invariants to prevent tenant data leaks.

CertiFlash is an open-source formal verification framework for Flash Translation Layers (FTL) in computational SSDs, mechanized in the Rocq proof assistant. It shows that a faulty FTL can corrupt device state at five surfaces (e.g., leaking data between tenants or dropping integrity tags), demonstrated on a DaisyPlus OpenSSD. Designers prove once that every operation of a general FTL model preserves a global invariant covering mapping, isolation, integrity, ownership, and allocation; new designs need only discharge five hypotheses. Across four case studies, added effort was 27-3,231 lines against a 16,489-line framework.

arXiv cs.CR·Sep 9, 15:44 UTC · 7d agoResearch1

K-Bench: a clinically calibrated benchmark for evaluating large language models in high-risk mental health conversations

Clinician-calibrated K-Bench evaluates 125 LLM configurations on 200 high-risk mental health vignettes, exposing wide variation in suicide and violence risk handling.

K-Bench is a clinician-calibrated, protected benchmark evaluating 125 model configurations from 33 base models across 14 providers on 200 multi-turn vignettes covering suicide, self-harm, domestic violence, substance misuse and no-risk presentations. A frozen GPT-4o judge achieved 94.2% exact agreement with clinician consensus across 6,751 eligible comparisons from 151 clinician-rated transcripts. Leading models combined supportive conversation with combined-risk scores above 95, while risk exploration varied substantially among weaker configurations; therapeutic prompting helped weaker models and elevated reasoning produced no average improvement. A continuously updated public leaderboard is hosted at k-bench.ai with protected test materials.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 16:49 UTC · 2d agoAI safety & security

HuggingFace: Security.txt

Hugging Face published a security.txt file, prompting limited Hacker News discussion of the RFC 9116 disclosure standard.

Hugging Face's security.txt file, which lists its security contact and disclosure channels per the RFC 9116 standard, drew attention on Hacker News. The RFC 9116 standard lets organizations publish where and how security researchers should report issues, but the submission received only one comment.

Hacker News · security·updated Sep 11, 16:04 UTC · 5d ago·first Sep 11, 14:38 UTC · 5d agoIndustry 2 sourcesHN 22↑ · 1 comments

Sound Debloating of Redundant Checks in Zero-Knowledge Machine-Learning Circuits

Automated framework soundly removes up to 48.7% of redundant constraints in ezkl and zkml ZK-ML circuits, cutting prover time by up to 72.8%.

The framework uses whole-circuit abstract interpretation and a provenance graph to verify that each removed redundant check (range proofs, sign lookups, bit decompositions) remains entailed by the rest of the circuit, provably preserving soundness. It was evaluated on MLP, CNN, RNN, and transformer circuits generated by ezkl and zkml, with up to 25.3 million constraints. It removes up to 48.7% of constraints and reduces prover time by up to 72.8% without weakening security. Under-constrained circuits in deployed ZK systems have previously enabled attackers to forge transactions and bypass verification.

arXiv cs.CR·Sep 9, 13:27 UTC · 7d agoResearch1

Knowing What Not to Answer: Selective Non-Compliance in Vision-Language Models

Researchers introduce KoNA, a benchmark exposing vision-language models' failures at selective non-compliance, plus fine-tuning that improves refusal and abstention accuracy.

KoNA is a benchmark for evaluating selective non-compliance in vision-language models across five categories: False Premise, Visual Inaccessibility, Universal Unknown, Task Feasibility and Safety. It tests both query-level and component-level non-compliance using paired single and compound queries, and evaluations across diverse VLMs show models often fail to refuse, correct or abstain appropriately, with failures worsening on compound queries. Fine-tuning VLMs on KoNA examples substantially improves non-compliance accuracy while largely maintaining performance on fully answerable tasks.

Hugging Face daily papers·Sep 3, 20:00 UTC · 13d agoAI research1