BITEM at the NTCIR-19 R2C2 Task: Predicting Confidence from Agentic RAG Pipeline Signals
New in Retrieval-augmented generation; no direction yet. Retrieval-augmented generation
Abstract (arXiv)
The BITEM team entered both subtasks of the NTCIR-19 R2C2 task with a single agentic pipeline, in which a model searches, reads and records evidence over a movie corpus while an orchestrator holds the record and rules on what may be submitted. A claim is admitted only once an entailment cascade has checked it against the passage it cites, and an answer is released only once enough checked evidence stands behind it. Each question is run three or four times, every pass retrieving from a corpus stripped of what the earlier passes have already seen. The confidence filed with each answer is computed by the orchestrator from what the run leaves behind and is never asked of the model, which is offered no way to rate itself. The two retrieval runs placed 4th and 5th of 22, pooling the passes was worth 0.0709 nDCG@20, and the gain was largest on the multi-hop and post-processing-heavy questions, where the organisers rank the pooled run top of the field. Sixteen of the 25 answer runs were built on passages these two runs supplied, 12 of them filed by other teams. HMR rewards a system whose confidence is high where it answers right and low where it answers wrong. The pipeline reached an accuracy of 0.9219, 6th of 25, while the confidence filed with those answers gave an HMR of 0.4915, 13th. A few rules crafted over those same recorded signals, with no further model call and no further retrieval, raise that to an accuracy of 0.9375, 5th, and an HMR of 0.6985, 9th. Ranking on HMR alone can reward a system for answering wrongly with low confidence, so we propose accHMR, the accuracy multiplied by HMR, which reports the reward in proportion to the accuracy, and on which the revised rules would have scored 0.6549, 5th. For future work, fitting a model on the numbers the pipeline already produces, rather than writing such rules by hand, would be a real step forward.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 23 references that are in the map. First posted on arXiv 29 Sep 2026.
Builds on
10 of 23 references.
References · 10
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2022Language Models (Mostly) Know What They Knowcited by 1,856
- 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,254
- 2023Can LLMs Express Their Uncertainty? An Empirical Evaluation of Confidence Elicitation in LLMscited by 974
- 2019Passage Re-ranking with BERTcited by 645
- 2023Evaluating Verifiability in Generative Search Enginescited by 303
- 2024Nomic Embed: Training a Reproducible Long Context Text Embeddercited by 265
- 2024Benchmarking Uncertainty Quantification Methods for Large Language Models with LM-Polygraphcited by 105
- 2024Sufficient Context: A New Lens on Retrieval Augmented Generation Systemscited by 72
- 2026Beyond Parallel Sampling: Diverse Query Initialization for Agentic Searchcited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Evaluating Confidence-Gated Retrieval with Matched Trajectory Replay
- 2026When Confidence Takes the Wrong Path: Diagnosing Retrieval-State Lock-In in RAG
- 2026Reliable Post-Retrieval Assembly for Agent Memory: Separating Evidence Extraction from Policy Execution
- 2026AgenticRAGTracer: A Hop-Aware Benchmark for Diagnosing Multi-Step Retrieval Reasoning in Agentic RAG
- 2026DualStake: Dual-Path Confidence Calibration in Deep Research Agents
- 2026BELIEFRAG: Making Adaptive RAG State-Aware under Evolving Evidence
- 2026Contract Memory Compiler: Resolve, Then Traverse
- 2026AILS-NTUA at SemEval-2026 Task 8: Evaluating Multi-Turn RAG Conversations