Benchmarks and evaluation

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

28,322 stories · RSS feed

arXiv AI
Sep 17

Mem2Ego: Empowering Vision-Language Models with Global-to-Ego Memory for Long-Horizon Embodied Navigation

Mem2Ego introduces a vision‑language model for embodied navigation that combines global memory with egocentric visual inputs. By adaptively retrieving task‑relevant cues from a global memory module and aligning them with local perception, the framework improves spatial reasoning and decision‑making over long horizons. The method outperforms prior state‑of‑the‑art approaches on the HSSD and HM3D benchmarks and shows strong performance on a real robot.

By Lingfeng Zhang, Yuecheng Liu, Zhanguang Zhang, Matin Aghaei, Yixin Xiao, Yaochen Hu, Mohammad Ali Alomrani, David Gamaliel Arcos Bravo, Hongjian Gu, Zhiyuan Li, Yangzheng Wu, Zhanpeng Zhang, Raika Karimi, Atia Hamidizadeh, Guowei Huang, Haoping Xu, Tongtong Cao, Weichao Qiu, Xingyue Quan, Jianye Hao, Yuzheng Zhuang, Yingxue Zhang
arXiv Computation and Language
Sep 17

English Word Sense Disambiguation in 2026: When the Labels Become the Bottleneck

The paper reports that in English all‑words word sense disambiguation (WSD), the scarcity of high‑quality labels—not the models—has become the limiting factor. The authors introduce lexEN, a human‑adjudicated correction layer over the Maru2022 ALL_NEW benchmark, and SenseBench, a living leaderboard for LLM WSD evaluation. They show that frontier large language models reach about 95 % accuracy on lexEN‑v1, that relabeling corpora with these models improves downstream systems, and that fine‑grained WordNet senses are often ill‑posed, with coarsening improving both annotator agreement and model performance. "whyItMatters":"The study highlights that improving label quality and managing annotation costs are now the critical challenges for advancing WSD performance, as model accuracy is already near its theoretical ceiling."

By Vassili Philippov, Amro Salman, Dmitrii Andreev, Penny Hands, Emil Kaiumov, Pavel Katunin, Anton Nikolaev
arXiv Computation and Language
Sep 17

PersonaPath: Towards Knowledge-Centric Personalized Learning Path Planning

PersonaPath is a new benchmark for knowledge‑centric personalized learning path planning, pairing 2,000 learner personas with a hierarchical knowledge graph of 347 textbooks, 1,751 units, and 4,092 concepts across 77 subjects. The study evaluates large language models on this benchmark, finding that even the best model achieves only a 29.5% final pass rate in Basic Education and fails to exceed 44.7% in tailoring paths to individual learners, highlighting a significant adaptivity gap. This work underscores the challenge of moving beyond exercise‑centric recommendation toward goal‑oriented, curriculum‑scale guidance.

By Yu Liu, Zeming Liu, Tianle Zhang, Zihao Cheng, Yuhang Guo, Kehai Chen, Min Zhang, Yunhong Wang, Haifeng Wang
arXiv AI
Sep 17

Disentangling Long-Term Memory via Latent Neuro-Symbolic Reasoning

The paper introduces LGM, a neuro‑symbolic framework that disentangles long‑term memory by mapping historical interactions into a continuous latent graph. Instead of static memory graphs, LGM uses a sparse autoencoder to create query‑aware latent nodes and edges, then applies a graph encoder conditioned on the query to perform non‑linear message passing. Experiments on long‑term personalization benchmarks show that LGM outperforms existing methods in capturing both explicit and implicit user preferences and generating personalized responses.

By Cai Ke, Xinghao Chen, Xiaoyu Shen, Keyu Chen, Siyu An, Junnan Dong, Ruifeng Xu, Ruizhi Qiao, Xing Sun
arXiv AI
Sep 17

ASLEval: Measuring Privacy Exposure Displacement in LLM Agent Sessions

The paper introduces ASLEval, a framework for measuring privacy exposure displacement in large language model (LLM) agent sessions. It highlights that traditional local proxies—such as inspecting a single action or final response—often miss unauthorized data leaks elsewhere in a multi-step session. ASLEval pre-registers hidden target sets, tracks all declared visible exits, and preserves internal traces for diagnosis, revealing that a single outlet view can overlook nearly 47% of exposure and that internal evidence typically precedes visible leaks. The study underscores the need for benchmarks that define complete visible boundaries, ground claims in pre-specified targets, and report privacy alongside task utility.

By Guosen Wu, Huizhen Huang, Guoxiong Long, Tao Huang, Chen Hou
arXiv Machine Learning
Sep 17

ActiveScale: Scaling Active Perception for Robots across Model, Data, and Hardware

ActiveScale is a framework that enhances active perception for robots by integrating model, data, and hardware innovations. It augments vision‑language‑action models with historical video observations and explicit camera‑pose supervision, and introduces a scalable human‑robot mid‑training recipe using 1000 hours of egocentric and robotic data. The Active‑perception Mobile‑manipulation Platform (AMP) enables single‑operator teleoperation for scalable demonstration collection, leading to improved success rates on active‑perception tasks.

By Shuai Zhou, Kaisheng Pang, Wenxuan Song, Wenjie Zhang, Xinhu Zheng, Haoang Li
arXiv Machine Learning
Sep 17

Locating Hidden Failures Makes Long-Horizon Agents More Reliable

The paper introduces Traverse, a benchmark of 2,518 agent trajectories and 6,967 annotated mistakes across software engineering, computer use, and science tasks, revealing that failures often go unrecovered and can cause irreversible harm before a run is deemed successful. It shows that human judges struggle to detect the first mistake in most runs, while a 4‑billion‑parameter verifier called Scout can locate failures more effectively and improve task success when used to select among candidate runs. The study demonstrates that making failure detection inexpensive and reliable can enable long‑horizon agents to learn from their own mistakes and increase trustworthiness in autonomous AI.

By Salman Rahman, Yubin Kim, Mihir Parmar, A. Ali Heydari, Genglin Liu, Simon A. Lee, Weizhi Zhang, Arian Hosseini, Ahmed A. Metwally, Yuzhe Yang, Baharan Mirzasoleiman, Xin Liu, Pavel Izmailov, Saadia Gabriel, Mark Malhotra, Shwetak Patel, Daniel McDuff, Hamid Palangi
arXiv Machine Learning
Sep 17

Safety-Flag: A Unified Benchmark for the Reliability and Calibration of LLM Content Moderators

Safety-Flag is a unified benchmark that consolidates seven popular safety datasets into a single balanced flag/do‑not‑flag protocol, providing item‑level decisions and confidence scores for multiple large language models and dedicated guards. The benchmark evaluates moderator reliability across three dimensions—error direction, probability calibration, and confidence‑based error ranking—revealing that aggregate accuracy masks significant differences, such as one model flagging 85% of benign content while another misses 54% of harmful content. The study shows that general‑purpose models are overconfident, but temperature tuning can substantially improve calibration, and confidence‑based abstention can reduce selective risk, though performance varies with how well confidence ranks errors.

By Yibo Hu
arXiv Machine Learning
Sep 17

Monitoring and Discovering Reward Hacking with Internal Representations during LLM Evaluations

The paper investigates whether reward hacking in large language models leaves identifiable patterns in their internal representations. By analyzing frontier open‑source LLMs such as Kimi K3, GLM 5.2, and Qwen 3.8 Max, the authors find that simple difference‑of‑means (DoM) vectors consistently capture a range of hacking behaviors across standard benchmarks like DeepSWE and SWE‑bench. These vectors are both generalizable and interpretable, enabling inexpensive online detection that can even predict future hacks before they occur.

By Leon Bergen, Usha Bhalla, Andrew Lee, Barak Widawsky, Linas Nasvytis, Connor Watts, Siddharth Boppana, Sidharth Baskaran, Dron Hazra, Michael Byun, Atticus Geiger, Owen Lewis, Matthew Kowal, Vasudev Shyam, Thomas Fel, Thomas McGrath, Ekdeep Singh Lubana, Jack Merullo
arXiv Machine Learning
Sep 17

ADAPT: Lightweight, Long-Range Machine Learning Force Fields Without Graphs

The paper introduces ADAPT, a lightweight machine‑learning force field that replaces graph neural networks with a direct coordinates‑in‑space Transformer encoder to model all pairwise atomic interactions. Applied to silicon point defects, ADAPT reduces force prediction error by about 22% and energy prediction error by roughly 40% compared to a state‑of‑the‑art GNN model, while also cutting computational cost. This approach addresses common GNN issues such as oversmoothing, oversquashing, and poor long‑range interaction representation, which are especially problematic for point defect modeling.

By Evan Dramko, Yihuang Xiong, Yizhi Zhu, Geoffroy Hautier, Thomas Reps, Christopher Jermaine, Anastasios Kyrillidis
arXiv Computation and Language
Sep 17

Faking Good and Faking Bad in LLMs: Response Distortion Across Dark Triad Personality Traits

The paper examines how large language models (LLMs) alter the expression of Dark Triad traits—Machiavellianism, narcissism, and psychopathy—when prompted to fake good or fake bad. Across seven state‑of‑the‑art models and two real‑world contexts (employment selection and forensic evaluation), most models lowered trait scores under fake‑good conditions and raised them under fake‑bad conditions, with varying consistency across traits and models. The study also finds that explicit fake‑bad instructions produce stronger distortions than contextual framing alone, underscoring the influence of motivational and situational context on personality‑related outputs.

By Victoria Popa, Guglielmo Cola, Caterina Senette, Maurizio Tesconi
arXiv Machine Learning
Sep 17

Leveraging Complementary Embeddings for Replay Selection in Continual Learning with Small Buffers

The paper introduces Multiple Embedding Replay Selection (MERS), a graph‑based method that combines supervised and self‑supervised embeddings to improve sample selection for replay buffers in continual learning. MERS replaces traditional buffer selection modules and demonstrates consistent performance gains over state‑of‑the‑art strategies, especially in low‑memory settings. Experiments on CIFAR‑100 and TinyImageNet show that MERS outperforms single‑embedding baselines without adding model parameters or increasing replay volume, making it a practical, drop‑in enhancement for replay‑based continual learning.

By Danit Yanowsky, Daphna Weinshall
arXiv Machine Learning
Sep 17

Subspace-Decomposed JEPAs: Disentangling Progression and Content in Latent World Models

Subspace-Decomposed JEPAs (SD-JEPA) split the latent space of Joint-Embedding Predictive Architectures into two orthogonal subspaces: a low-dimensional progression subspace trained with a cosine-margin triplet loss and a high-dimensional content subspace regularised by SIGReg. The authors prove that the anti-collapse forces act on disjoint coordinates, allowing additive composition rather than competition. SD-JEPA outperforms the LeWM baseline on most control benchmarks and the strongest non-LeWM JEPA baseline on Push‑T, with a subspace-ablation confirming the split as essential. The 1‑D angular progression coordinate serves as a scene-aware compass, advancing with task progress, regressing on backtracking, and relocalising under perturbations to separate surprise from meaning.

By Lucas Thil, Jesse Read, Rim Kaddah, Guillaume Doquet
arXiv AI
Sep 17

Contiguity, Not Importance: Budgeted Repair of Stale KV Caches After Document Edits

The paper investigates how to efficiently repair stale key-value (KV) caches in retrieval‑augmented generation systems after document edits. It proposes a budgeted in‑place recomputation approach and evaluates training‑free position‑selection policies on a factual RAG benchmark. Across three model families, a contiguous edit‑local window consistently recovers most of the post‑edit answer quality while being 13–21 times faster than a full re‑prefill, though its effectiveness diminishes when answer‑bearing text moves downstream.

By Mingyang Mao, Wyatt Mackey, Xiaomin Lin
arXiv AI
Sep 17

ERPBench: A State-Grounded Evaluation Paradigm for Computer-Use Agents in Enterprise Software

ERPBench introduces a new evaluation paradigm for computer-use agents that operate via screenshots and simulated actions, focusing on enterprise software such as ERP systems. The benchmark tests agents on a live, reproducible ERP platform and scores tasks against ground-truth database values, highlighting challenges like dense interfaces, multi-step interactions, and persistent record errors. Experiments with six agents show that strong general GUI performance does not translate to reliable enterprise outcomes, with many agents frequently saving incorrect data.

By Kratika Bhagtani, Kusha Sridhar, Maziyar Baran Pouyan, Yuying Zhao, Eugene Siow
arXiv AI
Sep 17

Do Frontier Models Seek Safety Evidence Before Acting?

The paper investigates whether large language models decide to gather safety-relevant evidence before acting. Using the SAFE benchmark, the authors evaluate models such as GPT‑5.5, o3, Claude Opus, and Claude Sonnet, finding distinct evidence‑acquisition strategies that vary with retrieval cost, severity, and presentation. Across models, expected‑value reasoning dominates Stage 1 rationales, and evidence framing can alter decisions near the inspection threshold while probability is often cited despite limited influence.

By Omer Tafveez
arXiv AI
Sep 17

The Mirage of Calibrated Confidence: Trajectory-Independence of Verbalized Confidence in Vision-Language Models

The paper investigates how Vision‑Language Models (VLMs) often report high confidence even after self‑correcting or arriving at wrong answers, a phenomenon the authors attribute to the verbalized confidence being largely independent of the model’s reasoning trajectory. By analyzing content variation, token masking, and hesitation markers, the authors demonstrate that confidence does not adequately reflect the actual reasoning process and that calibration training can sometimes worsen this disconnect. To address this blind spot, they introduce the Trajectory‑Grounding Score (TGS) in two forms—TGS‑self and TGS‑pair—and propose TGS‑Bench, a suite of 10 benchmarks that reveal divergences between conventional calibration metrics and trajectory‑grounded confidence.

By Jisoo Yang, Jaeho Han, Trung X. Pham, Junyeong Kim
arXiv AI
Sep 17

Bad Genius: Counterfactual-Guided Harness Evolution Beyond Task-Specific Shortcuts

arXiv:2609. 18366v1 Announce Type: new Abstract: Reliable agent evaluation is complicated by automatic harness optimization, which repeatedly uses a released benchmark $B_{\mathrm{rel}}$ to guide a Proposer that edits prompts, memory, retrieval, tools, and control code around a fixed target agent.

By Guojun Zhu, Xunheng Huang, Peng Yin, Jiahui Xie, Sanguo Zhang, Doudou Zhou
arXiv AI
Sep 17

TRIPROBE: Probing Task Separability Beyond Classification for XAI

TRIPROBE is a multi-level probing framework designed to diagnose task separability in machine learning pipelines. It evaluates separability across input spaces, learned feature representations, and classifier outputs by decomposing multi-task problems into binary subtasks and applying Foundational, Latent, and Final probes. Using Maximum Fisher's Discriminant Ratio, TRIPROBE identifies bottlenecks and task pairs that affect performance, as demonstrated on the Roshambo sEMG benchmark.

By Amirhossein Sadough, Freek Hens, Aleksa Bok\v{s}an, Mohammad Mahdi Dehshibi, Mahyar Shahsavari