Skip to content

Hierarchical Group-Conditional Conformal Risk Control for Selective Prediction in Language Models

Jul 2026 · arXiv.org · Vol abs/2607.24562 · 1 citation · 16 references
Computer Science

TL;DR

Hierarchical Group-Conditional CRC (Hierarchical Group-Conditional CRC), a post-hoc calibration framework enforcing simultaneous risk guarantees across all nodes of a user-defined group hierarchy, reaches an empirical 0% violation rate and WGER=0 on ARC Challenge for high-accuracy models.

Abstract

Large language models serve heterogeneous populations structured by domain, topic difficulty, and linguistic style. Conformal risk control (CRC) gives rigorous marginal risk guarantees for selective prediction with abstention, but marginal guarantees do not imply per-group ones: a model can meet the population budget while systematically over-exposing subgroups to errors. Under mild shift in group composition, standard CRC violates the budget in up to 47% of trials. We propose HG-CRC (Hierarchical Group-Conditional CRC), a post-hoc calibration framework enforcing simultaneous risk guarantees across all nodes of a user-defined group hierarchy. It applies a Bonferroni correction over nodes and a leaf-first policy that uses the most specific applicable threshold, falling back to coarser nodes when a finer one is uncertified or rejects the example. It needs only a held-out calibration set, with no retraining. We evaluate on three models (Qwen3-4B, Llama-3.1-8B-Instruct, Gemma-3-4B) and two benchmarks (ARC Challenge, MMLU-Pro) across eight configurations probing IID generalization, heterogeneity, mixture/domain/prompt/difficulty shift, label noise, and quantization. Main result: HG-CRC reaches an empirical 0% violation rate and WGER=0 on ARC Challenge for high-accuracy models (Qwen3-4B, Llama-3.1-8B). At 500 bootstrap trials these zeros are empirical upper bounds (true rate up to 0.6%), not certified. Results are benchmark-specific: on MMLU-Pro these models abstain entirely or (Llama) retain WGER=0.014. Gemma-3-4B, poorly calibrated here, degrades gracefully by abstaining. Participation cost vs. global CRC is 22 to 37 points. Ablations show hierarchical depth clears the budget: removing difficulty level returns violations to about 11%. Bonferroni is needed for the theoretical guarantee, though its empirical effect matters only with many nodes.

View source

Similar papers

#machine learning Preprint Sep 2026

Risk-Conditioned Fine-Tuning of Large Language Models

Large Language Models (LLMs) are increasingly deployed in settings where rare but severe harmful generations can have significant consequences. Existing Risk-Averse RLHF addresses this issue by optimizing Conditional Value-at-Risk (CVaR), but it trains policies for fixed risk levels and therefore cannot adjust the desi...

Zi-Xuan Liu, Fangzheng Wu, Brian Summa et al. · 0 citations
Review Open access Aug 2026

Uncertainty-aware large language models: a scoping review of conformal prediction methods.

A comprehensive review and analysis of conformal prediction for LLMs is presented and a novel taxonomy that categorises existing methods into six groups is proposed, suggesting that conformal methods for LVLMs exhibit a stronger coverage-informativeness trade-off than those for LLMs.

Alice E. Ashby, Khuong An Nguyen, Zhi-Yuan Luo · 1 citation
#machine learning Preprint Aug 2026

GUPO: Gradient Uncertainty-aware Policy Optimization for Post-Training Large Language Models

Gradient Uncertainty-Aware Policy Optimization is proposed, which models each group gradient as a random variable under a Bayesian formulation and estimates its probability distribution and derives gradient uncertainty using a Dirichlet-based formulation and uses it to calibrate the contribution of each group gradient...

Peizheng Guo, Jian-Qi Zhang, Xing-Yu Zhang et al. · 0 citations
#artificial intelligence Preprint Oct 2026

CreateScore: Domain-Theory-Informed Bayesian Routing for LLM-Based CV Screening

Large language models (LLMs) can support rubric-based screening of CVs, but applying a high-capability model to every candidate and criterion is costly. We present CreateScore, a domain-theory-informed Bayesian network for criterion-level LLM routing. A hand-specified directed acyclic graph with Dirichlet-multinomial c...

Rupsa Roy · 0 citations
#machine learning Preprint Sep 2026

Hierarchical Utility Calibration for Structured Multiclass Decisions

In multiclass probabilistic prediction, Utility Calibration (UC), which focuses auditing on specified utilities, has recently received attention as a way to guarantee downstream decisions while controlling computational and sample requirements. At the same time, some multiclass problems have meaningful label hierarchie...

Futoshi Futami, Jerry M. Huang, Ichiro Takeuchi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.