IDSPACE is a new synthetic document generator designed to aid the evaluation of digital identity verification systems. It uses model‑guided Bayesian optimization to tune generation parameters for visual similarity and prediction consistency, separates user‑defined metadata from low‑level control settings, and supports scanned and mobile‑captured documents. Experiments demonstrate that IDSPACE improves evaluation consistency by 15‑45 % over baselines, boosts training accuracy by up to 9 %, and increases SSIM similarity by 10 %, while providing a dataset of 359,240 synthetic documents across ten European ID types.
By Lulu Xie, Yancheng Wang, Kanchan Chowdhury, Rolando Garcia, Yingzhen Yang, Jia Zou
SVG-Score introduces a human‑aligned evaluation framework for text‑to‑SVG generation, addressing the shortcomings of existing image‑based metrics like CLIPScore that poorly capture SVG‑specific errors such as color, count, and spatial inaccuracies. The authors first demonstrate that CLIP‑based scores are largely insensitive to these errors and that generic Vision‑Language Models respond inconsistently across error types and styles. They then present a human‑annotated Semantic Alignment dataset and develop two complementary evaluators: a CLIP‑based scorer adapted to vector graphics and a VLM judge refined through supervised fine‑tuning and reward‑shaped reinforcement learning, enabling both fast large‑scale and expressive, interpretable assessment of SVG generators.
By Marco Cipriano, Leonardo Zini, Alexandra Schild, Valentin Teutschbein, Afsana Mimi, Marcella Cornia, Lorenzo Baraldi, Gerard de Melo
FWBC‑VLA is a force‑aware framework that links vision‑language‑action (VLA) models with whole‑body compensation control for wheeled‑legged robots. It introduces HSR‑Force, a sensorless residual‑torque estimator that infers contact strength and encodes this information as tokens for the VLA action decoder, allowing the policy to detect contact onset, loading, and release. The system fine‑tunes a pretrained VLA backbone on a large WL&Arm dataset, combines proprioceptive, Jacobian‑derived force, and contact estimates to generate corrective actions, and demonstrates effectiveness in real‑world tasks such as whiteboard wiping and door opening.
By Yutian Zhang, Siyuan Ma, Liwen Yang, Yang Li, Ce Hao, Haozhen Chi, Dong We, Qiaojun Yu, Dibo Hou
The paper argues that evaluating continual knowledge‑updating methods solely at a final checkpoint and a single adapter rank can be misleading. By fixing a periodic hierarchy and comparing it to cumulative replay on a 24‑month Wikidata stream, the authors show that the apparent best method changes depending on the evaluation month, replay LoRA rank, and query formulation. They recommend reporting performance trajectories and capacity sweeps, and only declaring a robust winner when the ranking remains stable across the evaluation region.
By Heejin Choi
The paper introduces Evidence‑Diagnosed Intervention Training (EDIT), a two‑phase framework designed to improve rubric‑faithful grading by large language models. EDIT‑SFT first identifies problematic reasoning steps using internal model signals—posterior belief over the final mark and input‑grounding scores—and revises only those steps with rubric checklists. EDIT‑RL then calibrates the grader with belief‑guided reward shaping, penalising harmful belief drifts while encouraging useful exploration. Experiments on two real‑world, multi‑subject grading benchmarks show that EDIT consistently outperforms strong supervised fine‑tuning and reinforcement learning baselines, with ablation studies confirming the importance of internal‑state diagnostics.
By Zhihao Wu, Linhai Zhang, Taiyi Wang, Runcong Zhao, Peter Andrews, Cesare Aloisi, Yulan He
The study evaluates self‑supervised learning (SSL) models pretrained on ImageNet‑1k and the Human Protein Atlas (HPA) Field‑of‑View (FOV) for protein localization in microscopy images. DINO‑based Vision Transformer backbones pretrained on either dataset transfer well to the OpenCell dataset, achieving strong performance even without fine‑tuning and improving further when fine‑tuned (0.704 ± 0.027 macro F1 on 17 classes). At the single‑cell level, the HPA‑pretrained model outperforms others in k‑nearest‑neighbor classification across all neighborhood sizes (macro F1 ≥ 0.515).
By Ben Isselmann, Dilara G\"oksu, Heinz Neumann, Andreas Weinmann
The paper investigates whether the rank of latent matrices in matrix‑chain‑of‑thought (Matrix‑CODI) models influences performance on reasoning tasks. Across multiple training regimes on ProsQA and GSM8K‑Aug, rank‑k projection ablations show flat accuracy curves, indicating that truncating the latent matrix to low rank does not hurt performance. Experiments with various readout architectures—bilinear, bilinear‑plus‑GELU, SVD‑augmented, and quadratic—confirm that rank‑indifference persists even for nonlinear readouts, and a linear probe on the latent matrix underperforms a raw pretrained hidden state.
By Samuel Larson (Pebble ML)
TRACE is a graph‑network simulator that stores granular contact history on edges using attention‑based message passing and a gated recurrent unit, with an edge‑identity dictionary to preserve memory as contacts change. It predicts normal and tangential forces while enforcing Coulomb friction and internal force balance, and is trained via single‑step pretraining followed by autoregressive fine‑tuning. On 2D and 3D granular column‑collapse benchmarks, TRACE achieves significantly lower long‑rollout position and deposit errors than existing simulators, uses fewer parameters, maintains near‑zero particle interpenetration, and outperforms the material point method by 12.2× (2D) and 8.9× (3D).
By Changjian Zhou, Negin Yousefpour, Jie Qi, Junfeng Fang, Guillermo A. Narsilio, Hans Petter Jostad
The paper introduces GEO Defender, a two‑stage defense system designed to protect generative search engines from malicious Generative Engine Optimization (GEO) attacks that rewrite web documents to manipulate generated answers. GEO Defender comprises a Shield Reranker, which learns a defensive residual to demote GEO‑rewritten documents while maintaining relevance, and a Training‑Free Shield Generation component that creates a natural‑language library guiding the target LLM’s source usage during inference. Experiments on both closed‑source and open‑source large language models show that GEO Defender dramatically lowers attack success rates from 50.32% to 6.20%, preserves over 94% of benign evidence usage, and maintains answer quality while generalizing to unseen attacks.
By Haozhang Li, Yangguang Shao, Xinjie Lin, Zhong Guan, Mi Zhou, Junzheng Shi
FailBench is a new benchmark for robot failure detection, containing 2,197 manipulation attempts from 14 public sources, with 75% of failures occurring naturally. The study evaluates 13 vision‑language model (VLM) detectors, finding the best model achieves only 0.77 mean balanced accuracy, and that fine‑tuned failure detectors often underperform general‑purpose VLMs. Performance varies with visual evidence, excelling when object motion is observable but dropping to near chance on contact‑intensive assembly tasks, and input‑level cropping of outcome‑relevant regions improves the top detector by 2.4 percentage points.
By Zaruhi Navasardyan, Tatul Danielyan, Hrant Davtyan
The paper introduces SWIM, a task that frames student writing simulation as proficiency‑conditioned essay generation. It evaluates prompting, supervised fine‑tuning, and reinforcement learning for aligning generated essays with student proficiency profiles, using automated essay scoring as a metric. Results show that prompting alone offers limited control, while supervised fine‑tuning and reinforcement learning significantly improve alignment across content, lexical, grammatical, and organizational traits, though low‑proficiency writing remains difficult to replicate.
By Heejin Do, Jakub Kontak, Mrinmaya Sachan
VoxReason introduces a listener‑free evaluation framework that measures whether a speech planning system’s delivery choices—such as pitch, energy, rate, pause, emphasis, and stance—are grounded in cited source records before any waveform is generated. The system outputs a source‑cited speaking plan and uses a deterministic verifier to check citation legality, slot agreement, unsupported states, schema validity, and counterfactual locality. Experiments on 1,440 source‑label cases show that simple slot accuracy can be misleading, while a 7B locality‑based repair model significantly improves plan‑slot accuracy and locality, and removing source records sharply reduces the grounded score.
whyItMatters":"The framework provides a concrete, measurable way to ensure that expressive speech systems make source‑licensed planning decisions, addressing a source‑use failure that occurs before audio synthesis."
By Mengzhe Geng
SimCast‑S2S is a generative latent‑diffusion framework designed for probabilistic subseasonal‑to‑seasonal precipitation forecasting. It tackles three key challenges: it uses a diffusion‑based generative pipeline for uncertainty quantification, operates in a compact latent space learned by VAEs for efficient large‑ensemble generation, and employs transfer learning with LoRA to overcome limited training data. On reanalysis data, it outperforms deep‑learning baselines and competes with or surpasses state‑of‑the‑art operational systems such as ECMWF‑S2S.
By Hiep V. Dang, Antonios Mamalakis
The paper investigates the problem of over‑editing by large language models when repairing code, showing that even state‑of‑the‑art models like GPT‑5.5 frequently rewrite more code than necessary. Using a benchmark of 400 BigCodeBench problems with controlled AST corruptions, the authors quantify excess edits and demonstrate that a simple preservation instruction can reduce unnecessary changes and improve pass rates. They further explore training strategies, finding that reinforcement learning yields the best balance between edit fidelity and performance retention, highlighting edit fidelity as a distinct, measurable dimension of code‑repair quality.
By Tongyao Zhu, Wei Hern Lim, Min-Yen Kan
The paper investigates how different post‑training methods—supervised fine‑tuning, reasoning‑augmented fine‑tuning, and preference optimization (ORPO)—affect the internal computation of refusal behavior in language models. Experiments on Llama‑3.1‑8B, Gemma‑2‑9B, and Qwen3‑8B show that reasoning‑augmented training consistently creates a distinct refusal computation across models, while the architecture influences the internal structure and steerability of refusal. None of the studied methods simultaneously achieve a distributed refusal mechanism, preserve general capability, and allow easy corrective edits, indicating that current post‑training approaches are not a fully reliable defense for safety-critical applications.
By Hoang Cuong Nguyen, Mark Dras, Usman Naseem
The paper investigates whether token-level routing in MoE+LoRA fine‑tuning truly isolates domain‑specific updates. Experiments with biomedical and mathematical data show that, despite near‑disjoint expert routing, adding biomedical data raises code perplexity, revealing negative transfer. Diagnostic metrics (Jaccard routing overlap and adapter‑gradient cosine similarity) pinpoint that interference stems from nearly orthogonal domain gradients competing within the same low‑rank adapter subspace. To mitigate this, the authors propose SpawnLoRA, which dynamically inserts gated sub‑adapters inside MoE experts when adapter‑level contention is detected, while keeping the router unchanged. Evaluations on Phi‑tiny‑MoE‑instruct and OLMoE‑1B‑7B demonstrate that SpawnLoRA reduces negative transfer more effectively than standard or rank‑adaptive LoRA, showing that structural separation inside experts offers benefits beyond routing or rank expansion alone.
By Mehreen Hossain Chowdhury, Nowshin Mahjabin, Ahmed Shafin Ruhan, Md Azam Hossain, Abu Raihan Mostofa Kamal, Md Tahmid Rahman Laskar
The paper introduces CHARM, a lightweight fine‑tuned language model framework for detecting moral foundations in text. CHARM combines MAC cross‑attention, rationale alignment, and hate‑speech modulation to operationalize distinct psychological constructs, achieving up to 15.3% higher AUC in‑domain and outperforming supervised baselines on all out‑of‑domain datasets. The authors demonstrate CHARM’s scalability by applying it to large‑scale COVID‑19 Twitter data, revealing a strong link between moral value alignment and online endorsement behavior.
By Huixiang Fu, Marian-Andrei Rizoiu
arXiv:2609. 03553v1 Announce Type: new Abstract: Policy analysis requires more than predicting whether a proposal will pass: it requires identifying who will be affected, how those actors respond, and what follows.
By Linh Le, Melanie Bui, My Chiffon Nguyen, Zachary Schlosser, David Williams-King
The paper reviews how Large Language Models (LLMs) are being adapted for medical reasoning, moving beyond single-step answers to systems that can systematically, transparently, and verifiably reason. It introduces a taxonomy of enhancement techniques, split into training-time methods such as supervised fine‑tuning and reinforcement learning, and test-time methods like prompt engineering and multi‑agent systems. The review examines their application across text, image, and code modalities in key clinical areas—diagnosis, education, and treatment planning—and tracks the shift in evaluation benchmarks from simple accuracy to more nuanced assessments of reasoning quality and visual interpretability.
By Zizhan Ma, Wenxuan Wang, Meidan Ding, Shiyi Zheng, Shengyuan Liu, Jie Liu, Jiaming Ji, Linlin Shen, Yixuan Yuan, Wenting Chen
Xiaomi-TabLDM is a tabular foundation model that performs classification and regression via in-context learning without task‑specific fine‑tuning. It is pretrained solely on synthetic data from structural causal models, achieving top‑ranked regression results on multiple benchmarks while reducing training and prediction time compared to leading models. The architecture incorporates a three‑stage training strategy, dual‑stream feature grouping, lightweight attention residuals, and sparse mixture‑of‑experts, and it can further improve accuracy through test‑time compute scaling.
By TabLDM Team, Penghui Wang, Wei Liu, Hong Wang, Chengyue Huang, Yuxi Sun, Zirui Wang, Hongming Huang, Quan Wang, Chunxiao Liu, Erli Meng, Bin Wang