mlsanityData to 13 Oct 2026

LAVOIR: Teaching a Single-Pass Decision Encoder When and What to Ask with Amortized Value of Information

arXiv 2609.30706 ↗First posted 25 Sep 2026cs.AI cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

"System One" decision models such as TypeSafe's Jev and its open counterpart Laya answer typed questions about a text in a single forward pass with calibrated probabilities, but they cannot ask for missing information: when a first message does not say what separates two departments, they guess. We present LAVOIR (Laya with Value-Of-Information Routing), which places the candidate pieces of missing information (slots) in the input next to the answer options, so that one forward pass returns both the decision distribution and, for every slot, the expected gain in the probability of the correct decision if the user were asked about it. VOI targets need no human labels: gold decisions come from schema rules, an LLM only verbalizes messages and answers, a model from another family checks every text, and pairing each message with several profiles makes regression on realized gains estimate the expected gain. A Gini-impurity cap bounds the predicted value by what a calibrated model can still gain. In a controlled study, decisions on seen schemas are statistically indistinguishable from the Bayes ceiling. The final model's question policy matches a greedy oracle VOI policy on seen schemas (AUC 0.799 vs. 0.797), and with at most 0.5 questions per conversation it is 14.1 points more accurate than never asking. On real ABCD conversations, one real exchange raises accuracy by 8.3 points where LAVOIR asks and leaves it unchanged where it does not; on SGD the cap lowers the asking rate from 93% to 8.6%. On Laya's twelve benchmarks LAVOIR is above Laya's reported scores on seven, and it answers a question in 31 ms (median, GH200).

Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 43 of its 86 references that are in the map. First posted on arXiv 25 Sep 2026.

Builds on

43 of 86 references.

References · 43

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,916
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,091
  3. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,831
  4. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,270
  5. 2017On Calibration of Modern Neural Networkscited by 4,902
  6. 2021Program Synthesis with Large Language Modelscited by 3,573
  7. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,676
  8. 2015Character-level Convolutional Networks for Text Classificationcited by 2,319
  9. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,163
  10. 2020Shortcut Learning in Deep Neural Networkscited by 1,944
  11. 2015A large annotated corpus for learning natural language inferencecited by 1,841
  12. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,600
31 more
  1. 2018Hierarchical Neural Story Generationcited by 1,186
  2. 2018Neural Network Acceptability Judgmentscited by 957
  3. 2017Selective Classification for Deep Neural Networkscited by 825
  4. 2019Adversarial NLI: A New Benchmark for Natural Language Understandingcited by 804
  5. 2021A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantificationcited by 786
  6. 2018Annotation Artifacts in Natural Language Inference Datacited by 664
  7. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 652
  8. 2024Smarter, Better, Faster, Longer: A Modern Bidirectional Encoder for Fast, Memory Efficient, and Long Context Finetuning and Inferencecited by 544
  9. 2020GoEmotions: A Dataset of Fine-Grained Emotionscited by 481
  10. 2019Towards Scalable Multi-domain Conversational Agents: The Schema-Guided Dialogue Datasetcited by 428
  11. 2020Efficient Intent Detection with Dual Sentence Encoderscited by 425
  12. 2020TweetEval: Unified Benchmark and Comparative Evaluation for Tweet Classificationcited by 416
  13. 2019Nuanced Metrics for Measuring Unintended Bias with Real Data for Text Classificationcited by 400
  14. 2019An Evaluation Dataset for Intent Classification and Out-of-Scope Predictioncited by 381
  15. 2023Robots That Ask For Help: Uncertainty Alignment for Large Language Model Plannerscited by 302
  16. 2020Consistent Estimators for Learning to Defer to an Expertcited by 268
  17. 2023ToxicChat: Unveiling Hidden Challenges of Toxicity Detection in Real-World User-AI Conversationcited by 230
  18. 2022MASSIVE: A 1M-Example Multilingual Natural Language Understanding Dataset with 51 Typologically-Diverse Languagescited by 145
  19. 2020The Multilingual Amazon Reviews Corpuscited by 143
  20. 2019Asking Clarifying Questions in Open-Domain Information-Seeking Conversationscited by 139
  21. 2018Learning to Ask Good Questions: Ranking Clarification Questions using Neural Expected Value of Perfect Informationcited by 113
  22. 2021Deep Adaptive Design: Amortizing Sequential Bayesian Experimental Designcited by 105
  23. 2024STaR-GATE: Teaching Language Models to Ask Clarifying Questionscited by 100
  24. 2023Clarify When Necessary: Resolving Ambiguity Through Interaction with LMscited by 95
  25. 2023GLiNER: Generalist Model for Named Entity Recognition using Bidirectional Transformercited by 85
  26. 2021Action-Based Conversations Dataset: A Corpus for Building More In-Depth Task-Oriented Dialogue Systemscited by 74
  27. 2021Building and Evaluating Open-Domain Dialogue Corpora with Clarifying Questionscited by 63
  28. 2025mmBERT: A Modern Multilingual Encoder with Annealed Language Learningcited by 42
  29. 2019Interactive Classification by Asking Informative Questionscited by 16
  30. 2025GLiClass: Generalist Lightweight Model for Sequence Classification Taskscited by 11
  31. 2026MoganBert-TR: A Turkish Encoder Foundation Model Trained from Scratch with a CLM-to-MLM Curriculumcited by 2

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2026: 1.

1 paper.