CalibraRL: Confidence-Calibrated Reinforcement Learning for Mitigating Hallucinations in RAG
Opens the reward-design strand: RL that rewards correct answers, penalizes wrong ones and allows abstention, aimed at RAG hallucinations.
27 items · 5 sources · 13 days
Operational story trace
Follow in this browser to see new updates on your Live feed.
Latest change
A Nov 12 preprint targets batch makespan for agent workloads, RL rollouts included, by coordinating LLM inference with environment execution, the third rollout-scheduling paper in this thread since Oct 27.
This thread is a topical grouping of 27 arXiv preprints since Oct 26, not one event: what they share is reinforcement learning as a post-training method for LLMs and agents. Most of them work on one of three problems: what the reward should measure, how to train multi-turn tool-using agents, and how to pay for the rollouts.
Arc
Opens the reward-design strand: RL that rewards correct answers, penalizes wrong ones and allows abstention, aimed at RAG hallucinations.
Asks when fine-grained credit assignment helps a multimodal tool-using agent and when it does not, using video editing as the test task.
Uses RL to push models toward coupled knowledge acquisition and reasoning in unfamiliar domains, beyond retrieval and aggregation.
Names the calibration gap in RLVR: the verifier rewards passing answers, but nothing ties the policy's confidence to correctness.
Addresses on-policy RL stalling when the base model cannot reach the reward, using guidance drawn from textual reward sources such as judge models.
Adds AI-chosen training-time hints to RLVR, on the argument that an outcome reward reduces each attempt to a single number.
Applies error-targeted learning to terminal agents: find specific misbehaviors, train against them, check that they are fixed.
Argues a harness tuned for a fixed policy goes stale as the policy learns, and trains the two together.
Replaces flat retrieval from a skill bank with routing that models the high-level strategy first.
Trains a prompt compressor with a mix of RL and supervised learning, aimed at cheaper and faster LLM calls.
Uses RL to close the gap between HTML that renders and HTML that works and looks right under real interaction.
Hierarchical multi-agent RL for long-horizon, multi-step tasks in GUI web agents.
Moves skill memory out of the prompt and into the model by combining RL with on-policy self-distillation.
Multi-agent RL for sub-agents that explore in parallel with isolated context windows.
The thread's diagnostic paper: multi-turn RL gains are highly sensitive to sampling breadth and interaction depth.
Trains incremental summarization with RL so bounded agent memory is optimized for downstream task utility.
First rollout-cost paper in the thread: environment-aware scheduling under a finite rollout budget.
Second scheduling paper: an offline rollout scheduler for multi-instance asynchronous RL of LLMs that targets rollout underutilization such as padding from uneven lengths.
Latest item: coordinates LLM inference with environment execution to cut batch makespan for evals, synthetic data and RL rollouts.
Off the agent track: how to inject stochasticity so GRPO can train few-step flow models.
Classical RL interpretability: explains agent policies through causal graph reasoning.
Theory entry: an axiomatic basis for RL when only a subset of agents is controllable, with smart grids as the motivating domain.
Diffusion counterpart to the rollout-cost theme: RL fine-tuning of few-step models, where many-step rollouts otherwise dominate training cost.
Model-based RL entry on encoding memory in world models at test time.
A benchmark with no RL method: task coordination in full-duplex voice agents, where users interrupt and redirect mid-speech.
A replication study with no RL method: whether LLM agents coordinate through shared memory without being told to.
Classical RL interpretability for high-dimensional multi-action policies.
Opens the reward-design strand: RL that rewards correct answers, penalizes wrong ones and allows abstention, aimed at RAG hallucinations.
Asks when fine-grained credit assignment helps a multimodal tool-using agent and when it does not, using video editing as the test task.
Applies error-targeted learning to terminal agents: find specific misbehaviors, train against them, check that they are fixed.
Argues a harness tuned for a fixed policy goes stale as the policy learns, and trains the two together.
First rollout-cost paper in the thread: environment-aware scheduling under a finite rollout budget.
Uses RL to push models toward coupled knowledge acquisition and reasoning in unfamiliar domains, beyond retrieval and aggregation.
Names the calibration gap in RLVR: the verifier rewards passing answers, but nothing ties the policy's confidence to correctness.
Replaces flat retrieval from a skill bank with routing that models the high-level strategy first.
Off the agent track: how to inject stochasticity so GRPO can train few-step flow models.
Classical RL interpretability: explains agent policies through causal graph reasoning.
Trains a prompt compressor with a mix of RL and supervised learning, aimed at cheaper and faster LLM calls.
Theory entry: an axiomatic basis for RL when only a subset of agents is controllable, with smart grids as the motivating domain.
Uses RL to close the gap between HTML that renders and HTML that works and looks right under real interaction.
Hierarchical multi-agent RL for long-horizon, multi-step tasks in GUI web agents.
Addresses on-policy RL stalling when the base model cannot reach the reward, using guidance drawn from textual reward sources such as judge models.
Moves skill memory out of the prompt and into the model by combining RL with on-policy self-distillation.
Multi-agent RL for sub-agents that explore in parallel with isolated context windows.
The thread's diagnostic paper: multi-turn RL gains are highly sensitive to sampling breadth and interaction depth.
Diffusion counterpart to the rollout-cost theme: RL fine-tuning of few-step models, where many-step rollouts otherwise dominate training cost.
Second scheduling paper: an offline rollout scheduler for multi-instance asynchronous RL of LLMs that targets rollout underutilization such as padding from uneven lengths.
Model-based RL entry on encoding memory in world models at test time.
A benchmark with no RL method: task coordination in full-duplex voice agents, where users interrupt and redirect mid-speech.
A replication study with no RL method: whether LLM agents coordinate through shared memory without being told to.
Trains incremental summarization with RL so bounded agent memory is optimized for downstream task utility.
Adds AI-chosen training-time hints to RLVR, on the argument that an outcome reward reduces each attempt to a single number.
Classical RL interpretability for high-dimensional multi-action policies.
Latest item: coordinates LLM inference with environment execution to cut batch makespan for evals, synthetic data and RL rollouts.
What to watch — open questions
Storylines are threaded mechanically from the feed: stories that share a distinctive anchor across multiple days and sources. Each item links to its original source. The evidence trace, current state, and open questions are written by the editor routine and refreshed whenever a new beat lands.