Prism-1 introduces Position- and Rival-Independent Scoring for System One models, ensuring that option ordering and set changes do not affect decision probabilities. It achieves this by reading each option in its own block at shared positions, preserving softmax independence across options. Experiments on Qwen3-8B and Gemma 4 12B show Prism-1 maintains baseline accuracy while eliminating sensitivity to shuffling and irrelevant options.
By Yao Long Teng, Jianguo Huang, Yanchen Deng, Jiayi Cai, Bo An
arXiv:2610.18233v1 Announce Type: new
Abstract: System One models answer typed questions in a single forward pass and promise the same answer for the same input. For choice questions, this promise fa...
By Jianguo Huang, Yao Long Teng, Yanchen Deng, Bo An
Verdict-MQ is an open encoder that processes a single piece of state once and then answers multiple typed questions about that state, avoiding separate passes for each question. By using a structured attention mask, it ensures the state encoding is independent of question order and prevents questions from influencing one another. On the typed‑decisions benchmark, Verdict‑MQ outperforms a larger specialist model, achieving higher accuracy and better calibration, while on other benchmarks it shows mixed results compared to fine‑tuned baselines.
By Avdhesh Singh Chouhan, Jack Perry
The study investigates whether adaptive layer-skipping and repetition programs truly improve language‑model inference or merely exploit input‑blind controls. Using 32 such programs on Qwen3‑4B‑Base and Llama‑3.1‑8B across 4,413 multiple‑choice items, the authors compare real program gains to those from input‑blind perturbations and fixed letter offsets. Results show that input‑blind controls can produce comparable or even larger headroom, and that real programs only outperform controls in specific menu configurations, indicating that the apparent benefits may not be due to the actual layer computation choices.
By Yibei Guo, Rui Liu
The paper investigates how compact an encoder can be for closed‑set decision tasks in language‑model pipelines, comparing joint versus per‑option scoring. In a 32‑million‑parameter study, per‑option scoring outperforms joint scoring by 5.8 chance‑corrected skill points on a 37‑benchmark suite, and two external benchmarks corroborate this advantage. Across six released joint encoders ranging from 17 million to 1 billion parameters, the 68‑ and 150‑million‑parameter models surpass a 435‑million‑parameter DeBERTa‑v3 zero‑shot classifier on 209 overlapping tasks and match it on 145 unseen tasks, while the smallest model processes a median request in 14 ms versus 728 ms for the classifier.
By Tardelli Ronan Coelho Stekel
arXiv:2608. 15428v1 Announce Type: cross Abstract: Multiple-choice benchmarks are graded on whether a model picks the right option, not on whether it needed the question.
By Volodymyr Ovcharov
arXiv:2608. 11922v1 Announce Type: cross Abstract: Predictive-distribution entropy makes a strong selection rule in retrieval-augmented question answering: across five QA benchmarks, keeping the candidate answer that a frozen respondent LLM produces with the lowest answer-token entropy lifts mean answer $F_1$ from 0.
By Po-Jen Ko, Che-Cheng Wu, Hung-Chun Hsu, Li-Yang Chang, Chuan-Ju Wang
arXiv:2607.27422v2 Announce Type: replace
Abstract: Goal-conditioned action generators can produce many plausible actions. Best-of-\(K\) selection then uses a critic to rank those actions for the cur...
By Ayushman Singh, Siddharth Aphale
arXiv:2410.02343v2 Announce Type: replace
Abstract: Large language models (LLMs) routinely fail to output the correct option in multiple-choice question answering (MCQA) while encoding the answer int...
By Eduard Tulchinskii, Kristian Kuznetsov, Laida Kushnareva, Anastasia Voznyuk, Andrei Andriiainen, Irina Piontkovskaya, Evgeny Burnaev, Serguei Barannikov
arXiv:2610.29052v1 Announce Type: cross
Abstract: A typed decision maps evidence, a question and a fixed set of options to a probability for every option, computed in one forward pass, by reading a l...
By Yuchuan Weng, Chi Liu, Xin Chen, Srinivasan Manoharan
arXiv:2607. 10139v1 Announce Type: cross Abstract: Selecting the correct answer from a pool of candidate reasoning chains is the engine of test-time scaling, yet the standard selectors each carry a cost: self-consistency inherits the errors of the single model it resamples, and trained reward models need labeled data and transfer poorly off-distribution.
By Ning Liu
arXiv:2610.19095v1 Announce Type: cross
Abstract: Chatbot Arena ranks language models with the Bradley-Terry model, which gives each model one score and so assumes Luce's choice axiom. Choice theory...
By Soovadeep Bakshi, Apurba Bose, Aishwarya Bose, Sandip Nandi