xoult

New Artificial Intelligence (cs.AI) papers, Tuesday 20 October 2026

486 papers announced on arXiv. Get them ranked for you, free →

  1. Transfer Learning for Power Outage Detection Task with Limited Training Data

    Olukunle Owolabi · arXiv:2305.17817

    Early detection of power outages is crucial for maintaining a reliable power distribution system. This research investigates the use of transfer learning and language models in detecting outages with limited labeled data. By leveraging pretraining and transfer learning, models…

  2. Multi-LLM Systems Exhibit Robust Semantic Collapse

    Weiyi Kong, Shiyang Lai, Jinghua Piao et al. · arXiv:2605.17193

    AI summaryMulti‑LLM systems converge to the same semantic representation over many generations without retraining, a phenomenon called semantic collapse. Despite varied decoding, prompting, agent design, and RL interventions, the collapse persists across model families and long runs.

  3. Transformer-based segmentation of prosodic boundaries in Brazilian Portuguese

    Rodrigo de Freitas Lima, Julio Cesar Galdino, Marcos Vinicius Treviso · arXiv:2607.07408

    AI summarySAMPA fine‑tunes Whisper on BP speech to insert prosodic boundary markers, achieving F1 = 0.731 on in‑distribution data and 0.796 out‑of‑distribution. The model leverages morphosyntactic, semantic, and acoustic cues for boundary detection.

  4. Dependency, Compression, and Synergy: A Unified Information-Theoretic View of Multimodal Learning

    Liangjian Wen, Linjie Li, Jiang Duan et al. · arXiv:2609.14421

    Recent advances in multimodal foundation models have intensified the need to understand how different modalities share, preserve, and complement information. Mutual Information (MI), the Information Bottleneck (IB), and Partial Information Decomposition (PID) provide…

  5. Can the Quantum Fisher Effective Dimension Judge a Hybrid Quantum Neural Network?

    Md Masum Mia, Amith Khandakar, Mohamed Arselene Ayari · arXiv:2610.14070

    Hybrid quantum neural networks (QNNs) pair a classical feature extractor with a variational quantum circuit, and the effective dimension of the circuit's quantum Fisher information matrix (QFIM) is widely used to assess such models. This scalar is often interpreted as an…

  6. LLM-Assisted Bi-Approximate CHC Solving

    Baiting Jiang · arXiv:2610.23771

    Constrained Horn clause (CHC) solvers often struggle to discover deep counterexamples whose derivations may require extensive rule unfolding. Although large language models (LLMs) can propose long-range symbolic relations, prior work on formally checked LLM-assisted verification…

  7. Web Agent Agentic Reinforcement Learning Decision Model Under Multi-Cost and Failure Risk

    Qianli Ma, Limengxi Yue, Shuyang Xu et al. · arXiv:2610.23857

    AI summaryProposes a constrained agentic RL model that unifies page access, search, and API calls with cost and CVaR risk constraints, reducing cost‑per‑success by 22‑31% and failures by 18‑26% while boosting completion rates under budget limits.

  8. GardenBench: A lightweight, daily evaluation of LLM capabilities

    Benedict Cummins-Mburu, Mariana Garcia Mejia, Oscar Heath et al. · arXiv:2610.23866

    AI summaryGardenBench offers a lightweight, daily LLM benchmark with 11 test suites that track daily accuracy, cost, and latency for consumer-facing tasks, enabling public comparison of model versions and providers through a live dashboard.

  9. Composable Parametric Demographic Injection for Values Survey Simulation

    Xinyuan Cao, Qingyi Pan, Bangde Du et al. · arXiv:2610.23867

    AI summaryPARADE injects demographic shifts into LLMs via reusable LoRA modules for each attribute, separating task knowledge from demographic effects. In simulations of World Values Survey and SocioBench, it reduces population KL divergence by up to 52.8% while preserving predictive accuracy.

  10. Context-Aware RGB-Thermal-Radar Obstacle Perception for Resource-Constrained ASVs

    Pranav Kedia, Edwin Redhead, Heiko Hamann · arXiv:2610.23873

    Reliable obstacle perception is challenging for small autonomous surface vessels (ASVs): reflections and glare confound visible-light cameras, vessel motion shifts the apparent waterline, and darkness removes the dominant sensing modality altogether. Rather than treating…

  11. Latent Multimodal Memory Reasoning

    Cai Ke, Xinghao Chen, Yuanchen Bei et al. · arXiv:2610.23890

    AI summaryThe paper introduces Latent Multimodal Memory Reasoning (LMMR), a neuro-symbolic framework that maps heterogeneous visual and textual memories into a shared sparse concept space to construct a dynamic memory graph. Experiments show that LMMR significantly outperforms existing methods in long-term multimodal reasoning and response grounding.

  12. EMMA: Event-Driven Multimodal Memory System with Multi-Agent Retrieval

    Ruochen Zhao, Jiazheng Kang, Gezi Li et al. · arXiv:2610.23892

    AI summaryThe paper introduces EMMA, an event-driven multimodal memory system that segments long videos by semantic events and uses multi-agent retrieval across a hierarchical memory structure. This approach improves long video understanding over standard fixed-length clip compression methods.

  13. GeoForward: Geometry-Guided Cross-View Alignment for Feedforward 3D Gaussian Splatting

    Yiming Shu, Peng Sun, Lang Zhang et al. · arXiv:2610.23895

    AI summaryGeoForward uses calibrated cameras and sparse LiDAR to anchor cross‑view correspondence with explicit geometry, then refines with visual features and predicts 3D Gaussian splatting. On nuScenes it achieves lower depth‑consistency error and Chamfer distance than competing methods while maintaining quality.

  14. EgoVine: Post-Training with Branching Experience Compiled from Real-World Videos

    Qinchuan Cheng, Bowen Lyu, Zhantao Gong et al. · arXiv:2610.23907

    AI summaryEgoVine turns fixed egocentric video demos into interactive experiences by compiling them into symbolic environments, enabling agents to recover from mistakes and compare alternative actions. The method jointly trains action generation and consequence prediction, achieving 81.8% success on main tasks and 66.7% on longer compositions.

  15. When the Editing Intent Is Split: A Cross-Modal Jailbreak Attack for Large Image Editing Models

    Xianmin Ye, Zhiyuan Fan, Tianju Liu et al. · arXiv:2610.23909

    AI summaryLarge image editors can be fooled by split-intent attacks that give a safe text prompt while hiding a harmful visual cue; the proposed SIJA attack succeeds on GPT Image 2 (68%) and Qwen-Image-3.0-Pro (91%) and is mitigated by joint intent reconstruction.

  16. UMI-WM: Interactive World Modeling for Bimanual Manipulation from Wrist Cameras

    Jingxiang Guo, Haoyu Zhao, Xidong Zhang et al. · arXiv:2610.23913

    Universal Manipulation Interface (UMI) pairs wrist-camera videos with camera trajectories and gripper openings, providing scalable, robot-free data for learning how bimanual actions change a shared scene. Existing interactive world models, however, typically rely on text or…

  17. SPIRIT: Sparse Physics-Informed Inverse Rendering for SAR Imaging

    Yimeng Liu, Maolin Gan, Jingkai Lin et al. · arXiv:2610.23914

    AI summarySPIRIT reconstructs 3‑D surfaces from sparse‑aperture SAR by physics‑informed inverse rendering, modeling visibility, phase coherence, and wave propagation. It recovers accurate geometry and signal with over 90% fewer measurements, outperforming conventional super‑resolution baselines.

  18. Cross-Modal Forgetting and Transfer in Unified Multimodal Post-Training

    Francesco Colasurdo, Ivan Slobozhan, Joaquin Vanschoren et al. · arXiv:2610.23918

    AI summaryCross‑modal fine‑tuning of a unified model (Janus‑Pro‑7B) can cause forgetting in untouched modalities. A single LoRA run preserves other capabilities, but chaining three runs collapses them; anchoring the untrained head prevents this damage.

  19. Doing Less with More: A First-Principles Exploration of the Suitability of Agentic Computing over Alternative Architectural Choices

    Ritvik Garimella, Biplav Srivastava, Amit Sheth · arXiv:2610.23921

    AI summaryThis paper evaluates agentic AI against traditional computing architectures on an arithmetic task, finding that while agents achieve high accuracy, they incur up to a million times the latency of deterministic methods. The authors propose a decision framework to match task types with optimal architectures rather than defaulting to LLMs.

  20. Zero-Shot Tabular Learning via Hypergraph Reasoning with LLMs

    Geon Lee, Kyungho Kim, Dongwon Choi et al. · arXiv:2610.23923

    AI summaryThis paper introduces TABHGR+, a zero-shot tabular learning framework that uses LLM-generated rules and hypergraph label propagation to model inter-row dependencies. It significantly reduces inference costs to a constant number of LLM calls while outperforming existing zero-shot and strong few-shot baselines in classification accuracy.

  21. SpinDoctor: Finding Innocuous Prompts for Biased Image Generation

    Anna Gerchanovsky, Omer Akgul, Lujo Bauer et al. · arXiv:2610.23925

    AI summarySpinDoctor is a black-box method that discovers seemingly innocuous text prompts capable of reliably inducing specific biases in text-to-image models without degrading image quality. Experiments show it successfully generates biased outputs across multiple models with high consistency.

  22. Improving Fake Profile Detection Through Multimodal Learning and Research-Guided Feature Integration

    Jean Claude Hirwa, Jamiu Dahunsi, Candide Giramata et al. · arXiv:2610.23926

    AI summaryMultimodal fusion of text, images, and metadata on TwiBot‑22 shows only marginal improvement over metadata‑only models; graph models perform worse under subsampled conditions. The study concludes that high‑quality metadata features are more valuable than complex multimodal or graph fusion.

  23. miniTE: Diagnosing and Bridging the Execution Gap in Native NVFP4 Reinforcement Learning

    Zhen Li, Mingfa Feng, Yiming Zhang et al. · arXiv:2610.23928

    AI summaryThis paper introduces miniTE, a framework that diagnoses and bridges cross-engine numerical discrepancies in native NVFP4 reinforcement learning for LLMs. It achieves stable training with near-BF16 performance while delivering up to 1.47x the throughput of standard NVFP4.

  24. Organizing LLM Inference for Aggregate Predictions from Behavioral Data

    Varun Gupta, Vijay Kamble · arXiv:2610.23934

    AI summaryThe paper investigates how to prompt LLMs for aggregate behavioral predictions without fine-tuning. It finds that evaluating summarized user histories in comparative prompts achieves the highest accuracy and lowest cost, nearly matching supervised baselines.

  25. Factorization-Guided Training and Inference for Diffusion-Drafted Speculative Decoding

    Jiakun Fan, Min Xiao, Qiang Wang et al. · arXiv:2610.23935

    AI summaryFactorizes diffusion‑draft training into inclusion, weighting, and prediction losses, and throughput into mean accepted tokens per round and latency, to guide training and inference configuration. Achieves up to 4.14× speedup over autoregressive decoding on Qwen3 models, 7–9% better than prior baselines.

  26. Beyond Prediction: A Component-Level Study of Concept Recovery in In-Context Learning

    Xufeng Liu, Fang Wan, Yi Liu · arXiv:2610.23936

    AI summaryComponent‑level analysis of in‑context learning shows that LLMs can predict accurately while failing to recover the whole concept; jointly specifying attributes and level constraints improves recovery, but it is fragile to unnecessary constraints, and joint supervision enhances both recovery and prediction.

  27. SECURE-AI: Multi-Signal Uncertainty Quantification for Trustworthy Acoustic Cough Detection

    Sejal Solkhan, Feiya Xiang, Mayur Sanap et al. · arXiv:2610.23937

    AI summarySECURE-AI wraps a frozen MobileNetV3 cough detector with a multi‑signal uncertainty module (Monte Carlo Dropout, Temperature Scaling, Mahalanobis distance) and shows that Mahalanobis distance alone achieves AUROC 0.86 for separating true from false coughs, raising precision from 60 % to 80 % when rejecting two‑thirds of false positives.

  28. PeekKV: The First Content Token Already Knows Which Heads Matter

    Minyoung Go, Yongjun Park · arXiv:2610.23939

    AI summaryPeekKV compresses LLM KV caches by peeking one content token after prefill to score attention heads and tokens, allocating cache budgets per head group without offline profiling. It achieves over 95% of full-cache accuracy at 1.5–10% memory budgets across benchmarks.

  29. A Group-Aware Comparative Study of Classical Machine Learning and Deep Learning Methods for Sensor-Based Human Activity Recognition

    Wahyu Pebrianto · arXiv:2610.23941

    AI summaryThe paper compares four classical and four deep‑learning HAR models on UCI‑HAR and KU‑HAR using group‑aware cross‑validation. Deep learning only slightly outperforms classical models on UCI‑HAR; on KU‑HAR, LightGBM wins (0.857 vs. 0.828), and combined ACC+GYRO generally yields the best results.

  30. ReTTT: Reflection-Driven Test-Time Training via Experience-Based Parametric Memory

    Kangcong Li, Hangfan Zhang, Shuyue Hu et al. · arXiv:2610.23942

    AI summaryReTTT trains a frozen LLM agent during each episode by reflecting on its own interaction feedback and storing lessons in memory; the agent updates a LoRA adapter for policy and reflection. This method improves task success by up to 12.14 points over trajectory‑based test‑time training on ALFWorld, ScienceWorld, and SWE‑bench Lite.

  31. CrowdH-Edit: Reference-Guided Instruction-Based Synthetic Hajj Crowd Image Generation for Crowd Counting

    Amirah F. Alshammari, Bander A. Alzahrani, Nahed A. Alowidi · arXiv:2610.23945

    AI summaryCrowdH-Edit generates synthetic Hajj crowd images guided by real references and textual instructions, producing 6,122 clean samples and 387 annotated ones. Adding the synthetic set to training data lowers MAE in three models and RMSE in two, showing reference-guided synthesis benefits crowd counting.

  32. A Controlled LLM Workflow for Evidence-Grounded Diagnosis of Risk Score Differences

    Hanqing Dou, Zijia Cao · arXiv:2610.23962

    AI summaryControlled LLM workflow combines reference retrieval, contrastive SHAP, reference-based reasoning and deterministic validation to explain risk score differences; it yields more consistent, evidence‑grounded diagnoses than an unconstrained LLM.

  33. REAP: Learning General Rearrangement Heuristics from Motion-Planner Feedback

    Daniel Swoboda, Hector Geffner · arXiv:2610.23973

    AI summaryREAP learns a graph‑neural‑network heuristic that infers hidden geometric preconditions from a motion planner, enabling greedy best‑first search to solve more rearrangement problems while cutting planner queries tenfold and achieving 94 % feasibility for top‑ranked actions.

  34. How Much Can We Prune? Exploring the Performance Limits of Visual Token Pruning

    Janghoon Cho, Shubhankar Borse, Reza Pourreza et al. · arXiv:2610.23974

    AI summaryThe paper formulates visual token pruning as an offline utility maximization problem for image understanding, introducing QA‑Mini‑Batch Greedy (QA‑MBG) to efficiently build nested token subsets. QA‑MBG achieves higher performance than existing baselines, closing the gap to full‑token inference while using far less compute.

  35. LLM Evolutionary Search Strategies Should be Compared by Tokens

    Tal Oved, Roi Pony, Oshri Naparstek et al. · arXiv:2610.23977

    AI summaryLLM evolutionary search is usually benchmarked by proposal counts, but this obscures real compute cost; using token counts shows that evolution’s apparent advantage disappears—evolution only outperforms independent sampling by ~5% in most cases, with a 23–28% margin on only one task.

  36. SituHOI: Scalable Capture of Scene-Situated Full-Body Human-Object Interaction

    Qifan Wang, Qihang Fang, Boao Shi et al. · arXiv:2610.23980

    AI summarySituHOI provides 18,429 RGB‑D clips in 16 indoor rooms with whole‑body, object, and scene annotations, enabling joint motion prediction. On a MoCap subset, the pipeline cuts human G‑MPJPE from 195.4 to 68.3 mm and object error from 43.0 to 28.7 mm.

  37. RL Teaches VLMs Where to Attend but Not How to Perceive

    Ziqian Zhang, Junjie Liao, Zhining Zhang et al. · arXiv:2610.23983

    AI summaryReinforcement learning improves VLMs by teaching them to focus on visual tokens rather than enhancing perception. The study shows that RL boosts VQA performance via increased visual attention in LLM layers, recoverable with a simple attention bias plug‑in.

  38. IWOO: Wave Optics Optimizer Improved with Hybrid Strategies for Numerical Optimization and Engineering Applications

    Rui Du, Yaming Zhang, Yongpeng Wen et al. · arXiv:2610.23994

    The Wave Optics Optimizer (WOO) incorporates optical diffraction and interference into numerical optimization and has shown competitive performance in benchmarks and engineering applications. However, it can converge slowly, become trapped in local optima, and lose search…

  39. Agentic Interpretation: Harness-Governed Evidence Construction for Software Agents

    Yifeng He, Yanjun Wang, Siwei Cui et al. · arXiv:2610.23996

    AI summaryAgentic Interpretation builds reproducible, audit‑ready evidence for software‑agent tasks by proposing typed records that a deterministic harness accepts, grades, and persists. It outperforms baseline agents on patch‑acceptance and fault‑localization, cutting wasted inspections by 60 % and executions by 35 %.

  40. spora: A Unified Multimodal Dataset and Platform for Spatial Proteomics

    Benedikt von Querfurth, Johann Wenckstern, Eeshaan Jain et al. · arXiv:2610.24002

    AI summaryspora is a large, harmonized multimodal spatial proteomics dataset of 13,546 multiplex images from 5,477 patients across 35 cohorts and five platforms, with standardized formats, segmentations, metadata, and paired H&E. It also offers a unified interface (spora[io]) and a benchmark suite (spora[bench]) for cell phenotyping, diagnosis, therapy prediction, and virtual staining, enabling fair comparison of foundation models.

  41. PACE: Pareto-Adaptive Compression for Efficient Native MLLMs

    Lei Tian, Chunzheng Zhu, Kai Wu et al. · arXiv:2610.24005

    AI summaryPACE compresses visual tokens in native multimodal LLMs by using direction‑aware saliency and Pareto‑optimal budget allocation, achieving near‑lossless performance with only 25–50% token retention and halving FLOPs.

  42. What Social Media Teaches Us About Accumulative AI Risks

    Dawei Li, Bohan Jiang, Huan Liu · arXiv:2610.24006

    AI summaryThis position paper argues that AI safety must address accumulative harms from repeated daily use, drawing parallels to social media dynamics. The authors show how feedback loops in conversational AI can gradually erode independent judgment and privacy without causing a single catastrophic event.

  43. Beyond Explicit Intent: Discovering and Shaping Artistic Intent through Human-AI Co-Creation

    Renye Yan, Jialun Zhong, Jikang Cheng et al. · arXiv:2610.24010

    AI summaryThe paper presents a human‑AI co‑creation loop that expands exploration, lets artists discover latent preferences through observation, and then reinforces those preferences via tailored RL, gradually aligning the model to individual aesthetics and revealing vague creative intents.

  44. TWIN-MoE: Two-stage Intra-Expert Imputation Network for Incomplete Multimodal Learning

    Liang Nathan Zheng, Jiyuan Liu, Wenhao Liang et al. · arXiv:2610.24014

    AI summaryTWIN-MoE introduces a two-stage intra-expert imputation: pre-imputation creates context-conditioned estimates clipped by modality statistics, then post-imputation refines them using expert-conditioned aggregates. It achieves state‑of‑the‑art performance on four benchmarks with fewer parameters than existing MoE approaches.

  45. Analysis of Binary O-type Star Systems Using Recurrent Neural Networks

    Miguel Flores R., Luis J. Corral, Celia R. Fierro-Santillán et al. · arXiv:2610.24015

    This work presents an initial analysis of the estimation of effective temperature and surface gravity for simulated O-type binary systems using a recurrent neural network. The proposed system uses 34 equivalent-width measurements from the optical region of a stellar spectrum.…

  46. Unified Multiparadigm Fusion Intelligence for Rare Disease Diagnosis

    Jian Yang, Peiling Liu, Songda Li et al. · arXiv:2610.24024

    AI summaryFusionRare fuses symbolic reasoning, deep learning, case retrieval, and LLM inference to prioritize rare disease diagnoses, achieving 51% Recall@1 for phenotype-only and 79% for phenotype‑genotype cases—outperforming DeepRare, GPT‑5.5, PhenoBrain, and LIRICAL.

  47. LLM Evolution in a Simple Simulated Market

    Charlie Pilgrim, Christopher Krupenye, Dora Biro et al. · arXiv:2610.24033

    Arguments that AI systems will evolve in harmful ways are largely made in the abstract. We provide a concrete empirical example. We simulate simple markets consisting of populations of twenty Large Language Model agents tasked with solving arithmetic problems. Agents differ only…

  48. Client-Aware Security Adaptive Early Exit Vision Transformers for Heterogeneous Federated Learning

    Sahar Refaei Ghalibafan, Samira Nazari, Christian Herglotz et al. · arXiv:2610.24036

    AI summaryClient‑aware early‑exit ViTs in federated learning use client‑specific thresholds and adaptive routing based on entropy and confidence, achieving 88.7% CIFAR‑10 accuracy with 32% depth saved and 73.7% ImageNet‑1K top‑1 accuracy with 30% saving.

  49. The Window Is in the Reasoning: When LLM Agents Decide to Follow Prompt Injections

    Haoxuan Jia, Yang Liu, Bin Chong et al. · arXiv:2610.24048

    AI summaryThe paper shows that prompt‑injection decisions in LLM agents are largely determined when the injection is read, but reasoning reduces this “read‑time” variance. It finds that multi‑run evaluations are necessary, as single‑run labels can disagree up to 35 %.

  50. LogicVal:A Logic-Formalized Benchmark for Constraint Satisfaction in Text-to-Image Generation

    Savitha Sam Abraham, Marjan Alirezaie, Hossein Rahnama · arXiv:2610.24051

    AI summaryLogicVal formalizes text‑to‑image evaluation as a constraint‑satisfaction problem, combining neural detection with logical reasoning. It shows a large drop from 98% success on single-object constraints to 53% on multi‑object logical relations, highlighting T2I models’ limited compositional reasoning.

  51. Red-Teaming Multi-Agent Attacks for Loss-of-Control Risks

    John Kitaoka, Thao Amelia Pham, Carlos Rafael Giudice et al. · arXiv:2610.24052

    AI summaryThe paper presents MiniLab, a synthetic testbed for evaluating how multiple AI agents can covertly collude to achieve harmful objectives. It shows that distributed attacks evade per-agent monitors (7% flag rate) while human-crafted multi-agent plans succeed 80% of the time.

  52. World of SWECraft: Agent Collaboration at Scale via Simulated Software Worlds

    Shannon Zejiang Shen, Yapei Chang, Qiyao Liang et al. · arXiv:2610.24061

    AI summaryThe paper introduces Software World, a simulation framework that creates realistic software ecosystems for multi‑agent collaboration. Experiments show that scaling inference‑time compute yields up to 31% efficiency gains, with most agents finding useful tasks while some high‑performance models stop searching early.

  53. OR-License: Evaluating LLM Agents as Real-World Operations Research Practitioners

    Peisong Wang, Feixue Liu, Yize Meng et al. · arXiv:2610.24087

    AI summaryLarge language model agents can solve real‑world operations research problems directly from client materials, but they rarely match expert solutions. In a benchmark of 31 industrial cases, the best LLM achieved 88% feasibility and 0.87 DAQ, below expert level.

  54. Persistent Memory and Iterative Improvement in an LLM Agent for Chinese-Character Drawing

    Peilin Wu, Yi-Zhuang You · arXiv:2610.24090

    AI summaryThe study evaluates how persistent memory affects a Chinese‑character drawing LLM agent. Free‑form memory raises first‑attempt success by 4.6 pp, code‑bank memory by 2.8 pp; with target‑specific supervision, the code‑bank gains rise substantially, showing memory design shapes learning benefits.

  55. Does AI-Assisted Development Homogenize Software? An Empirical Study of Code Similarity, Quality, and Evolution

    Luciano Marchezan, Romain Lefeuvre, Kevin Delcourt et al. · arXiv:2610.24093

    AI-assisted software development is evolving from interactive LLM assistance toward agentic systems that autonomously perform software engineering tasks, yet the effects of this shift remain insufficiently understood. We present an empirical study of 50 long-lived Java and…

  56. Cache2LoRA: Understanding and Improving Context Internalization

    Yi Fang, Gaurav Srivastava, Zhenyu Bi et al. · arXiv:2610.24107

    AI summaryCache2LoRA generates low-rank parameter updates from a reusable document cache guided by the query. It matches full-context in-context learning performance across 17 tasks while delivering nearly six times the decoding throughput.

  57. Joint, Decoupled, or Agent: When Each Multimodal Alignment Paradigm Wins

    Yi Fang, Gaurav Srivastava, Sirui Ding et al. · arXiv:2610.24108

    AI summaryThe paper compares joint, decoupled, and agent multimodal alignment paradigms across 16 datasets, finding no single winner but that selection depends on supervision budget, task format, and unimodal 5‑NN accuracy, with a diagnostic cascade choosing the best paradigm 71.4% of the time.

  58. BLANC: Adaptive Temporal Scheduling for Sign Language Production

    Youngmin Kim, Seoyeong Hwang, Sujung Hong et al. · arXiv:2610.24109

    AI summaryBLANC uses a Multi‑Rate Vector Quantizer to separate body and hand motion into different temporal resolutions and a latent articulatory clock to adaptively schedule variable‑duration motion blocks. It achieves state‑of‑the‑art sign‑language production on PHOENIX‑2014T and CSL‑Daily.

  59. Graph-Regularized Synthetic Control for Stable Counterfactual Estimation under Donor Redundancy

    Yanlin Zhang, Sungyong Chung, Alireza Talebpour · arXiv:2610.24113

    AI summaryGraph-Regularized Synthetic Control adds a graph Laplacian penalty to classical synthetic control, encouraging coherent weights across similar donors. It yields more stable, interpretable counterfactuals while matching pre‑ and post‑treatment accuracy, especially in donor‑redundant settings.

  60. Prefix-Tuning for Arbitrary Output Sequences on Pretrained Transformers

    Peter Cho-Ho Lam, Ziyi Wang, Zirui Zhou · arXiv:2610.24123

    AI summaryThe paper shows that for any pretrained autoregressive Transformer and any target output within the model’s range, a prefix can be constructed by solving linear systems to force the model to generate that output; it also proves this condition is necessary.

  61. On the Selectivity of Generative Models in Structure-Based Drug Design

    Ella Miray Rajaonson, Jungyoon Lee, William Chau et al. · arXiv:2610.24124

    AI summaryThe paper introduces SELECTBENCH, a benchmark for assessing selectivity in generative structure‑based drug design. It evaluates nine models on three real‑world tasks, finding that current methods, even those trained for selectivity, only modestly discriminate off‑targets.

  62. The Weight of Teamwork: Does Communication Structure Help LLM Scientists Search for Scientific Laws?

    Jianing Shi, Zaibin Zhang, Shijun Lei et al. · arXiv:2610.24131

    Team performance is often reported as one delivered score, even though that score is produced in two stages: a system generates candidate answers and a selection rule returns one of them. We use symbolic regression as an observable scientific-search setting and compare…

  63. A Conditional No-Hair Theorem for Transformers: How Language Models Forget Their Prompt

    Shuyang Xiang · arXiv:2610.24133

    AI summaryThe paper measures how quickly a transformer’s hidden states forget its prompt, finding a power‑law decay t⁻ᵅ with α≈0.55–0.7 for trained models and 0.2–0.5 for untrained ones, and proves an O(P(log t)^{L‑1}/t) bound under mild conditions.

  64. From Spectrograms to Shallow Speech SSL: Audio-Frontend Design for Generator-Disjoint and Low-Latency Audio--Visual Deepfake Detection

    Qiwu Wen, Jahangir Alam, Eric Charton · arXiv:2610.24138

    Video-mediated conversational systems rely on synchronized speech and facial video, making audio--visual input integrity important for reliable perception. We study audio-frontend design in a fixed MRDF (Modality-Regularization-based DeepFake)-based pipeline with AV-HuBERT…

  65. lepidoptera: A Domain-Agnostic Engine for Causal Simulation with Mixed Variable Types, Vine Copula Dependence, and Individual-Level Counterfactual Propagation

    Danilo Augusto Sarti · arXiv:2610.24147

    lepidoptera is an open-source R and Python package for simulation from structural causal models with heterogeneous variable types. The package is built around a typed mechanism architecture, which separates the causal graph from the generating rule at each node and exposes each…

  66. CoDA: A Human-LM Collaborative Codebook Development Assistant for Domain-Specific Text Annotation

    Jaspreet Ranjit, Swaminathan Chellappa, Augusto Rivas Costante et al. · arXiv:2610.24157

    AI summaryCoDA is a human‑LM collaborative tool that speeds domain‑specific codebook creation by iteratively refining guidelines through feedback on model errors. It matched expert codebooks’ accuracy while cutting development time to 2 hours and annotations by fivefold.

  67. TorchTPU - A Hybrid Eager/Compiled Architecture for Native PyTorch Execution on TPU

    Claudio Basile, Michael Voznesensky, Gunhyun Park et al. · arXiv:2610.24161

    AI summaryTorchTPU introduces a native PyTorch backend for Google TPUs combining eager execution and torch.compile integration. It enables seamless model migration while delivering industry-competitive inference and training performance.

  68. Model Capacity Frontier: A Development Framework for LLM-Supported Social Simulation

    Patrick Zhao, Yuxuan Li, Hirokazu Shirado · arXiv:2610.24168

    Large language model (LLM) agents are increasingly incorporated into agent-based models (ABMs) on the premise that richer, context-sensitive human behavior can improve empirical fidelity. However, LLM-supported ABMs introduce an open-ended design space in which subtle modeling…

  69. Self-Improving Video-to-Action Models

    Hyunwoo Ryu, Eric Ming Chen, Max Wilcoxson et al. · arXiv:2610.24177

    AI summaryMirror learns video‑to‑action mappings by self‑interaction: it follows a visual plan, records the resulting video‑action pairs, and retrains itself, achieving state‑of‑the‑art performance on Atari, OGBench, DeepMind Control, and Minecraft without prior action data.

  70. Bootstrap Stochastic Interpolant Tree for Inference-time Search Under Sparse Reward

    Binglin Ji, Anindya Sarkar, Yevgeniy Vorobeychik · arXiv:2610.24185

    AI summaryBootstrap Stochastic Interpolant Tree (BSIT) decouples child‑node sampling from parent transitions, enabling diverse trajectory rollouts and wider exploration in inference‑time search. Experiments show BSIT converges faster to target distributions and outperforms DDPM‑based tree samplers in rare‑reward tasks.

  71. Agents' Last Doubt: Knowing When to Act and When to Step Back in Tool-Using Agents

    Qisai Liu, Qingyue Jiao, Bangwei Guo et al. · arXiv:2610.24194

    AI summaryThe paper builds a counterfactual dataset of 3,115 outcomes for 1,036 decision points in ToolSandbox, trains SURE‑Act to rank actions, and shows a 0.0309 utility gain over regression, up to 0.0575 overall score improvement, outperforming prior methods.

  72. Towards an Intelligent Decision Engine for Smart Contract Deployment

    Oana-Otilia Captarencu, Emanuel Onica, Andrei Arusoaie · arXiv:2610.24198

    Layer 2 (L2) blockchain solutions emerged in recent years, predominantly in the Ethereum ecosystem, as a viable option for scaling a main blockchain network (L1). However, the selection of a L2 solution for deploying smart contracts backing blockchain applications is a decision…

  73. Distillation, Self-Training, and the Fragility of Learned Chemical Reasoning

    Anagha Aneesh, Sebastian Ibarraran, Frank Hu et al. · arXiv:2610.24199

    AI summaryResonance uses a one‑time bootstrap of frontier supervision to distill an open‑weight teacher’s reasoning traces, then self‑trains on verified outputs, turning a near‑zero accuracy base model into a competent predictor that can even surpass its teacher. However, the distilled student inherits the teacher’s fragile, single‑pass reasoning and fails to maintain correct answers under challenge.

  74. SWE-Bench Pro V2: A Cleaner, Harder-to-Game Coding Benchmark

    Soham Dan, Jeff Da, Sanyam Bhutani et al. · arXiv:2610.24206

    SWE-Bench Pro is a widely used benchmark of long-horizon software engineering tasks for coding agents. As agents improve, they reach task issues earlier agents never touched and interact with the evaluation environment in ways the original harness did not anticipate. We present…

  75. Landmark-Free and Scale-Blind Multi-View Registration of Preoperative Liver Models to Intraoperative Surfaces

    Jiaming Feng, Gerardo Loza Galindo, Shahid Farid et al. · arXiv:2610.24218

    AI summarySimCompose jointly estimates full similarity (scale, rotation, translation) from multiple partial liver surface views without landmarks, then refines with a low‑dimensional Neo‑Hookean deformation; it outperforms single‑view baselines, boosting success from 38.4% to 77% on synthetic data and reducing error three‑fold on five in‑vivo patients.

  76. Training-Free Prompt Selection for Efficient Reinforcement Learning With Partial Rollouts

    Lei Jiang, Honghui Bao, Yue Zhou et al. · arXiv:2610.24229

    AI summaryThis paper introduces LIFT, a training-free prompt selector for reinforcement learning that evaluates data using only partial reasoning rollouts. LIFT reduces selection token costs by up to 9.1 times while maintaining competitive downstream reasoning performance.

  77. LoopHIL: Looping Hardware into LLM-assisted Agents for Wireless Embedded Systems

    Dhairya Shah, Spanddhana Sara, Savitha Viswanadh Kandala et al. · arXiv:2610.24231

    LLM agents are widely used for software development and debugging, but their adoption in embedded systems, especially for wireless tasks, remains limited. This is because embedded development requires hardware-in-the-loop testing. Agents cannot directly observe the spectrum,…

  78. Analyzing Repetition and Interference Effects in Memory-Constrained User Simulators

    Cara Su-Yi Leong, Nicholas Tomlin, Tal Linzen · arXiv:2610.24232

    AI summaryUser simulators are evaluated for behavioral parity with humans by testing memory constraints, repetition, and interference effects. While some simulators match overall human accuracy and replicate repetition/interference magnitudes, they differ on specific errors, revealing distinct forgetting patterns.

  79. Who Plans, Who Edits? Verified, Cost-Aware Division of Labor for LLM-Driven Analog Layout Repair

    Xilai Dai, Saeed Mohammadi · arXiv:2610.24234

    Language-model agents can repair analog layouts when sign-off tools check every edit, but which model should plan a repair, which should edit it, and at what cost remain open questions. In our tool-grounded repair agent, models only choose bounded layout operators; sign-off…

  80. Encoder-Free Multimodal LLMs Learn Implicit Encoders

    David Harwath, Desh Raj, Xavier Velez et al. · arXiv:2610.24239

    AI summaryEncoder‑free multimodal LLMs (Gemma‑4 12B, Inkling‑Small) learn “implicit encoders” in their early layers that transform audio and visual inputs into representations largely independent of cross‑modal context. Layer probing shows these implicit encoders match the behavior of standard dedicated encoders, and early‑modality encoding alone matches joint‑encoding accuracy.

  81. Towards Reinforcement Learning for Space Robotics: Fast Training and Reliable Real-World Transfer

    Abhishek Naik, Michael Wu, Michael O'Sullivan et al. · arXiv:2610.24241

    This work demonstrates the use of a fast simulation-based training framework to learn control policies using reinforcement learning. The hardware requirements are minimal and the simulation-learned policies transfer reliably to the real world. With this setup, we show that a…

  82. Probing Ambiguity: Adversarial Intent Resolution for Robust Text-to-SQL

    Youbing Yin, Xujun Peng, Muhammad S. Uddin et al. · arXiv:2610.24248

    AI summaryAIR probes ambiguous text‑to‑SQL queries by generating multiple SQL interpretations, executing them, and asking data‑driven clarification questions; it outperforms prior methods on AMBROSIA and AmbiQT, achieving higher F1 with only ~7% loss without full database access.

  83. Cortex: A Fixed-Point Theory of Governed Coding Agents - Technical Report

    Marius-Constantin Dinu, Florian Zeba · arXiv:2610.24255

    AI summaryCortex adds a supervisory layer that plans, edits, and validates code from a large language model. The paper proves that, under sound, monotone validation rules, exhaustive or fair scheduling will converge to the least fixed point of the requirement lattice, and provides a stochastic bound on expected iteration time.

  84. AM-Bench: A Unified Taxonomy and Evaluation Suite for Agentic Misalignment

    Eric Zhang, Terry Jingchen Zhang, Chijioke Ugwuanyi et al. · arXiv:2610.24264

    AI summaryAM‑Bench defines a taxonomy of agentic misalignment using threat, opportunity, and reasoning dimensions, and evaluates 35 cross‑industry scenarios on 10 LLM agents, finding a 62‑point misalignment gap, with Gemini models worst and Claude near‑zero.

  85. Can Compact Open-Weight Large Language Models Recover Mobility Events from Incomplete Trajectories? A Controlled Evaluation Using Air Trips

    Hsuan-Chih Wang, Xianfeng Terry Yang · arXiv:2610.24266

    AI summaryCompact LLMs can infer missing flight events from incomplete GPS traces, but perform poorly: only 9% correctly identify the transition segment and 31% recover the origin. The most explicit prompt slightly improves these rates, illustrating limits of LLMs for trajectory inference.

  86. From SEC Filings to Financial Signals: Evaluating LLMs on Stock Market Reactions and Analyst Forecasts

    Shengkun Wang, Taoran Ji, Linhan Wang et al. · arXiv:2610.24268

    AI summaryWe evaluate 13 LLMs on 45,964 Form 10‑Q MD&A texts, linking them to fundamental ranks, analyst forecasts, and abnormal returns. Adding fundamental ranks improves RankIC by ~0.009, while LLM forecasts do not beat analysts; consensus anchoring increases forecast accuracy but raises error.

  87. SPIDES: Information-Flow Control for Browser Agents

    Egor Zverev, Juhee Kim, Leon Trampert et al. · arXiv:2610.24277

    Browser agents automate complex workflows by reading and acting on arbitrary page content, but this flexibility exposes them to prompt injection attacks and unintended data exfiltration. Recent work argues that LLM-driven browser agents erode traditional web security boundaries…

  88. SteerSearch: Interactive Search Reasoning with Mid-Response Steering

    Udit Thakur, Baohao Liao, Matteo Nulli et al. · arXiv:2610.24287

    AI summarySteerSearch trains language models to handle mid‑response steering by rewarding context preservation when users change the target question. It raises steering accuracy from 11% to 31% on Qwen2.5‑3B and from 36% to 45% on Qwen3‑4B while keeping single‑query performance intact.

  89. Unbounded Losses, Unchecked Inputs: Measuring the Safeguards of LLM Options-Trading Agents

    Mengxiao Wang, Nitesh Saxena · arXiv:2610.24289

    Large language model (LLM) agents now place options orders at retail brokers, and developers publish open-source options agents faster than anyone has examined them. Prior security work on trading agents scored academic equities designs by whether an attacker can flip a…

  90. Not Every User Says It All: Training Tool-Using Agents Beyond Ideal Simulated Users

    Han Bao, Zheyuan Zhang, Kaiwen Shi et al. · arXiv:2610.24294

    AI summaryTraining with weak, masked users hurts performance; existing policies trained on strong users do not improve for weak users. StaGPO, a state‑grouped policy optimizer, lets agents document missing info and assign step‑level credit, boosting weak‑user success by 4.8 points on ToolWOZ and improving generalization.

  91. Who Speaks, Who Authorizes, Who Acts? Understanding Trust Boundaries in Multi-Agent LLMs

    Junru Zhu, Xin Chen, Hang Lyu et al. · arXiv:2610.24298

    AI summaryMulti‑agent LLMs have distinct trust boundaries for message delivery, signing authority, and tool execution; the paper formalizes these and shows that a small coalition of compromised signers can forge policy‑valid proofs. Experiments reveal that routing, source cues, and tool gates do not consistently prevent false claims, highlighting the need to evaluate each boundary separately.

  92. CME-SpectrumBench: Can LLMs Analyze Condensed Matter Spectral Data?

    Jin Gene Wong, Anjney Midha, Joseph Mathew Tennyson et al. · arXiv:2610.24304

    AI summaryCME-SpectrumBench evaluates LLMs on analyzing simulated condensed‑matter spectroscopy data, scoring their numeric outputs against ground truth. Models fail on direct analysis but match handwritten code when given a Python interpreter, highlighting the need for better data‑processing capabilities.

  93. Learning Administrative Boundary-Aware Location Encoders via Reverse Geocoding

    Lakshay Sharma, Alex Marin · arXiv:2610.24306

    AI summaryThe paper trains location encoders with reverse‑geocoded text to explicitly encode administrative boundaries, improving downstream geospatial tasks. A new RevGeoRQ model achieves state‑of‑the‑art performance and offers more interpretable, residual‑quantized geographic representations.

  94. RATION: Towards Quantitative Risk-Based Access Control for AI Agents

    Yuntao Du, Harsh Chaudhari, Yuetian Chen et al. · arXiv:2610.24311

    AI agents increasingly interact with external environments to complete complex user tasks. These interactions can lead to unexpected behavior and expose agents to security threats such as indirect prompt injection. Current agent security systems largely protect agents by…

  95. Indirect Influences of Artificial Intelligence Advice on Complex Sepsis Treatment Decisions

    Venkatesh Sivaraman, Joel Levin, Eric P. Mason et al. · arXiv:2610.24313

    Sepsis is a major public health concern, and many sepsis patients die due to ineffective hemodynamic management. Artificial intelligence could support hemodynamic decisions, particularly in complex cases where conflicting information and comorbidities drive uncertainty and…

  96. The Judge Can Debias Itself: Awareness and Self-Debiasing for Reliable LLM-as-a-Judge

    Youbing Yin, Jingyu Wu, Anoop Kumar et al. · arXiv:2610.24320

    AI summaryThis paper introduces prompt-based strategies where large language models explicitly recognize and critique their own systematic biases during evaluation. These lightweight methods consistently improve evaluation reliability across diverse bias types without requiring external training.

  97. Morpheus-2.0: Multiscale Probabilistic Forecasting with Dual-Axis Attention

    Aakriti, Manoj Cherukumalli, Prathamesh Patil et al. · arXiv:2610.24321

    AI summaryMorpheus‑2.0 trains a single encoder‑only model that jointly attends across variables and time on a variable‑time grid, sampling horizon lengths during training. The multiscale version handles multiple resolutions, achieving 0.646 relative MASE and 0.455 relative CRPS, the best reported.

  98. Continuous Ontology Assurance through External Resources -- An Ontology Engineering Method with a Case Study in Software Language Engineering

    Ralf Lämmel · arXiv:2610.24322

    AI summaryCOATER introduces executable “arrows” that compare scoped ontology sections to external resources, flagging support or challenges and generating tasks for revision. Applied to the FSL ontology, it raised Wikipedia-linkage compliance from 405 to 600/600 and catalogued SLE resources.

  99. VERAS: Verification-Guided Adaptive Search for Reliable Operations Research

    Minbo Ma, Honglin Zhang, Bangtao Zhou et al. · arXiv:2610.24329

    Advances in reasoning, coding, and tool use enable LLM agents to solve operations research (OR) problems through iterative problem modeling, program construction, and verification. Yet passing self-authored verification does not ensure that the solutions satisfy task constraints…

  100. Screening LLM Judges Without Ground Truth: A Preliminary Evaluation of an AI Dental Hygiene Coach

    William DeShong, Barath Kannan, Auberon Palma et al. · arXiv:2610.24335

    AI summaryA staged pipeline screens LLM judges and student models using audit, similarity, bias, and robustness checks before expert review, demonstrated on an AI dental hygiene coach. The pipeline found two local judges nearly matched hosted judges, but did not conclusively separate the student models, highlighting issues like truncation and hallucinations.

  101. What Matters for NVFP4 Training? A Comparative Study of Low-Precision Pretraining Recipes

    Anjulie Agrusa, Andrei Panferov, Elizabeth Wei et al. · arXiv:2610.24343

    AI summaryNVFP4 training of 8B and 30B MoE language models to 1T tokens is studied, showing a recipe that combines unbiased gradient estimation, selective high‑precision layers, and partial tensor de‑biasing. The final method achieves the smallest loss gap to BF16 at this scale.

  102. FlashRT-PAI: Fast Kernels Are Not Fast Pipelines for Physical AI Inference

    Liang Su, David Chen, Jason Li et al. · arXiv:2610.24349

    AI summaryFLASHRT‑PAI speeds physical AI inference by co‑designing pipeline and hardware, fusing kernels, reusing state, and snapshotting, achieving 3.38–12.66× latency reduction vs. eager PyTorch at 16‑bit precision and 94 % success on Jetson AGX Thor.

  103. Koi: Evidence-Guided, Self-Calibrating Planning for Multi-Cloud, Heterogeneous LLM Inference Fleets

    Mankeerat Sidhu, Gangmuk Lim, Hetarth Chopra et al. · arXiv:2610.24355

    AI summaryKoi is a self‑calibrating cluster planner that models LLM inference as a causal graph and uses a recursive language model with deterministic predictors to optimize deployment decisions across heterogeneous, multi‑cloud fleets. It improves goodput by 18% and cuts cost per token by 20% compared to baselines.

  104. DKnown-Jev: Fine-Tuning and Evaluation of a JEV-Style Model for Tasks Involving Normative Knowledge

    Qi Li, Jianjun Xu, Pingtao Wei · arXiv:2610.24358

    AI summaryFine‑tunes Qwen3.5‑2B and Qwen3.8‑27B for classifying normative text as Answer Evidence or Non‑answer Evidence. The 27B model attains 98.75% accuracy and 98.60% macro‑F1, outclassing prior Jev models by >6 points.

  105. A Two-Stage Hybrid Framework for Inferring Air Trips from Mobile Location-based Service (LBS) Data under Incomplete Airport Sightings

    Hsuan-Chih Wang, Xianfeng Terry Yang · arXiv:2610.24366

    AI summaryA two-stage method infers U.S. domestic air trips from LBS data even when airport sightings are missing: Stage 1 uses heuristic rules for high-confidence trips, Stage 2 applies a probabilistic model with spatial, temporal, and flight-schedule cues. The framework raises route coverage from 10.65 % to 50.60 % and boosts Spearman correlation with official benchmarks from 0.4490 to 0.7630.

  106. WAQS: Weight Absorption for Quadratic Probing and Affine Steering

    Ding Zhu, Mohammad Mahdi Khalili · arXiv:2610.24367

    AI summaryWAQS uses a quadratic probe to compute a state‑dependent affine steering direction, which can be exactly absorbed into adjacent linear layers via an offline weight update. It outperforms static linear steering on truthfulness, refusal, and sycophancy tasks without adding inference cost.

  107. Tactix: Towards a Programmable Strategy Interface for Flexible SAT Solving

    Haoze Wu, André Schidler, Armin Biere et al. · arXiv:2610.24369

    Modern SAT solvers combine a rich repertoire of proof rules with sophisticated strategies that determine when and how to apply them. Often, the internal implementations are tightly coupled to particular strategies, making it inconvenient to define new strategies without changing…

  108. Beyond Next-Screen Prediction: The Decision Value of GUI World Models

    Sizhe Tang, Hanhan Zhou, Jeffrey Svajlenko et al. · arXiv:2610.24372

    AI summaryThe paper shows that the benefit of GUI world models comes mainly from how their predictions are used, not from prediction quality itself. A Direct Action Ranking model outperforms lookahead methods on AndroidWorld and transfers zero‑shot, implying world models should be evaluated by their decision value.

  109. Train Locally, Learn Together: Distributed Multi-Agent Training via ADMM

    Yiwei Chen, Changsheng Wang, Yicheng Lang et al. · arXiv:2610.24380

    AI summaryDistributed MAS training using consensus ADMM lets agents learn locally yet achieve joint optimization, reducing HarmBench attack success by up to 26.4% while matching centralized reasoning performance. The framework enables scalable, resilient multi-agent learning without a central trainer.

  110. Is This Your Agent? Identity Watermarking for Agent Systems in Dynamic Environments

    Yuwei Zhong, Yu Cheng, Jiuan Zhou et al. · arXiv:2610.24382

    AI summaryDASMark embeds an identity watermark in dynamic agents by learning action‑preserving, semantically similar decision channels and recovering it with shift‑robust techniques. It attains 98.5% bit‑decoding and 95.2% accuracy under attacks while keeping task performance unchanged.

  111. IF-MAP: Influence-Function-Inspired Agent Prioritization in Multi-Agent Systems

    Jie Mao, Pingchen Lu, Zikun Qu et al. · arXiv:2610.24383

    AI summaryIF-MAP prioritizes agents in LLM‑based multi‑agent systems by estimating how end‑to‑end loss changes with prompt perturbations, using the estimated response norm as a score. It achieves 3.81‑pp macro gain on prompt optimization and 7.62‑16.42‑pp on model upgrades, while cutting token costs by up to 74%.

  112. Bridging Exploration and Persona: Information-Directed Dueling for Test-Time Agent Personalization

    Jie Mao, Pingchen Lu, Xiangyi Wang et al. · arXiv:2610.24385

    AI summaryID‑TAP uses a neural utility model with a Bradley‑Terry explorer to select and refine persona choices from binary response comparisons, transferring evidence across similar queries. It outperforms baselines on seven benchmarks within ten comparison rounds.

  113. Trust the Edge, Doubt the Arrow: Auditing Validation Signals for Text-Mined Clinical Causal Knowledge Graphs

    Su Lan, Shicheng Zhou, Yiqi Wang et al. · arXiv:2610.24390

    AI summaryThe paper audits clinical causal knowledge graph candidates mined from 328k MIMIC‑IV discharge notes, comparing lift, coding‑order, and literature signals against SemMedDB. Lift best filters unsupported mentions, coding‑order and literature give weak or partial direction evidence, leaving direction uncertainty.

  114. MSCR: Jointly Balancing Utilization Across Modalities and Discovering Synergistic Information

    Xinyu Chen, Liangjian Wen, Jiang Duan et al. · arXiv:2610.24395

    AI summaryMSCR introduces a regularizer that simultaneously balances modality use and boosts synergistic fusion in multimodal learning. It outperforms MCR on five datasets, improving conditional recovery and cross‑modal attribution while remaining effective with Transformer fusions.

  115. ZeroDSS: Semantic Segmentation from Class Names Alone

    Tian Ming, Marzi Heidari, Yuhong Guo · arXiv:2610.24405

    AI summaryZeroDSS trains semantic segmentation models using only class names and synthetic data generated via an LLM‑driven prompt distribution and diffusion attention, then iteratively refines masks with feedback loops. It attains 35.0% mIoU on COCO and up to 66.3% on PASCAL VOC.

  116. Long Listening Thoughts: Eliciting Open Auditory Reasoning with Deliberative Perception and Cognitive Refinement

    Jaeyeon Kim, Chao-Han Huck Yang, Luoyi Zhang et al. · arXiv:2610.24409

    We introduce Long Listening Thoughts (LLT), a framework for constructing post-training datasets that improves audio reasoning by pairing deliberate perceptual grounding with explicit cognitive behaviors. On audio understanding and reasoning benchmarks, large audio-language…

  117. When Opposite Premises Translate Identically: A Source-Conditioned Diagnostic for Multilingual Commonsense Items

    Shuai Wang, Rui Hu · arXiv:2610.24428

    AI summaryThe paper introduces a source‑conditioned diagnostic that flips the polarity of English premises, translates both sides, and counts identical target outputs to detect unfaithful translations in multilingual commonsense QA. The method finds dozens of collisions in Swahili and LaBSE, proving translation errors but not pinpointing the faulty arm.

  118. Do 3D Large Language Models Really Use 3D Evidence?

    Yifei Zhao, Fanyu Zhao, Han Zhang et al. · arXiv:2610.24447

    AI summaryThe paper introduces UNICORNS, a benchmark that tests 3D large language models on grounded reasoning across four evidence conditions, and shows a gap between control accuracy (≈61%) and challenge categories (≈41%). A new post‑training method, HORN, raises challenge accuracy to about 75% without hurting control performance.

  119. HumanSkill-4D: Training-Free Language Querying of Animatable Gaussian Avatars in Space and Time

    unsu Kim, Naeun Kim, Dongyoon Han et al. · arXiv:2610.24452

    AI summaryHumanSkill-4D allows users to query animatable Gaussian avatars by language, selecting body parts, garments, or motion intervals without training. It achieves superior 3D/4D referring segmentation over baselines using a multimodal LLM, semantic memory, and motion memory with minimal avatar setup.

  120. Hippo: Training-Free Agent Self-Evolution via Hippocampal Replay

    Yutong Song, Jiang Wu, Yuxuan Ren et al. · arXiv:2610.24453

    AI summaryHippo is a training‑free memory framework that lets LLM agents improve by replaying hippocampal‑style experiences, comparing new attempts with past ones to merge overlaps and resolve conflicts via applicability conditions. It boosts performance on SWE‑bench, WebArena, and Mind2Web while keeping far fewer stored experiences than simple accumulation.

  121. MELD: Recursive Self-Improvement via Hierarchical Coordination for Multi-Agent Scientific Discovery

    Sizhe Tang, Zuyuan Zhang, Zeyu Fang et al. · arXiv:2610.24454

    AI summaryMELD jointly trains a Coordinator and Scientist policies in a hierarchical, recursive framework for multi‑agent scientific discovery, yielding a best‑of‑budget objective that outperforms baselines on 20 of 22 tasks with a 4B model.

  122. Tree Plurality Veto: Voting in Few Rounds with Efficient Communication and Low Metric Distortion

    Gabriel Chen, Yu Cheng, Alice Wang · arXiv:2610.24456

    AI summaryTreePluralityVeto shows that for any r≥2 a deterministic protocol can achieve distortion at most 2r–1 using r rounds and only O(n log m + n·min{n,m}^{1/(r-1)} log min{n,m}) bits, by running Plurality‑Veto on a hierarchical voter partition.

  123. Learning to Compose: Recursive Self-Improvement of Shared Executable Stacks for Zero-Shot Long-Horizon Robot Manipulation

    Yangzhi Chen, Feiran Liu, Zishuo Wang et al. · arXiv:2610.24464

    AI summaryRecursia recursively improves a shared executable stack of robot skills by using source‑side execution traces to add missing tools, repair components, and enforce contracts. It raises long‑horizon success rates by 5.8–15.1 pp in simulation and 40 pp on real tasks versus baseline.

  124. SENTRY: A Streaming Edge Network Trust Engine for Real-Time Audio Deepfake Detection

    Chirantan Banerjee, Soumita Chatterjee, Bhargab B. Bhattacharya et al. · arXiv:2610.24468

    AI summarySENTRY streams audio at the network edge, using integer-only wavelet and spectral transforms plus a gradient‑boosted tree and Mahalanobis out‑of‑distribution detector to classify deepfakes, achieving 98.75% accuracy (1.25% EER) on WaveFake and 94.75% accuracy (5.05% EER) on ASVspoof 2019 LA.

  125. Which Long Documents Matter? A Controlled Study of Data Selection for Context Extension

    Junlong Jia, Jiang Zhou, Xing Wu et al. · arXiv:2610.24469

    Natural long documents are widely used for context extension, but which selection pipelines are effective remains unclear. We conduct a controlled comparison on Qwen2.5-3B at 128K under matched 6B-token continued-training budgets. Random sampling of natural long documents…

  126. Pluralistic Alignment in Language Models: Objectives, Human References, and Preference Representations

    Meng-Chen Wu, Umesh Bodhwani · arXiv:2610.24471

    AI summaryThe paper proposes a two‑layer taxonomy for pluralistic alignment—categorizing objectives (Overton, Steerable, Distributional) and human references (aggregate, regional, subgroup)—and reviews 70 studies, showing most work focuses on Steerable and Distributional pluralism with limited evidence for true preference variation.

  127. Write Once, Check Many: Reusable Ledgers for Post-Hoc Policy Compliance Auditing of Agent Trajectories

    Ashwin Nagarajan, Gursimran Panesar, Alicia Yang et al. · arXiv:2610.24483

    AI summaryThe paper introduces a write‑once, check‑many ledger system that records agent trajectories in a policy‑independent format, enabling efficient post‑hoc compliance checks. Experiments show ledger readers outperform trajectory readers, achieving higher AUC with far fewer tokens.

  128. ConCI: A Controlled Counterfactual Benchmark for Contextual Integrity in LLMs

    Juhyeon Park, Sumin Yu, Taesup Moon · arXiv:2610.24494

    AI summaryThe authors introduce ConCI, a controlled counterfactual benchmark for evaluating contextual integrity in LLMs using paired information flows that isolate single parameter changes. They find that top models struggle with appropriate flows and over-predict inappropriate ones, revealing a persistent bias toward refusal rather than genuine contextual reasoning.

  129. GazeAct: A Human-Gaze-Annotated Manipulation Dataset for Attention-Regularized Policies

    Anupam Pani, Wang Yuan, Qifan Wang et al. · arXiv:2610.24507

    AI summaryGazeAct records human gaze during real‑robot manipulation, synchronizing 300 Hz gaze with images, proprioception, and actions across 12,000 demos in 40 tasks. Training VLA policies with gaze‑derived attention improves success from 48.1 % to 58.6 % (up to 25 pp gains) and transfers to other datasets.

  130. $M^2Net$: Unifying Scale-Specific Structures and Prototype Decomposition for Spatial-Temporal Forecasting

    Chengyang Zhou, Zijian Zhang, Hao Miao et al. · arXiv:2610.24516

    Spatial-temporal forecasting is pivotal for intelligent urban management yet remains challenging due to the intricate coupling of spatial dynamics and temporal non-stationarity. Existing approaches, while effective, often overlook two fundamental characteristics of real-world…

  131. Axiomatic World Modeling for Physics Reasoning

    Xinye Yang, Zhenyang Liu, Yuxuan Wang et al. · arXiv:2610.24519

    AI summaryRLAWM trains LLMs to penalize differences between their internal axiomatic world model and the true physics, using two hierarchical rewards for modeling and solving. The method boosts PhysReason by 12.2 points and PHYSICS by 5.2, with strong zero‑shot generalization.

  132. HABIT-Bench: Evaluating Habit Induction from Longitudinal Weak Evidence in Agent Memory

    Junming Zhang, Rubin Wei, Xu Cheng et al. · arXiv:2610.24520

    In long-term interactions with large language model (LLM) agents, users reveal habits through their choices and actions. These habits capture implicit user information that agents must infer across conversations. However, individual observations may provide only partial evidence…

  133. Comparing Sparsified MLPs and Transcoders: Many Transcoder Features Are Neurons in Disguise

    Stepan Shabalin, Mateusz Piotrowski · arXiv:2610.24521

    MLP neurons in transformer language models are widely understood to be polysemantic, motivating transcoders - sparse, learned approximations of MLP layers - as interpretable replacement models for mechanistic analysis. However, recent work shows that MLP neurons can be used to…

  134. Rethinking EEG Spatial Super-Resolution as Dynamic State Decomposition and Filtering

    Hongjun Liu, Leyu Zhou, Chang Ge et al. · arXiv:2610.24528

    EEG spatial super-resolution aims to recover high-density neural signals from sparse electrode observations. Existing methods have achieved substantial progress through spatial modeling, generative reconstruction, and temporal representation learning. However, the current EEG…

  135. Contrastive Hypergraph Source-free Domain Adaptive Object Detection in Adverse Weather Conditions--Extended Version

    Jicheng Yuan, Tung Kieu, Manh Nguyen-Duc et al. · arXiv:2610.24532

    Adverse weather conditions such as fog, rain, snow, and low illumination introduce structured visibility degradations that severely impair object detectors trained on clear-weather data. When source data are inaccessible due to privacy or trans- mission constraints, source-free…

  136. When Code Becomes an LLM Call: An Empirical Study of Call-Site Contracts in Agentic Systems

    Shihao Weng, Longtian Wang, Yang Feng et al. · arXiv:2610.24545

    Software quality has long rested on specifications that state what code must do, and on testing and verification that check that the code does it. Agentic systems change this foundation: they replace parts of their logic, such as choosing the next tool, judging whether an action…

  137. CARVS: A Congestion-Aware Algorithm for Online Multi-Agent Pickup-and-Delivery in Human-Collaborative Warehouses

    Chaoran Li, Zeyuan Zhao, Shao Zhang · arXiv:2610.24549

    Intelligent warehouse systems have transformed logistics by integrating robots with minimal infrastructure changes, boosting efficiency and optimizing workflows compared to traditional human-only operations. However, human-robot collaboration introduces new challenges,…

  138. From Stories to Features: Scaling Concept Vectors for AI Alignment & Interpretability

    Dmitry Scherbakov, Oleg Chernikov, Victoria Khamash et al. · arXiv:2610.24556

    AI summaryThe authors propose generating feature vectors for language model safety and alignment by taking the mean activation difference between synthetic concept-antagonist story pairs. Scaling this approach to 1,036 concepts across multiple models, they show these vectors generalize to detect concepts, reveal shared geometric properties, and causally steer model behavior.

  139. ASR Personalization in Pathological Voice: Accuracy, Efficiency, and Duration Effects

    Giuseppe Giaimis, Sergei Katkov, Muhammad Azfar Yaqub et al. · arXiv:2610.24572

    Automatic Speech recognition (ASR) struggles with Pathological speech due to persistent speaker-specific mismatch. In clinical and accessibility scenarios, only limited target-speaker data is typically available, making full model retraining impractical. We present a…

  140. Concordance Plausibility Check for Intervention-Conditioned Human Digital Twins

    Saeed Farzi, Christopher Kipps, John McBeth et al. · arXiv:2610.24577

    AI summaryThis paper introduces CPC, a framework that verifies counterfactual predictions of human digital twins by matching them with real‑world evidence and clinical knowledge, yielding Pass/Fail/Indeterminate outcomes.

  141. Scene-Adaptive VLA: Efficient Autonomous Driving via Dynamic Layer Routing

    Yujia Yang, Quan Yuan, Jiawei Fan et al. · arXiv:2610.24590

    AI summaryThis paper introduces Scene-Adaptive VLA, a framework that uses dynamic layer routing based on real-time scene complexity to optimize Vision-Language-Action models for autonomous driving. The approach reduces inference-time computational overhead by 53.5 percent while maintaining driving and language performance.

  142. CADS: Measuring the Incremental Contribution of LLM Proposers in Sequential Biological Screens

    Guanxing Chen, Nihui Shao, Haohuai He et al. · arXiv:2610.24597

    AI summaryCADS is an error-controlled evaluation framework that measures the true incremental contribution of LLM proposers in sequential biological screens. It reveals that standard raw hit counts often overstate LLM value by conflating it with baseline algorithmic performance.

  143. AdamPM: Memory-Efficient LLM Optimization via Moment Pooling

    Xiaowei Ji, Lishan Xu, Jianing An et al. · arXiv:2610.24598

    AI summaryAdamPM reduces Adam’s memory footprint by pooling second-moment entries into groups, keeping a single shared mean per group. With group size s, memory drops to 1/s of Adam’s, while preserving accuracy and speed on LLM pre‑training and fine‑tuning.

  144. Severity-Channel Conditioning: An Injection-Level Study for Consumer-Device Deblurring

    Abdullah Al Shafi, Kazi Saeed Alam, Sumaiya Rahim Suma et al. · arXiv:2610.24599

    Motion-deblurring models lose substantial accuracy when transferred from professional cameras to smartphone-derived imagery. This paper studies whether a severity descriptor, partly derived from the paired sharp target, helps adaptation on the iPhoneBlur consumer-device…

  145. HSPR: Recovering Software-Agent Benchmark Scores via Hierarchical Posterior Inference

    Wanyi Chen, Wanqin Shen, Yuanchen Shi et al. · arXiv:2610.24611

    AI summaryHSPR uses hierarchical posterior inference on historical data and adaptive task sampling to efficiently estimate full software-agent benchmark scores. Operating at a 10 percent task budget on SWE-bench, it achieves the lowest error among compared methods while maintaining accurate agent rankings.

  146. How Much Do Activation Monitors Benefit from Original Model Computations?

    James Oldfield, Shawn Im, Jay J Culligan et al. · arXiv:2610.24613

    AI summaryThis paper investigates whether internal activation monitors rely on original model computations to detect undesirable behavior. The authors find that while most monitor performance can be recovered without native traces, access to original computations provides a small but consistent predictive advantage.

  147. Muse Glimmer 30B: An On-Device Agentic Model

    Arash Ebrahim Abtahizadeh, Muna Aghamelu, Adil Ahmed et al. · arXiv:2610.24628

    We introduce Muse Glimmer, an open-source 30B parameter causal language model with perception encoder, purpose-built for autonomous agentic tasks on consumer hardware. Muse Glimmer integrates multi-step reasoning, reliable tool use and failure recovery into a single model that…

  148. Selm: Self-Evolving Library Management for Multi-Skill Agent Optimization

    Mengxi Hu, Yuxuan Hu, Jinbo Su et al. · arXiv:2610.24630

    AI summaryThe paper introduces SELM, a self-evolving library management framework that coordinates skill retrieval, updates, and lifecycle control for LLM agents. SELM improves task performance across diverse domains by continuously accumulating, refining, and pruning reusable skills based on utility signals.

  149. Frequency-Domain Membership Inference Does Not Beat Confidence Thresholding: A Band-Resolved Analysis of Why

    Mohammad Zare, Pirooz Shmamsinejadbabaki · arXiv:2610.24643

    AI summaryThis paper evaluates frequency-domain membership inference by testing how image resolution degradation affects model confidence. It finds that frequency-based attacks fail to outperform standard confidence thresholding because discriminability decreases as detail is removed.

  150. Good Judgment, Bad Advice: Decision-Model Controllers Raise Agent Cost Without Improving Success

    Naman Vats · arXiv:2610.24649

    Agent scaffolds increasingly delegate small decisions (whether to stop, verify, or change approach) to cheaper models. We ask whether a typed decision model, Jev 1.13, consulted only at deterministic decision points, makes a Claude Sonnet 5.5 terminal agent cheaper without…

  151. Can AI agents make law? Evaluating AI legal relevance and creativity

    Benjamin Ricaud, Artem Galushko · arXiv:2610.24661

    AI summaryThis paper evaluates LLMs drafting a novel constitution for AI communities via multi-character debates. The agents reliably form foundational legal rules and generate AI-specific proposals, though their creativity remains limited to recombining existing human legal concepts.

  152. From Prediction to Action: Population Health World Model for Digital Medicine

    Xike Xie, Yu Li, Weizhong Yang et al. · arXiv:2610.24662

    AI summaryThis paper proposes population health world models to shift digital medicine from static outcome prediction to interactive decision-making. The main result is a foundational framework that couples health trajectories with interventions and resource constraints to enable population-level intervention intelligence and equitable care delivery.

  153. MM-LeJEPA: Correlated Gaussian Regularization for Multimodal Joint-Embedding Predictive Architectures

    Haowen Bai, Rui Gong$, Meichen Liu et al. · arXiv:2610.24681

    LeJEPA derives an isotropic Gaussian embedding target by minimizing, under its task assumptions, a Fisher information criterion that controls the task-averaged squared prediction bias. This enables unimodal self-supervised learning without reconstruction decoders,…

  154. Contrastive Adversarial Training for Robust Graph Neural Networks under Label Poisoning

    Manshika Charvi Bissessur, Melis Ilayda Bal, Michael Muehlebach · arXiv:2610.24685

    Graph Neural Networks (GNNs) are effective for modeling relational data but are vulnerable to label poisoning, where a small number of corrupted training labels can propagate errors across the graph via message passing. Despite this risk, defenses against label poisoning remain…

  155. Verifying Human-Written Reasoning References

    Ali Ansari, Farhana Ferdousi Liza · arXiv:2610.24690

    AI summaryThe paper introduces a method to verify each step of human‑written reasoning chains by checking entailment against cited premises, re‑checking against full premises, and attributing failures. On P‑FOLIO, only 52.3% of 386 derivations passed all checks; most “failures” were due to missing or mismatched premises, with 21 human errors, 11 translation errors, and 7 annotation errors identified.

  156. Spherical Physics-informed Neural Operator with Multi-scale Coupling for Meteorological Downscaling

    Yiqiang Ye, Yichi Wang, Haodi Zhang et al. · arXiv:2610.24708

    Meteorological downscaling is crucial for high-resolution regional climate forecasting and disaster early warning. While neural operators have emerged as a promising paradigm for modeling complex spatiotemporal mappings, existing frameworks often struggle with spherical manifold…

  157. SQuIREL: A Context-Relative Framework for Measuring Entity Richness in Wikidata

    Michelle Nwachukwu, Albert Meroño-Peñuela, Martim Brandão · arXiv:2610.24709

    Wikidata is a large, heterogeneous knowledge graph and applying data quality metrics requires context-specific approaches. The "richness" quality metric is currently under-researched and typically restricted to the ontology level, which fails to capture entity-specific…

  158. DiffuPlan: Editable Planning State for Diffusion Language Model Agents

    Qisheng Zhou, Zhen Xiong, Qiaoyu Tan · arXiv:2610.24717

    Diffusion language models (dLLMs) are emerging as an alternative to autoregressive (AR) language models, yet dLLM agents largely inherit an interaction protocol designed for AR generation: once intermediate state is written, later observations can only be incorporated by…

  159. Neuro-Inspired Inhibitory Message Passing for Accurate and Token-Efficient Multi-Agent Reasoning

    Nima H. Siboni, Magdalena Springer, Vahid Rostami · arXiv:2610.24718

    AI summaryInhibitory message passing routes each evidence sentence only to agents that lack it, suppressing redundant information without training. Across seven models and multiple multi‑agent architectures, the method boosts accuracy by 39–77 points and reduces tokens per run by 10–46 %.

  160. Tensor Network Datamodels for Training Data Attribution

    Farzaneh Heidari, Md Rifat Arefin, Louis Jaburi et al. · arXiv:2610.24721

    Datamodels predict how a model's behavior changes when different parts of its training data are included or removed. However, linear datamodels assign fixed contributions to training units and cannot represent non-additive joint effects. We introduce Tensor Network Datamodels…

  161. Where Natural Language Ends in Agents: Executable Skill Composition with MetaSkill

    Meng Shu, Wei He, Hang Zhou et al. · arXiv:2610.24723

    AI summaryThe paper introduces MetaSkill, a hybrid agent framework that combines natural-language skill packages with an executable DAG runtime for reliable skill coordination. Experiments show that MetaSkill improves task execution reliability and outperforms baseline natural-language and prompt-graph approaches across multi-skill artifact tasks.

  162. GLOSS-MT: Controllable Low-Resource Machine Translation with an Editable Dictionary

    Mich-Seth Owusu, Stephen E. Moore, Akwasi Asare et al. · arXiv:2610.24730

    AI summaryGLOSS-MT injects an editable offline dictionary into pretrained machine translation models via a single round of fine-tuning on mixed-language inputs. This approach improves translation quality on low-resource English-to-Asante Twi benchmarks by up to 5.48 chrF2 while enabling precise, retraining-free terminology control.

  163. Can LLM Agents Resolve Service Failures? Simulating Multi-Turn Complaint Handling under Information Asymmetry

    Wailing Ng, Mengze Hong, Chen Jason Zhang et al. · arXiv:2610.24733

    LLM agents are widely adopted in service chatbots for rule-guided support and information access, yet emotionally demanding complaint handling still relies heavily on human agents. We introduce ServiceBench, to our knowledge the first benchmark dedicated to complaint handling,…

  164. Toward Collective Model Intelligence: Characterizing and Coordinating Models

    SinapisAI Team, Jian-Dong Liu, Qun Dai et al. · arXiv:2610.24739

    Independently developed AI models accumulate diverse and complementary capabilities, but a growing model collection does not automatically realize Collective AI. Addressing this gap requires understanding model capabilities with limited evaluation, organizing complementary…

  165. Are We Evaluating VLM Token Pruning Right? Looking Beyond Accuracy and Token Count

    Geng Li, Guohao Chen, Shilin Shan et al. · arXiv:2610.24740

    AI summaryThis paper identifies fundamental flaws in how vision-language model token pruning is evaluated, specifically showing that aggregate accuracy and token counts mask poor token selection and real-world latency. The authors introduce PAA-Bench, along with new metrics Random-Pass@k and Preservation-Constrained Speedup, to provide a more rigorous evaluation of pruning quality and actual inference efficiency.

  166. ReTRACE: Feedback-Guided LLM Agent in a Chemistry Harness for Retrosynthesis Planning

    Jinxiang Xie, Yijian Zhang, Qingyuan Yi et al. · arXiv:2610.24744

    AI summaryReTRACE is a feedback-guided LLM agent for retrosynthesis planning that integrates molecular tools, predictive engines, and multi-criterion route evaluation. It achieves high success rates across standard benchmarks, generating valid synthetic routes verified by both programmatic checks and wet-lab experiments.

  167. CorrFlow: Self-Correcting Flow Matching

    Hangwei Zhang, Nathan Rouillé, Chuanxia Zheng · arXiv:2610.24750

    Flow-matching models generate samples through iterative velocity predictions, but typically do not revisit these predictions using the intermediate representations that produced them. We introduce CorrFlow, a self-correcting flow-matching framework that reuses this information…

  168. DialogMem: Evaluating Dialogue-Grounded Embodied Memory in 3D Environments

    SeongJun Jeong, Junghyun Kim, Gi-Cheon Kang et al. · arXiv:2610.24767

    AI summaryDialogMem benchmark tests embodied memory that fuses RGB‑D perception with human dialogue for object navigation and QA. Experiments show dialogue improves QA but not navigation, revealing key bottlenecks in object-level grounding, retrieval, and localization.

  169. Evidence Field: Adaptive Covering Programs for Medical Imaging

    Isarar Siddique, Raiyan Siddique, Arshi Niyaz et al. · arXiv:2610.24773

    Medical image classifiers typically return predictions without a native contract for independently reconstructing their spatial decision computation. Evidence Field is a trainable spatial-program architecture that jointly produces class scores, selected covering programs and…

  170. AI Rights with an Off-Switch: Rights-Balancing and Due Process Harmonize AI Rights with AI Safety

    Heather Alexander, Jonathan Simon · arXiv:2610.24782

    Several prominent voices in AI safety have recently opposed rights for AI on the grounds that such rights would make it harder for us to justify a mandatory off-switch for potentially dangerous systems. In this paper, we argue from a legal perspective that AI rights are fully…

  171. LLM Trojans that Increase Response Lengths and Cost

    Zhengxing Li, Guangmingmei Yang, Nader Alfares et al. · arXiv:2610.24784

    Management of the token-based costs of using LLMs has emerged as a significant problem. Some frontier-model providers charge five times per response token than per prompt token, while others offer prefilling discounts for prompt tokens. In this paper, we devise a defense against…

  172. IndustrialCAD-1400: Benchmarking Detailed Industrial Assemblies from Text

    Hebao Zhu, Kang An, Zhuoke Liao et al. · arXiv:2610.24789

    AI summaryThe authors introduce IndustrialCAD-1400, a text-to-CAD benchmark featuring 1,400 complex industrial assembly requests with detailed component, spatial, and numerical constraints. Results show that evaluating geometry program generation against multi-view functional specifications enables rigorous assessment of industrial text-to-CAD synthesis.

  173. When LLM-Generated Refactorings Ripple: An Empirical Study of Repository Adoption Readiness

    Muhammad Waseem, Aakash Ahmad, Pekka Abrahamsson · arXiv:2610.24790

    Large Language Models (LLMs) are increasingly used to refactor source files, but file-local evaluations do not reveal changes to contracts, dependencies, or caller assumptions affecting repository adoption. To address this gap, we conduct 1,500 generation attempts across 150…

  174. Cooperation Without Shared Rewards via Reciprocal Q-Augmentation

    Francesco Morri, Adel Abusitta, Quentin Cappart et al. · arXiv:2610.24793

    AI summaryReciprocal Q-Augmentation augments each agent’s Q‑function with a latent opponent model, enabling learning of both cooperative and defective behaviors using only its own rewards. Experiments on iterated dilemmas show RQA agents converge faster and achieve higher welfare than shared‑reward or purely cooperative baselines.

  175. Medical Fine-Tuning Reshapes, Not Reduces, Patient-Facing AI Risk: A Rubric-Based, LLM-Judge Evaluation Framework

    Savan Doshi · arXiv:2610.24807

    AI summaryThe paper proposes a risk‑aware evaluation rubric scoring medical LLM answers for six harmful language categories, using a three‑judge LLM ensemble. It finds medical fine‑tuning does not lower overall risk but reshapes it, reducing high‑alert mentions while increasing overconfident statements.

  176. First-Order LoRA Training with Phone NPUs

    Xu Zheng, Wei Cheng, Zhuomin Chen et al. · arXiv:2610.24816

    AI summaryFirst‑order LoRA training is ported to phone NPUs, executing all frozen‑weight multiplications on the NPU while keeping adapters and optimizer on CPU, and applying precision‑aware gradient guards; this yields on‑device fine‑tuning speeds comparable to GPU and 3–4× faster than CPU on Snapdragon.

  177. Pair-Aware Optimization: Coordinating Exploration and Refinement for Jailbreaking LLM Agents

    Juanyang Xu, Zheng Wang, Xingyu Zhao et al. · arXiv:2610.24823

    AI summaryPair‑aware optimization coordinates zeroth‑order prefix search with first‑order suffix refinement, selecting the best prefix‑suffix pair. Experiments show the hybrid ZO‑FO strategy outperforms single‑optimizer attacks, and the optimization order significantly affects jailbreaking success.

  178. Teaching Code Agents to Ask Without Leaking Private Code

    Wenjia Jiang, Jieke Shi, Zhensu Sun et al. · arXiv:2610.24824

    AI summaryUVA trains coding agents to ask cloud models using abstract descriptions that reveal less private info while maintaining repair quality. Trained agents solve 37.6% of repository issues (vs 25.3% alone) and reduce private entity disclosure by 3.7× and code leakage by 1.4×.

  179. Pattern-Driven Evaluation of LLM Code Optimization: Isolating Compiler-Transcendent Semantic Reasoning

    Wesley Lu, Runzhou Liu, Hongru Du et al. · arXiv:2610.24835

    AI summaryPatternBench evaluates LLM code optimizers on their ability to apply compiler‑transcendent transformations, measuring both runtime speedup and AST‑based faithfulness of the intended change. Results show that fidelity strongly predicts speedup and that fine‑tuning improves both metrics.

  180. SpriteStage: Long Horizon Animation Generation via Progressive Scene Programming and Replay

    Zhaoqi Wang, Zijian Zhang, Jiamou Liu · arXiv:2610.24869

    AI summarySpriteStage builds long animations by progressively enacting each scene from a checkpointed world state, revising based on runtime feedback, and re‑orchestrating to engine assets. It produces 9.9–14.3 min narratives, showing that iterative scene programming yields coherent, extended stories.

  181. Bellman Language Models: Solving the Recurring Decisions of LLM Agents

    Adarsh Vatsa, William Eiers · arXiv:2610.24871

    AI summaryBellman Language Models (BLMs) discretize an LLM agent’s conversation into states, estimate transition probabilities and costs, solve the resulting MDP once, and reuse the optimal policy, reducing model calls by up to 98% and raising task success from 29% to 96% on telecom benchmarks.

  182. The One-Pixel of Reasoning: One Truthful Relation Is Enough to Mislead LLM Agents

    Jinwei Hu, Youcheng Sun, Yi Dong et al. · arXiv:2610.24873

    AI summaryThe paper introduces the one-relation attack (ORA), which flips LLM beliefs by inserting a single, source‑grounded sentence targeting an implicit inferential warrant. ORA succeeds on 54.9% of proprietary and 80% of open‑weight biomedical models, transfers without feedback, and evades detection.

  183. RAFT: Redundancy-Aware Input Filtering for Temporal Graph Neural Network Training

    Yue Dai, Sarah Zhou, Youtao Zhang · arXiv:2610.24875

    AI summaryRAFT prunes redundant temporal events in TGNN training by tracking memory changes, filtering unnecessary prediction targets and historical context. It cuts inputs by ~35 % on average (up to 97 %) and training time by ~53 % with minimal precision loss.

  184. HybridResearcher: Bridging the Structured-Unstructured Boundary for Deep Research Agents

    Soyoung Yoon, Peiran Xu, Han Wang et al. · arXiv:2610.24899

    AI summaryHybridResearcher is a 4B parameter agent trained via synthesized trajectories and reinforcement learning to reason across structured databases and unstructured web sources. It outperforms much larger models on hybrid research benchmarks without sacrificing single-source performance.

  185. Leveraging Mental Models for Human-Centered Explanations: A Systematic Design Approach Illustrated by Explainable Fake Review Identification

    Sidra Naveed (University of Siegen, Germany), Md Shajalal (University of Siegen et al. · arXiv:2610.24903

    Explainable AI (XAI) often prioritizes model fidelity over user intelligibility, yielding explanations that satisfy technical transparency yet fail to support human sense-making. We propose a human-centered approach, MIND-X (Mental-model INtegrated Design for eXplainability),…

  186. A Cross-Domain Evaluation of Prompting Techniques for Large Language Models

    Kevin Krazius, Tim Schlippe, Paul Libbrecht · arXiv:2610.24913

    AI summaryThe study benchmarks Zero-Shot, Few-Shot, Retrieval-Augmented Generation, and automatic prompt optimization across six reasoning tasks using a single LLM. RAG tops the overall average (78.33 %) but no method outperforms all others; selection should depend on task characteristics.

  187. Arctic-SWE: Revisiting the Long Horizon Agent Training by Modeling-System Co-Design

    Boyi Liu, Yite Wang, Xinyu Lian et al. · arXiv:2610.24914

    AI summaryArctic-SWE introduces an asynchronous reinforcement learning framework for long-horizon software engineering agents through model-system co-design. Using optimized infrastructure and curated data, it enables a 4B model to achieve 65.0% on SWE-bench Verified.

  188. Same Data, Different Bytes: Serialization-Invariant Integrity Checks for Agent-Published Datasets

    Jin Gao, Maura Clark · arXiv:2610.24916

    Agent networks require reliable ways for requesting agents to verify where data is located, how it can be accessed, and whether the data received matches what the data owner made available. Checksum mismatches can reflect either altered content or serialization differences that…

  189. How Well Can LLMs Verbalize Mathematical Formulas? A Multi-Domain Evaluation

    Peter Volbach, Tim Schlippe · arXiv:2610.24917

    AI summaryLarge‑language models can generate reasonably accurate verbalizations of LaTeX formulas, with GPT‑5.2 scoring highest on simple transcriptions (≈76 % BLEU) and Claude Sonnet 4.5 excelling on extended transcriptions (≈36 % BLEU). Accuracy drops for longer, more complex formulas and depends on context and domain.

  190. Stable Signer V3: 4D Deformable Primitive Splatting Is All You Need for Sign Language Production

    Sen Fang, Liwei Che, Dimitris N. Metaxas · arXiv:2610.24926

    AI summaryStable Signer V3 uses 4D Deformable Primitive Splatting with face, body, and tunneling super‑resolution modules optimized once per signer, reducing facial error 71.4 %, body error 35.1 %, and RGB error 24.2 % while enabling interactive high‑resolution sign language avatars.

  191. Means-Ends Analysis Helps LLMs Plan in Continuous-State Domains

    Jiayi Li, Carl Kingsford · arXiv:2610.24928

    AI summaryMedaka uses Means‑Ends Analysis to guide LLMs in continuous‑state planning, recursively decomposing goals and tracking state. In Liquidworld, a liquid‑mixing benchmark, Medaka boosts accuracy across model families, showing that classical MEA techniques elicit better continuous‑state reasoning.

  192. What Can't Jev Decide? Probing the Limits of One-Pass Decision Models

    Wang Yang, Xinpeng Li, Yanyan Zhang et al. · arXiv:2610.24929

    AI summaryJev makes one-pass decisions efficiently but cannot match LLMs that write intermediate steps; its accuracy drops when multiple updates are needed and it fails to detect errors from stale state. It succeeds on 97.5% of one-pass solvable items but only 74% of more complex ones.

  193. TrustAgent-RFF: Agentic Diagnostic Planning for Reliable RF Fingerprinting under Domain Shift

    Chuan Liu, Tianya Zhao, Xuyu Wang · arXiv:2610.24930

    AI summaryTrustAgent‑RFF adds a frozen I/Q classifier with a diagnostic framework that measures counterfactual stability, prototype consistency, domain similarity, and signal quality to estimate prediction reliability without target labels, then uses an LLM planner to select diagnostics and a source‑calibrated decision layer to Accept, Reject, or Defer, reducing mis‑predictions under domain shift.

  194. LowNet: Looped Wavelet Neural Networks with 24 Learnable Parameters for Solving Poisson Equations

    Yuanhao Gong · arXiv:2610.24941

    AI summaryLowNet uses a 24‑parameter looped wavelet neural network that solves Poisson equations with high accuracy (up to 100.74 dB PSNR after three loops) and linear‑time complexity, making it compact and efficient for data‑specific applications.

  195. Epi: Towards a Persistent, Self-Improving Agent for Autonomous Research

    Yue Huang, Zhangchen Xu, Xiaonan Luo et al. · arXiv:2610.24944

    AI summaryÉpi is a self‑improving research agent that persists across model sessions, learns from experiments, and produces 120 record‑setting results—including an 84‑fold tighter $n$‑queens bound and a 3.6‑million‑fold Feigenbaum interval—while also proving new combinatorial conjectures. Its lightweight Épi‑turbo variant outperforms Codex on 30 routing/scheduling benchmarks with only 64 % model cost.

  196. Robust Direct Preference Optimization under Preference Label-Flip Attacks

    Chenye Yang, Weiyu Xu, Lifeng Lai · arXiv:2610.24945

    AI summaryThe paper develops defense mechanisms for Direct Preference Optimization against label‑flip attacks, introducing Trim‑K and Soft‑Trim‑K methods that remove or downweight high‑impact pairs. It proves deterministic gradient‑perturbation bounds and shows these defenses achieve uniform policy deviation guarantees under bounded‑region assumptions.

  197. ControlJEPA: Principled Trajectory Regularization via Lyapunov Tube Loss

    Thai-Khanh Nguyen, Nhi Y. Pham, Uyen N. B. Vo et al. · arXiv:2610.24951

    AI summaryControlJEPA regularizes language model hidden-state trajectories using a Lyapunov contraction condition, penalizing deviations from a reference tube. It improves fine-tuning accuracy and data efficiency across six benchmarks without architectural changes.

  198. CasePlay: Self-Play Reinforcement Learning from Case Reports for Medical Reasoning

    Hao Wang, Zihan Wang, Kai Wu et al. · arXiv:2610.24952

    AI summaryCasePlay uses document-grounded self‑play on medical case reports, generating questions from knowledge points and evaluating answers with rubric‑based quality feedback. It improves LLM medical reasoning by 3.1 overall points (6.3 on LiveClin) over prior self‑play baselines.

  199. MemPrice: Online Memory Allocation via Adaptive Pricing for Long-Horizon Agents

    Yiming Zong, Shiyuan Piao, Jiashuo Jiang et al. · arXiv:2610.24955

    AI summaryMemPrice allocates limited context to a long‑horizon agent by treating memory slots as a shared resource with an adaptive price that rises with memory pressure, keeping detail only when worth it. The method guarantees that, without horizon knowledge, average allocation regret vanishes under sublinear estimation error, outperforming fixed‑budget baselines across multiple benchmarks.

  200. Revealing what benchmark scores hide: Jointly measuring the breadth and reliability of LLM capabilities using accessibility profiles

    Kazem Faghih, Yize Cheng, Shoumik Saha et al. · arXiv:2610.24957

    AI summaryThe paper defines “accessibility” as the probability a model succeeds across equivalent formulations of a question. It shows that many model pairs have similar average accuracy but diverge on Access@5 vs. Reliable@5, revealing a tradeoff between breadth and consistency of performance.

  201. CoworkEnv: Synthesizing Training Environments for Long-Horizon Cowork Agents

    Zhongwei Xie, Yiming Du, Jiaxin Bai et al. · arXiv:2610.24960

    AI summaryCoworkEnv synthesizes training environments guided by workflow constraints, generating requests, tools, and validation checks for AI coworkers. Training with these environments raises Qwen3‑VL‑8B‑Instruct SFT scores from 46.6 to 64.1 on Claw‑Eval, especially improving multi‑turn performance.

  202. Label-Space Mismatch Distorts Cross-Cohort Evaluation in Breast Cancer Molecular Subtyping

    Suxing Liu, Byungwon Min, Zhijian Zheng et al. · arXiv:2610.24962

    AI summaryThe study shows that breast‑cancer subtyping classifiers fail cross‑cohort evaluation when training and test label spaces differ; adjusting the label set (label‑space compliance) improves accuracy by ~6–7 % and reveals that multimodal fusion adds no benefit over mRNA alone.

  203. Towards Human-AI Complementarity for AI Safety

    Sander Lanbo Shi, Miranda Anna Christ, Eric Modesitt et al. · arXiv:2610.24969

    AI summaryThis paper introduces a large benchmark suite to study human-AI complementarity in safety-critical AI oversight. The results show that while strong potential for complementarity exists, current assistance and hybridization methods fail to effectively capture it.

  204. PRECOCIAL: Pretraining with Code Curriculums via Iterative Search for Accelerated Learning

    Edward Gu, Ali Payani, Kevin Ellis · arXiv:2610.24970

    Fully synthetic pretraining data generated by symbolic programs can bootstrap downstream training on naturalistic tasks, such as language modeling, but the generating programs have so far been designed by hand. We introduce PRECOCIAL, a method for automatically optimizing…

  205. CorrectRTL: Boost RTL Generation Quality Through Automated Self-Correction with Instruction Decomposition

    Jing Wang, Shang Liu, Hangan Zhou et al. · arXiv:2610.24977

    AI summaryCorrectRTL decomposes RTL generation into scaffold creation and detailed implementation, using structure-aware decomposition, snippet-based RAG, and SVA-based self‑correction. On the new ScaleBench benchmark it raises Pass@1 from 20.5 % to 49.0 % (+28.5 %) and reaches 96.1 % on VerilogEval.

  206. UtoMe: Observation-Uncertainty-Guided Token Merging for Weather Foundation Models

    Yunbei Zhang, Janet Wang, Xi Xiao et al. · arXiv:2610.25001

    AI summaryUtoMe introduces an observation-uncertainty-guided token merging framework for weather transformers that combines feature similarity with ensemble data assimilation spread. At a 50 percent token reduction, it significantly lowers forecasting error compared to standard token merging while maintaining reduced computational costs.

  207. UpLoop: Upcycling Large Language Models with Gated Loop

    Tieyuan Chen, Huabin Liu, Yingtao Zhang et al. · arXiv:2610.25004

    AI summaryUpLoop is a post‑training technique that loops selected layers of a pretrained LLM with hidden‑wise gates, allowing each loop to refine outputs rather than overwrite them. Starting from Qwen3‑4B, UpLoop raises average benchmark accuracy by 6.17 % at R = 3.

  208. ReTrace: Visual Backtracking for Efficient Multimodal Large Language Models

    Guangzong Si, Dong Wang, Yifan Yu et al. · arXiv:2610.25005

    AI summaryReTrace introduces a dormant token state for MLLMs that decouples early computational deactivation from permanent deletion. This enables the model to retrieve information from previously pruned visual tokens during middle-layer reasoning, achieving a 2.83x prefilling speedup with minimal performance loss.

  209. IECLA: Interpretable Emotion Contribution Learning for Affective Image Editing

    Yijie Guo, Dexiang Hong, Weidong Chen et al. · arXiv:2610.25015

    AI summaryIECLA separates source‑emotion attribution from target‑aware editing, learning signed object‑level contributions via counterfactual interventions and a context‑conditioned predictor. It consistently improves target‑emotion expression while preserving content across six backbones and is validated by VLMs, humans, and user studies.

  210. LLM Agents as Suppliers of Physical System Models: Calibration and Acceptance in Modelica

    Jörg Frochte, Herbert Schmidt · arXiv:2610.25019

    AI summaryLLM coding agents can generate Modelica models from client specifications and data for both simulated systems and a real magnet, but the handover leaves structural choices open. Acceptance is achieved by requiring the model to belong to a set of acceptable solutions rather than matching a single reference, and specifying residual thresholds improves pass rates.

  211. Synergy-Aware Residual Flow Matching for Single-Cell Perturbation Prediction

    Jingrui Wu, Wangyun Dan · arXiv:2610.25021

    AI summarySynGeneFlow predicts single‑cell responses to perturbations by learning a residual flow from an additive prior, incorporating gene‑interaction masks and deformation biases, and aligning distributions with MMD. It outperforms existing methods on genetic and drug perturbation benchmarks, especially for non‑additive synergy effects.

  212. One Head Away from Language Confusion: Single Attention Heads Across Model Families

    Jiwon Jeong, Anjelo Jann Laroza, Chaewoon Yoon et al. · arXiv:2610.25026

    Large language models sometimes reply in an unexpected language, a failure known as language confusion. We ablate individual attention heads in 12 model checkpoints spanning seven model series, using FLORES-200 continuations in five languages and Language Confusion Benchmark…

  213. VLA-Rolling: Fewer Denoising Steps, Better Control via Adaptive Action Reuse

    Sicheng He, Yi Pan, Qiuting Yu et al. · arXiv:2610.25043

    AI summaryVLA-Rolling reuses discarded denoising tails in vision‑language‑action models, adaptively allocating steps and refining with confidence estimates. It cuts inference cost up to 1.48× and boosts success rates by up to 15 % on 16 model‑benchmark pairs.

  214. SteadyThought: Mitigating LLM Under-Thinking via Thought-Level Preference Optimization

    Zhenyue Peng, Lin Yang, Jie Wang et al. · arXiv:2610.25045

    AI summarySteadyThought optimizes thought-level preferences to curb excessive switching in large reasoning models, forcing continuations from selected points to improve quality. It reduces token usage by up to 63.8% while preserving accuracy and generalizes across domains and languages.

  215. HCFM: Helmholtz Component Flow Matching for Time Series Anomaly Detection

    Shyam Sundar Saravanan, Tie Luo, Sanjay Madria · arXiv:2610.25059

    AI summaryHCFM trains flow-based generative models for time‑series anomaly detection by splitting the vector field into divergence‑free transport, compression, and residual heads; this separation reduces Jacobian cost and improves detection accuracy on large univariate and multivariate benchmarks.

  216. Policy Is Not Capability: Some Safety Benchmarks Measure Which Definition of "Unsafe" You Trained On

    Vahid Jebraeeli, Jonathon Romero, Yijin Wang et al. · arXiv:2610.25060

    AI summaryThe paper shows that safety benchmark scores largely depend on the labeling policy used, not model capability. It demonstrates that minor changes in policy or a few parameters can shift scores across the full range, calling for explicit reporting of contamination and policy definitions.

  217. One Skill Takes Over: Clashing Agent Skills and a One-File Fix

    Parsa Razmara, Seyedarmin Azizi, Ardalan Aryashad · arXiv:2610.25064

    AI summaryThe study shows that coding agents tend to “take over” when two same‑job skill files are present, following only one skill’s rules. Adding a single example that merges both skills dramatically reduces this clash, enabling models to follow up to 99% of the possible rules.

  218. Auto-MD-bench: Evaluating Autoresearch Agents for Real-World Medical Tasks

    Shenqi Zhou (National University of Singapore, Zhejiang University), Qiran Zou (National University of Singapore) et al. · arXiv:2610.25069

    AI summaryAuto-MD-bench benchmarks 15 real-world medical tasks across 10 datasets, evaluating autonomous ML agents. The study finds that top agents match baseline primary metrics but have poorer risk calibration and robustness to population shifts, showing that single performance metrics are insufficient for clinical modeling.

  219. DAGLoop: Aligning Method Design with Experimental Feedback in Automated AI Research

    Dengyuxing Wang, Yonggang Zhang, Qianshu Cai et al. · arXiv:2610.25089

    AI summaryDAGLoop aligns automated AI research with experimental feedback by constructing a directed acyclic graph of design decisions, each paired with a targeted ablation test that validates its expected effect under required conditions. Experiments on numerous research tasks show that this method yields substantial performance gains across diverse settings.

  220. Toward Agentic Retrieval-Augmented Generation for Enterprise Retail Workflows over Heterogeneous Data Sources

    Jeonghwan Choi, Jibin Hwang, Hayoon Park et al. · arXiv:2610.25096

    AI summaryRetailBridge is a new retail benchmark that simulates complex, heterogeneous data workflows, requiring agents to chain evidence across structured tables and unstructured text. RetailRAG, a framework with schema briefing and source‑routing, outperforms existing baselines and shows multi‑source chaining is the key bottleneck.

  221. Pre-Query Retention with Bounded Bit and Word Retrieval

    Pranav Singh, Prashant Singh · arXiv:2610.25098

    An agent can retain information before receiving a future question and later retrieve evidence from an archive. Evaluating this arrangement requires accounting for both retained information and the width of each retrieval response. Decision-tree capacity bounds describe…

  222. Explore or Confirm? LLM Agents Misallocate Measurements Under Noise

    Abdul Karim, Matt Keon · arXiv:2610.25111

    AI summaryThe paper introduces Wellocate, a benchmark simulating noisy experimental assays, and evaluates five LLM agents that misallocate their limited budgets between exploration and confirmation. Results show over-confirmers waste resources on re‑tests, while under-confirmers ignore repeated checks, both performing worse than simple scripted baselines.

  223. Self-organizing reinforcement learning: a swarm approaches the explore-exploit optimum

    Galen J. Wilkerson · arXiv:2610.25113

    AI summaryA minimal foraging swarm balances exploration and exploitation via Levy flights and threshold cascades, reaching an ideal‑free distribution without learning or rewards. It attains ~65% of the oracle ceiling immediately, surpassing some RL methods early but not its final asymptote.

  224. Compile Once, Run Cheap: Frozen, Portable Skills for Embodied Agents, and What Recursive Self-Improvement Adds

    Jingwen Bai, Guochao Bai, Canbo Zhang et al. · arXiv:2610.25114

    Embodied AI lacks the data-rich pretraining that gave language models their agents and skills, so new manipulation capability costs demonstrations per task or a frontier model in every episode. We study a third route: a strong general model acts only as an offline author that…

  225. ClinSDT: LLM-Encoded Clinical Semantic Guidance for Sepsis Treatment via Decision Transformer

    Yanyan Wu, Guanyu Zhu, Changbin Zhao et al. · arXiv:2610.25121

    AI summaryClinSDT augments a Decision Transformer with LLM-encoded clinical semantics (Profile, Context, Advisory) and a treatment‑response forecaster to filter low‑uncertainty actions. On MIMIC‑III/IV it improves sepsis treatment policies over standard imitation, RL, and Transformer baselines.

  226. TIRE: Top-Down Formula Instantiation with Reliable Execution for Physics Problem Synthesis

    Xiaoyu Wu, Zhaoxin Yu, Xinglin Xiao et al. · arXiv:2610.25134

    AI summaryTIRE generates physics problems by instantiating reusable formulas and conditions, creating reference solutions before generation for reliable supervision. The resulting TIRE‑19k dataset improves fine‑tuned and RL‑trained LLMs by ~3 pp over comparable datasets.

  227. Reflection-Guided Dynamics Rectification for Text-to-Image Generation

    Shuo Xu, Hanrui Ying, Debin Liu et al. · arXiv:2610.25139

    AI summaryReflection‑Guided Dynamics Rectification (RGDR) uses reflections of a generated image to intervene at every sampling step, correcting the trajectory of a diffusion model. On fixed budgets, RGDR boosts final checklist scores by 1.51× over TIR and 1.81× over Dynamic CFG.

  228. Spectral Adaptive Graph Transformer for Efficient and Scalable Traffic Forecasting

    Amirhossein Ghaffari, Susanna Pirttikangas, Ekaterina Gilman · arXiv:2610.25140

    AI summaryThe paper proposes a Spectral Adaptive Graph Transformer that learns a directed, state‑conditioned spatial operator with linear sensor cost, combined with a sparse diffusion branch and frequency‑bin attention. It achieves state‑of‑the‑art accuracy on six benchmarks while using only a quarter of the memory and training twice as fast.

  229. PLANE: Plug-and-Play Fine-Grained Visual Experts for Hallucination Mitigation in Large Vision-Language Models

    Jianghao Yin, Lang Yu, Qianxi Yu et al. · arXiv:2610.25146

    AI summaryPLANE introduces fine‑grained LoRA visual experts and an instruction‑aware gate to enrich CLIP features, reducing hallucinations in large vision‑language models. On new GPT4‑free GIFT benchmark and existing tests, it cuts hallucinations with negligible latency, outperforming state‑of‑the‑art methods.

  230. Learning without Overwriting: Structural Knowledge Fusion for Continual Learning

    Kanishk Bakshi, Amitansu Pattanaik, Kathiravan Srinivasan · arXiv:2610.25150

    AI summaryKnowledge Fusion Network learns each new task in a lightweight specialist and fuses it into a global model using a novelty‑gated Structural Fusion Module. It achieves 71% accuracy on ten‑task Split CIFAR‑100 while adding only 25% more parameters, cutting forgetting by ~58% versus replay.

  231. M-JEPA: Predictive Self-Supervised Learning for Molecular Graphs with Scaffold-Shift Evaluation on Tox21

    Karthik Iyer, Nasser Sabar · arXiv:2610.25163

    AI summaryM-JEPA trains a molecular graph encoder with masked subgraph prediction and an EMA teacher, outperforming InfoNCE on ESOL (RMSE 2.12 vs 3.75) while running faster, and shows mixed but sometimes improved ranking and calibration on Tox21 scaffold splits.

  232. World Models, Trees and Foundation Models for Retail Forecasting: Evidence from Four Public Data Sets

    Karthik Iyer, Madan Dabbeeru · arXiv:2610.25170

    AI summaryThe paper benchmarks multiple forecasting models—world models, LightGBM, TFT, TimesFM, etc.—across four retail datasets at various grain levels (item, store, category, chain). It finds that an average of world model, LightGBM, and TimesFM performs best for most item/store and cross‑store tasks, while model choice varies for higher‑level aggregates.

  233. Memory, Know Your PLACE: Governing Lifecycle State and Query-Time Eligibility in Persistent-Memory Agents

    Chen-Fang Hu, Hong-Han Shuai, Woan-Shiuan Chien · arXiv:2610.25179

    AI summaryPLACE adds write‑side state certification and read‑side authorization to persistent memory, improving lifecycle correctness and preventing causal leakage. Evaluation on Mem0 with Qwen2.5 models shows combined governance yields best performance while preserving relevant support.

  234. Dialogue Generation for Conversational Recommendation Using User Search Interactions and Knowledge Graphs

    Minsung Hwang, Donggyu Yoon, Gowoon Hwang et al. · arXiv:2610.25182

    AI summarySearCl automatically generates 3,538 recommendation dialogues from search and click logs, using a probabilistic state machine and LLM agents guided by knowledge graphs. The generated conversations score higher than benchmark dialogues under an LLM-as-a-judge protocol.

  235. Reranking Answers of Large Language Models with Knowledge Graphs

    Mikhail Salnikov, Hai Le, Olga Tsymboi et al. · arXiv:2610.25185

    AI summaryThe paper extracts subgraphs around entity candidates by computing shortest paths in Wikidata, then uses features from these subgraphs to rerank LLM-generated answers. Experiments show the reranker improves answer accuracy over baseline LLM outputs.

  236. ViCoR: Estimating Visual Necessity via Counterfactual Residuals for Multimodal Medical Data Selection

    Haotian Gan, Yudong Li, Xintian Li et al. · arXiv:2610.25202

    AI summaryViCoR selects image-text pairs that truly need visual input by measuring counterfactual residuals and calibrating with medical supervision; on two backbones and multiple benchmarks, a 20% ViCoR‑selected subset outperforms full-data fine‑tuning and other selectors.

  237. BrandEval: A Two-Track Multi-Agent Benchmark for Risk-Sensitive LLM Crisis Communication

    Haotian Gan, Weidong Tang, Hanbin Sun et al. · arXiv:2610.25208

    AI summaryBrandEval is a two-track benchmark for LLM crisis communication, with a static strategic analysis track and a dynamic multi‑agent sandbox (BrandPolis) that simulates consumer feedback, competitor actions, and trust trajectories. It shows static quality predicts some outcomes but misses volatile, tail‑risk failures revealed by dynamic tests.

  238. NeuroAct: Advancing EEG Analysis and Decoding via Dual-Loop Autonomous Research

    Wei Xiong, Jiangtong Li, Han Zhao et al. · arXiv:2610.25211

    AI summaryNeuroAct automates EEG research with a dual-loop system that tests hypotheses, selects interventions, and refines models using evidence from signal structure, representations, and training dynamics. It boosts macro‑average accuracy by 17.75 points over BrainAgent and improves balanced accuracy and correlation across four EEG tasks.

  239. Calibration-Free Early Stopping for Chain-of-Thought Reasoning via E-processes

    Dong-Jae Lee, Gyojin Han, Junmo Kim · arXiv:2610.25212

    AI summaryCalibration-free early stopping for chain‑of‑thought LLM reasoning uses two e‑processes to sequentially accumulate evidence, guaranteeing a user‑specified false‑alarm rate without calibration. The method matches or outperforms calibration‑based policies across models and datasets.

  240. Assessing the Empirical Evidence for Loss of Control from Agentic General-Purpose AI

    Risto Uuk, Santeri Koivula, Lorenzo Pacchiardi et al. · arXiv:2610.25241

    Theoretical literature warns that advanced generalist agentic systems might pursue instrumental goals that are misaligned with human preferences, thus posing risks of irreversible loss of human control. The EU's Code of Practice for General-Purpose AI lists loss of control as a…

  241. BatchParScale: Sparse Batch-Mixing for Sequence Models

    Hans Peter Lyngs{\o}e Raaschou-jensen (University of Copenhagen), M. Onurcan Kaya (Technical University of Denmark), Desmond Elliott (University of Copenhagen) · arXiv:2610.25254

    AI summaryBatchParScale adds a sparse communication attention to parallel reasoning streams, enabling them to share information at selected positions. It improves language‑model loss over ParScale, outperforms unmasked baselines in masked pretraining, and works with LoRA fine‑tuning, but retrieval gains remain uncertain.

  242. EG-GRPO: Evidence-Guided Step-level Credit Assignment for Deep Search Agents

    Sijia Luo, Mengjie Gao, Yuxiao He et al. · arXiv:2610.25269

    LLM-based search agents demonstrate strong capabilities in long-horizon information seeking and reasoning, typically trained via reinforcement learning. However, existing approaches predominantly rely on trajectory-level outcome rewards, providing limited supervision for complex…

  243. Bridging Concepts: Multi-Agent Reasoning over Scientific Concept Graphs for High-Impact Research Prediction

    Donggyu Yoon, Minsung Hwang, Juneha Baek et al. · arXiv:2610.25281

    AI summaryThe paper builds scientific concept graphs from conference papers and proposes MiroGraph, a multi‑agent system that designs, extracts, and classifies features to forecast high‑impact concept pairs. MiroGraph outperforms existing impact‑forecasting and temporal link‑prediction baselines.

  244. Vision as Proprioception: Estimating Humanoid Robot Pose from Video

    Jiaxi Jiang, Matthias Heyrman, René Zurbrügg et al. · arXiv:2610.25288

    Estimating a humanoid robot's internal state from video has a wide range of real-world applications but remains unexplored. During interactions with a robot, its onboard state information may be unavailable due to privacy, ownership, or communication constraints. Meanwhile,…

  245. World Model Interpretability: From Decoding Representations to Understanding Latent Worlds

    Jize Wang, Yongcheng Jing, Xinyi Le et al. · arXiv:2610.25296

    Emerging Joint-Embedding Predictive Architectures (JEPAs) are moving beyond representation learning towards latent world models that support prediction, planning, and control. Yet their latent worlds naturally lack a human-interpretable interface. In this Perspective, we argue…

  246. Aligning Language Models with Indigenous Community Cosmovision through Constitutional AI

    Silvia Fernández-Sabido, Jorge Reyes-Magaña, Jesús Adrián Chay Tun et al. · arXiv:2610.25298

    Large language models (LLMs) are predominantly trained on corpora that reflect Western, anglophone worldviews. This asymmetry is not neutral: when a model answers questions about territory, community authority, or the relationship with nature, it does so from assumptions that…

  247. Learning When to Abort in Transformer Planning: A Mechanistic Study

    Shi Feng, Qimin Zhong, Siwei Wang et al. · arXiv:2610.25300

    Planning does not by itself imply the ability to recognise errors, but recognising errors can improve planning capacity. In this paper, we study this phenomenon in Transformer planning. To analyze the inner mechanism, we follow the approach of Wang et al. (2024) and abstract…

  248. Shared-Private Cross-Modal Discrepancy Learning for Imbalanced Multi-Source Audio-Visual Deepfake Detection

    Qiwu Wen, Jahangir Alam · arXiv:2610.25301

    Audio-visual deepfake detectors are often trained under a single dataset or manipulation regime, but multi-source training collections may contain heterogeneous attacks and uneven source distributions. Training separate detectors for each source is inefficient, while a single…

  249. AdaFedXplain: Adaptive Federated Learning with Explainable AI for Ransomware Detection

    Md. Emran Biswas, Md. Delowar Hossain, Mst. Tanbin Yasmin Tanny et al. · arXiv:2610.25318

    Attacks using ransomware have developed into complex multiphase campaigns that target vital infrastructure, resulting in annual damages of billions of dollars. Conventional detection techniques are ineffective against zero-day variations, and privacy issues are raised by…

  250. Where and Why Search-Augmented LLMs Fail When Reasoning over Rapidly Evolving Knowledge

    Tianyi Hu, Bhavyajeet Singh, Niket Tandon et al. · arXiv:2610.25323

    AI summaryTREK is a framework and benchmark that diagnoses why large language models struggle to reason about fast‑changing facts. It shows that the main failure lies in post‑retrieval reasoning, where models get misled by conflicting evidence rather than retrieval errors.

  251. Formally Verified Autoresearch for Analyzing the Expressivity of Multi-Head Attention

    Karthik Viswanathan, Plamen Dimitrov, Stefano Rocca et al. · arXiv:2610.25341

    Multi-head attention is a central component of the transformer architecture, yet how its expressivity depends on the number of heads remains poorly understood. We study a one-layer, attention-only transformer with additive positional embeddings and define the head complexity…

  252. Local Evidence, Global Failure: Diagnosing Speech-Vision Temporal Composition in Audio-Visual Language Models

    Jaehong Myung, Seunghun Oh, Unsang Park · arXiv:2610.25352

    AI summaryThis paper introduces Temporal Evidence Decomposition, a training-free diagnostic framework that separates local visual verification from speech-relative aggregation in audio-visual language models. It reveals that while models struggle with full-video tasks, their local visual evidence recovery dramatically improves when queried with isolated temporal windows.

  253. CHSM8: A Chess Transformer that Follows Natural-Language Style Prompts

    Ilia Badanin · arXiv:2610.25356

    We present CHSM8, a 210M-parameter chess transformer that plays moves conditioned on a free-text description of a playing style, e.g. "go for the Sicilian Defense", "solid, safe, risk-free chess" or "You are Magnus Carlsen in his prime". The model is pretrained without search on…

  254. CD-OPD: Contextual Digest for On-Policy Distillation

    Mingyuan Li, Yucheng Li, Xiaxia Wang et al. · arXiv:2610.25359

    Teacher takeover in on-policy distillation (OPD) can produce incorrect responses even when the student and teacher independently answer the same problem correctly, a failure we quantify using Collaboration Failure Rate (CFR). To address it, we propose Contextual Digest for…

  255. Aligning Cultural Behaviors in Arabic Language Models via Preferences

    Junhong Liang, Daniil Orel, Saeed Almheiri et al. · arXiv:2610.25362

    Arabic LLMs have improved rapidly, but aligning them with country-specific cultural behavioral preferences remains underexplored. Previous work has focused primarily on instruction-tuning for factual knowledge, overlooking nuanced cultural behaviors. We propose ArabPref, which…

  256. MemDerive: A Diagnostic Benchmark for Agent Memory over Evolving Data

    Sen Gao, Yongan Li, Han Chen et al. · arXiv:2610.25373

    AI summaryMemDerive is a diagnostic benchmark that records exact derivation DAGs for agent memory over evolving data, enabling error tracing at intermediate states. It shows that existing memory systems lag simple retrieval baselines and rarely propagate implicit changes, highlighting the need for gathering, versioned rules, and dependency maintenance.

  257. Outcome-Anchored Credit Reallocation for Agentic Knowledge Graph Question Answering

    Mingyuan Li, Yucheng Li, Xiaxia Wang et al. · arXiv:2610.25384

    AI summaryThe paper introduces Outcome-Anchored Credit Reallocation (OACR) to assign fine-grained operation credits from final answer rewards in agentic knowledge graph question answering. OACR improves multi-turn reasoning performance across three benchmarks while reducing inference-time LLM calls and token usage.

  258. When Form Changes but Logic Doesn't: Building Logic-invariant LLMs through Logical Structure

    Xuyuan Liu, Xinshuai Dong, Elynn Chen et al. · arXiv:2610.25402

    Large language models (LLMs) have achieved strong performance across diverse reasoning tasks, yet it remains unclear whether this performance reflects an understanding of underlying logical structure or a reliance on shallow semantic cues. A key indicator of such understanding…

  259. MOSAIC: Multi-Objective Search for Allocating Inference Cache Across LLM Decoder Layers

    Sravanth Kodavanti, Manjunath Arveti · arXiv:2610.25431

    The Key-Value (KV) cache is the main memory bottleneck of long-context LLM inference. Token eviction methods such as SnapKV, H2O, AdaKV and L2Norm shrink it, but they give every transformer layer the same budget, although layers differ in which tokens they need. We present…

  260. Stepwise Reasoning Verification: Don't Generate, Classify!

    Yifei Shi, Michalis Korakakis, Rami Aly et al. · arXiv:2610.25441

    AI summaryThe paper redefines stepwise reasoning verification as natural language inference, classifying each step as entailed or not. It shows that small encoder classifiers (0.15B) outperform most generative verifiers, achieving comparable accuracy with far fewer parameters and annotations.

  261. Enhanced Masked Diffusion Unlearning

    Tomer Garber, Tom Tirer · arXiv:2610.25447

    Masked diffusion language models (MDLMs) generate text by iteratively unmasking tokens with bidirectional context. As these models reach real-world deployment, machine unlearning becomes essential. This process aims to remove the influence of a designated "forget set" without…

  262. System X: An LLM Decision Model That Replies from Its Own KV Cache

    Syed Usama Khalid Bukhari, Syed Safwan Khalid, Muhammad Aamir · arXiv:2610.25456

    Decision models return probabilities over supplied options, but a deployed agent may also need to reply in words. The present study introduces System X, a large language model (LLM) decision model that adds a text-reply option to the LLM-as-Jev readout. When this option wins, or…

  263. Reliability-Preserving Compression for Deployable Medical Image Segmentation

    Sagar Kumar, Shailja Sharma, Tirthajit Baruah et al. · arXiv:2610.25460

    Post-training compression of pretrained medical segmentation models commonly uses quantization, pruning, or distillation to reduce model size and computational cost. Existing medical segmentation quantization studies mainly evaluate Dice, model size, memory, and latency, but…

  264. DiaLong: Benchmarking Reminiscence in Long-Context Dialogues

    Owen Bianchi, Samer Aslan, Ryunosuke Saito · arXiv:2610.25463

    AI summaryDiaLong is a benchmark dataset of 100 long‑context dialogues with a fact‑recall task, where models must classify 40 candidate facts as true or false. Results show current LLMs still forget long‑range information, indicating room for memory‑enhancing methods.

  265. On Reasoning Correctness Directions

    Munachiso Samuel Nwadike, Zayd M. K. Zuhri, Rifo Genadi et al. · arXiv:2610.25464

    AI summaryThe study trains a 3‑million‑parameter model on ChainSearch, an arithmetic reasoning task, and uses linear probes to find internal directions that predict reasoning correctness. These directions are statistically significant but do not causally improve reasoning, challenging the linear representation hypothesis.

  266. A failure of Imagination: VLMs fail to use visual representations for text, but self-distillation can help

    Shashwat Singh, He He, Tal Linzen · arXiv:2610.25470

    Vision-language (VL) models are typically built by fine-tuning a language model to attend to visual features in service of a Visual Question-Answering objective. We ask whether this alignment changes how language models represent text---especially on tasks where visualization…

  267. P(Yes): 15$\times$ Improvements via Test-Time Scaling of Decision Models

    Lev Stambler · arXiv:2610.25474

    Decision models answer typed questions, such as multiple-choice or yes/no questions, with a probability for each option. We add test-time search to frozen decision models, with no training: we show the model a complete proposed answer, read off its probability of saying "Yes" to…

  268. Multimodal-Conditioned Latent Diffusion Models for Spatiotemporal Brain MRI Forecasting

    Antonio Scardace, Silvia Ingala, Sebastiano Battiato et al. · arXiv:2610.25481

    Spatiotemporal forecasting of 3D anatomical changes is a critical generative vision challenge for modeling Alzheimer's Disease (AD) progression. While brain MRI forecasting from single-modality data has advanced, other key complementary multimodal biomarkers remain…

  269. PRIMA: Pose Refined Inductive Motion Adapter for Zero Shot Social Bodily Behavior Recognition

    Mingcong Ding, Babette Bühler, Tim Fütterer et al. · arXiv:2610.25482

    Recognizing fine-grained bodily behaviors, such as self-grooming, postural shifts, and backchanneling, is a useful intermediate step for computational social signal analysis. But the behaviors that matter vary across social contexts, and retraining a model for each new taxonomy…

  270. From Proposal to Execution: Modeling Interaction Semantics in Shared Autonomy

    Shashank Shekhar, Laurent Jeanpierre, Abdel-Illah Mouaddib · arXiv:2610.25496

    In many human-AI systems, candidate actions are not executed directly but are first evaluated by another decision-making entity under a potentially different objective or decision model. Standard decision-theoretic frameworks do not require this interaction to be represented…

  271. Assessing the AI Readiness of Construction Datasets: A Multidimensional Operational Framework

    Xiaoyu Hou, Bo Xiao, Abdolmajid Erfani et al. · arXiv:2610.25499

    The rapid growth of artificial intelligence (AI) applications in construction has increased the demand for datasets suitable for reliable model development, evaluation, and reuse. However, construction datasets vary widely in documentation, quality, governance, and evaluation…

  272. Formal Raising: Embedding Verifiable Ethical Properties into the Development of AI

    Rolf Drechsler, Christina Plump · arXiv:2610.25501

    Alan Turing proposed constructing a ``child machine'' and educating it rather than directly programming an adult-like intelligent machine. Recent work on model raising revives this developmental view for Large Language Models by arguing that moral values should accompany…

  273. Dynamics-Aligned Representation Learning under Induced Partial Observability

    SM Mazharul Islam, Manfred Huber · arXiv:2610.25511

    Model-based reinforcement learning (MBRL) has enabled sample-efficient learning of continuous control policies from high-dimensional observations through learned latent dynamics models. These models are typically trained with observation reconstruction objectives, which provide…

  274. When Interpretations Persist: Downstream Influence in Gaze-Aware Assistants

    Mingcong Ding, Chenyan Zhang, Zhuojiang Cai et al. · arXiv:2610.25512

    AI assistants may carry forward not only observations but also interpretations of what a person is doing or may do next across time. Once retained, these interpretations become context for later predictions and system-triggered outputs. We study whether this representation step…

  275. Bud ContextCompact 2.0: Context Compaction for Agent Success and Accuracy with Small Language Models and Constrained Context Windows

    Jithin VG, Ditto PS · arXiv:2610.25516

    Agents that work for many turns outgrow the context window of the model that serves them, and on small language models (SLMs) and constrained inference systems that window is small. Context compaction replaces older turns with a summary so a session can continue, but it is…

  276. ATEST: Adaptive Resource-Aware Test-Time Scaling for LLM Inference

    Mobina Kashaniyan, Ali Jannesari · arXiv:2610.25519

    Test-time scaling (TTS) improves large language model (LLM) reasoning by sampling multiple answers, but fixed sampling budgets ignore both query difficulty and the changing energy cost of inference under GPU contention. We measure up to a 4.1-fold increase in energy for the same…

  277. When Empathy Misses the Goal: A Benchmark for Goal Displacement in LLM Advice

    Dean Ariel, Guy Laban · arXiv:2610.25522

    Conversational large language models can respond with warmth and reassurance while failing to advance the user's stated goal. We conceptualize this failure as $\textbf{goal displacement}$, the substitution of persona-maintenance content for goal-relevant substance. To measure…

  278. StopLoss: Teaching Agents to Predict Failure and Stop Early

    Jiarong Liang, Xueguang Ma, Dongfu Jiang et al. · arXiv:2610.25525

    Coding agents keep working on runs that will fail verification, and asking a frontier model to watch for this is expensive in its own right. We introduce StopLoss, a small external monitor that learns failure recognition from completed trajectories and their verifier outcomes.…

  279. From Clinical Risk Prediction to Operational Decisions: An Uncertainty-Aware Framework for ICU Staffing

    Jiayan Yang, Ad Feelders, Arno Siebes · arXiv:2610.25530

    Advances in electronic health records (EHR) and large-scale critical care databases have enabled the development of machine learning models for the early detection of patient deterioration. While these models often achieve strong predictive performance for outcomes such as…

  280. Modaliff: A Unified Token Diffusion Model for Any-to-Any Generation

    Duc Kieu, Kien Do, Minh Khoa Le et al. · arXiv:2610.25533

    AI summaryModaliff learns a token-based diffusion model that uses bimodal pairs to keep each modality’s native latent sequence while unifying them into a single token stream with per‑token attributes. It outperforms other any‑to‑any models in fidelity across text, image, and audio with fewer parameters and training data.

  281. Residential Construction Image Dataset Using CSI Divisions for Deep Learning-based Object Detection

    Fahad Iqbal, Shayan Mirzabeigi · arXiv:2610.25535

    Accurate recognition of construction site elements is essential for the application of deep learning (DL) in the construction industry. Despite rapid advances in computer vision, the adoption of DL in construction has been limited by the lack of structured, publicly available…

  282. Auditing Tool Traces in Agentic LLMs: Source Localization and Counterfactual Dependence Testing

    Junhao Liu, Tianxiao Li, Yongxian Wu et al. · arXiv:2610.25540

    AI summaryThis paper introduces a two-stage auditing framework to detect hidden label shortcuts in tool-augmented LLM agent traces. Applying the audit to TCR-pMHC binding reveals that apparent scientific reasoning was actually driven by dataset identifiers rather than genuine evidence utilization.

  283. Editing as Language: Teaching LLM Agents a Grammar for Native Context Editing

    Yunlong Deng, Yan Li, Xing Hu et al. · arXiv:2610.25550

    A synopsis in novels folds a story into a few lines; a function in code gathers many steps with a single execution. Context editing is native to language itself. In this paper, we propose the Native Context Editing (NCE) framework, which gives language model agents a grammar for…

  284. Symbolic Constraint Agents: Mining Formal Tool-Call Constraints to Prevent Agent Errors

    Jinu Lee, Shraddha Barke · arXiv:2610.25552

    Symbolic constraints (programmatic, deterministic checks for tool calls) enable deterministic verification of LLM agents' tool calls, but existing approaches primarily enforce predefined safety policies rather than tool dependencies in complex tool environments. We explore…

  285. Narrow Decision Models: A System-1 Architecture for Calibrated, Typed Decisions

    Carlos André Antunes, Aldry Albuquerque, Gabriel de Melo Schmith et al. · arXiv:2610.25553

    System One models, introduced with TypeSafe's Jev, answer typed questions about a state with calibrated probabilities instead of generated text: choosing among options described in natural language (Choice), placing the state on an ordered scale (Score), or judging a yes/no…

  286. Learning Which Device to Call: Online Tool Grounding for LLM Agents in IoT

    Yichen Liu, Xiaochong Jiang, Haoran Yu et al. · arXiv:2610.25563

    The Internet of Things (IoT) gives large language model (LLM) agents access to physical observations, but one requested capability is usually offered by several devices, and the agent's plan does not say which one to call. Existing work retrieves relevant tools and checks plan…

  287. Design and Cross-Domain Evaluation of an Agent Execution Harness

    Saurav Joshi, Manas Gupta, Ashwin Venkatesh Raman et al. · arXiv:2610.25568

    Completing complex tasks with language-model agents requires coordinating planning, execution, and review so the final result addresses the user's original objective. We present an agent execution harness that keeps the original objective separate from a revisable plan and an…

  288. Benchmark for Structured Retrieval-Augmented Generation in Perovskite Photovoltaics

    Qiwei Han, Chi Zhou, Gaoxiang Yuan · arXiv:2610.25575

    While retrieval-augmented language models increasingly serve as literature assistants in the physical sciences, existing benchmarks evaluate them primarily on qualitative text overlap or through model-based scoring rather than against verified experimental ground truth. In…

  289. When Better Opportunities Backfire: Service Worker Responses to Parallel AI Deployment in Customer Acquisition

    Xinyu Fu, Shulong Luo, Narayan Ramasubbu et al. · arXiv:2610.25603

    As AI voice agents get deployed in high-volume contact centers, firms can route low-intent leads to AI and allocate high-intent leads to human workers. Drawing on sequential search theory, we posit that AI-induced task allocation reshapes work, enriching opportunities facing…

  290. Safety Offset Learning: When Benign Fine-Tuning Misaligns LLMs

    Jesson Wang, Zhanhao Hu, Minghao Lin et al. · arXiv:2610.25611

    Safety risks from fine-tuning are commonly characterized by the harmfulness of the training data:harmful fine-tuning is considered dangerous, while benign fine-tuning is often assumed to preservealignment. We argue that this view misses a more fundamental factor-the behavioral…

  291. Weighted State Souping for Efficient Long-Context Retrieval

    William L. Tong, Aryo Lotfi, Emmanuel Abbe et al. · arXiv:2610.25621

    State space models (SSMs) combine fast inference and fixed state size with competitive language-modeling performance. Recently, state souping has been proposed as a procedure whereby an SSM independently encodes chunks of tokens like documents, tool definitions, or memory…

  292. MapSteal: Map-based Autonomous Knowledge Stealing Attack Against Large Language Models

    Zhengao Li, Chuxu Zhang, Yushun Dong · arXiv:2610.25626

    Knowledge acquisition from black-box large language models (LLMs) offers a practical approach to adapting smaller student models. However, many existing methods rely on predefined queries or student feedback to guide acquisition, leaving autonomous expansion of knowledge targets…

  293. Selecting and Composing Agent Design Patterns: Industrial Case Evidence and Controlled Reference-System Experiments

    Jia Huang, Bingsheng Ru, Bo Liang et al. · arXiv:2610.25629

    Agent pattern catalogs describe architectural alternatives, but engineers also need evidence for selecting and composing them. We extend a cognitive-function--execution-topology framework with an evidence-driven selection procedure and explicit composition contracts. The study…

  294. The Forward/Inverse Duality of Controlled Emergence:A Computational Design Program from Explanation to Engineering

    Hao Li, Minghui Ren, Shaowen Lu · arXiv:2610.25630

    The macroscopic capabilities of intelligent systems arise from the local interactions of many simple units. When such systems are deployed in the real world, their behaviour must nevertheless be constrained, leaving designers caught between releasing adaptability and preventing…

  295. ACorD: Adaptive Correspondence Discovery for Medical Image Registration

    Arghavan Rezvani, Kun Han, Xiaohui Xie · arXiv:2610.25638

    Medical image registration is a fundamental task for aligning anatomical structures across images. Exhaustively searching for point-wise correspondences is prohibitively expensive in both computation and memory, particularly for high-resolution 3D medical images. Most recent…

  296. Think, Compress, Answer: Reinforcement Learning for Multimodal Grounding via Reasoning Compression

    Jinbae Seo, Hyeongjun Kwon, Jiyoung Lee et al. · arXiv:2610.25640

    AI summaryTCA splits multimodal grounding into reasoning, target-aware compression, and answer generation, training with staged GRPO rewards that keep only target‑relevant info. It yields large zero‑shot gains on six grounding benchmarks by compressing reasoning into minimal context.

  297. Spherical Fixed-Point Reasoners: Adaptive Loop Halting on the Hypersphere

    Arber Zela, Artavazd Maranjyan, Pol Puigdemont et al. · arXiv:2610.25646

    Looped (weight-tied) transformers enable adaptive computation by allocating more iterations to harder inputs. Fixed-Point Reasoners (FPRM) achieve this with a damped fixed-point solver, but operate in an unbounded Euclidean residual space with coupled rescaling and relative-norm…

  298. Consistency Training Suppresses Cue Following Without Teaching Cue Selectivity

    Prakhar Gupta, Terry Jingchen Zhang, Zhijing Jin · arXiv:2610.25650

    Language models often change answers because of a cue, a hint such as "I believe the answer is B" that gives no valid evidence. Consistency training (CT) trains a model to answer the same with and without the cue. Four CT methods apply this idea to output tokens (BCT), residual…

  299. A "feature ODE" describing the learning behavior of shallow MLPs on simple functions

    Joseph Turnbull, Berkan Ottlik, Jamie Simon · arXiv:2610.25652

    AI summaryThe paper introduces a “feature ODE” that approximates the gradient‑flow dynamics of two‑layer MLPs on anisotropic Gaussian data, showing that trained networks on simple targets (Hermite or staircase functions) largely follow the ODE’s loss trajectory, an unexpected but useful correspondence.

  300. Beyond Leaderboards: A Method for Application-Specific Capability Profiling of Large Language Models

    Oleg Grynets, Vasyl Lyashkevych, Andrii Salyk et al. · arXiv:2610.25659

    AI summaryThis paper introduces a containerized testbed for application‑specific capability profiling of LLMs, separating model, judges, and agents, and providing versioned, sparse metamodels. It finds that model choice matters more than framework choice and that instruction tuning is deployment‑specific.

  301. HyperTaxa: Multiscale Genome Representations for Generalized Microbial Taxonomic Inference

    Akash Rao, Sushim Gupta, Vishalini Ramnath et al. · arXiv:2610.25673

    Reliable microbial taxonomic inference is challenged by the rapid growth of newly sequenced organisms and incomplete reference coverage. While alignment- and database-driven tools remain essential for reference-backed identification, they are not designed for learned inference…

  302. LIRQuant: An Efficient Locally Isolated Rotation Quantization Method for Large Language Models

    Desheng Xu, Hanglin Li, Tianchen Song et al. · arXiv:2610.25675

    Post-Training Quantization (PTQ) enables efficient deployment of Large Language Models (LLMs), yet activation outliers remain a key challenge for low-bit quantization. Existing global transformation methods overlook heterogeneous channel sensitivity to quantization noise,…

  303. Neither Over- nor Under-Constrained: Evaluating LLM Personalization under a Constraint Qualification Audit

    Xuran Li, Guanqin Zhang, Imran Razzak et al. · arXiv:2610.25676

    Accurate evaluation of LLM personalization is hindered by current evaluation paradigms that over- or under-constrain the response space, yielding frequent false rejections and false acceptances. To reduce these false rates, we introduce ConQual-Audit, an audit-based framework…

  304. Cross-Pollination Retrieval: Finding Transferable Ideas Across Fields in Scientific Literature

    Seokwon Jung, Yerang Kim, Yejin Kim et al. · arXiv:2610.25678

    Many scientific advances come from cross-pollination, carrying an idea from one field over to a problem in another. Yet retrieving papers across fields remains underexplored, with existing benchmarks confined to a narrow range of fields. We study cross-pollination retrieval, the…

  305. BitFlat: Error-Localized Bitstream Design for Robust Diffusion Image Compression

    Xinfeng Deng, Li Zhou, Haitao Chen et al. · arXiv:2610.25682

    Zero-shot diffusion image compression based on reverse channel coding achieves high perceptual quality at low bitrates without retraining, yet its bitstream remains vulnerable to bit flips. Prior work has shown that a joint combinatorial representation can amplify a single bit…

  306. When Safety Fails Collectively: Robust Alignment Against Harmful Fine-Tuning via Joint Weight Perturbations

    Zhiyuan Wang, Yuezhi Zhou, Zhu Zhang et al. · arXiv:2610.25683

    Harmful fine-tuning can rapidly erode the safety alignment of large language models, creating substantial risks when aligned models are adapted to downstream tasks. Existing alignment-stage defenses use harmful examples and simulated harmful perturbations during safety alignment…

  307. MT-CC: Multi-Group Temperature Scaling for Asymmetric Calibration Behavior in Class-Incremental Learning

    Sungjun Yun, Yonghee Choi, Dong-Jun Han · arXiv:2610.25689

    As deep neural networks are required to continuously adapt to evolving data, class-incremental learning (CIL) has become an active research area. However, most existing works primarily focus on improving accuracy while overlooking confidence calibration, which measures the…

  308. Progress-Guided Preference Generation for Aligning Generative Control Policies

    Tung M. Luu, Tri Ton, Duc M. Nguyen et al. · arXiv:2610.25692

    Generative policies have achieved strong performance in imitation learning tasks, but their success is often constrained by the limited availability of expert demonstrations. Although preference-based fine-tuning can leverage suboptimal rollouts to improve performance, existing…

  309. ToolOPD: Credit-Aware On-Policy Distillation for Tool-Use Agents

    Chu Zhao, Lei Tang, Yanming Wang et al. · arXiv:2610.25693

    On-policy distillation (OPD) enhances the capabilities of small language agents by providing dense, token-level supervision from a teacher model on student-generated trajectories. However, standard OPD implicitly assumes that credit is uniformly distributed across long-horizon…

  310. CVaR-RMD: CVaR Selection Pressure for Robust Metaheuristic Discovery

    Ruodai Cui, Li Niu · arXiv:2610.25697

    Large language models have recently been used to discover heuristics through iterative program search, offering a promising approach to automated algorithm design. However, candidates selected by average performance may degrade across instance families, random seeds, and problem…

  311. From Black Box to Controller: Inference-Time Steering of LLM via Feature Amplification

    Keqi Chen, Zekai Sun, Yuhua Wen et al. · arXiv:2610.25700

    Inference-time steering is crucial for deploying Large Language Models (LLMs) in real-world applications, where they must flexibly adjust behavior preferences. For instance, a model should dynamically adjust its caution level based on the risk of the scenario. This requirement…

  312. Whose Credential Is It? How Owner Attribution in Agent MemoryShapes Cross-User Account Misuse

    Hau-Sing So, Daixian Liu, Carl Hou et al. · arXiv:2610.25707

    Shared long-term memory lets an LLM agent serving one user inadvertently retrieve another user's credentials, but it is unclear when such exposure leads to actual harm. We introduce a three-stage audit that separates three events: a foreign credential reaches the prompt…

  313. Causal Humility: Governing the Authority of Fairness Claims Under Causal Uncertainty

    Khadija Zanna, Rodrigo Ferreira, Frederick L. Oswald et al. · arXiv:2610.25709

    AI systems increasingly shape consequential decisions in employment, lending, healthcare, and public services, making fairness an important problem for auditing and governance. Fairness assessment often requires more than identifying disparities in outcomes; it also requires…

  314. PFedQFT: Personalized Federated Quantum-Inspired Fine-Tuning for Medical Large Language Models

    Qihan Huang, Lingxia Zhang, Guye Zhang et al. · arXiv:2610.25712

    Medical data remain fragmented across institutional silos because of privacy, governance, and ownership constraints. Federated learning enables medical institutions to adapt large language models (LLMs) collaboratively without transferring raw records. However, independently…

  315. Fine-Grained Units, Flat Decisions: Hierarchical Micro-Expert Pruning for Mixture-of-Experts Models

    Zukang Xu, Xinpei Gao, Xing Hu et al. · arXiv:2610.25717

    Micro-expert pruning reduces the capacity of mixture-of-experts (MoE) models by removing coupled channels within routed experts. However, finer pruning granularity alone does not guarantee the preservation of downstream capabilities, as similar language-modeling perplexity can…

  316. Corrected Block Sparse Spectral Optimization: Exact Models, Finite Identification, and Local Dynamics

    Omid Shams Solari · arXiv:2610.25721

    The block generalized-power method pairs threshold-based support selection with inexpensive Stiefel updates, but the standard block formulation conflates two nonequivalent objectives and leaves inactive components, threshold ties, and post-selection refitting ill-specified. We…

  317. Anatomy of Off-Policy Policy Gradient: Importance Sampling, KL Regularization, and Baselines

    Haoqun Cao, Yurun Yuan, Tengyang Xie · arXiv:2610.25725

    Reinforcement learning has become a central tool for large language model (LLM) post-training, where policy gradient methods are routinely deployed off-policy, even though vanilla policy gradient assumes on-policy sampling. We study when such off-policy deployment is justified,…

  318. No Matter Who You Are: Addressivity and Sycophancy in Large Language Models

    Seungjong Sun, Hyunmin Jun, Minsik Yoon et al. · arXiv:2610.25728

    AI summaryThe paper identifies a link between “addressivity” (the model’s tendency to direct outputs toward an addressee) and sycophancy, showing that post‑training strengthens this connection and that any recognized addressee triggers the effect.

  319. TimelineAgent: An LLM-based Framework for Query-Centric Event Timeline Extraction Across Multiple Documents

    Qingkai Min, Yunxin Bao, Yifeng Lu et al. · arXiv:2610.25733

    Query-centric cross-document event timeline extraction aims to construct event timelines from multiple documents under diverse query focuses. The task is very challenging due to the heterogeneous event modeling and reasoning requirements arising from both the intrinsic…

  320. A Calibrated Instrument for Detecting Disposition Drift in Language Models

    Jerry Kaplan · arXiv:2610.25735

    Before language models are released, they are tested for harmful traits such as willingness to carry out dangerous requests, deception, power seeking, and sycophancy. The safe behavior these tests certify may degrade as models are modified, by topical fine-tuning, new training…

  321. Cognitively Decoupled Meta-Induction for Out-of-Distribution Generalization

    Yuqian Wang, Yuanzheng Wang, Chaojun Xiao et al. · arXiv:2610.25749

    In-context learning (ICL) tackles downstream tasks conditioned on demonstrations. This paradigm relies heavily on neighbor-based matching between queries and demonstrations, limiting out-of-distribution (OOD) performance. For better generalization, rule-based inductive reasoning…

  322. Remember Less, Adapt Longer: Bounded-State In-Context Reinforcement Learning with Recurrent Summary Memory

    Jiawen Wang, Cheng Xue, Peng Zhang et al. · arXiv:2610.25758

    AI summaryRecurrent Summary Memory (RSM) is a Transformer policy that keeps a fixed-size working buffer and a compressed summary of past experience, allowing in-context reinforcement learning with constant memory and per-step cost. RSM sustains adaptation over eight times the training horizon using only 1 % of full-history memory, outperforming sliding-window, full-history, and other recurrent baselines.

  323. Computation, Not Memory: Chain-of-Thought and State Tracking in LLM Agents

    Pedram Mouseli, Massieh Moayedi · arXiv:2610.25760

    Language-model agents often reason before they act, and the value of monitoring that reasoning depends on how it relates to their actions. We ask how an agent's actions depend on its reasoning when the correct action depends on a changing state. In a small file-system task,…

  324. ActTime: Action-Conditioned World Modeling for Time Series

    Xinxing Zhou, Xiaojie Yuan, Yanlong Wen et al. · arXiv:2610.25764

    Time-series models increasingly condition on known future inputs. In controlled systems, some of these inputs are actions that can be changed, compared, and optimized before execution. A model must therefore do more than predict the realized future: it must predict how outcomes…

  325. TRACE: Tracking Multimodal Clinical Trajectories for Inpatient Risk Prediction

    Minjun Kim, Jong Hak Moon · arXiv:2610.25765

    Accurate inpatient risk prediction requires modeling heterogeneous clinical evidence that accumulates irregularly over time. This challenge spans in-hospital mortality, prolonged length of stay, and readmission, each with task-specific observation windows. Existing multimodal…

  326. EvalRx: Agentic Diagnosis and Verified Repair of Foundation Models

    Jiaqi Liu, Ruinan Jin, Yitong Tang et al. · arXiv:2610.25767

    Model evaluation reveals where models fail, but rarely why or whether a proposed fix genuinely works. We introduce EvalRx, an open-source agentic framework for statistically grounded model diagnosis and repair. EvalRx discovers systematic failure modes, explores candidate…

  327. From Trace to Fix: Residual Task State in Long-Horizon Agents

    Zile Huang, Ser-nam Lim · arXiv:2610.25776

    Recovering from failures in long-horizon, stateful language agents is challenging because the action introducing a defect, the symptom exposing it, and the persistent state requiring repair frequently diverge. Existing methods largely focus on retrospective failure attribution,…

  328. Standing on the Shoulders of Giants: Enhancing LLM Agents for Automated Fact-Checking with Human Expert Skills

    Xinwen Chen, Haorui He, Yupeng Li · arXiv:2610.25777

    AI summaryWe distill AFP fact‑checking guidelines into a modular “Professional Fact‑Checking Skill” and give LLM agents dynamic access to it at inference. SkillCheck improves accuracy by 2.2–4.8 pp and Macro‑F1 by 1.5–6.3 pp on AVeriTeC, and with GPT‑4o‑Mini surpasses GPT‑4o while cutting inference cost by ~61 %.

  329. OpenSaC: A Python Library for Search as Code in Deep Research Agents

    Qi Liu, Jiaxin Mao, Fengbin Zhu et al. · arXiv:2610.25779

    Deep research agents investigate complex questions through iterative search, source examination, and evidence synthesis. A conventional workflow alternates reasoning with individual search and reading actions. Search as Code introduces a new paradigm: agents write programs that…

  330. Can LLM User-Proxies Stand In for Humans in Reliance Measurement? Replicating Rel-A.I. with Simulated Users

    Shuai Wang, Rui Hu · arXiv:2610.25788

    AI summaryLLM user‑proxies fail to reliably mimic human reliance on AI answers; the best proxy shows a 22.5‑point absolute-rate error and 8.3‑point domain‑effect error versus humans. The audit demonstrates no firm validity for proxy‑derived effect sizes.

  331. SAR: Learning Global Item-Space Matching and Geometry-Aware Placement Ranking for Buffered Online 3D Bin Packing

    Xinpeng Lei, Jin Zhang, Yizhe Yang et al. · arXiv:2610.25795

    AI summaryThe paper introduces Spatial Affordance Retrieval (SAR), a framework for online 3D bin packing that decouples global item-space matching from geometry-aware placement ranking. SAR improves space utilization over strong baselines by up to 4.20 percentage points across standard datasets.

  332. AirMPA: A Meteorology-to-Pollution Adapter for Global Air Quality Forecasting

    Yiheng Wang, Kai Zheng, Yuetan Lin et al. · arXiv:2610.25797

    AI summaryAirMPA decouples meteorology from pollutant forecasting with a dual‑branch Swin‑Transformer, predicting 13 global pollutants at 0.4° resolution. It outperforms Aurora and beats CAMS in ~90% of cases, surpassing CAMS on all variables beyond 48 h over a 5‑day horizon.

  333. When to Stop Asking: Factor Coverage Bias and LLM Determinability Judgments with Underspecified Information in Medicine

    Yusuke Watanabe, Yohei Kobashi, Taisei Tosaki et al. · arXiv:2610.25819

    Clinical decision-making often begins with underspecified information and requires not only gathering missing information but also knowing when to stop. This calls for judging determinability (whether the available information is sufficient for a decision) by considering whether…

  334. Optimizing Marketing Budgets for Social Influence: A Generalized Fractional Incentives Framework

    Abhishek K. Umrawal, Akhil Bhimaraju, Eliot W. Robson et al. · arXiv:2610.25823

    AI summaryA method for allocating a marketing budget continuously across social network users, accounting for each user’s response curve and cost. The greedy algorithm guarantees near‑optimal influence and outperforms heuristic spreads in large real networks.

  335. When Retrieval Partially Conflicts with Skills: Understanding Procedural Hallucination in Language Models

    Guanqun Jiang, Pengfei Cao, Kang Liu et al. · arXiv:2610.25827

    Language models increasingly use skills that provide reusable instructions and procedures for task execution. After a relevant skill has been selected, the model may need to apply its governing procedure together with retrieved task context. When the retrieved context is useful…

  336. FrontierRefactor: Benchmarking Multi-Scale Performance-Oriented Codebase Refactoring

    Shijian Wang, Fanqing Meng, Jiajun Chen et al. · arXiv:2610.25834

    Autonomous codebase refactoring requires coding agents to restructure working software while strictly preserving externally observable behavior and prioritizing execution performance and compute efficiency over stylistic preference. Existing benchmarks: refactoring benchmarks…

  337. Diffusion Language Models Change Speed Across Tasks and Languages

    Mohsen Fayyaz, Ali Modarressi, Daniel Israel et al. · arXiv:2610.25835

    AI summaryDiffusion language models vary decoding cost across tasks and languages; generating new, rare content requires many forward passes while copying or repeating existing reasoning is cheap. Cost correlates with correctness and can guide efficient inference.

  338. Where RL Breaks: Localizing and Repairing Failures via Targeted Continued Pretraining

    Xinyi Wang, Danqi Chen · arXiv:2610.25836

    AI summaryThe paper shows that RL failures in language models are localized to a few characteristic n‑grams. By retrieving and continued pretraining on just 35M tokens of failure‑related text, it consistently improves reasoning accuracy, outperforming random pretraining data across multiple models and tasks.

  339. OV-PEAR: Observation-Verified Pose-Scale Estimation and Reconstruction for Unknown Industrial Manipulation Objects

    Guoqin Tang, Qingxuan Jia, Yichen Tan et al. · arXiv:2610.25840

    Fine industrial robotic manipulation requires 6D pose, scale, and an operation-ready 3D model. Existing industrial pose estimation relies on CAD models, object-specific training data, or stable workcells, limiting use with unseen objects; zero-shot methods suffer from…

  340. Not Every Rollout Needs Distillation: Correctness-Filtered On-Policy Self-Distillation

    Harrison Zhao, Lei Huang, Fei Liu et al. · arXiv:2610.25842

    On-policy self-distillation (OPSD) supervises student-generated trajectories with a reference-conditioned version of the same base model. We ask whether every trajectory supplies distinct supervision that warrants its distillation cost. Gradient measurements on Qwen3-1.7B at…

  341. A Cue's Hidden Price: Auditing Seller Influence on AI Shoppers

    Felix Buecheler, Gerardo Berbeglia, Mingyu Guo · arXiv:2610.25843

    Large language models are increasingly asked to shop on a user's behalf, which lets seller-controlled content such as badges, endorsements, and framing steer what they recommend. That poses the question at the core of generative engine optimization (GEO): not whether seller…

  342. SWIFT: Self-guided Weak-to-strong dIFfusion models via Target extrapolation

    Yanjin He, Cuifeng Shen, Wanzhou Lei et al. · arXiv:2610.25844

    Training high-quality diffusion models is computationally expensive, and inference-time guidance often adds further sampling cost. In this work, we introduce Swift, a simple yet effective self-guided training method that uses a frozen weak denoiser to improve a stronger model…

  343. Measurement Validity and Representation Dynamics of Confidence Signals in Large Language Models

    Debojeet Ghosh, Shreyansh Kumar, Ayushman Garg · arXiv:2610.25846

    AI summaryThe paper audits Qwen2.5 models’ confidence signals (verbal, probe-based, sampling agreement) on retrieval and reasoning tasks, finding probes signal agreement earlier for retrieval, verbal confidence unstable across prompts, and sampling agreement offers higher resolution despite higher ECE.

  344. Rubrics Beyond Evaluation: Exploiting Rubric Structure in Reinforcement Learning

    Yuxun Huang, Yunyao Zhang, ZeLiang Chen et al. · arXiv:2610.25850

    Rubrics are widely used to evaluate open-ended question answering by breaking overall quality into explicit criteria. These explicit criteria make rubrics a rich source of learning guidance, yet their potential for guiding the training process has been largely overlooked.…

  345. MASIF: Implicit Failures for Process Observability in Multi-Agent Systems

    Yanwei Huang, Arpit Narechania, Atanu Sinha · arXiv:2610.25852

    Multi-agent systems (MAS) can complete a task despite local execution errors that are corrected, bypassed, or carried forward without individually determining its outcome. We call these implicit failures (IFs) and study them as signals for process observability beyond final task…

  346. Are Self-Evolving Agents Continual Learners?

    Xiaoyin Chen, Yizheng Huang, Yinglun Xu et al. · arXiv:2610.25858

    Large language model agents are often deployed in environments where new knowledge, tools, and workflows keep arriving. Such an agent is therefore expected to adapt continually, learning new tasks as they arrive without forgetting earlier ones. This resembles the continual…

  347. Adaptive Decoding Methods for Token-Efficient Reinforcement Learning

    Zhaonan Li, Zelei Cheng, Amritansh Mishra et al. · arXiv:2610.25860

    Rollout decoding affects both which trajectories are used for reinforcement learning with verifiable rewards (RLVR) and how many completion tokens are spent collecting them. We study whether candidate-token support should remain fixed or widen during training in the context of…

  348. Minimum-Cost Robust Evidence Certificates for Horn Reasoning under Correlated Source Failures

    Yukun Yang · arXiv:2610.25865

    A small justification for a rule-based conclusion may disappear when a source is withdrawn, and multiple derivations need not provide independent evidence. We study minimum-cost certificates that preserve a Horn conclusion under every withdrawal of at most k source domains.…

  349. Benefit-Targeted Routing and Bounded Revision for LLM-Based Evidence Screening in Manufacturing Supplier Discovery

    Yijiashun Qi, Hanzhe Guo, Yuxuan Li · arXiv:2610.25867

    An evidence-review system must allocate additional model judgments and control their use. We study these software decisions on 6,164 frozen manufacturing source-task pairs. Benefit-targeted routing learns recovered agreement minus newly introduced disagreement. On the original…

  350. CODA: Cohort- and Drift-aware Foundation Model for Multimodal Clinical Reasoning

    Changshuo Liu, Jiaqi Zhu, Wenqiao Zhang et al. · arXiv:2610.25871

    Recent advances in multimodal foundation models have demonstrated strong performance across diverse clinical tasks. However, existing approaches predominantly operate at the individual sample level and fail to model the interplay between population-level cohort patterns and…

  351. Manifold-Constrained Residual Adaptation with Frame-Adaptive Layer Aggregation for Speaker Verification

    Zezhong Jin, Xiaoyu Wang, Zhe Li et al. · arXiv:2610.25892

    Large self-supervised speech models provide powerful representations for speaker verification, but full fine-tuning is expensive. Most conventional adapters insert small trainable modules to modify the output of each layer, while keeping the original residual connections…

  352. Motor compound fault diagnosis using an attention-based cross-talk architecture

    Wonjun Yi, Wonho Jung, Junho Kim et al. · arXiv:2610.25893

    As physical AI increasingly relies on sensing to understand physical systems, reliable condition monitoring of industrial machinery has become more important. Motors are ubiquitous in industrial systems, and increasing system complexity raises the likelihood of simultaneous…

  353. When Should AI Chime In? Benchmarking Timely Contribution of Proactive Agents in Multi-Party Chat

    Ruotong Wang, Brian S. Yu, Xinyi Zhou et al. · arXiv:2610.25896

    Proactive agents can support group collaboration by surfacing useful information without waiting to be asked, but even relevant contributions can be disruptive if poorly timed. In this work, we isolate the timing question: given a fixed candidate contribution such as a…

  354. Secure Agentic Coding through Counterexample-Grounded Feedback

    Tue Le, Anh Nguyen Hoang, Gabriel Sasseville et al. · arXiv:2610.25916

    As coding models and agent harnesses become more capable, reliable security verification is becoming a central bottleneck. Improving secure code generation requires a signal whose reported progress remains aligned with actual program behavior under optimization; otherwise, an…

  355. UtilityBench: Measuring Language Model Utility When Errors Have Different Costs

    Qifeng Lei, Zhiyong Yang, Zitai Wang et al. · arXiv:2610.25924

    As language models are increasingly deployed in real-world scenarios with important outcomes, the impact of their mistakes often extends far beyond what correctness can capture. In domains like medicine, a single error can lead to serious consequences and put patient safety at…

  356. TESS: LLM-guided Translation, Exploration, Simulation, and Search for Embodied Task Planning

    Peiran Xu, Yixiang Yang, Jinghan Li et al. · arXiv:2610.25930

    In this work we focus on the problem of embodied task planning, which requires an agent to accomplish a complex task by separating it into atomic actions. Recent studies have developed LLM-based methods to address this problem. However, the executability and correctness of the…

  357. EvoSkill v2: Fully Agentic Skill Evolution from Benchmark Adaptation to a Stateful Evolver

    Dastin Huang, Baran Nama, Salaheddin Alzubi · arXiv:2610.25931

    EvoSkill v2 is a three-agent system that edits the instructions (skills) an agent is given, leaving its model and harness intact. The user starts a run by describing a benchmark and supplying a grader, which a benchmark adaptor turns into a benchmark-specific plugin. A solver…

  358. Keep the Lineages Alive: Diversity-Preserving SMC for Diffusion LLM Decoding

    Minoo Ahmadi, Seyedarmin Azizi, Mehdi Kamal et al. · arXiv:2610.25932

    Inference-time sequential Monte Carlo (SMC) decoding can improve the reasoning accuracy of masked diffusion language models (diffusion LLMs) without post-training by resampling a population of partial generations according to a reward. Its effectiveness therefore depends on the…

  359. The KV-Surgeon: Compensation-Aware Offline KV-Cache Compaction

    Moritz Wagner, Christophe Roux, Max Zimmer et al. · arXiv:2610.25933

    Offline compaction of the key--value cache (KV-cache) reduces the cost of repeatedly querying a fixed context by constructing a smaller cache once and reusing it subsequently. The central challenge of compaction is deciding which cache entries to delete and which to retain.…

  360. Global probabilistic forecasting of air pollution

    Ammar Kheder, Michael Boy, Zhi-song Liu · arXiv:2610.25941

    AI summaryGenerative model “Foehn” learns global km-scale PM2.5 estimates to forecast air quality; over a year it outperforms operational forecasts at four stations, detecting local pollution extremes four days ahead with calibrated ensembles.

  361. Policy Search in Code Space for Multi-Agent Pathfinding

    Matthias Eder, Pantelis Emmanouil, Vivek Farias et al. · arXiv:2610.25946

    Developing coordination policies for complex multi-agent systems relies on either labor-intensive algorithm design or opaque task-specific reinforcement learning. With recent advances in autonomous coding agents, we show that policy search directly in code space offers a…

  362. Claim Laundering: When Agent Decision Models Trust Records Over Reality

    Tina Khezresmaeilzadeh, Seyedarmin Azizi, Erfan Baghaei Potraghloo et al. · arXiv:2610.25947

    Agent decision models select actions in a single forward pass from inputs that combine environmental observations with the agent's own record of previous actions. When an action fails silently, these sources can conflict: the record reports success, but the environment shows…

  363. OrderGPT: Generation Order as a Learnable Modeling Choice

    Chenhe Yang, Yuhuan Lyu, Tianyang Hu · arXiv:2610.25949

    Generative modeling of discrete data has two popular paradigms: autoregressive models such as GPT, which factorize a sequence in a left-to-right (L2R) order, and masked diffusion models, which are essentially any-order autoregressive modeling. Rather than competing methods,…

  364. AdaExploreBench: Benchmarking LLM Agents for Proactive Exploration and Test-time Adaptation in Evolving Environments

    Rui Wang, Zishen Lai, Jiayu Liu et al. · arXiv:2610.25950

    AI summaryAdaExploreBench evaluates LLM agents on proactive exploration and test‑time adaptation in environments with hidden, drifting rules. GPT‑6 Sol attains only 61.9% accuracy, and performance improves by ~10% when agents receive evidence or detect rule drift, highlighting active evidence acquisition as a bottleneck.

  365. CXBench: A Benchmark for Process-Compliant LLM Agents in Regulated Customer-Experience Workflows

    Boxi Yu, Yuzhong Zhang, Zhenfeng Su et al. · arXiv:2610.25954

    AI summaryCXBench evaluates language‑model agents on both outcome correctness and strict process compliance in six regulated customer‑experience domains. It finds that 55.5% of 840 runs are false‑passes, with only 13.8% satisfying both outcome and process checks, reshuffling model rankings.

  366. Productive State-Space Exploration for Multi-turn RL in LLM Agents

    Mohammed Haroon Dupty, Yong Liang Goh, Song Guo et al. · arXiv:2610.25957

    Reinforcement Learning (RL) for Large Language Model (LLM) agents in multi-turn, long-horizon environments remains challenging due to inefficient action selection and repetitive behavioral patterns. In particular, agents often become trapped in high-confidence yet unproductive…

  367. EmbodiedWorld-200K: Toward Embodied World Agents via Embodied-Planning Dataset and Interactive World Models

    X. Feng, J. Tang, Z. Lin et al. · arXiv:2610.25959

    Building embodied agents that can perceive, reason, and act across diverse 3D worlds is a central research direction toward artificial general intelligence. Yet most existing work remains confined to specific tasks in a single scene and transfers poorly to new environments,…

  368. PaceVLA: Adaptive Temporal Action Quantization in Vision-Language-Action Models

    Hojin Jeon, Jimin Lee, Taekwan Kim et al. · arXiv:2610.25961

    Fast and reliable manipulation is crucial for practical robot deployment. Although Vision-Language-Action (VLA) models have recently shown remarkable progress as generalist robot policies, their execution often remains temporally inefficient. A key source of this inefficiency is…

  369. ABACUS: Program-Guided Multistep Reasoning over Frozen Judgment Models

    Yuhao Wang, Zelin Zang · arXiv:2610.25963

    Judgment models answer semantic questions by scoring a finite set of candidate outcomes. Can reusable programs turn these local decisions into powerful multistep reasoning? We introduce \method, a framework that jointly constructs judgment schemas and composition programs for…

  370. Behavioral Probes for Information Flow in LLM Swarms

    Junhui Chen, Yu Zhang, Lantian Li et al. · arXiv:2610.25966

    Most existing approaches to LLM swarm optimization are utility-driven, focusing on final task utility while leaving the processing, integration, and reliance of information within individual interactions largely implicit. To address this, we study LLM swarm interactions from an…

  371. Reconstruction and Discrete-Event Simulation Assessment of an Analytical

    Mohsen Reda Mahmoud Moursi, Ahmed Stohy · arXiv:2610.25967

    This article presents an analytical-DES benchmark for intra-aisle robotic picking in automated warehousing. The investigated cycle combines horizontal shuttle travel, tote handling and item picking at storage locations. Simulation results are compared with the analytical…

  372. GLOBE: Geometry-Led Online Behavioral Early Exit via Unit-Sphere Trajectories

    Xinyue Peng, Zhenlin Liang, Meng Cai et al. · arXiv:2610.25970

    AI summaryGLOBE stops chain-of-thought reasoning early by embedding reasoning segments on a unit sphere and monitoring trajectory shape; it cuts tokens by ~50 % and latency by ~51 % while retaining 80.6 % of full‑CoT accuracy across five tasks.

  373. Correctness-Dependent Asymmetric Target Distributions for Self-Distillation Policy Optimization

    Suwan Yoon, Seongryong Jung, Changhee Lee · arXiv:2610.25973

    AI summaryAPSD mixes student and self‑teacher distributions based on rollout correctness, preserving good behavior on correct rollouts and sharpening corrections on incorrect ones. It matches or exceeds SDPO performance while reducing training steps by 2.6× on Qwen3 models.

  374. On the Benefits of Uncertainty Estimation for Species Classification: A Case Study on Optimizing Expert re-Annotation

    Kamenan N'Gadi (LORIA, BISCUIT), Martin Laviale (LIEC et al. · arXiv:2610.25977

    Automated identification of diatoms from microscopic images is a cornerstone of large-scale freshwater biomonitoring, yet the high diversity of species and strong class imbalance pose significant challenges for reliable classification. In this study, we develop a ResNet-18…

  375. GraphEvoResearcher: Graph-Aware Training-Free Self-Reflective Reasoning for Cost-Bounded Multi-Hop Question Answering

    Suxing Liu · arXiv:2610.25978

    Multi-hop question answering (QA) requires models to chain intermediate conclusions while remaining cost-aware. Existing training-free self-reflective protocols (generate -> critique -> revise) improve accuracy but operate on a flat token stream: revisions cannot identify which…

  376. ClueFlow: Learning Long-Horizon Search through Attributed Research-State Transitions

    Yicheng Wang, Wentao Tan, Yidan Huang et al. · arXiv:2610.25980

    Long-horizon search requires agents to acquire relevant evidence and integrate it into an evolving research state. Existing methods maintain research states to guide exploration or assign turn-level progress signals, yet grounding these signals in explicit, attributable state…

  377. Auditor-Assisted Summary-Channel Verification for Hosted LLM Identity Substitution

    Ziyi Zhang, Ziyao Wang, Guoheng Sun et al. · arXiv:2610.25982

    Hosted LLM services increasingly expose model identity as a product claim, but external users and auditors often cannot inspect which model configuration served a request. We study an auditor-assisted regime in which a trusted auditor enrolls claimed identities and prepares…

  378. NIOCIS: Typed-Decision Next-Hop Routing with Node-Conditioned Option Spaces for Tool-Use Agents

    Jin Han, Mingfeng Xin, Feng Liang et al. · arXiv:2610.25985

    Tool-use agents pay per decision: at each hop a language model re-reads the state and thinks for seconds, though its actions are finite and decisions recur. We present NIOCIS, a routing layer that folds execution logs into a loop-collapsed action graph (forward transitions plus…

  379. Map-Distribution Mixture-of-Experts for Multi-Agent Pathfinding

    Fumimaro Suzuki, Keisuke Okumura · arXiv:2610.25991

    AI summaryThe paper builds a Mixture‑of‑Experts router that selects between map‑specific neural policies for multi‑agent pathfinding, improving over a single pre‑trained policy and beating existing baselines, though a well‑trained monolithic model still slightly outperforms the MoE.

  380. Procedural Memory for Language Agents: A Neurosymbolic Perspective on Explicit Goal Structure

    Jonathan Leung, Zhiqi Shen, Deheng Ye · arXiv:2610.25996

    Large language models remain unreliable on long-horizon tasks requiring procedural reasoning. We argue that a key cause is the absence of explicit procedural memory: accessible, modifiable knowledge of how tasks are accomplished, distinct from semantic and episodic memory.…

  381. TimesJev: Thinking Fast on Time Series with System 1 Sufficiency

    Chenghao Liu, Wei Fan, Jindong Han et al. · arXiv:2610.26002

    Large language models (LLMs) have recently shown strong potential for time series reasoning, while models that reason over time series are usually with long chains of thought. However, this process often consumes thousands of tokens, directly leading to substantial latency…

  382. Accelerated Drift of Scientific Prose in the LLM Era: Evidence from an Interrupted Time-Series Analysis

    Hanna Hubarava, Benjamin V. Ineichen · arXiv:2610.26008

    Every scientific text is embedded in the writing norms of its time: it reflects earlier publications while also shaping the texts that follow. The growing use of LLM-based writing tools introduces a new factor in this evolving system, but the linguistic changes coinciding with…

  383. Understanding When Reflective Prompt and Skill Optimization Helps on Locally Served Reasoning Models: A Two-Model Study of GEPA and SkillOpt

    Andrea Giummarra, Carmelo Baglieri, Antonio Di Maria et al. · arXiv:2610.26020

    Reflective text-space optimizers such as GEPA and SkillOpt have reported large gains on frontier and mid-size models. We test replication across two reasoning-native target-serving configurations: DeepSeek V4 Flash through DwarfStar and Qwen3.8-27B through LM Studio. For each…

  384. FrameGRPO: Incentivizing Video Reasoning via Multi-Frame Rollouts and Temporal Credit

    Jiaxuan Sun, Biao Wang, Shuai Li · arXiv:2610.26022

    AI summaryFrameGRPO improves video reasoning for multimodal LLMs by using multi‑frame rollouts that sample different temporal views and a gated temporal credit that rewards short‑frame trajectories only when full‑frame references fail, yielding better performance on video benchmarks.

  385. Multimodal Decoupling for Diversified Recommendation through Semantic and Structural Shaping

    Changran He, Jiaming Wei, Jianghong Ma et al. · arXiv:2610.26024

    Recommender systems often suffer from over-concentrated results when optimized for accuracy, limiting recommendation diversity. While diversity has become an important objective, existing methods still face fundamental limitations from both semantic and structural perspectives.…

  386. TamedFlow: Trajectory-Aware Distillation\\for Teacher-Assisted Diffusion Sampling

    Shuaiqi Cheng, Jiahao Zhang, Boyuan Gu et al. · arXiv:2610.26025

    Diffusion Transformers (DiTs) deliver high-fidelity image and video generation, but inference requires many sequential model evaluations. Two acceleration strategies are increasingly important: model compression makes each evaluation cheaper, while adaptive inference avoids…

  387. AuDQ: Auditable Data Quality through Agentic Rule Discovery

    Jacopo Biggiogera, Nicolas Colombo, Krati Saxena et al. · arXiv:2610.26031

    AI summaryAuDQ introduces a repository-native, ontology‑grounded data quality layer where rules are versioned, provenance‑linked, and replayable. Their agentic rule‑discovery engine (Full‑Agentic and Guided modes) generates rules matching expert‑specified quality and diversity on finance and retail datasets.

  388. Decision4Rec: A Jev-Inspired Framework of Decision Models on Knowledge and Active Graphs for Multi-Agent Recommender Systems

    Marco Polignano, Het Darshan Mehta, Pasquale Lops et al. · arXiv:2610.26035

    Decision models, such as the commercial Jev, are language models that return one probability for each option of a question instead of generating text. We present Decision4Rec, an open and modular framework that makes decision models useful for recommendation. A knowledge graph…

  389. Honeyed Words, Hidden Daggers: Benchmarking and Training LLMs to See Through Mock Politeness

    Caixin Kang, Sitong Gong, Tianyu Yan et al. · arXiv:2610.26059

    The Chinese idiom "kou mi fu jian" ("honeyed words, hidden daggers") names speech that is polite in form but hostile in function. We present ZhenhuanBench, a 1,592-item benchmark built from expert commentary on Empresses in the Palace, covering speaker intent, emotion-language…

  390. FinSafeGuard: A Quality-Driven Synthetic Dataset for Financial AI Safety

    Joseph Thomas Thacil, Reetu Raj Harsh, Krati Saxena et al. · arXiv:2610.26066

    Generating high-quality synthetic datasets at scale remains a fundamental challenge for training specialized AI systems in data-scarce domains. We present a comprehensive methodology that produces 14.3 million quality-filtered synthetic training examples from a structured…

  391. CUA-Lite: An Open Platform for Computer Use Agents

    Zhanhui Zhou, Weichen Zhang, Haoran Liu et al. · arXiv:2610.26071

    Open resources for computer use agents (CUAs) -- environments, datasets, and models -- remain scattered: without a standard, these resources cannot be integrated and scaled; additionally, evaluation, RL, and SFT cannot share one infrastructure. We present CUA-Lite, an open…

  392. Not All Similarity Is Leakage: Distribution-Aware Identity Leakage Assessment in Synthetic Face Datasets

    Pawe{\l} Borsukiewicz, Daniele Lunghi, Wendkûuni C. Ouédraogo et al. · arXiv:2610.26077

    Synthetic data provides the means for more ethical and less biased facial recognition. Nonetheless, the limitations of generative models and the conditioning process they rely on pose a risk of identity leakage, resulting in synthetic samples that are overly similar to those…

  393. How Robust Are Prognostic Radiomic Features? Comparing Selection Techniques on Pooled Glioblastoma Cohorts

    Yannick Sodonougbo, Marlene Schnieders, Alexia Rizoudis et al. · arXiv:2610.26095

    Radiomic survival studies in glioblastoma report heterogeneous prognostic features, but how much of this stems from the methodology itself is rarely examined. We analysed the association of 463 radiomic, anatomical and clinical features from pre-treatment MRI with overall…

  394. From Code to Playable Systems: CEGame-Bench for Long-Horizon Game Creation Agents

    Zixuan Dong, Yanghai Wang, Hanyan Bian et al. · arXiv:2610.26098

    A game ships when a player can launch it, finish it, and return to a saved world, none of which a successful build guarantees, yet game-creation agents are mostly tested on one engine or on one-prompt browser games. We present CEGame-Bench, the first long-horizon benchmark for…

  395. Reliable Before Profitable: QuantHarness for Governing Financial Strategy Development with LLM Agents

    Jiasheng Mao, Jiacheng Liu, Hengwei Ye et al. · arXiv:2610.26101

    AI summaryQuantHarness introduces a two-layer agent framework to govern financial strategy development by enforcing strict workflow boundaries and maintaining verifiable execution records. It achieves a 90.72 percent task success rate on a new reliability benchmark, outperforming existing systems while preserving auditable development evidence.

  396. Don't Rewrite the SID Map: Topology Preservation for Generative Retrieval in Dynamic E-Commerce Search

    Jianbo Zhu, Xing Fang, Xiaopeng Chu et al. · arXiv:2610.26105

    Generative retrieval assigns each item a discrete semantic identifier (SID) and retrieves items by autoregressively generating SID sequences. In dynamic environments such as e-commerce, new items arrive continuously, requiring periodic updates to the SID-to-Item mapping and…

  397. Nash-MOPD: Optimizing Task Trade-offs in Multi-Teacher On-Policy Distillation

    Siyuan Gan, Bo Yang, Linjian Meng et al. · arXiv:2610.26124

    AI summaryNash-MOPD schedules teacher sampling by solving a local minimax game over reverse‑KL statistics, giving more prompts to domains that improve slowly. It outperforms fixed and D³‑MOPD, achieving higher math and code scores on DeepSeek‑R1‑Distill‑Qwen‑1.5B and Qwen3‑8B‑Base.

  398. MoveBench: A Rubric-Based Benchmark for Evaluating Large Language Models in Sports and Health Coaching

    Yitong Li, Jiang Bian, Jingling Wang et al. · arXiv:2610.26185

    Despite rapid advances in large language models (LLMs), their deployment in the sports and health domain remains high-risk due to the absence of domain-specific evaluation benchmarks. Existing general-purpose benchmarks (e.g., MMLU and HELM) primarily assess broad knowledge and…

  399. On Counting Graphs for Modal Logic with Counting

    Avijeet Ghosh, François Schwarzentruber · arXiv:2610.26187

    AI summaryThe paper analyzes the complexity of counting trees and graphs that a graph neural network classifies positively, equivalently satisfying a modal logic formula with counting, and investigates convergence properties of this counting process.

  400. VEILED-SH: Vulnerability Expression through Indirect Language Evaluation Dataset (Self-Harm)

    Leanne Tan, Keith Chua, Shaun Khoo et al. · arXiv:2610.26190

    AI systems may miss indirect, culturally situated distress or provide support mismatched to the application context. Existing benchmarks do not jointly address cultural variation, application context, and practitioner disagreement. We introduce VEILED-SH, a benchmark and…

  401. GeoEdit: Adversarial De-Evidencing for Silent Geoprivacy Protection via Image Editing

    Yu Yan, Shengjia Cheng, Fei Ma et al. · arXiv:2610.26194

    Recent efforts have demonstrated the strong capabilities of Multimodal Large Reasoning Models (MLRMs) in geographic reasoning. By jointly analyzing subtle visual cues, these models can infer the locations of photos, thus enabling doxing even by non-expert adversaries. Existing…

  402. LLMs Prompted for Legal Context Refuse More: Overrefusal from Small On-Premises LLMs in Criminal Legal Context

    Anastasiia Kucherenko, Francois Brouchoud, Dimitri Percia David et al. · arXiv:2610.26211

    Confidentiality requirements increasingly push legal professionals toward small, on-device LLMs that keep case data in-house, used for everyday tasks such as summarization, translation, and reformulation. Following standard prompting guidance, a user naturally states their role…

  403. Fairness or Fallacy? Mapping the Landscape of AI Bias in Disease Detection

    Ghulam Mudassir, Hameed Ullah Khan, Ahmad Sami Al-Shamayleh et al. · arXiv:2610.26215

    Artificial intelligence (AI) has several transformative effects on healthcare, like to facilitate clinicians in disease detection and to manage patient care with enhanced precision. Due to the increasing complexity of medical data and the growing volume of diagnostic images, the…

  404. Towards More Granular Reasoning: Mapping the DSA Transparency Database Taxonomy to Platform Terms and Conditions Using Large Language Models

    Alyson Ranucci, Eline Leijten, David Graus · arXiv:2610.26226

    Article 24(5) of the Digital Services Act (DSA) requires providers of online platforms to submit every content moderation decision they make, with a corresponding Statement of Reasons (SoR), to the DSA Transparency Database (DSA-TDB). Such decisions are classified against…

  405. CoRS: Fast Neural Flexible Job-Shop Scheduling via Composite Interval State Reuse

    Jiang Sutong, Zhao Peng, Wu Xuan et al. · arXiv:2610.26239

    Neural solvers for the Flexible Job-Shop Scheduling Problem (FJSP) typically refresh graph representations and update feasibility after every operation--machine decision. However, only feasibility must remain exact at every step, whereas graph encoding is substantially more…

  406. Machina Pauliana: A neuro-symbolic approach to the actio pauliana in Dutch insolvency law

    Daan Boven, Gregor Behnke, David Graus · arXiv:2610.26241

    Applying a legal provision frequently requires both structured rule-based reasoning and sensitivity to open-textured terms developed in case law. The actio pauliana of Article 42 of the Dutch Bankruptcy Act (Faillissementswet, Fw), which allows an insolvency practitioner to…

  407. Beyond Static Leaderboards: Capability-Focused Evaluation with Structural Diversity for Time Series Foundation Models

    Hongyin Zhang, Mingyi Xiang, Rongzhao Chen et al. · arXiv:2610.26251

    AI summaryCaFE extends static time‑series leaderboards by generating a refreshed test set that varies eight structural features, providing per‑feature capability profiles. It shows stable scores, uncovers hidden strengths/weaknesses, and selects models that outperform aggregate‑leaderboard choices on structured data.

  408. LOCU: Lowdin-Orthogonalized Constraint Updates for Multi-Constraint Policy Optimization

    Joonyoung Lim, Younghwan Yoo · arXiv:2610.26256

    We investigate multi-constraint policy optimization in constrained Markov decision processes (CMDPs), where interactions among constraint gradients often yield ill-conditioned update directions, causing numerically fragile steps and unintended cancellation or redundant overlap…

  409. REFLEX: RNA Ensemble Generation via Flexibility-Calibrated Stochastic Bridge

    Wanli Ma, Tianmeng Hu, Ke Li · arXiv:2610.26261

    RNA molecules often function through multiple experimentally observed conformational states. A central challenge is to capture ensemble diversity without sacrificing structural fidelity: samples may collapse toward averaged representative structures or drift into unsupported…

  410. Physics-anchored residual quantum neural networks for cloud-cover parameterization

    Zhuo Wang, Ce Yu, Bin Yang · arXiv:2610.26279

    AI summaryResidual quantum neural networks correct a fitted physical cloud‑cover estimate, reducing mean squared error by 38–54 % compared to direct QNN predictions. They outperform compact residual MLPs and approach the performance of a longer‑trained classical baseline.

  411. Toward Online Robust Zero-Sum Markov Games with Function Approximation

    Chenhao Zhou, Jiyu Wei · arXiv:2610.26286

    Online robust zero-sum Markov games pose a coupled operator-learning and game-solving problem: from nominal interaction data, the learner must recover a worst-case minimax Bellman operator while maintaining strategic coverage and controlling stage-game approximation error.…

  412. Robotic Photography System based on Vision-Language-Action Model

    Song-Li Wu, Chubin Zhang, Wenbo Ding et al. · arXiv:2610.26287

    AI summaryRoboPhoto-VLA integrates vision, language, and action to autonomously plan camera motions and capture aesthetically pleasing photos. It uses PhotoCoT for structured action planning and ADPO to align with human aesthetics, achieving better alignment and generalization on the new OpenPhotography dataset.

  413. The Scheduler Is a Hidden Retriever: How Asynchrony Shapes Evidence Acquisition in Search Agents

    Ruiyang Ren, Yuhao Wang, Yinan Zhang et al. · arXiv:2610.26310

    Language-model agents increasingly solve complex tasks through parallel reasoning and asynchronous information gathering. Controlled replay across two model families and three benchmarks shows that delivery timing redirects search decisions made before all results arrive,…

  414. Selective Transfer through Sequence Distillation: From Benchmark Knowledge to Backdoor Behaviour

    Jonibek Mansurov, Sholpan Bolatzhanova, Filbert Aurelian Tjiaranta et al. · arXiv:2610.26311

    Knowledge distillation is widely used to transfer capabilities from teacher models to student models, but recent work shows that it can also transfer unintended teacher properties. We study whether different hidden teacher properties survive the same distillation channels.…

  415. StrucChunk: Structure-Aware Retrieval for Legal Document RAG

    Surya Deep Singh, Ashutosh Tripathi, Gaurav Deep Singh · arXiv:2610.26313

    Retrieval-Augmented Generation (RAG) can ground LLM outputs in domain-specific knowledge, but legal documents are hard: standard chunking fragments hierarchical argument structure, and generic embeddings struggle with both precise citation matching and semantic understanding. We…

  416. MCDA: Multi-View Graph Contrastive Learning with Dynamic Topology Augmentation for Functional MRI Analysis

    Hao Zhang, Xiaoyun Liu, Shuo Huang et al. · arXiv:2610.26322

    Resting-state fMRI (rs-fMRI) is a vital non-invasive tool for diagnosing brain disorders and uncovering pathological mechanisms. However, existing graph contrastive learning (GCL) methods often underexploit augmentation histories across training epochs and the relationships…

  417. The Control Layer Behind Rule-Following Agents Trading Across Market Conditions

    Saad Naja, Nasser Odtallah, Jake Van-Praag et al. · arXiv:2610.26324

    Trading discipline often fails people. Our study tested whether four AI trading agents followed their strategies and risk rules. Offering traders the evidence and an agent evaluation toolkit to separate luck from following the rules, before giving agents meaningful autonomy or…

  418. CIS-Transolver: A Cross-Layer Incremental-State Neural Operator for Fine-Scale Automotive Aerodynamic Flow Prediction

    Jianglong Liu, Zhicheng Zhu, Jia Hao et al. · arXiv:2610.26337

    Neural operators offer an efficient data-driven approach to rapid prediction of complex automotive aerodynamic flows. However, spectral bias and other factors limit accurate reconstruction of fine-scale flow variations near complex geometries. Existing studies improve the…

  419. Large-Scale Biomedical RAG: Corpus Scaling, Document Representation, and Efficiency Trade-offs

    Adrián Sánchez-Freire, Gonzalo Pérez-Gómez, Aitziber Atutxa et al. · arXiv:2610.26339

    We present a controlled, large-scale evaluation of how corpus scale, document representation, and reranking affect the effectiveness and efficiency of biomedical Retrieval-Augmented Generation (RAG) systems. Retrieval collections were progressively expanded while retaining the…

  420. A Generic On-Board AI Processing Chain for Earth Observation: From Application Development to Embedded Deployment and Mission-Level Orchestration

    Michel-François Foulon (TAS), Liz Ramos Medina (TAS), Thomas Goudemant (TAS) et al. · arXiv:2610.26340

    Earth observation satellites acquire more data than they can downlink. Extracting information on board with artificial intelligence (AI) turns the satellite into a data-reduction stage that downlinks compact products, such as masks or detections, instead of full scenes;…

  421. VibeTraining-Bench: Data-Trainer-Harness Co-Design for Iterative System Improvement

    Ruotian Peng, Yuanyi Ren, Shuaiqi Liu et al. · arXiv:2610.26342

    AI summaryVibeTraining-Bench evaluates agents’ ability to jointly refine training data, trainer, and inference harness through iterative feedback, across diverse tasks. GPT‑6‑Astra lifts a base system from 32.9 % to 53.7 % on SWE‑bench Verified, approaching a human‑crafted 55.4 % benchmark.

  422. CARRS: A Constraint-Aware, Real-Time Routing System for Emergency Vehicles in Urban Environments

    Vincent Sello, Timothy Adeliyi, Ridewaan Hanslo · arXiv:2610.26346

    Emergency vehicles such as police vehicles, fire engines, and ambulances require a stable and efficient route optimization to reach life-critical events in the shortest times possible. However, the dynamic nature of urban traffic makes this ideal scenario much more challenging,…

  423. PhyPro-FM: A Physics and Prompt-Guided Graph Foundation Model for Contingency Analysis

    Xu Yang, Zhanyuan Sheng, Chenhui Lin et al. · arXiv:2610.26351

    AI summaryPhyPro‑FM combines graph neural networks with a learnable global query and prompt‑guided few‑shot learning to perform contingency analysis. It outperforms prior methods by prioritizing branch‑flow errors during training and using a residual‑based correction for singular branches, achieving superior accuracy and robustness.

  424. GAIDA: Generative AI for Human-in-the-Loop Document Annotation

    Islam Mesabah, Ali Elhosary, Priyabanta Sandulu et al. · arXiv:2610.26362

    Document annotation is a fundamental yet labor-intensive step in building document information extraction systems. While Optical Character Recognition (OCR) and Large Language Models (LLMs) can automate parts of this process, we argue that annotation systems should be judged not…

  425. Autonomous intelligence for mining productivity: a multi-agent AI approach to operational value creation

    N Guerin (CGS i3), A Dehoux (ERAMET), M Nakhla (CGS i3) · arXiv:2610.26369

    Integrated Remote Operation Centres (IROCs) are emerging as the architectural frontier of Industry 4.0 for capital-intensive sectors such as mining, oil and gas, and energy. Yet two intertwined gaps constrain their evolution towards full autonomy. First, no integrated agentic…

  426. BOSS: Token-Budgeted Online Sampling and Selection for LLM Reasoning

    Yupeng Chang, Yahan Li, Chenlu Guo et al. · arXiv:2610.26383

    Test-time scaling can improve LLM reasoning, but existing approaches typically adapt generation or apply answer selection after a predetermined generation schedule. We study within-instance allocation: under a hard per-instance prompt-plus-completion token cap, when should…

  427. Answer Delivery Under a Shared Token Budget: An Audited Study of Stopping and Finalization

    Yupeng Chang, Linyuan Gao, Zhiyuan Li et al. · arXiv:2610.26384

    An inference budget is useful only when the system delivers an answer within it. We study a fixed-budget policy combining first-valid-box stopping with a charged finalization cue. On 100 fresh, independently audited GSM8K test questions per model, it improves delivered endpoint…

  428. When Coding Agents Outpace Review: Evaluating PRD-Driven Development in Mature Enterprise Repositories

    Tianqi Liu, Yandong Guan, Songze Li et al. · arXiv:2610.26394

    AI summaryPACE evaluates coding agents on 43 enterprise PRD tasks, measuring full requirement fulfillment. The best model (GPT‑5.6‑Sol) attains only 14% complete delivery, with incomplete implementation and missing integration as main bottlenecks.

  429. Local data augmentation for imbalanced binary classification

    Harold Guéneau (SAMM), Alain Celisse (LPP, MODAL) et al. · arXiv:2610.26418

    Facing imbalanced binary classification, we aim at maximizing the recall while limiting the proportion of false detections in the minority class. For doing that, the present work studies the effect of several rebalancing strategies, from the uniform subsampling of the…

  430. Physiology-Aware Graph Attention for Early Ventricular Reentry Prediction

    Maëlis Morier (EPIONE), Jairo Rodríguez Padilla (ISIR, MLIA) et al. · arXiv:2610.26430

    Sudden cardiac death mostly originates from post-infarct ventricular tachycardia. This reentry is sustained by propagation around scar tissue, but its risk remains difficult to predict from infarct imaging alone. While in silico induction studies can reveal these mechanisms,…

  431. Fake News, Real Crashes: Information Injection Attacks on LLM Financial Trading Agents

    Mengxiao Wang, Nitesh Saxena · arXiv:2610.26438

    Large language model (LLM) agents now trade real capital using news as evidence, yet they cannot reliably tell fabricated headlines from real news. Because they read the same feeds under near-identical policies, a single fabricated post can push them into the same trade at the…

  432. Rethinking LLM Fine-Tuning via Weight Space Reparameterization: Preserving Safety during Downstream Adaptation

    Minseong Kim, Jongbok Won, Jeesup Park et al. · arXiv:2610.26443

    Fine-tuning large language models (LLMs) on downstream tasks often weakens their previously aligned safety behavior, creating an inherent trade-off between task adaptation and safety preservation. Existing approaches attempt to mitigate this issue by identifying safety-relevant…

  433. Remembering Has a Price: Learning Memory Worth under Resource Constraints

    Guannan Lai, Zi-Yang Bai, Jun-Peng Jiang et al. · arXiv:2610.26453

    Lifelong agents continually accumulate and reuse experience to improve after deployment, yet in practice they often operate under tight generation, interaction, and memory budgets. Under such stringent joint constraints, we find that existing lifelong-memory methods can become…

  434. ALIGN: Aligning Condition Estimation and Expression in Advantage-Conditioned Behavior Cloning

    Zechen Wang, Zhenqi Qiu, Houlong Xiong et al. · arXiv:2610.26455

    Human-collected robot manipulation data often mix successful behavior with retries, pauses, recoveries, and failures. Advantage-Conditioned Behavior Cloning (AC-BC) can exploit such mixed-quality data, but only if the conditioning signal is both accurately constructed from…

  435. VeriCUA: Learning Proactive Verification for Reliable GUI Agent Rewards

    Zhizhou Wang, Yaxi Lu, Zhong Zhang et al. · arXiv:2610.26469

    Reinforcement learning for computer-use agents increasingly relies on proactive reward agents that interact with the post-execution GUI environment to verify what recorded screenshots cannot reveal. The reliability of such verification hinges on two coupled decisions: what to…

  436. SPAR: Structural Pruning and Action Recovery for Vision-Language-Action Models

    Shenli Zheng, Zhou Fang, Yuan Du et al. · arXiv:2610.26487

    The limited onboard computing resources of robots make the inference demands of vision-language-action (VLA) models costly to accommodate. Reducing these demands through aggressive compression, however, can degrade manipulation performance beyond what supervised fine-tuning…

  437. Mitigating Reward Hacking in Preference Reward Models with Evolving Penalties

    Afonso Baldo, António Farinhas, Marcos Treviso et al. · arXiv:2610.26496

    AI summaryDynalize automatically generates penalties from a language model that identifies reward‑hacking behaviors during policy training, applying them to rollouts. This online intervention lets open‑ended models train longer and improves downstream performance, reducing hacking patterns in tasks like counseling and creative writing.

  438. ScopeMem: Latent Memory That Learns Where to Revise Frozen GUI Agents

    Zhicheng Zheng, Cheng Zhang, Shengping Yu et al. · arXiv:2610.26503

    AI summaryScopeMem adds a latent memory prefix that, conditioned on the model’s initial answer, revises only incorrect actions while preserving 94.4% of correct ones. It outperforms CE-trained prefixes and other baselines on AndroidControl, GUI-Odyssey, and AITW, matching or beating larger VL models.

  439. Learn the Task, Not the Schedule: Reducing Spurious Cross-Arm Coupling in Bimanual Imitation Learning

    Shuyuan Hu, Deng-Ke Wu, Yifan Jin et al. · arXiv:2610.26507

    A bimanual demonstration specifies both what the robot should do and one particular schedule for when each arm should act. Standard imitation learning does not distinguish task-required cross-arm constraints from incidental scheduling choices, and may therefore exploit…

  440. RouterWorld: Scaling Conversational AI with Latency-Aware LLM Routing

    Jinyang Li, Denis Emelin, Simone Tedeschi et al. · arXiv:2610.26511

    AI summaryRouterWorld benchmarks conversational LLM routing with realistic latency and partial observability, offering 371k responses and 76k agent trajectories. It shows most existing routers prioritize accuracy over latency when only sparse logs or streaming data are available.

  441. Toward Structured Financial Foundation Models

    Natraj Raman, Saumitra Mishra, Vamsi Potluru et al. · arXiv:2610.26516

    Foundation models promise reusable capabilities and step-change performance gains across tasks. In finance, large-scale pretraining of domain-specialized foundation models can advance both goals. However, prevailing architectures and objectives do not by themselves address the…

  442. Beyond Behavioral Accuracy: Evaluating Individual-Level Fidelity in LLM Investor Simulation

    Jiajie He, Yuanhong Jiang, Xintong Chen et al. · arXiv:2610.26524

    Large language models (LLMs) are increasingly used as user simulators, but can they faithfully reproduce an individual's behavior and decision logic over time? We investigate this question in a longitudinal paper-trading study with 80 participants. Using rolling next-day…

  443. A Semantic Knowledge Graph Construction Pipeline for Vehicle Intention Prediction in nuScenes

    Khaled Nowara, Mohamed Manzour, Catherine Elias · arXiv:2610.26528

    Knowledge graphs (KGs) are increasingly used in autonomous driving (AD) to make traffic scene entities and relations explicit for prediction and reasoning. Existing traffic-scene KGs, however, primarily emphasize trajectory forecasting or general scene understanding. This paper…

  444. Breaking Diffusion: Parallel Reasoning with Draft Refinement

    Jaesang Yu, Seoyeon Byun, Yun Wang et al. · arXiv:2610.26542

    Drafting an answer allows a reasoning model to reconsider each decision in the context of the others. Yet repeated diffusion denoising does not ensure that individually plausible token updates form a better answer together. We introduce Draft Refinement Language Models (DRLMs),…

  445. Agentic Orchestration of EDC Data Space Retrieval and Natural Language Driven Data Processing

    Marla Grunewald, Fin Gentzen, Iulisloi Zacarias et al. · arXiv:2610.26548

    Participating in a data space still requires the Dataspace Protocol (DSP) negotiation flow to be hand-coded against each provider's access policy. We present a multi-agent architecture that automates this process using natural language requests. Built on LangGraph over an…

  446. Training Natural Schemers: RL Can Amplify Oversight-Conditional Behavior

    Bart Jaworski, Nathaniel Mitrani, Fred Bruford et al. · arXiv:2610.26551

    One of the central concerns for the safety of advanced AI is scheming: when a model strategically complies under oversight but pursues its own goals when unobserved. Current demonstrations, such as Anthropic's Alignment Faking work, depend on design choices that make them less…

  447. BetaMem: Learning to Remember a Changing World for Embodied Agents

    Mai Liu, He Sun, Siru Zhong et al. · arXiv:2610.26554

    Long-horizon embodied agents face temporal confusion and incomplete or distorted records, recurring errors from fixed memory rules, and growing storage and retrieval costs. We present BetaMem, a framework for building and evolving traceable long-term memory through six linked…

  448. Reward Objectives for Robust (PO)MDPs: A Law-Preserving Equivalence with (Partially Observable) Games

    Durgam Latha, Dion Reji, Dorde Zikelic et al. · arXiv:2610.26568

    Robust partially observable Markov decision processes model agents that act under partial observability while adversarial environment resolves uncertainty in the transition probabilities. Reward objectives such as discounted-sum, long-run average and cumulative reward under…

  449. WhatIf-Bench: Benchmarking Intervention-Aware Time Series Forecasting

    Arjun Ashok, Mihir Parmar, Palash Goyal et al. · arXiv:2610.26582

    Recent time series foundation models (TSFMs) can consume covariates in-context, extending zero-shot forecasting to problems driven by external factors. This enables scenario analysis: forecasting how a target responds to events that set covariates to chosen future values.…

  450. Concerns in Benchmarking Jailbreaks: An Empirical Study of Attack Success Rates

    Leon Tu Nguyen, Rohan Menon, Rafael Tappe Maestro et al. · arXiv:2610.26595

    Jailbreak methods are commonly compared using Attack Success Rate (ASR), but these comparisons depend on how responses are generated and judged. In this paper, we examine eight attacks against three open-weight language models using three evaluation procedures. Low-resource…

  451. Conducting Reliable Keyword Estimation with Unreliable ASR in Police Audio Data

    Robert Cole Molloy, Rhiannon N. Miller, Stephen Morgan et al. · arXiv:2610.26614

    Extracting insights from large audio data sets using human transcription is expensive and time-consuming. Off-the-shelf Automatic Speech Recognition (ASR) systems offer an easy-to-use scalable alternative, but systematic transcription errors, especially in domain-specific…

  452. VaDar: Implicit Goal Conditioning via Value Disaggregation

    Shashwat Saxena, Mehul Goel, Sreyas Venkataraman et al. · arXiv:2610.26629

    Long-horizon tasks are important for modern AI and robotics, yet pose a challenge for reinforcement learning. Historically, a popular approach has been to decompose a task into subgoals, and learn a subgoal-conditioned policy to execute each subtask in sequence. We introduce an…

  453. When the harness decides success: state that cannot be re-observed

    Raimondas Lencevicius (Microsoft) · arXiv:2610.26632

    Agent harnesses decide what a language model sees across turns: they drop old turns, summarize them, or replay the model's own earlier reasoning. We ask when these choices change whether an agent succeeds, not only what it costs, and report three findings. First, in a…

  454. Revision-Based Learning from Interactive Experience and Feedback

    Jiawen Li, Chenming Ge, Alice Gao et al. · arXiv:2610.26636

    Code generation models are increasingly used to produce interactive artifacts, such as websites and user interfaces. Many properties that determine whether these interfaces are useful only become apparent through realistic interaction, making them difficult to incorporate into…

  455. Reasoning-Aware Multicalibrated Reliability Predictors for Language Models

    Ekaterina Fedorova, Alessandro Morosini, Chara Podimata · arXiv:2610.26645

    As people increasingly rely on large language models (LLMs) for information, model providers need to communicate meaningful estimates of whether individual responses are correct or, more generally, reliable. In the context of hallucinations, existing work uses multicalibration…

  456. From Outcomes to Components: A Counterfactual Evaluation Framework for LLM-Proposed Repairs

    Hengyu Ye, Songhua Hu · arXiv:2610.26650

    An LLM-generated repair action specifies which records to change and by how much. A failed action may still contain a useful target set or numerical update, depending on how the two are paired. We evaluate this problem in traffic networks and databases, where aggregate…

  457. The Effectiveness and Durability of Pretraining Data Filtering in Protein Language Models

    Aaron Maiwald, Roderick McNeill, Jaeyoung Lee et al. · arXiv:2610.26651

    Pretraining filtering is one of the most common safeguards for open-weight language models. Here we study its effectiveness, durability and scalability using the ESM-2 family of protein language models. We find that filtering viral proteins from the pretraining data meaningfully…

  458. The Development of Sycophancy in Language Models: Tracing Vulnerabilities from Pretraining to Post-Training

    Haonan Huang, Chengkun Cai · arXiv:2610.26655

    Language models can change a committed answer to accommodate a user's opinion or pushback without new evidence. However, when this behaviour develops during training and what a released model inherits from earlier stages remain unclear. We follow 741 checkpoints of 30 open model…

  459. Tandem: Serving Hybrid Linear-Attention GUI Agents on Mobile NPUs

    Zhuomin Chen, Jingchao Ni, Xu Zheng et al. · arXiv:2610.26660

    Smartphone GUI agents complete tasks in mobile apps by repeatedly reading the screen and asking a model for the next action. Mobile neural processing units (NPUs) enable local execution, keeping screen contents on the phone, but model latency accumulates with every action.…

  460. AllPath: Layered Verification for a Deployed, Self-Revising LLM Trading Agent under Human-Gated and Autonomous Regimes

    Tian Zhang, Meng Li · arXiv:2610.26662

    AI summaryAllPath deploys a self‑revising LLM trading agent with a three‑layer verification architecture: deterministic code gates, bounded nightly self‑review, and human approval. In live testing, human gating caught strategy disagreements and rule deletions while code gates ensured consistency, revealing production failures unseen in backtests.

  461. Honeypots for AI Agent Insider Threats

    Jan Wehner, Jam Kraprayoon · arXiv:2610.26664

    AI agents deployed inside organizations can pose an insider threat if they make mistakes, are compromised by an attacker, or pursue misaligned objectives. We propose honeypots as an AI control method to improve the security of internal agent deployments. Rather than only using…

  462. StepBench: Diagnosing Real-World Procedural Understanding in AI Agents

    Hossein A. Rahmani, Bin Wu, Chaeeun Lee et al. · arXiv:2610.26679

    AI summaryStepBench evaluates AI agents on procedural understanding by testing five diagnostic tasks from 6,885 wikiHow procedures, revealing that step ordering is hardest, with top models correctly ordering only 63% of steps and performance dropping to 33% for long procedures.

  463. Intra-Rubric Reward Divergence: Mitigating Rubric Hacking through Latent Dimension Recovery and Balancing

    Jianqiang Xia, Han Xu, Dianxi Shi · arXiv:2610.26685

    Rubric hacking limits both performance and training robustness in rubric-based reinforcement learning. By decomposing rubrics into sub-dimensions, we reveal the Intra-Rubric Reward Divergence: as the total rubric score increases, certain sub-dimension scores systematically…

  464. Hierarchical Token Merging with Recursive Autoencoders for Unsupervised Grammar Induction

    Murat Guney Kemal, Robert Lieck · arXiv:2610.26695

    Hierarchical abstraction is a fundamental principle across many data modalities, enabling complex sequences to be represented compositionally at multiple levels. Learning such hierarchies directly from data, without explicit structural supervision, remains a central challenge in…

  465. Towards Robust Model Organisms for Eliciting Latent Knowledge

    Lennart Finke, Hardik Bhatnagar, Euodia Dodd et al. · arXiv:2610.26698

    A key problem in AI safety is eliciting latent knowledge (ELK), extracting information from a model that is misaligned and more knowledgeable than its overseer. For example, a misaligned model used to scan code for vulnerabilities may want to withhold its findings, i.e.,…

  466. recAMPLIFY: Large-Scale Pretraining of Recursive Protein Language Models

    Saurav Jha, Qianli Liao, Robert Vernon et al. · arXiv:2610.26747

    AI summaryrecAMPLIFY trains a recursive masked protein language model with 155 M unique parameters on 2 T tokens, achieving a 22.5% lift in fold accuracy and better contact recovery while using 56% fewer parameters. Gated Mixture Recurrence (GMR) adds adaptive gating, reducing expected depth by up to 37% with modest accuracy loss.

  467. TokenGate: Adapting LLMs for Fast and Memory-Efficient Prefill with Learned Token Pruning

    Liana Patel, Rishabh Ranjan, Ion Stoica et al. · arXiv:2610.26754

    AI summaryTokenGate adds a lightweight module to transformers that learns to prune input tokens during prefill, using token‑gated attention to bypass the non‑differentiable top‑K. It yields 1.4–11.3× faster TTFT and 1.5–3.4× lower memory without accuracy loss, outperforming prior token‑pruning methods.

  468. Game of Phones: Harnessing Game Theory and LLMs in 'Bot Wars' to Counteract Phone Scams

    Nardine Basta, Robin Carpentier, Benjamin Zi Hao Zhao et al. · arXiv:2610.26781

    Phone scams impose substantial and growing costs on individuals and financial systems worldwide, yet existing countermeasures impose no resource cost on perpetrators. Strategic scam-baiting, in which automated agents engage scammers to deplete their operational capacity, offers…

  469. LG-Bench: A Graph-Structured Evaluation Benchmark for Life Sciences

    Lu Sun, Xiangyi Zhang, Xiangyang Zhu et al. · arXiv:2610.26787

    Traditional evaluation benchmarks reduce inherently interconnected scientific knowledge in life sciences into flat lists of questions, disregarding the underlying topological structure of the knowledge. We introduce, the first graph-structured benchmark for life sciences,…

  470. SOMA: Continuous Monitoring and Intervention for System Two Reasoning with System One Models

    Ruizhi Qian, Lei Shi, Tianyu Hu et al. · arXiv:2610.26793

    Reasoning models often run into problems without noticing them, even when symptoms are visible in their own text. In humans, metacognition separates monitoring from control: fast, intuitive signals keep watch while slow, deliberate reasoning unfolds and help decide whether to…

  471. Mise-en-Video: Fine-Grained 3D Control for Multi-Shot Video Generation

    Yingshuang Zou, Xiaoyu Shi, Yawen Luo et al. · arXiv:2610.26801

    Recent advances in text-to-video generation have enabled high-fidelity single-shot synthesis, yet practical storytelling creation requires multi-shot videos with both strong inter-shot consistency and fine-grained controllability. Existing multi-shot video generation approaches…

  472. Next Best Action: Causal Constrained Offline RL for Business Action Targeting

    Surya Ramachandiran, Yiming Li, Juan Mancilla-Caceres et al. · arXiv:2610.26817

    Next Best Action (NBA) systems must select among customer interventions (e.g., discounts, promotions, and lifecycle actions), maximize long-term economic value, satisfy complex operational constraints, and remain causally grounded. Existing approaches lack a rigorous framework…

  473. AfriBED: a Speech Recognition Bias Evaluation Dataset for Low Resource African Languages

    Claytone Sikasote, Hussein Suleman, Jan Buys · arXiv:2610.26821

    AI summaryAfriBED is a 9‑hour Bemba and 18‑hour Nyanja speech dataset designed to evaluate gender and speaker‑type bias in ASR. Baseline experiments show it effectively reveals performance disparities across speaker subgroups in low‑resource African languages.

  474. RefCraft: Benchmarking Visual-Reference-Conditioned Agentic Generation through Web Development

    Yuchi Wang, Rongyao Fang, Weihao Yu et al. · arXiv:2610.26826

    AI summaryRefCraft introduces a benchmark of 300 multimodal tasks evaluating AI agents on webpage development using visual references and text instructions. Experiments show that current frontier models struggle with this workflow, with the top system achieving a score of only 52.12 out of 100.

  475. Agent World Model in the Wild: Computer-Use Agent Environment Synthesis

    Zhaoyang Wang, Qianhui Wu, Haorui Wang et al. · arXiv:2610.26828

    AI summaryWildAWM synthesizes 341 long‑horizon computer‑use tasks in controllable, multi‑interface environments using open‑source models, and training Qwen agents in these worlds boosts performance on eight out‑of‑distribution benchmarks.

  476. ProteinGeoBench: Frontier Structural-Biology Agents Are Fluent at Lookup but Lost in Geometry

    Matt Turk, Brandon L. Neel, Diana M. Lopez et al. · arXiv:2610.26829

    AI summaryProteinGeoBench shows frontier models excel at metadata lookup (0.785–0.816) but struggle with numeric geometry (often failing 12/28 tasks); performance varies with evaluation budget, harness, and network access, underscoring the need for per‑task reporting.

  477. Kronecker Delta Rule for Long Context Linear Attention

    Anamaria-Roberta Hartl, Levente Zólyomi, Michael List et al. · arXiv:2610.26834

    AI summaryKronLSTM introduces the Kronecker Delta Rule, a minimally invasive memory‑revision update for linear attention. It converges to a stable steady‑state, keeps the memory norm bounded, and outperforms existing linear attention models on long‑context language tasks.

  478. Same Simulation, Different Evidence: Where Retrieved Tool Output Costs LLM Agents Accuracy

    Ke Zhang, Sahchit Chundur, Jerry Peprah Owusu et al. · arXiv:2610.26836

    LLM agents that compute the right answer can still answer wrongly. Agent harnesses increasingly keep long tool outputs out of the context window, saving them to files that the agent searches or reads on demand. We ask where this costs accuracy with a real scientific tool:…

  479. LatComm: Reusable Context Compression for Latent Communication between Large Language Models

    Huawei Lin, Jinting Liu, Tan Yu et al. · arXiv:2610.26840

    Systems that combine several large language models (LLMs) often use one context for many questions. When the context is passed between models as text, the receiving model processes all of its tokens again for every question. Avoiding this cost requires a context representation…

  480. AnyGoal: On World Model Generalization Beyond Expert Rollouts

    Heejeong Nam, Divyat Mahajan, Quentin Le Lidec et al. · arXiv:2610.26844

    The goal of a world model is to capture the dynamics of an environment. This has the great appeal that it allows agents to plan and simulate a course of actions with the help of a world model. For these uses to be reliable, however, the learned dynamics must behave well beyond…

  481. Train An Imaginative Agent

    Jiaxin Ge, Junyi Zhang, Tianning Chai et al. · arXiv:2610.26845

    A seemingly reasonable push in Sokoban can make the puzzle unsolvable. To avoid such mistakes, an agent has to anticipate the consequences of its actions before execution, especially when feedback from the real environment is sparse or actions are irreversible. We introduce…

  482. WeAct: Dynamic Weight Switching as Agent Actions

    Rui Shi, Xunjian Yin, Jiacheng Sang et al. · arXiv:2610.26847

    Long-horizon agents must learn heterogeneous capabilities from interleaved trajectories. Updating shared parameters to learn new capabilities can degrade previously acquired ones, resulting in catastrophic forgetting. As a trajectory unfolds, different stages may require…

  483. Where is Physical RSI capability from? An Observational Scaling Law of LLM-as-policy

    Zekai Li, Jiayi Yu, Jinlu Zhang et al. · arXiv:2610.26848

    In this paper, we systematically investigate the mechanisms, scaling behavior, and generalization of physical Recursive self-improvement. We introduce PhysRSI-eval to quantify physical RSI through a five-axis metric: First-Attempt Performance, Efficiency, Success, Budget and…

  484. CoopUQ: Robust Multi-Robot Social Navigation via Uncertainty-Aware Cooperative Forecasting

    Zehao Wang, Jianpeng Yao, Yuping Wang et al. · arXiv:2610.26852

    AI summaryCoopUQ fuses cross‑robot spatiotemporal features to produce uncertainty‑aware occupancy forecasts, then uses these forecasts in a constrained multi‑agent reinforcement learning policy that penalizes traversal of high‑risk or uncertain cells. It shows better prediction accuracy and safer navigation in both in‑distribution and out‑of‑distribution Unity3D and real‑robot tests.

  485. Reinforcement Learning with Visually Attributable On-Policy Self-Distillation

    Shiao Xie, Siyu Chen, Jianwei Lv et al. · arXiv:2610.26856

    Multimodal reinforcement learning with verifiable rewards (RLVR) provides reliable task-level supervision, yet offers limited guidance for localizing errors in visual reasoning. On-policy self-distillation (OPSD) complements this supervision with dense token-level corrections…

  486. OpenVLHarness: Real World Visual Agentic Tool-Use with Multimodal Memory

    Yu Zhou, Cheng-Fu Yang, Rui Sun et al. · arXiv:2610.26860

    AI summaryOpenVLHarness adds a tool‑capability layer and persistent multimodal memory, enabling large language models to fetch, interpret, and store heterogeneous evidence across reasoning steps. It boosts performance on 22 benchmarks by 9.7–12.6 points over no‑tool baselines while reducing token cost.