Dream2Discern: Learning from Hard Latent Variants for Runtime Failure Prediction in Multi-Agent Systems
Boxuan Zhang, jianing Zhu, Xiaotian Han, Ruixiang Tang
Rutgers University · The University of Texas at Austin · Amazon
Published October 12, 2026 · on the feed October 19, 2026 · ▲ 16 · arXiv 2610.16071
The abstract
Reliable deployment of LLM-based multi-agent systems calls for runtime auditors that predict terminal outcomes from observed execution prefixes. These auditors typically learn from a limited corpus of trajectories with verified outcomes. Expanding this corpus requires costly execution and verification, yet broader failure coverage alone provides no explicit criterion for identifying prefixes that the current auditor finds difficult to classify. To this end, we propose Dream2Discern, a runtime auditor trained through implicit augmentation guided by its own prediction loss. During Dream, we select perturbations of the auditor's representation operators to increase prediction loss on recorded prefixes, yielding hard latent variants. During Discern, the auditor learns to predict execution outcomes from these variants using the original labels. The variants are regenerated as the auditor learns, turning a limited corpus into a renewable source of hard examples and requiring no additional trajectory collection or outcome verification. Extensive evaluations on AFTraj-2K and StepShield show that Dream2Discern outperforms competitive failure auditors and achieves over 90% trajectory-level weighted accuracy on both benchmarks while balancing prediction accuracy and timeliness. Project page: https://zbox1005.github.io/dream2discern-project/
The Brief
2:26A short podcast summary of the paper. Written and voiced by AI.
Transcript
Dream2Discern. Learning from Hard Latent Variants for Runtime Failure Prediction in Multi-Agent Systems. By Boxuan Zhang and three others, from Rutgers University, the University of Texas at Austin, and one other institution. Published on the twelfth of October. Its code repository is public but slight: eight source files.
Reliable deployment of LLM-based multi-agent systems calls for runtime auditors: models that watch a run as it unfolds and predict, from the prefix of execution seen so far, how it will end. Such auditors usually learn from a limited corpus of trajectories whose outcomes have been verified. Growing that corpus is expensive, because every new trajectory has to be executed and then verified. And even broader coverage of failures does not, by itself, say which prefixes the current auditor actually finds hard to classify. More data, in other words, is both costly and untargeted. Gathering it gives no explicit criterion for which examples would teach the auditor the most.
Dream2Discern is a runtime auditor trained by implicit augmentation, and the augmentation is steered by the auditor's own prediction loss. Rather than collecting more examples, it manufactures difficult ones from the examples it already has, choosing them precisely because the auditor gets them wrong.
Training alternates between two phases that give the method its name. In the Dream phase, perturbations of the auditor's representation operators are selected to increase its prediction loss on recorded prefixes. What comes out are hard latent variants: versions of recorded prefixes, made in the auditor's representation rather than in new runs, that the auditor struggles with. In the Discern phase, the auditor learns to predict execution outcomes from those variants, using the original labels. Because the variants are regenerated as the auditor improves, the hard examples keep pace with it. A limited corpus becomes a renewable source of difficulty, with no additional trajectory collection and no extra outcome verification.
Evaluation uses two benchmarks, AFTraj-2K and StepShield. On both, Dream2Discern outperforms competitive failure auditors, and achieves over ninety percent trajectory-level weighted accuracy. It does so while balancing two aims that pull against each other in runtime auditing: being accurate, and being timely.
The scarce resource here is verified trajectories, and the method spends none of it. Difficulty is generated inside the auditor's own representations, labelled with outcomes already known, and refreshed every time the auditor catches up.
More with an account
Listen to every day’s papers
Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.
Join free