Benchmarks and evaluation

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

28,620 stories · RSS feed

arXiv Computer Vision
Sep 14

Uni-Light: An Ultra-Lightweight Framework via Uncertainty-Aware Knowledge Distillation for Brain Tumour Segmentation

arXiv:2609.06729v2 Announce Type: replace Abstract: Accurate 3D brain tumour segmentation from multi-modal Magnetic Resonance Imaging (MRI) is essential for clinical diagnosis and treatment planning....

By Libing Kuang, Soren Salehi, Ziling Wu, Ahmad P. Tafti, Armaghan Moemeni
arXiv Machine Learning
Sep 14

A Dataset and Benchmarks for Atrial Fibrillation Detection from Electrocardiograms of Intensive Care Unit Patients

The paper presents a new labelled ICU dataset and benchmarks for detecting atrial fibrillation (AF) from electrocardiograms (ECGs). It compares three AI approaches—feature‑based classifiers, deep learning, and ECG foundation models—across Canadian ICU data and the 2021 PhysioNet challenge, finding that ECG foundation models with transfer learning achieve the highest F1 score (0.89). The study demonstrates the feasibility of automated AF monitoring in ICU settings and provides resources for further research.

By Sarah Nassar, Nooshin Maghsoodi, Sophia Mannina, Shamel Addas, Stephanie Sibley, Gabor Fichtinger, David Pichora, David Maslove, Purang Abolmaesumi, Parvin Mousavi
arXiv Machine Learning
Sep 14

Statistical Uncertainty Quantification for Aggregate Performance Metrics in Machine Learning Benchmarks

The paper discusses how to quantify statistical uncertainty for aggregate performance metrics in machine learning benchmarks, focusing on methods such as bootstrapping, Bayesian hierarchical modeling, and visualizing task weightings with standard errors. It demonstrates that these techniques can uncover insights—for example, revealing that a model may dominate specific task types even if its overall performance is poor. The authors apply their approach to the Visual Task Adaptation Benchmark (VTAB) to illustrate its practical usefulness.

By Rachel Longjohn, Giri Gopalan, Emily Casleton
arXiv Machine Learning
Sep 14

PACEvolve: Enabling Progress-Aware Consistent Evolution

The paper introduces PACEvolve, a framework that improves self‑evolving agents powered by Large Language Models by addressing their tendency to become trapped in local contexts and repeat flawed hypotheses. It does so through three techniques: Hierarchical Context Management to prune memory, Momentum‑Based Backtracking to escape local minima, and a self‑adaptive Collaborative Evolution policy to balance refinement and knowledge transfer. These methods enable the agents to maintain a global view of search momentum and achieve state‑of‑the‑art results on complex evolutionary benchmarks.

By Minghao Yan, Bo Peng, Benjamin Coleman, Ziqi Chen, Zhouhang Xie, Shuo Chen, Zhankui He, Noveen Sachdeva, Isabella Ye, Weili Wang, Chi Wang, Ed H. Chi, Fernando Pereira, Wang-Cheng Kang, Derek Zhiyuan Cheng, Beidou Wang
arXiv Computation and Language
Sep 14

Do LLMs Trust the Accuser or the Accusation? Measuring Belief Shifts in Werewolf

The paper introduces a belief‑shift evaluation benchmark for large language models (LLMs) using the social‑deduction game Werewolf. By annotating suspicion and accusation messages in LLM‑played games, the authors measure how a village‑side model’s beliefs change after each message, evaluating 40 open‑weight LLMs on 1,224 annotated messages. Results show that larger models better distinguish wolves from villagers, yet accusations still heavily sway beliefs, especially when the accuser is trusted, and even when the accuser is wolf‑aligned. "whyItMatters":"The study highlights that current open‑weight LLMs up to 120B parameters still struggle to integrate accusation content with source trust in strategic communication, revealing limitations in their belief‑updating capabilities in complex social contexts."

By Yu-Yu Yang, Ti-Rong Wu, Hung Guei, Hsing-Yu Chen, I-Chen Wu
arXiv Computation and Language
Sep 14

Confidence-Gated Transductive Test Generation for Code Reranking

The paper introduces Confidence-Gated Transductive Test Generation (CoTT), a method that combines an efficient inductive approach with selective transductive generation triggered only when inductive confidence is low. This adaptive strategy enhances the reliability of test case outputs while limiting additional computational effort. Experiments on code reranking benchmarks demonstrate that CoTT surpasses previous baselines in performance metrics and reduces overall cost compared to applying transductive generation to every input.

By Sungjae Lee, Youngsik Yoon, Seockbean Song, Siwei Wang, Wei Chen, Jungseul Ok
arXiv Computer Vision
Sep 14

Semantically Aligned Gradient-Driven Context-Preserving Image Editing

Semantically Aligned Gradient-Driven Context-Preserving Image Editing (IABEdit) is a model‑agnostic framework that embeds differentiable semantic verification into the training of generative image editors. By using a frozen vision‑language model to extract spatially‑aware descriptors from ground‑truth edits and a trainable aligner to reproduce them from generated outputs, the residual becomes a gradient that teaches the generator both what to edit and where, without adding inference‑time VLM cost. IABEdit is compatible with various backbones (e.g., U‑Net in Stable Diffusion and MMDiT in FLUX) and improves structural fidelity on MagicBrush, achieves state‑of‑the‑art instruction adherence on RealEdit and EMU Edit, and outperforms the proprietary Gemini agent on the D‑LORD surveillance benchmark under heavy occlusion. "whyItMatters":"IABEdit demonstrates that incorporating semantic verification during training can produce more accurate, well‑localized edits and outperform existing methods even in challenging surveillance scenarios, as shown by its superior metrics and human/GPT‑4o evaluations."

By Chiranjeev Chiranjeev, Muskan Dosi, Mayank Vatsa, Richa Singh
arXiv Computer Vision
Sep 14

PAVXploreRL: Physical-Action-Visual World Model Reinforcement Learning with Action Exploration

PAVXploreRL introduces a reinforcement learning framework that builds on a pretrained latent world model to explicitly optimize Physical Plausibility, Action Adherence, and Visual Fidelity (PAV) objectives. By combining in‑distribution expert trajectories with noise‑driven out‑of‑distribution action exploration, the method avoids reliance on paired video supervision and improves generalization. Experiments demonstrate a 5.6% average performance gain over pretrained baselines and more reliable policy evaluation with reduced overestimation bias.

By Han Wang, Zijun Wang, Shuoshuo Xue, Rui Cao, Fengjiao Chen, Xiaodan Liang, Roy Ka-Wei Lee
arXiv Computer Vision
Sep 14

BodhiPromptShield: Pre-Inference Prompt Mediation for Surface-Form Privacy Propagation in LLM Agent Pipelines

BodhiPromptShield is a policy‑aware mediation layer for LLM agent pipelines that detects sensitive text spans before they propagate, replacing them with typed placeholders, semantic abstractions, or secure tokens and restoring them only at authorized execution boundaries. In evaluations on AI4Privacy, PrivacyLens, and AgentDojo datasets, the system reduces identifier exposure to 7.4% and 1.8% respectively, and limits exact identifier leakage in final actions to 2.1–3.1%. While mediation preserves factual content according to automated metrics, human annotations show a significant drop in inferability from 100% to 24–53%, indicating the need for human validation of semantic‑leakage measures.

By Bo Ma, Jinsong Wu, Weiqi Yan
arXiv Statistics ML
Sep 14

A data-driven Fourier-mixture neural-network method for density estimation

The paper introduces a data‑driven Fourier‑trained neural‑network estimator for fixed‑horizon probability densities, using a positive Gaussian–Laplace mixture with a closed‑form characteristic function. Training occurs directly in Fourier space, enabling non‑negativity and unit‑mass preservation while handling both i.i.d. and resampling‑based pseudo‑sampling data. The authors provide theoretical error bounds, a multidimensional extension, and demonstrate competitive empirical performance against Expectation–Maximization, especially on heavy‑tailed targets.

By Duy-Minh Dang, Volter Entoma
arXiv Machine Learning
Sep 14

VertiFuseX: Generalizable Financial Forecasting via Multi-Stream Temporal Fusion

VertiFuseX is a hybrid LSTM architecture that fuses multi‑scale temporal representations at the penultimate layer, stacking features from LSTM, Bi‑LSTM, and St‑LSTM branches and a parallel DNN stream. On 15 years of global equity index data, it reduces MAPE by 30‑54% and improves MAE and RMSE by over 40% compared to LSTM baselines, outperforming seven state‑of‑the‑art models across 33 metric‑dataset comparisons. The model is lightweight (675k parameters, 2.6 MB footprint) with 1.5 ms/sample inference latency and demonstrates robust, interpretable forecasting with reduced drawdowns in algorithmic trading simulations.

By Aashish Bohra, Vivek Vijay
arXiv Machine Learning
Sep 14

QuPAINT: Physics-Aware Multimodal Reasoning for Quantum Material Characterization

QuPAINT is a physics‑aware multimodal framework designed to characterize two‑dimensional quantum materials using optical microscopy. It employs the Synthetic Materials Framework (Synthia) to generate diverse synthetic images that preserve layer‑dependent optical behavior, and builds the QMat‑Instruct dataset with image‑specific reasoning traces. The framework integrates these signals through Physics‑Informed Attention (PIA) and is evaluated on the newly introduced QF‑Bench benchmark, achieving state‑of‑the‑art performance for flake detection and demonstrating improved spatial grounding and confidence calibration.

By Sankalp Pandey, Xuan-Bac Nguyen, Hoang-Quan Nguyen, Tim Faltermeier, Nicholas Borys, Hugh Churchill, Khoa Luu
arXiv Machine Learning
Sep 14

Autonomous Research for Open-Ended Problems: A Case Study on Telecom Ticket Retrieval

The paper investigates how fully autonomous machine‑learning research systems can tackle open‑ended, industry‑grade problems, using telecom ticket retrieval as a case study. It finds that while autonomous research excels at hyperparameter tuning, it lacks human intuition and creativity, yet can achieve about 90% of state‑of‑the‑art performance in a fraction of the time and at modest cost. The authors recommend a hybrid approach where human researchers collaborate with autonomous frameworks for optimal results.

By Junghyun Min, Huseyin Uzunalioglu, Mohamed Trabelsi
arXiv Machine Learning
Sep 14

Trainability-Oriented Hybrid Quantum Regression via Geometric Preconditioning and Curriculum Optimization

The paper introduces a hybrid quantum–classical regression framework that uses a lightweight classical embedding as a learnable geometric preconditioner to improve the conditioning of a downstream variational quantum circuit. It further incorporates a curriculum optimization protocol that gradually increases circuit depth and switches from SPSA-based exploration to Adam-based fine‑tuning. Experiments on PDE‑informed and standard regression datasets show that this approach consistently outperforms pure QNN baselines, yielding more stable convergence and reduced structured errors, especially in data‑limited regimes.

By Qingyu Meng, Yangshuai Wang
arXiv Machine Learning
Sep 14

What Did the MLLM Hear? Token-Level Spectro-Temporal Grounding for Audio MLLM Explainability

The paper introduces STAG, a post‑hoc framework that provides token‑level spectro‑temporal grounding for captions produced by audio‑based multimodal large language models (MLLMs). STAG estimates temporal support for each token via vocabulary projections of encoded audio, measures frequency‑band relevance through controlled spectral occlusion, and fuses these signals into a spectro‑temporal relevance map. Evaluations across ten explanation methods and four grounding benchmarks show that STAG achieves superior event‑localization performance on every dataset, and counterfactual deletion experiments confirm that removing the identified evidence selectively reduces model confidence and often eliminates the corresponding event from regenerated captions.

By Lucia Cascone, Valeria Fraenza, Michele Nappi, Fabio Narducci, Benedetto Simone
arXiv Machine Learning
Sep 14

Code-to-Harness: Distilling Black-Box Optimizers from Self-Play

The paper investigates whether an agent can learn a numerical search strategy through executable practice and then encode that strategy as text. By repeatedly writing and evaluating optimizer programs, the agent distills a 197‑word text called Harness A, which significantly reduces regret for Gemini Flash and other language‑model executors, matching the performance of classical Gaussian‑process Bayesian optimization. An independent replication produced a different but equally effective text, Harness B, and the framework also achieved the lowest regret on a sealed YouTube reward‑tuning benchmark.

By Yi Wu, Zheng Ren, Zhiyu Hu, Haochen Wang, Daryl Chang, Li Wei, Ting Wang, Zhen Li, Pooja Gupta, Nitin Jindal, Lukasz Heldt
arXiv Machine Learning
Sep 14

GLaMoR: Consistency Checking of OWL Ontologies using Graph Language Models

The paper introduces GLaMoR, a reasoning pipeline that converts OWL ontologies into graph-structured data and applies a Graph Language Model (GLM) for consistency checking. It addresses the challenge of verifying ontology consistency, especially for large ontologies where classical reasoners become computationally expensive. Experiments on NCBO BioPortal ontologies show that GLaMoR achieves 95% accuracy and is 20 times faster than traditional reasoners.

By Justin M\"ucke, Ansgar Scherp