Benchmarks and evaluation

Leaderboards, eval harnesses and ablations — the contested business of deciding which model is actually better.

28,322 stories · RSS feed

arXiv Computation and Language
Sep 23

Spoken Language Models that Think Aloud

arXiv:2609.26488v1 Announce Type: new Abstract: While Chain-of-Thought (CoT) reasoning has improved the capability of language models, directly applying it to Spoken Language Models (SLMs) may introd...

By Junyi Ao, Kainan Peng, Mingbo Ma, Shun Zhang, Zhenyu Tang, Xutai Ma, Xiang Li, Yinghao Li, Yuancheng Wang, Zhizheng Wu, Haizhou Li, Qing He, Xubo Liu
arXiv AI
Sep 23

Testing, not presuming, adequacy: calibrating generative social simulators against emergent network structure

The paper introduces an adequacy‑aware calibration protocol for generative social simulators that integrates amortized posterior estimation, synthetic identifiability assessment, matched‑sample‑size adequacy checks, diagnosis‑guided repair, and held‑out audits. Applied to a second‑hand luxury resale market, the protocol reveals that behavioural parameters are recoverable but calibration is approximate and overconfident for one parameter, and that the simulator’s reachability reference is violated in every cell, particularly in mean purchased tier. The repair improves two of four cells but fails to restore full adequacy, and a held‑out audit uncovers a buyer‑breadth‑dispersion miss not detected earlier; profile‑source ablation shows language‑model‑derived persona profiles outperform a flat rule baseline, though within‑category brand relabelling has no consistent effect. whyItMatters":"The study demonstrates that without an adequacy check, generative social models may appear valid descriptively yet fail to capture key emergent network structures, highlighting the need for rigorous calibration protocols in social simulation research."

By Tengfei Shao, Chao Li, Xu Wang, Masayuki Goto
arXiv AI
Sep 23

Taming CoT Obfuscation in VLMs: From Mechanistic Evidence to Activation Enforcement

The paper investigates how reinforcement learning can unintentionally obscure the chain‑of‑thought (CoT) reasoning in vision‑language models, making their internal reasoning less traceable. By analyzing activation patterns, the authors show that template‑associated activations become less distinguishable during RL and that targeted interventions can mitigate this effect. They introduce TAME, a method that uses sparse autoencoders to suppress these problematic activations while still encouraging accurate behavior, achieving significant gains in CoT monitorability across multiple datasets and model families.

By Xutao Mao, Jianing Zhu, Jinman Zhao, Tongliang Liu, Xiaowen Chu, Cong Wang, Bo Han
arXiv Machine Learning
Sep 23

Can We Predict Anomaly Detection Performance from Embedding-Space Geometry?

The paper investigates whether the performance of anomaly detection systems can be predicted without labeled anomalies. For kNN-based detectors, it derives a lower bound on AUC that links detection performance to the separation and variance of inlier and outlier scores, and uses this to analyze how density variation, intrinsic dimensionality, and domain mismatch affect score variability. The authors introduce pseudo‑anomaly probes that provide a reference for estimating relative score separation, and demonstrate through experiments on DCASE benchmarks that these probes enable anomaly‑free model selection to outperform conventional development‑set selection, especially under domain shift.

By Kevin Wilkinghoff, Zheng-Hua Tan
arXiv Machine Learning
Sep 23

Same Quantity, Different Answer: Numerical Representation Invariance in Language Models

The paper introduces a benchmark of 3,600 exact‑rational word problems and 8,600 prompts that test whether language models give the same canonical answer when the same quantity is expressed in different numeric forms (decimal, fraction, percentage, number word, scientific notation, or unit‑converted). After normalizing answer syntax, canonical accuracy is high (0.969–0.996), but correctness across equivalent representations drops to 0.848–0.981, revealing that many errors stem from the evaluator’s number grammar rather than the models’ reasoning. The study also finds that representation consensus does not outperform paraphrase consensus on low‑error subsets and that certain models (e.g., Mistral Small 4) exhibit systematic unit‑conversion errors.

By Ephraim Atta-Duncan