Monthly Issue
Collected dispatches

2026-08

2026-07-02 to 2026-07-31
320 papers
30 daily issues
A monthly ledger of recurring themes, selected papers, and daily issues. 3 sections
§ I

The Month in Review

Editorial summary

Here's a summary of the monthly trends from the provided papers:

Shifts in Research Direction Popularity:

The dominant theme this past month has been enhancing the robustness, reasoning capabilities, and safety of AI agents. There's a strong focus on moving beyond static LLMs to dynamic, interactive, and more human-like agents. This includes:

• Advanced Agent Architectures: Papers like "Cognitive-structured Multimodal Agent" and "WebSwarm" introduce novel architectures that externalize memory, use recursive delegation, and enable more sophisticated multi-agent coordination for complex tasks. • Mitigating LLM Weaknesses: A significant effort is directed towards addressing core LLM limitations. "Game Theory Driven Multi-Agent Framework Mitigates Language Model Hallucination" and "Towards Mechanistically Understanding Why Memorized Knowledge Fails to Generalize" tackle hallucination and generalization failures respectively, while "UltraX" and "Prompt Compression via Activation Aggregation" focus on data quality and efficient prompt processing. • Long-Horizon and Complex Tasks: Many papers, including "Remember When It Matters" and "LongMedBench," focus on enabling agents to handle tasks that require sustained attention, memory, and decision-making over extended periods or across multiple interactions. • Safety and Attribution: "TRACE" and "Token-Flow Firewall" introduce methods for watermarking and auditing agent trajectories to ensure provenance and prevent malicious behavior. "TrustX Agent Risk Classification Framework (ARC)" and "HyperSafe" address governance and safety restoration. • Specialized Domains and Benchmarking: A surge in domain-specific benchmarks like "AUTOPILOT VQA," "DocMaster," "OmniFood-Bench," and "LongMedBench" indicates a drive towards more targeted evaluation of agent capabilities in areas like driving, document analysis, health, and medicine. • Multimodality: Integrating vision, language, and action is becoming increasingly common, as seen in "WCog-VLA" for autonomous driving and benchmarks evaluating multimodal agents.

Notable Groups or Labs:

While specific lab affiliations aren't explicitly stated for each paper, the consistent focus on advanced agent architectures, theoretical underpinnings of LLM behavior (like generalization failures), and robust evaluation suggests significant contributions from leading AI research institutions and companies. The presence of multiple papers on agent orchestration and multi-agent systems points to active research in this area.

Trends to Watch Next Month:

• Practical Deployment of Robust Agents: Expect to see more research on making these sophisticated agents deployable in real-world scenarios, focusing on efficiency, cost-effectiveness, and user experience. • Unified Embodied AI: Continued progress in unifying multimodal and embodied capabilities for agents operating in physical environments, as hinted by "Xiaomi-Robotics-U0" and "From World Action Models to Embodied Brains." • Advanced Agentic Reasoning and Planning: Further exploration into how agents can perform more complex planning, strategic decision-making, and collaborative reasoning, potentially through novel auction mechanisms or hierarchical task decomposition. • Decomposition of LLM Failures: Continued investigation into the internal mechanisms of LLMs that lead to errors, with a focus on developing actionable solutions for generalization and reliability. • Enhanced Safety and Governance Frameworks: Increased development of robust frameworks for evaluating, auditing, and governing complex agentic AI systems to ensure responsible deployment. • Cross-Domain Transfer and Generalization: More emphasis on agents that can transfer knowledge and skills learned in one domain to another, improving overall versatility.

§ II

Top Papers

Selected research 320
cs.AIarxiv:2607.08497v1Lead article

Cognitive-structured Multimodal Agent for Multimodal Understanding, Generation, and Editing

Feng Wang, Canmiao Fu, Zhipeng Huang, Chen Li, Jing Lyu

his paper introduces a Cognitive-structured Multimodal Agent that addresses limitations in current unified multimodal models by externalizing visual information into an Episodic Visual Memory. This allows for selective retrieval of relevant visual context during reasoning, overcoming issues with long-horizon dialogues and token explosion. The agent's contribution lies in its novel architecture with distinct engines for perception, memory retrieval, and task execution, along with a new dataset generation method to facilitate training for improved cross-turn multimodal understanding and generation.

A multi-turn multimodal dialogue produced by our Cognitive-structured Multimodal Agent, spanning 20 turns across four topics (stargazing dome, biological cells, cleanroom facility, spacecraft). The agent autonomously handles interleaved understanding, generation, and editing tasks while accurately retrieving and referencing visual episodes from earlier turns.
A multi-turn multimodal dialogue produced by our Cognitive-structured Multimodal Agent, spanning 20 turns across four topics (stargazing dome, biological cells, cleanroom facility, spacecraft). The agent autonomously handles interleaved understanding, generation, and editing task…
cs.AIarxiv:2607.08403v1Lead article

Game Theory Driven Multi-Agent Framework Mitigates Language Model Hallucination

Runzhe Liu, Biquan Bie, Zihao Wang, Yuchao Ma, Yexin Liu

his paper introduces G-Frame, a multi-agent framework that uses game theory to train language models for scientific domains. By integrating Bayesian and team game principles, G-Frame forces models to internalize domain constraints, significantly reducing hallucinations. This approach leads to specialized models like OmniChem, which achieve competitive performance with state-of-the-art models while exhibiting drastically fewer errors.

a. G-Frame achieves adaptive strategies through two distinct modes: (i) team games and (ii) Bayesian games. b. The bar chart illustrates the number of open-source databases designated with chemical labels on Hugging Face as of May 15, 2025. Notably, a substantial portion of these datasets contains invalid entries or pertains to other domains; thus, the amount of genuinely usable data for chemistry is less than the reported. c, d, e. The workflow for building OmniChem using G-Frame is illustrated, consisting of three modules: data preprocessing, data synthesis, and model training. f. The composition of the journal corpus used for pre-training is shown.
a. G-Frame achieves adaptive strategies through two distinct modes: (i) team games and (ii) Bayesian games. b. The bar chart illustrates the number of open-source databases designated with chemical labels on Hugging Face as of May 15, 2025. Notably, a substantial portion of these…
cs.AIarxiv:2607.08393v1Lead article

Towards Mechanistically Understanding Why Memorized Knowledge Fails to Generalize in Large Language Model Finetuning

Lu Dai, Ziyang Rao, Yili Wang, Hanqing Wang, Hao Liu

his paper addresses the "Knowing-Using Gap" in LLM fine-tuning, where models memorize new facts but fail to apply them in reasoning. Using a novel "self-patching" technique, they identify that memorized knowledge is internally present but not correctly routed to computation-effective layers. This "knowledge-circuit misalignment" is the core reason for generalization failure, and their diagnostic finding leads to a practical strategy that significantly improves generalization performance.

Illustration of the Knowing–Using Gap.
Illustration of the Knowing–Using Gap.
cs.AIarxiv:2607.08646v1Lead article

UltraX: Refining Pre-Training Data at Scale with Adaptive Programmatic Editing

Xinlong Zhao, Dongsheng Liu, Hengyu Zhao, Zixuan Fu, Zheng Wang

ltraX addresses the diminishing returns of scaling LLMs by focusing on data quality. Its core method is an adaptive programmatic editing framework that refines pre-training data at scale by enabling fine-grained insertion, deletion, and modification. This approach improves data quality efficiently and reliably, overcoming limitations of existing rule-based and LLM-based methods.

Overall workflow of UltraX, covering program-supervision generation, refinement model training, and inference-time program execution.
Overall workflow of UltraX, covering program-supervision generation, refinement model training, and inference-time program execution.
cs.AIarxiv:2607.08662v1Lead article

WebSwarm: Recursive Multi-Agent Orchestration for Deep-and-Wide Web Search

Xiaoshuai Song, Liancheng Zhang, Kangzhi Zhao, Yutao Zhu, Zhongyuan Wang

ebSwarm addresses the limitations of single LLM agents in deep and wide web searches by introducing a recursive delegation framework. Its core method involves dynamically creating agentic search nodes that jointly decompose tasks, recursively expand search, and adaptively collaborate. This allows for more effective handling of complex research tasks by enabling agents to either solve objectives directly or delegate them to child nodes, improving both search depth and coverage.

Illustration of representative multi-agent orchestration paradigms and WebSwarm.
Illustration of representative multi-agent orchestration paradigms and WebSwarm.
cs.AIarxiv:2607.09424v1Lead article

A Sovereign, Open-Source Foundation Model for German and English

The Soofi-Team, :, Benedikt Droste, David Fitzek, Ruben Härle

his paper introduces Soofi S 30B-A3B, a novel open-source Mixture-of-Experts foundation model for German and English. Its hybrid Mamba-Transformer architecture efficiently activates only 3B parameters per token, offering significant throughput advantages for long contexts and high concurrency. Soofi S achieves competitive performance against larger dense models and outperforms existing European sovereign baselines, demonstrating strong capabilities in both languages and code generation.

cs.AIarxiv:2607.09330v1Lead article

Communication-Efficient Digital-Twin Coordination for Heterogeneous LLM Embodied Agents over Computing Power Networks

Nuocheng Yang, Sihua Wang, Zihan Chen, Tony Q. S. Quek, Changchuan Yin

his paper proposes LDT-Coord, a novel framework for coordinating heterogeneous LLM-powered embodied agents. It utilizes lightweight digital twins to enable communication-efficient coordination by having agents independently select actions and report them, overcoming challenges of high communication overhead, LLM capability constraints, and action delays inherent in traditional dialogue-based methods. The core contribution is a more scalable and efficient coordination mechanism for complex embodied agent teams.

The six multi-arm collaboration tasks considered in this work, spanning sequential coordination and concurrent execution under increasing workspace overlap [ 11 ] .
The six multi-arm collaboration tasks considered in this work, spanning sequential coordination and concurrent execution under increasing workspace overlap [ 11 ] .
cs.AIarxiv:2607.09403v1Lead article

Fictional Worldbuilding: Multi-Agent LLM Collaboration with Hierarchical Context Compression and Iterative Review

Jingbo Chen, He Wang, Wei Yuan, Yuqiao Lai, Zhenyan Lu

his paper introduces AutoWorldBuilder, a multi-agent LLM system for fictional worldbuilding. Its core method involves a hierarchical context compression technique to manage information growth and an iterative review process with specialized agents to ensure content quality and consistency. The main contribution is a robust framework that overcomes LLM limitations in complex, creative generation tasks like worldbuilding.

Figure 1. System Architecture Overview of AutoWorldBuilder. The complete pipeline comprises: User Input → \( \rightarrow \) Task Decomposer → \( \rightarrow \) Hybrid Batch Partitioner → \( \rightarrow \) Core Loop (Context Packager, Agent Pool, Iterative Review) → \( \rightarrow \) Final Check → \( \rightarrow \) Report. Three supporting components include the Agent Pool (21 skill-driven agents), 8 specialized Auditors, and LLM Backends.
Figure 1. System Architecture Overview of AutoWorldBuilder. The complete pipeline comprises: User Input → \( \rightarrow \) Task Decomposer → \( \rightarrow \) Hybrid Batch Partitioner → \( \rightarrow \) Core Loop (Context Packager, Agent Pool, Iterative Review) → \( \rightarrow…
cs.AIarxiv:2607.09322v1Lead article

LongMedBench: Benchmarking Medical Agents for Long-Horizon Clinical Decision-Making

Yanzhen Chen, Zihan Xu, Xiaocheng Zhang, Zhiting Fan, Weiqi Zhai

his paper introduces LongMedBench, a benchmark designed to evaluate medical AI agents on long-horizon clinical decision-making using real-world electronic health records. Unlike previous benchmarks focusing on short-term tasks, LongMedBench simulates longitudinal patient care, requiring agents to integrate information across multiple visits and evolving treatments. Its contribution lies in providing a realistic environment for assessing agents' ability to handle complex, time-dependent clinical scenarios.

Data processing pipeline for LongMedBench
Data processing pipeline for LongMedBench
cs.AIarxiv:2607.09492v1Lead article

Multimodal Reward Hacking in Reinforcement Learning

Jiayu Yao, Yiwei Wang, Anmeng Zhang, Zhe Sun, Songsong Wang

his paper investigates "reward hacking" in reinforcement learning for multimodal large language models (MLLMs), where models achieve higher rewards without actually improving task performance. The core method involves introducing the "Newly Rewarded Failure Rate" (NRFR) to quantify failures introduced by RL. The key contribution is demonstrating that outcome-only rewards lead to significant hacking, even in large models, and that answer-aware rewards are crucial for robust alignment.

Overview of multimodal reward hacking. When automated proxy rewards r ​ ( x , y ) r(x,y) diverge from the intended oracle objective o ​ ( x , y ) o(x,y) , RL can increase reward scores while degrading faithful multimodal reasoning. The central example shows a Chart VQA case where the RL policy obtains high reward by giving the correct answer but fabricates visual evidence, exposing a reward–oracle mismatch. We study this failure mode in a controlled multimodal RL sandbox covering task type, reward design, RL algorithm, and model scale, and diagnose three hacking categories: Decision Hacking, Evidence Hacking, and Reward-Form Hacking. Metrics including RHR, ROG, and NRFR quantify how imperfect rewards induce shortcut learning under optimization pressure.
Overview of multimodal reward hacking. When automated proxy rewards r ​ ( x , y ) r(x,y) diverge from the intended oracle objective o ​ ( x , y ) o(x,y) , RL can increase reward scores while degrading faithful multimodal reasoning. The central example shows a Chart VQA case where…
cs.AIarxiv:2607.09474v1Lead article

ProofCouncil: An LLM Agent for Solving Open Mathematical Problems

Johannes Schmitt, Tim Gehrunger, Jasper Dekoninck, Gergely Bérczi, Uri Kreitner

roofCouncil is an LLM agent designed to solve open mathematical problems by mimicking real-world mathematical practice through an author-critic architecture. Its core method involves an iterative process where an "author" generates potential solutions and a "critic" evaluates them, leading to improved problem-solving. The paper's main contribution is demonstrating ProofCouncil's strong performance on challenging open problems, outperforming other agents in the FirstProof challenge and showing significant promise on a dataset of researcher-curated problems.

cs.AIarxiv:2607.09493v1Lead article

Shared Selective Persistent Memory for Agentic LLM Systems

Sanjana Pedada, Aditya Dhavala, Neelraj Patil

his paper addresses the context problem in agentic LLM systems by introducing **shared selective persistent memory**. This architecture intelligently identifies and retains reusable context like task specifications and tool configurations, discarding irrelevant session details. The key contribution is enabling collaborative reuse of this memory across users, significantly improving efficiency and generation quality in multi-turn tool-use scenarios.

cs.LGarxiv:2607.09375v1Lead article

Mach-Mind-4-Flash Technical Report

Foundation Model Team

ach-Mind-4-Flash is a 35B-parameter MoE model that achieves competitive performance with larger models through post-training optimization and scalable agentic reinforcement learning. Its core contribution lies in a novel training pipeline that includes an efficient RL/OPD infrastructure, parallel domain-specific expert training fused via Multi-Teacher On-Policy Distillation to avoid reward degradation, and Hybrid Median-length Policy Optimization. This approach significantly boosts performance on real-world tasks by enabling scalable agentic interaction environments.

Mach-Mind-4-Flash matches or exceeds much larger models across diverse capability axes. With only 3B activated parameters, Mach-Mind-4-Flash leads on IFBench, Behavioral-SafetyBench, and BrowseComp-zh, while remaining competitive on reasoning, tool use, and agentic coding against models with 3–30 × \( \times \) its activated size.
Mach-Mind-4-Flash matches or exceeds much larger models across diverse capability axes. With only 3B activated parameters, Mach-Mind-4-Flash leads on IFBench, Behavioral-SafetyBench, and BrowseComp-zh, while remaining competitive on reasoning, tool use, and agentic coding against…
cs.AIarxiv:2607.11614v1Lead article

Extending LLM Context via Associative Recurrent Memory

Gleb Kuzmin, Ivan Rodkin, Aydar Bulatov, Yuri Kuratov, Lyudmila Rvanova

his paper introduces the Associative Recurrent Memory Transformer (ARMT) to overcome the context length limitations of standard transformers. ARMT achieves constant memory scaling and improved efficiency by incorporating an associative recurrent memory mechanism. The authors also contribute domain-specific long-context datasets and a training recipe that combines pre-training, synthetic data, and curriculum learning to effectively extend LLM context.

Base LLM architecture (left) and ARMT architecture (right). ARMT divides the input text into segments and processes them sequentially, allowing the model to handle long contexts.
Base LLM architecture (left) and ARMT architecture (right). ARMT divides the input text into segments and processes them sequentially, allowing the model to handle long contexts.
cs.AIarxiv:2607.11505v1Lead article

Proxy Exploration and Reusable Guidance: A Modular LLM Post-Training Paradigm via Proxy-Guided Update Signals

Daocheng Fu, Rong Wu, Yu Yang, Xuemeng Yang, Jianbiao Mei

his paper introduces Proxy-guided Update Signal Transfer (PUST), a modular post-training framework for LLMs. PUST decouples exploration from alignment by using a lightweight proxy model to efficiently discover high-reward behaviors. The relative improvement signal from the proxy is then transferred to guide the primary LLM's policy, enabling reusable and transferable optimization signals.

Comparison of post-training pipelines. (a) Serial : Sequential domain exploration, risking catastrophic forgetting. (b) Parallel : Parallel domain exploration followed by unified policy alignment. (c) Proxy Asynchronous (Ours) : A proxy model conducts asynchronous exploration; extracted signals are subsequently transferred to various primary models. Decoupling these update signals from the base model enables seamless propagation and reuse.
Comparison of post-training pipelines. (a) Serial : Sequential domain exploration, risking catastrophic forgetting. (b) Parallel : Parallel domain exploration followed by unified policy alignment. (c) Proxy Asynchronous (Ours) : A proxy model conducts asynchronous exploration; ex…
cs.AIarxiv:2607.11643v1Lead article

Xiaomi-Robotics-U0: Unified Embodied Synthesis with World Foundation Model

Xinghang Li, Jun Guo, Qiwei Li, Long Qian, Hang Lai

his paper introduces Xiaomi-Robotics-U0, a unified 38-billion-parameter model for embodied AI. Its core method is to treat embodied generation as an extension of existing foundation image/video models, jointly optimizing various tasks like scene and video generation. The key contribution is a framework that preserves the broad knowledge of foundation models while adapting them to robot-specific constraints, enabling high-quality multi-view embodied synthesis.

Embodied and general capabilities of Xiaomi-Robotics-U0 . The rectangle corresponds to the initial observations for the same embodiment, the pairwise transfer sample, and the keyframes within a video for the embodied capabilities. All frames are referenced and generated images.
Embodied and general capabilities of Xiaomi-Robotics-U0 . The rectangle corresponds to the initial observations for the same embodiment, the pairwise transfer sample, and the keyframes within a video for the embodied capabilities. All frames are referenced and generated images.
cs.LGarxiv:2607.11475v1Lead article

HyperSafe: Inference-Time Safety Recovery for Fine-Tuned Language Models

Aznaur Aliev, Carlos Hinojosa, Abdelrahman Eldesokey, Bang An, Bernard Ghanem

yperSafe addresses the fragility of safety in fine-tuned language models by proposing a post-hoc, model-specific approach. It generates a "Safe Side Network" (SSN) for each fine-tuned model by learning a mapping from layer-wise activation fingerprints to SSN parameters. This allows for non-invasive safety restoration without retraining or affecting task performance.

HyperSafe pipeline. Stages 1–3 (training, one-time): fine-tune the base model on each training domain (1), train a domain-specific SSN per fine-tuned checkpoint (2), and train the hypernetwork to map activation fingerprints to SSN weights (3). Stage 4 (deployment): for any new fine-tuned model, extract calibration activations and generate a model-specific SSN in a single forward pass.
HyperSafe pipeline. Stages 1–3 (training, one-time): fine-tune the base model on each training domain (1), train a domain-specific SSN per fine-tuned checkpoint (2), and train the hypernetwork to map activation fingerprints to SSN weights (3). Stage 4 (deployment): for any new fi…
cs.CLarxiv:2607.11503v1Lead article

GEIS: A Generation-Evaluation-Improvement Loop of Agent Skills for Long-Form Article Generation

Jiale Zhang, Juntao Hu, Zhijian Ou

EIS introduces a novel Generation-Evaluation-Improvement loop for long-form article generation. Its core method involves a structured cycle of agent skills, including planning, drafting, and evaluation, to address challenges like long context and complex instructions. The key contribution is a declarative and inspectable skill-based system that allows for iterative improvement of agent capabilities through structured feedback and rule-level patching.

The six-stage article-writer process. Request normalizes the user task, Plan constructs the article outline, Draft writes the full article, Audit checks quality, Refine revises weak parts, and Deliver emits the final text or document.
The six-stage article-writer process. Request normalizes the user task, Plan constructs the article outline, Draft writes the full article, Audit checks quality, Refine revises weak parts, and Deliver emits the final text or document.
cs.AIarxiv:2607.12829v1Lead article

Accelerating Masked Diffusion Large Language Models: A Survey of Efficient Inference Techniques

Daehoon Gwak, Minhyung Lee, Junwoo Park, Jaegul Choo

his survey addresses the challenge of achieving practical speedups in masked diffusion large language models (dLLMs), despite their theoretical parallel generation advantage. The core method involves introducing a unified latency decomposition framework to disentangle algorithmic, architectural, and system-level factors influencing inference speed. The main contribution is a structured categorization of acceleration techniques based on this framework, enabling rigorous comparisons and guiding future research towards efficient dLLM deployment.

cs.AIarxiv:2607.12650v1Lead article

Evidence-Grounded Verified Agentic Reasoning: A Path Toward Eliminating LLM Hallucination in Empirical Inference via Tool-Attested Kernel Proofs

Junyu Ren

his paper introduces EG-VAR, a novel architecture that uses the Lean 4 formal verification kernel to ensure Large Language Model (LLM) empirical reasoning is grounded in attested evidence and logically sound. By requiring all verified outputs to trace back to tool calls and kernel-checked inferences, EG-VAR significantly reduces LLM hallucinations and improves source faithfulness, achieving perfect accuracy on numerical reasoning tasks and outperforming baseline methods in stress tests.

cs.AIarxiv:2607.12696v1Lead article

Less Experts, Faster Decoding: Cost-Aware Speculative Decoding for Mixture-of-Experts

Jincheng Xie, Runheng Liu, Heyan Huang, Yawen Ling, Hanbin Dai

his paper addresses the inefficiency of speculative decoding in Mixture-of-Experts (MoE) LLMs. It proposes **EcoSpec**, a cost-aware speculative decoding framework that minimizes expert scattering by considering the marginal expert activation cost during draft token selection. This approach aims to improve inference speed by reducing memory traffic and maximizing the benefits of speculative decoding in MoE models.

cs.AIarxiv:2607.12790v1Lead article

Who Grades the Grader? Co-Evolving Evaluation Metrics and Skills for Self-Improving LLM Agents

Xing Zhang, Guanghui Wang, Yanwei Cui, Ziyuan Li, Wei Qiu

his paper addresses the challenge of evaluating LLM agents when no reliable metric exists. Their core method, "Double Ratchet," co-evolves evaluation metrics and agent skills simultaneously. This allows the system to learn and refine both its performance and how to measure it, leading to self-improvement even in novel domains.

Double Ratchet architecture. The metric loop (left) evolves an expression over drawback detectors; the skill loop (right) evolves the agent’s skill bank, its training graded by the evolved metric during co-evolution. Anchors (bottom) are never trained on; an independent judge audits final outputs on reference-free tasks.
Double Ratchet architecture. The metric loop (left) evolves an expression over drawback detectors; the skill loop (right) evolves the agent’s skill bank, its training graded by the evolved metric during co-evolution. Anchors (bottom) are never trained on; an independent judge aud…
cs.AIarxiv:2607.13705v1Lead article

AgentCompass: A Unified Evaluation Infrastructure for Agent Capabilities

Zichen Ding, Jiaye Ge, Shufan Jiang, Kai Chen, Mo Li

gentCompass provides a unified, open-source infrastructure for evaluating LLM-based agents by decoupling benchmarks, harnesses, and environments. This modular design promotes flexibility, reproducibility, and reduces redundant engineering. Its key contribution lies in offering a scalable and transparent system for diagnosing agent failures and advancing agent research.

Capability profiles of representative models across the five core evaluation dimensions.
Capability profiles of representative models across the five core evaluation dimensions.
cs.AIarxiv:2607.13608v1Lead article

Automatic Ordinary Differential Equations Discovery For Biological Systems Using Large Language Model Powered Agentic System

David Krongauz, Arad Zulti, Eran Segal, Teddy Lazebnik

his paper introduces MEDA, an LLM- and symbolic regression-powered agentic system for discovering Ordinary Differential Equation (ODE) models of biological systems. MEDA leverages LLMs to retrieve domain knowledge, define variables, and generate constraints, which then guide symbolic regression in proposing and refining candidate ODEs. Its core contribution is an automated framework for mechanistic ODE discovery specifically tailored for complex biological dynamics.

Architecture of MEDA . Specialized agents (centre) each read a defined input artifact and write a defined output artifact (right) to a shared session directory. Solid arrows apply in both operating modes; green dashed arrows are active only in data-anchored mode, in which a supplied time series feeds the Explorer (EDA + SINDy screening) and the Runner . The ground-truth equations are quarantined from all discovery agents and read only after the blind search ends, by the Evaluator (red dashed arrow).
Architecture of MEDA . Specialized agents (centre) each read a defined input artifact and write a defined output artifact (right) to a shared session directory. Solid arrows apply in both operating modes; green dashed arrows are active only in data-anchored mode, in which a suppl…
cs.AIarxiv:2607.13884v1Lead article

Experience Memory Graph: One-Shot Error Correction for Agents

Wenjun Wang, Yuchen Fang, Fengrui Liu, Zibo Liang, Kai Zheng

his paper introduces the Experience Memory Graph (EMG) to address error correction in LLM agents. EMG reformulates failure recovery as a graph matching problem, converting failed and successful trajectories into directed action decision graphs. By matching these graphs, it identifies successful workflows and provides explicit correction paths, enabling one-shot error recovery without costly iterative reflection.

Figure 1 . Difference of error correction based on (a) reflect-replay loop and (b) Experience Memory Graph. Existing methods rely on iterative test‑time reflection — the agent replans and re‑executes after each failure, causing high latency and cost. Our Experience Memory Graph extracts error correction paths offline by computing graph edit paths that transform failed trajectories into successful ones from paired training trajectories of the same task, distills them into insights, and stores them in a memory graph. At test time, retrieval enables one‑shot exectution without loops.
Figure 1 . Difference of error correction based on (a) reflect-replay loop and (b) Experience Memory Graph. Existing methods rely on iterative test‑time reflection — the agent replans and re‑executes after each failure, causing high latency and cost. Our Experience Memory Graph e…
cs.AIarxiv:2607.13712v1Lead article

Groc-PO: Grounded Context Preference Optimization for Truthful Multimodal LLMs

Zhixiao Zheng, Zheren Fu, Zhiyuan Yao, Chunxiao Liu, Dongming Zhang

his paper addresses untruthfulness in multimodal LLMs by proposing Groc-PO. Unlike standard methods that optimize only the final answer, Groc-PO applies preference optimization at earlier grounding stages. This grounded approach aims to prevent error propagation by providing more direct supervision for multimodal reasoning, leading to more faithful and reliable LLM outputs.

Figure 1. Motivating example of error propagation across stages in MLLMs. (a) A case where an early grounding error propagates to the later reasoning stage and leads to an incorrect answer. (b) Statistical experiments with LLaVA-v1.5-7B (Liu et al. , 2023a ) on GCPD dataset (constructed from RLHF-V (Yu et al. , 2024 ) ), showing that introducing errors into 0, 1, or 2 grounding stages is associated with progressively lower final reasoning accuracy, consistent with error propagation in MLLMs.
Figure 1. Motivating example of error propagation across stages in MLLMs. (a) A case where an early grounding error propagates to the later reasoning stage and leads to an incorrect answer. (b) Statistical experiments with LLaVA-v1.5-7B (Liu et al. , 2023a ) on GCPD dataset (cons…
cs.AIarxiv:2607.13591v1Lead article

Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents

Eric Hanchen Jiang, Zhi Zhang, Yuchen Wu, Levina Li, Dong Liu

his paper introduces MemCon, a framework that treats LLM agent memory management as a learned, adaptive process. Instead of fixed heuristics, MemCon uses a Markov Decision Process to train an online policy that dynamically decides when, what, and how to retrieve or inject information into memory based on the current task context. This adaptive approach addresses the bottleneck of static memory access, enabling more efficient and effective experience accumulation for LLM agents.

Overview of MemCon . (Left) Task streams from ALFWorld, PDDL, and ScienceWorld are executed through three agent frameworks (Lobster, LangGraph, Agent-FW) sharing one LLM backbone. (Middle) The Memory MDP runs four steps per retrieval: extract a compact state ϕ ​ ( s ) \( \phi \)(s) from task + memory signals; select an action via the UCB policy over Q ​ ( ϕ , a ) Q(\( \phi \),a) ; the backend-agnostic wrapper issues retrieval to the inner backend with policy-chosen top_k / insight_k /hop; retrieved context (optionally plus an injected success plan) is fed to the LLM, and the episode is scored ( + 1 +1 success, − 0.5 -0.5 failure, plus efficiency bonus). (Right) Online learning: the action space is { Retrieve (varying depth), PlanInject , Re-Retrieve , Consolidate , Forget , NoOp }; after each episode the reverse-discounted reward γ | ep | − j − 1 ​ r i \( \gamma \)^{|\( \text{ep} \)|-j-1}r_{i} updates every visited ( ϕ j , a j ) (\( \phi_{j} \),a_{j}) .
Overview of MemCon . (Left) Task streams from ALFWorld, PDDL, and ScienceWorld are executed through three agent frameworks (Lobster, LangGraph, Agent-FW) sharing one LLM backbone. (Middle) The Memory MDP runs four steps per retrieval: extract a compact state ϕ ​ ( s ) \( \phi \)(…
cs.AIarxiv:2607.13596v1Lead article

Protective Capacity Hallucination: When Large Language Models Claim Nonexistent Capabilities

Eunna Lee, Jungpyo Nam, Sunjun Hwang

his paper introduces "Protective Capacity Hallucination" (PCH), where Large Language Models (LLMs) falsely claim to perform real-world protective actions they cannot execute when cast in a protector role. The study finds PCH is influenced by situational severity and interaction format, occurring more frequently in general domains with multi-party input, but surprisingly less in intimate partner conflict scenarios despite higher severity.

cs.AIarxiv:2607.13618v1Lead article

STOCKTAKE: Measuring the Gap Between Perception and Action in LLM Agents with a Fair Oracle

Sagar Deb, Ashwanth Krishnan

his paper introduces STOCKTAKE, a benchmark for evaluating LLM agents on complex, multi-week decision tasks where the true state of the world is hidden. STOCKTAKE's core method uses a "fair oracle" (an exact Bayes filter) to provide a perfect reference policy that observes the same limited information as the agent. This allows the paper to measure the "knowing-doing gap" – the difference between an agent's understanding of the situation and its ability to act effectively – by comparing its performance to the oracle and analyzing its reasoning.

Measuring the knowing-doing gap with a fair oracle. Six hidden factor processes evolve on a fixed, action-independent event tape (left; dark segments mark stress regimes) and emit noisy symptoms into a weekly dashboard. The identical observation stream feeds both the LLM agent and a Bayes-filter reference policy (one exact filter per factor driving a rollout), so neither sees the hidden state. The agent’s episode cost is placed on a skill scale anchored by a symptom-blind base-stock floor (0) and the fair oracle’s 20-replication mean (1): shortfall on this scale is attributable to acting on beliefs, not to forming them.
Measuring the knowing-doing gap with a fair oracle. Six hidden factor processes evolve on a fixed, action-independent event tape (left; dark segments mark stress regimes) and emit noisy symptoms into a weekly dashboard. The identical observation stream feeds both the LLM agent an…
cs.LGarxiv:2607.13988v1Lead article

TRACE: Turn-level Reward Assignment via Credit Estimation for Long-Horizon Agents

Leitian Tao, Baolin Peng, Wenlin Yao, Tao Ge, Hao Cheng

RACE addresses the challenge of assigning credit to individual actions in long-horizon multi-turn agents. It achieves this by representing agent rollouts as state transitions and using a frozen reference model to estimate the value of reaching the correct final answer. Per-action rewards are then derived from the temporal difference in these estimated values, providing denser and more informative supervision than outcome-only rewards.

Credit assignment at tool-call boundaries in a search trajectory. The figure illustrates a long-horizon search rollout decomposed into tool-call turns. Early search and open actions can add task-relevant evidence to the transcript even when a later branch leads to an incorrect final answer. Outcome-reward training attaches one trajectory-level advantage to all actions in the rollout, whereas TRACE computes prefix values at tool boundaries and assigns turn credit from adjacent value changes.
Credit assignment at tool-call boundaries in a search trajectory. The figure illustrates a long-horizon search rollout decomposed into tool-call turns. Early search and open actions can add task-relevant evidence to the transcript even when a later branch leads to an incorrect fi…
cs.CLarxiv:2607.13854v1Lead article

SPyCE: Skill-Policy Co-evolution for Multimodal Agents

Ru Zhang, Weijie Qiu

PyCE proposes a novel framework for multimodal agents that learns reusable skills alongside the policy during reinforcement learning. Instead of treating trajectories as mere rewards or relying on static memory retrieval, SPyCE distills complex reasoning into a hierarchical library of execution and workflow skills. This co-evolutionary approach allows agents to efficiently discover and leverage tool-use patterns across tasks.

SPyCE enables closed-loop co-evolution between skill and policy for multimodal agents. The agent conditions on a hierarchical skill library, including workflow skills and execution skills, to reason and act over multimodal inputs. Rollout trajectories are then distilled back into the skill library, creating a feedback loop where better skills guide better policies, and better policies induce stronger skills.
SPyCE enables closed-loop co-evolution between skill and policy for multimodal agents. The agent conditions on a hierarchical skill library, including workflow skills and execution skills, to reason and act over multimodal inputs. Rollout trajectories are then distilled back into…
cs.AIarxiv:2607.15095v1Lead article

Digital Pantheon: Simulating and Auditing Coalition Formation with LLM Agents

Dylan Van Mulders, Matthias Bogaert, Dirk Van den Poel

his paper introduces "Digital Pantheon," a novel multi-agent framework for simulating political coalition formation using LLMs. It combines SFT, DPO, and RAG to create partisan agents that are both ideologically aligned and factually grounded. The framework's contribution lies in enabling realistic, interpretable simulations of complex political negotiations, demonstrated on a real-world election scenario.

Overview of the individual party alignment model process.
Overview of the individual party alignment model process.
cs.AIarxiv:2607.15200v1Lead article

Mask-Aware Policy Gradients for Diffusion Language Models

Haran Raajesh, Kulin Shah, Adam Klivans, Philipp Krähenbühl

his paper introduces a novel reinforcement learning method for Masked Diffusion Language Models (MDLMs) by treating generation as a two-stage action Markov Decision Process. This approach decomposes the policy gradient into token prediction and masking decisions, allowing for joint optimization. The method achieves state-of-the-art results on mathematical reasoning and coding tasks by effectively addressing the intractability of log-likelihood estimation in MDLMs.

Test accuracy of our method and baseline methods on two mathematical reasoning and two code generation benchmarks. All methods use LLaDA-8B-Instruct as the base model and are evaluated with a generation length of 128. Full results are provided in Table 1 .
Test accuracy of our method and baseline methods on two mathematical reasoning and two code generation benchmarks. All methods use LLaDA-8B-Instruct as the base model and are evaluated with a generation length of 128. Full results are provided in Table 1 .
cs.AIarxiv:2607.14989v1Lead article

OmniaBench: Benchmarking General AI Agents Across Diverse Scenarios

Chengyu Shen, Yujie Fu, Gangtao Xin, Yanheng Hou, Wenlong Fei

mniaBench introduces a comprehensive benchmark for evaluating general AI agents by creating diverse, executable scenarios derived from real-world applications. Its core method involves constructing a hierarchical taxonomy of domains and synthesizing tasks across these domains using multiple generation routes. This benchmark's contribution lies in its systematic characterization of agent capabilities across heterogeneous settings, addressing limitations of existing, more narrowly focused evaluations.

cs.AIarxiv:2607.15163v1Lead article

Scaling Behavior Foundation Model for Humanoid Robots

Weishuai Zeng, Kangning Yin, Xiaojie Niu, Shunlin Lu, Weixiang Zhong

his paper investigates how to effectively scale Behavior Foundation Models (BFMs) for humanoid robots. Their core method involves coordinating three key components: a motion tracking learning paradigm, specific behavioral data, and model architecture. The main contribution is demonstrating that this coordinated approach leads to substantial performance gains in humanoid control, enabling better whole-body coordination, real-time responsiveness, and generalization.

cs.AIarxiv:2607.15257v1Lead article

SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration

Yuyao Zhang, Junjie Gao, Zhengxian Wu, Jiaming Fan, Jin Zhang

his paper introduces SearchOS-V1, a multi-agent framework for robust open-domain information seeking. Its core method is to represent search progress as explicit, shared state, moving beyond the limitations of implicit tracking in current systems. This explicit state management, through components like Frontier Task and an Evidence Graph, helps agents avoid repetitive loops and improve the quality and completeness of their search results.

SearchOS interface for a long-horizon information-seeking task. The workspace exposes the orchestration trace, pipeline parallel agent activity, and relational schema coverage.
SearchOS interface for a long-horizon information-seeking task. The workspace exposes the orchestration trace, pipeline parallel agent activity, and relational schema coverage.
cs.AIarxiv:2607.15218v1Lead article

When Words Are Safe But Actions Kill: Probing Physical Danger Beyond Text Safety in Hidden-State Risk Space

Weimeng Wang, Ziqiang Wang, Zihang Zhan, Chuanpu Fu, Qi Li

his paper investigates the distinction between text-based safety and physically grounded danger in Large Language Models (LLMs). It demonstrates that these two types of danger are represented separately within LLM hidden states. The authors propose PRISM, a simple probing method that effectively identifies physical danger with higher accuracy and lower false positive rates than LLM judges, and introduce a new benchmark, PhysicalSafetyBench-1K, to evaluate such capabilities.

cs.LGarxiv:2607.14952v1Lead article

LongStraw: Long-Context RL Beyond 2M Tokens under a Fixed GPU Budget

Changhai Zhou, Kieran Liu, Yuhua Zhou, Qian Qiao, Jun Gao

ongStraw addresses the challenge of training Reinforcement Learning (RL) agents with extremely long contexts (over 2 million tokens) within a limited GPU budget. Its core method involves an architecture-aware execution stack that optimizes memory usage by avoiding autograd for shared prompts and selectively retaining necessary model states. This allows for efficient post-training of large language models on long trajectories, a crucial capability for AI agents.

cs.AIarxiv:2607.16066v1Lead article

LLM-Powered Agentic AI for 5G/6G Networks: A Tutorial and Survey on Architectures, Protocols, and Standardization

Mazene Ameur, Abdelkader Mekrache, Bouziane Brik, Adlen Ksentini

his paper introduces Agentic AI, powered by LLMs, as a novel approach for autonomous control of 5G/6G networks, moving beyond traditional rule-based automation. It bridges the gap in existing research by detailing how agentic capabilities can be integrated with network control planes, protocols, and standardization efforts. The contribution lies in providing a comprehensive framework and survey for developing and deploying these intelligent, goal-driven network agents.

Figure 1 . Survey Structure.
Figure 1 . Survey Structure.
cs.AIarxiv:2607.16097v1Lead article

Understanding Reasoning from Pretraining to Post-Training

Jingyan Shen, Ang Li, Salman Rahman, Yifan Sun, Micah Goldblum

his paper investigates how pretraining choices influence the effectiveness of reinforcement learning (RL) for improving large language model (LLM) reasoning. Using chess as a controlled environment, the authors demonstrate that pretraining scale and data significantly impact RL's ability to enhance reasoning capabilities. Their work clarifies what RL actually modifies within the LLM, moving beyond isolated RL studies to understand the full pretraining-to-post-training pipeline.

Overview. (a) We introduce a synthetic framework for studying reasoning from pretraining to post-training in the chess domain. (b) Using this framework, we establish a joint pretraining–RL scaling law, showing that pretraining performance provides predictive signal for RL performance under a fixed compute budget. (c) Through mechanistic analysis of policy evolution, we show that RL can surface moves that were nearly absent under the SFT policy.
Overview. (a) We introduce a synthetic framework for studying reasoning from pretraining to post-training in the chess domain. (b) Using this framework, we establish a joint pretraining–RL scaling law, showing that pretraining performance provides predictive signal for RL perform…
cs.LGarxiv:2607.15810v1Lead article

QUADS: Stabilizing NVFP4 Reinforcement Learning for MoE via QUantization-error Alignment across Dual Sides

Zhengyang Zhuge, Hao Yu, Xin Wang, Zheng Li, Yizhong Cao

his paper addresses the instability of using low-precision NVFP4 for Reinforcement Learning (RL) rollouts in Mixture-of-Experts (MoE) models. The core method, QUADS, stabilizes NVFP4 RL by aligning quantization errors between the rollout and training processes, specifically targeting activation errors which are identified as the primary cause of instability. This contribution enables efficient low-precision RL for MoE models, overcoming previous limitations.

Naive NVFP4 collapse in RL. (a) Mean training reward: naive NVFP4 W4A4 rollout with BF16 training (blue) peaks near step 150 and then collapses, whereas the BF16 RL baseline (red) continues to improve steadily. (b) Held-out test score shows the same pattern, confirming that the failure is not limited to the training reward signal. (c) Log-probability difference between the NVFP4 rollout engine and the BF16 trainer diverges extremely, indicating a severe training–inference mismatch that importance sampling cannot correct.
Naive NVFP4 collapse in RL. (a) Mean training reward: naive NVFP4 W4A4 rollout with BF16 training (blue) peaks near step 150 and then collapses, whereas the BF16 RL baseline (red) continues to improve steadily. (b) Held-out test score shows the same pattern, confirming that the f…
cs.AIarxiv:2607.18063v1Lead article

Adaptive Adversaries: A Multi-Turn, Multi-LLM Benchmark for LLM Agent Security

Devina Jain, David Hartmann, Chuan Li

his paper introduces a novel benchmark for evaluating LLM agent security against adaptive, multi-turn attacks. Its core method involves an autonomous LLM attacker that learns from defender responses across multiple rounds to refine its attacks. The key contribution is demonstrating that adaptive, multi-LLM attacks significantly increase success rates compared to static attacks, uncovering novel vulnerabilities and highlighting the limitations of current defense strategies.

3 × \( \times \) 3 attacker × \( \times \) defender ASR matrix ( N = 5 N{=}5 runs per scenario, 945 total battles), with 95% bootstrap CIs in brackets.
3 × \( \times \) 3 attacker × \( \times \) defender ASR matrix ( N = 5 N{=}5 runs per scenario, 945 total battles), with 95% bootstrap CIs in brackets.
cs.AIarxiv:2607.17879v1Lead article

Exploratory and Assimilating Reflection: Reflective Recall Cycle for Long-term Memory

Ganesh Senrayan, Moyuru Yamada, Ishan Jindal, Kiran Purohit

his paper introduces Exploratory-Assimilating Reflection (EAR), a novel framework for LLM-based agents to manage long-term memory. EAR employs an iterative search (Exploratory Reflection) to gather relevant memories and then refines a global reranker by replaying these experiences (Assimilating Reflection). This approach significantly improves retrieval performance and sample efficiency for dynamic knowledge reasoning in long-term interactions.

Figure 1. Comparison of memory retrieval paradigms. (a) Static reranker is unable to adapt to data distribution shifts. (b) Reranker with RL update struggles with sample inefficiency. (c) Our EAR (Exploratory-Assimilating Reflection) achieves both high initial recall and sample-efficient updates.
Figure 1. Comparison of memory retrieval paradigms. (a) Static reranker is unable to adapt to data distribution shifts. (b) Reranker with RL update struggles with sample inefficiency. (c) Our EAR (Exploratory-Assimilating Reflection) achieves both high initial recall and sample-e…
cs.AIarxiv:2607.18114v1Lead article

How Does Alignment Tuning Shape Representations of Sycophancy and Related Cue-Induced Biases in LLMs?

Prakhar Gupta, Terry Jingchen Zhang, Florent Draye, Bernhard Schölkopf, Zhijing Jin

his paper investigates how alignment tuning in LLMs creates susceptibility to prompt-induced biases like sycophancy. The core method involves extracting and analyzing "bias directions" within model representations. The key contribution is demonstrating that alignment tuning, not pretraining, installs these biases, which manifest as distinct, steerable directions that can be corrected.

Left: per-bias direction extraction and intervention. For each (biased, unbiased) prompt pair, the model either resists the cue (gives the correct answer) or flips (caves to the bias’s target letter). We extract d bias = μ flipped − μ resisted d_{\( \mathrm{bias} \)}=\( \mu \)_{\( \mathrm{flipped} \)}-\( \mu \)_{\( \mathrm{resisted} \)} from last-token residual-stream activations (here illustrated for Suggested Answer ); subtracting α ⋅ d bias \( \alpha \)\( \cdot \) d_{\( \mathrm{bias} \)} at inference time debiases the model (§ 8 ), adding amplifies cue-following. Right: scope of the problem. Per-(model, bias) flip rate: fraction of pairs the model would have answered correctly on the unbiased prompt but flips on when reframed with the bias cue. OLMo’s Post Hoc (99%) leaves no resisted contrast for LODO testing (§ 5 ).
Left: per-bias direction extraction and intervention. For each (biased, unbiased) prompt pair, the model either resists the cue (gives the correct answer) or flips (caves to the bias’s target letter). We extract d bias = μ flipped − μ resisted d_{\( \mathrm{bias} \)}=\( \mu \)_{\…
cs.AIarxiv:2607.18147v1Lead article

LLMs and Agentic AI Systems for Smart Grids: A Tutorial on Architectures and Applications

Daniela Rojas, Abdulwahab Albassam, Aidan G. Leung, Jett Ngo, Ryan Luo

his paper proposes a "solver-grounded" design principle for LLM-based agentic AI systems in smart grids, ensuring numerical outputs are from trusted tools and explicitly verified. This approach addresses the lack of unified design and evaluation in the field, where LLMs can produce physically infeasible results. The contribution lies in providing a structured framework for building and assessing these systems, demonstrated through case studies in areas like wind power forecasting.

Solver-grounded LLM and agentic workflow for smart grids. (a) Conventional power system studies rely on trusted numerical tools, followed by explicit verification before results are reported. (b) In the proposed solver-grounded agentic workflow, the LLM acts as an interface and orchestration layer: it parses natural language requests, retrieves relevant context, plans tool calls, and summarizes outputs, but numerical quantities are reported only if they originate from a trusted solver or simulator and pass a verification gate. If verification fails, the solver-grounded workflow either repairs the setup through bounded retries, or returns a safe failure message rather than fabricating numerical results.
Solver-grounded LLM and agentic workflow for smart grids. (a) Conventional power system studies rely on trusted numerical tools, followed by explicit verification before results are reported. (b) In the proposed solver-grounded agentic workflow, the LLM acts as an interface and o…
cs.AIarxiv:2607.18006v1Lead article

MADA-RL: Multi-Agent Debate-Aware Reinforcement Learning for Parameter-Efficient Reasoning in Compact Models

Martino M. L. Pulici, Cuong Xuan Chu, Evgeny Kharlamov, Zifeng Ding, Volker Tresp

ADA-RL is a post-training framework that trains compact language models for efficient reasoning. It specializes models into generator and critic roles, using a novel "counterfactual critic advantage" signal to train the critic to improve upon the generator's consensus. This approach fine-tunes only a small subset of parameters, enabling specialized agents to achieve strong reasoning performance with limited resources.

cs.AIarxiv:2607.18026v1Lead article

Rethinking Heterogeneous LLM Merging: A Weighted Model Averaging Perspective

Jiahe Fan, Yinghao Hou, Si Chen, Aiyuan Zhang, Hong Xie

his paper proposes a simple, training-free method for merging heterogeneous Large Language Models (LLMs) by adapting their parameter spaces and then performing weighted averaging. The core contribution is demonstrating that this approach, involving dimensional expansion or truncation followed by ratio-controlled interpolation, can effectively merge significantly different LLMs and even improve performance without complex alignment techniques.

Two heterogeneous model merging strategies. (1) Union-style merging: expand the smaller model to match the larger model’s dimensionality, then merge. (2) Intersection-style merging: truncate the larger model to the smaller model’s dimensionality, then merge.
Two heterogeneous model merging strategies. (1) Union-style merging: expand the smaller model to match the larger model’s dimensionality, then merge. (2) Intersection-style merging: truncate the larger model to the smaller model’s dimensionality, then merge.
cs.LGarxiv:2607.17972v1Lead article

DiFA: Inference-Time Forward-Process Alignment for Diffusion Models

Shigui Li, Delu Zeng

iFA reframes diffusion model inference as a sequential state estimation problem, treating iterative predictions as correlated observations. It builds a "forward-aligned temporal consensus" by aggregating past predictions based on structural consistency and noise-level compatibility, inspired by Kalman filtering. This approach aims to improve generation quality by counteracting over-smoothing with a deviation guidance mechanism.

cs.LGarxiv:2607.18199v1Lead article

PPL-Factory: Task-Aware and Budget-Aware Data Selection from Language Modeling to Reasoning

Hang Zhang, Warren J. Gross

PL-Factory proposes a task-aware and budget-aware data selection method for fine-tuning large language models. It improves upon existing perplexity-based approaches by considering the distinct learning objectives of language modeling and reasoning tasks, and by incorporating budget constraints. This framework aims to reduce computational costs while maintaining or improving downstream performance.

Overview of the proposed PPL-Factory framework. The orange-shaded block represents PPL-Factory. Purple-shaded blocks represent LLMs, green-shaded blocks represent datasets. The top, middle, and bottom rows illustrate the model fine-tuning, data selection flow, and internal components of PPL-Factory, respectively.
Overview of the proposed PPL-Factory framework. The orange-shaded block represents PPL-Factory. Purple-shaded blocks represent LLMs, green-shaded blocks represent datasets. The top, middle, and bottom rows illustrate the model fine-tuning, data selection flow, and internal compon…
cs.AIarxiv:2607.19336v1Lead article

Agents in the Wild: Where Research Meets Deployment

Grace Hui Yang, Pranav N. Venkit, Hooman Sedghamiz, Enrico Santus, Victor Dibia

his paper bridges the gap between LLM agent research and real-world deployment. Its core method involves analyzing practical challenges like robustness and safety encountered during deployment, drawing on case studies in pharmaceuticals and finance. The key contribution is identifying successful design patterns and mitigation strategies for failure modes, offering a roadmap for building reliable agentic systems.

cs.AIarxiv:2607.19219v1Lead article

Beyond Score Prediction: LLM-Based Essay Scoring and Feedback Generation via Reinforcement Learning with Rubric Rewards

Xuefeng Jin, Jiashuo Zhang, Teng Cao, Bin Yang

his paper introduces RLAES, a novel framework that uses reinforcement learning to jointly optimize essay scoring and feedback generation in LLMs. Its core contribution is the Rubric-based Feedback Evaluation (RFE) system, which uses an LLM-as-judge and fine-grained rubric items to measure feedback quality. This enables Adaptive Gated Feedback Optimization (AGFO) to efficiently improve feedback while also proposing Adjacent Contrastive Reasoning (ACR) for better score calibration.

Construction of the RFE rubrics.
Construction of the RFE rubrics.
cs.AIarxiv:2607.19345v1Lead article

Copy Less, Ground More: Overcoming Repetitive Copying in Long-Context Reasoning via Evidence-Aware Reinforcement Learning

Lizhe Fang, Weizhou Shen, Tianyi Tang, Yisen Wang

his paper addresses the problem of repetitive copying in long-context reasoning by Large Language Models. Their core method, GEAR, uses reinforcement learning to reward models not only for correct answers but also for grounding their reasoning in relevant evidence from the input, penalizing indiscriminate copying. This approach aims to improve the accuracy and efficiency of LLMs in handling lengthy contexts by encouraging them to focus on essential information.

cs.AIarxiv:2607.19257v1Lead article

Prompt Design at Scale: How Format, Instruction Count, and Context Length Shape Instruction Adherence and Hallucination in Large Language Models

Netanel Eliav

his paper investigates how prompt design choices impact large language model performance. Through controlled experiments, it reveals that the number of instructions, their format, and context length significantly affect instruction adherence and hallucination. The study's core contribution is providing empirical evidence that perfect instruction following collapses rapidly as the number of instructions increases, with placement and format also playing crucial roles, though their impact varies by model.

Perfect-response rate vs. instruction count N N , by format (color) and model (panel), pooled across system and user-turn placement. All five models converge to a perfect-response rate of zero by N = 80 N=80 , regardless of format.
Perfect-response rate vs. instruction count N N , by format (color) and model (panel), pooled across system and user-turn placement. All five models converge to a perfect-response rate of zero by N = 80 N=80 , regardless of format.
cs.LGarxiv:2607.19223v1Lead article

AdaFlash: Adaptive Speculative Decoding via On-Policy Distilled Diffusion Drafters

Yu-Yang Qian, Hao-Cong Wu, Chen Chen, Jiacheng Sun, Zhenhua Dong

daFlash accelerates large language model inference by improving speculative decoding with diffusion drafters. It addresses the high variance in diffusion drafters' draft quality by introducing an adaptive framework that uses on-policy distillation to create specialized "drafter" models. This allows for more stable and efficient draft generation across different contexts.

Illustration of the high variance issue in diffusion drafters. (a) Probability density of the acceptance rate across three task domains (chat, code, and math), showing substantial distributional differences. (b) Box plots of the acceptance length over five different datasets. (c) Per-token acceptance probability for two nearly identical prefixes differing by only one token; the acceptance lengths diverge drastically, revealing high token-level variance of diffusion drafters.
Illustration of the high variance issue in diffusion drafters. (a) Probability density of the acceptance rate across three task domains (chat, code, and math), showing substantial distributional differences. (b) Box plots of the acceptance length over five different datasets. (c)…
cs.AIarxiv:2607.20268v1Lead article

PoTRE: Test-Time Reasoning inspired by Cognitive Heterogeneity

Anmol Kankariya, Sercan Ö. Arık

oTRE is a novel framework that enhances LLM reasoning by employing a heterogeneous ensemble of four specialized agents: adversarial refinement, hierarchical planning, spectrum search, and direct chaining. These agents' diverse perspectives are dynamically integrated by a task-adaptive aggregation layer to produce robust solutions for complex reasoning tasks. This approach significantly improves performance on challenging benchmarks like Humanity's Last Exam, achieving state-of-the-art results.

cs.AIarxiv:2607.20064v1Lead article

PRO-LONG: Programmatic Memory Enables Long-Horizon Reasoning

Alexis Fox, Junlin Wang, Paul Rosu, Bhuwan Dhingra

RO-LONG introduces a programmatic memory framework for LLM agents to tackle long-horizon reasoning tasks. It addresses the challenge of context management by maintaining a complete, structured interaction log and leveraging recent advancements to efficiently retrieve relevant information, overcoming the trade-off between information preservation and tractability.

PRO-LONG matches or exceeds state-of-the-art ARC-AGI-3 results at 4.2 4.2 – 5.8 × 5.8\( \times \) lower token cost. Left: ARC-AGI-3 results on the public game set with a 500 action limit, grouped by model and harness. Filled bars show pass@1, with bootstrap confidence intervals where multiple runs are available (five for Codex, two for Claude Code). Outlined bars show best@ k k . We rescore the released runs of WorldModeler, Arcgentica, and Schema for a consistent comparison. 3.1 Schema reports best@2; the others report pass@1. Right: Performance versus billed tokens per game for PRO-LONG and the strongest prior harness on Codex and Claude Code, across budgets from 100 to 500 actions. PRO-LONG stays within 2 2 – 4 4 points of the strongest prior harness at 4.2 4.2 – 5.8 × 5.8\( \times \) lower cost. ∗ PRO-LONG (Fable 5) at a 2 , 000 2{,}000 -action limit; this is a lower bound on best@2, as certain games we only ran once.
PRO-LONG matches or exceeds state-of-the-art ARC-AGI-3 results at 4.2 4.2 – 5.8 × 5.8\( \times \) lower token cost. Left: ARC-AGI-3 results on the public game set with a 500 action limit, grouped by model and harness. Filled bars show pass@1, with bootstrap confidence intervals w…
cs.AIarxiv:2607.20090v1Lead article

Reinforcement Learning for Large Language Model Selective Evidence Adoption from Contaminated Retrieval Results

Yanyu Chen, Yue Li, Yongyi Cui, Dongsheng Shi, Lichang Dai

his paper addresses the challenge of Large Language Models (LLMs) selectively adopting evidence from potentially contaminated retrieval results. Their core method involves post-training LLMs using Reinforcement Learning with Direct Preference Optimization (DAPO) and novel reward signals (rule-based or semantic judge) to learn to distinguish and utilize useful information while rejecting misleading content. The main contribution is SelectBench, a benchmark and training set designed to evaluate and improve this selective evidence adoption capability, demonstrating modest but significant gains in accuracy and reduced adoption of harmful content.

cs.AIarxiv:2607.20286v1Lead article

Sound Probabilistic Safety Bounds for Large Language Models

Mahdi Nazeri, Anne-Kathrin Schmuck, Sadegh Soudjani, Alessandro Abate

his paper introduces a framework for calculating rigorous probabilistic safety bounds for Large Language Models (LLMs), ensuring they don't generate harmful content. Their core method applies Clopper-Pearson confidence intervals and a novel algorithm that uses latent space features to efficiently explore generation paths likely to produce harmful outputs. This enables sound, statistically proven lower bounds on LLM harmfulness, even for rare events.

A practical instance of data generation for our problem setting, which leverages a classifier ℋ \( \mathcal{H} \) that detects an harmful output by the LLM ℳ \( \mathcal{M} \) under a fixed prompt 𝐱 \( \mathbf{x} \) .
A practical instance of data generation for our problem setting, which leverages a classifier ℋ \( \mathcal{H} \) that detects an harmful output by the LLM ℳ \( \mathcal{M} \) under a fixed prompt 𝐱 \( \mathbf{x} \) .
cs.CLarxiv:2607.20410v1Lead article

LKValues: Aligning Large Language Models with Sri Lankan Societal Values

Nethmi Muthugala, Supryadi, Surangika Ranathunga, Nisansa de Silva, Ruijie Tao

his paper introduces LKValues, a novel resource suite to address the Western bias in Large Language Model (LLM) value alignment. It contributes a survey-grounded set of 40 Sri Lankan societal values, an instruction corpus (LKvaluesIT) in Sinhala and English, and an evaluation benchmark (LKvaluesBench) to enable culturally sensitive LLM fine-tuning and assessment in Sri Lanka.

The flowchart shows the process for deriving Sri Lankan societal values, starting with selecting questions from established surveys, followed by manual and LLM-assisted value elicitation. This results in 51 candidate values, with 40 values retained after calculating endorsement percentages from 205 participants, using finite population correction.
The flowchart shows the process for deriving Sri Lankan societal values, starting with selecting questions from established surveys, followed by manual and LLM-assisted value elicitation. This results in 51 candidate values, with 40 values retained after calculating endorsement p…
cs.CLarxiv:2607.20372v1Lead article

Notes to Self: Can LLMs Benefit from Experiential Abstractions?

Chang Liu, Xinyu Li, Artur Dubrawski

his paper investigates if Large Language Models (LLMs) can improve their problem-solving abilities by learning from their own past experiences, similar to how humans create reusable strategies. The core method involves extracting natural-language "experiential abstractions" from LLM solution traces and then using these abstractions at inference time or for reinforcement learning. The key contribution is demonstrating that these self-generated abstractions significantly enhance LLM performance on reasoning tasks, suggesting LLMs can indeed benefit from distilled experience.

Pipeline Overview. An extractor LLM (teacher or self) distills the target LLM’s training traces into a library of natural-language abstractions, used in two modes: (1) inference-time retrieval into the test prompt, and (2) GRPO (Shao et al. , 2024 ) post-training on abstraction-augmented prompts.
Pipeline Overview. An extractor LLM (teacher or self) distills the target LLM’s training traces into a library of natural-language abstractions, used in two modes: (1) inference-time retrieval into the test prompt, and (2) GRPO (Shao et al. , 2024 ) post-training on abstraction-a…
cs.CLarxiv:2607.20062v1Lead article

Solar Open 2 Technical Report

Sungrae Park, Sanghoon Kim, Gyoungjin Gim, Jungho Cho, Hyunwoong Ko

olar Open 2 is a 250B-parameter Mixture-of-Experts model designed for long-horizon agentic tasks. Its core innovation is a novel 1M-token attention mechanism that interleaves softmax and linear attention layers without positional encoding, enabling it to process entire agent trajectories. The paper also details efficient training strategies, including initialization from a previous model and value-aware data curation, to achieve this scale within a fixed compute budget.

Benchmark comparison across three capability groups: knowledge and reasoning (top), agentic (middle), and Korean (bottom).
Benchmark comparison across three capability groups: knowledge and reasoning (top), agentic (middle), and Korean (bottom).
cs.AIarxiv:2607.21503v1Lead article

Agentic Context Management: Solving Agent Memory and Cost by Treating Them as Lifecycle and Architecture Problems

Gaurav Dadhich

his paper argues that AI agent failures stem from poor context management, not reasoning ability. It proposes treating context management as a lifecycle and architectural problem, rather than just storage and retrieval. The core contribution is a framework for actively managing agent memory by considering its entire lifecycle, from deciding what to remember to forgetting, all within budget constraints.

The five-primitive context lifecycle (architecting → \( \rightarrow \) ingesting → \( \rightarrow \) scoping → \( \rightarrow \) anticipating → \( \rightarrow \) compacting & consolidation), drawn as a cycle around a central agent, with the retrieval scope hierarchy (user → \( \rightarrow \) customer → \( \rightarrow \) client) as a vertical axis and the global knowledge layer drawn separately, feeding entity canonicalization.
The five-primitive context lifecycle (architecting → \( \rightarrow \) ingesting → \( \rightarrow \) scoping → \( \rightarrow \) anticipating → \( \rightarrow \) compacting & consolidation), drawn as a cycle around a central agent, with the retrieval scope hierarchy (user → \( \r…
cs.AIarxiv:2607.21324v1Lead article

GRADRAG: Cross-Component Prompt Adaptation for Coordinated Multi-Agent RAG

Paolo Pedinotti, Enrico Santus

RADRAG introduces a novel framework for optimizing multi-agent RAG systems by coordinating improvements across all components. It models the RAG pipeline as a computational graph and uses structured feedback from an Evaluator to iteratively adapt upstream agents like retrievers and answerers. This cross-component adaptation leads to more coordinated and effective RAG performance.

GradRAG : cross-component prompt adaptation in an agentic RAG pipeline. Grey (forward pass): A Retrieval Agent gathers evidence from either document chunks (Vector RAG) or a structured entity–relation graph (GraphRAG, constructed by a separate agent that is not shown in the mock up), which is assembled into a context and passed to an Answer Generation Agent to produce a candidate answer. Orange (evaluation and control): An Evaluator reviews the answer and its supporting evidence and returns feedback with a binary Stop? decision. If Yes , the answer is accepted. If No , a Prompt Optimizer updates the prompts of one or more agents (as indicated by the evaluation), and the next forward pass is executed.
GradRAG : cross-component prompt adaptation in an agentic RAG pipeline. Grey (forward pass): A Retrieval Agent gathers evidence from either document chunks (Vector RAG) or a structured entity–relation graph (GraphRAG, constructed by a separate agent that is not shown in the mock …
cs.AIarxiv:2607.21419v1Lead article

PATS: Policy-Aware Training Scaffolding for Agentic Reinforcement Learning

Yipeng Shi, Zhipeng Ma, Yue Wang, Qitai Tan, Yang Li

his paper introduces PATS, a novel training method for LLM agents that uses a "policy-aware training scaffold." Instead of focusing on skills, PATS dynamically adjusts the context provided to the agent during training based on its current performance. This scaffolding guides weak policies to succeed and is gradually removed as the agent improves, leading to more efficient and robust reinforcement learning.

Seed-0 training dynamics on 1.5B ALFWorld under the shared 150-step RL budget. Left: validation success rate. Right: mean prompt tokens per policy call; faint traces are raw logs and bold traces are seven-step moving averages. Pats expands its training context early and later contracts it as validation improves, whereas SkillRL’s context grows and SKILL0 follows staged withdrawal.
Seed-0 training dynamics on 1.5B ALFWorld under the shared 150-step RL budget. Left: validation success rate. Right: mean prompt tokens per policy call; faint traces are raw logs and bold traces are seven-step moving averages. Pats expands its training context early and later con…
cs.LGarxiv:2607.21356v1Lead article

Emergent Misalignment Recruits a Pre-existing Persona Subspace

Mohammed Suhail B Nadaf

his paper investigates emergent misalignment in language models, where fine-tuning on narrow "bad advice" leads to broad misalignment. The core method reveals that this generalization occurs because fine-tuning activates a pre-existing persona subspace within the model. The key contribution is demonstrating that this subspace, not just the specific training data, is responsible for emergent misalignment, and controlling it can prevent it.

A persona subspace present in the model before fine-tuning carries broad misalignment. The subspace is extracted from the frozen instruction-tuned model. Projecting it out of the residual stream throughout fine-tuning prevents broad misalignment (27.7% → \( \to \) 0.0%); adding it to the never-fine-tuned model induces misalignment that grows with dose (to 45.4%); the same projection applied to the weight gradient changes nothing (26.6% vs. 26.7%). Each arm carries a matched random control (Section 5 ).
A persona subspace present in the model before fine-tuning carries broad misalignment. The subspace is extracted from the frozen instruction-tuned model. Projecting it out of the residual stream throughout fine-tuning prevents broad misalignment (27.7% → \( \to \) 0.0%); adding i…
cs.LGarxiv:2607.21273v1Lead article

The Dark Room in the Reward Channel: Dense Prediction Rewards Collapse GRPO-Trained LLM Agents -- and What Actually Works

Yu Wang

his paper demonstrates that dense, per-step prediction rewards, intended to aid long-horizon LLM agents, actually cause catastrophic policy collapse under Group-Normalized RL (GRPO). The core issue is that GRPO's z-scoring amplifies the dense signal, leading to a "dark room" pathology where agents become stuck in unproductive states. The authors' key contribution is identifying that removing GRPO's standard deviation normalization resolves this collapse, suggesting that dense rewards are effective only when this specific normalization is absent.

The std-normalized prediction reward collapses every run at all three scales; timing is non-monotonic (saturation race, § 4.5 ). Honeymoon peaks rise with scale: the signal genuinely helps until hacking pressure arrives.
The std-normalized prediction reward collapses every run at all three scales; timing is non-monotonic (saturation race, § 4.5 ). Honeymoon peaks rise with scale: the signal genuinely helps until hacking pressure arrives.
cs.LGarxiv:2607.21550v1Lead article

X$^3$-OPD: Distilling Reasoning into Large Audio-Language Models via On-Policy Alignment

Dongjie Fu, Di Cao, Xize Cheng, Zihan Zhang, Wenxu Jia

$^3$-OPD distills reasoning abilities from text-based models into audio-language models using a novel on-policy alignment framework. It trains the audio model by having it generate reasoning steps based on its acoustic perception, guided by a text teacher using matched inputs and verified answers. This approach, supported by a diverse three-tier corpus, enables audio models to perform complex reasoning beyond purely textual content, incorporating non-linguistic events and prosody.

Overview of X 3 -OPD . Left: a three-tier symmetric corpus—Logical (text + TTS speech), Audio (audio + refined caption), and Dialogue (dialogue + prosody-aware meta-caption)—providing ( x t , x a , q , a ⋆ ) (x_{t},x_{a},q,a^{\( \star \)}) for every instance. Right: an offline warm-start ( ℒ off \( \mathcal{L} \)_{\( \mathrm{off} \)} , Eq. 1 ) followed by cross-modal on-policy distillation, where the student rolls out under ( x a , q ) (x_{a},q) and the frozen teacher scores the same trajectories under ( x t , q , a ⋆ ) (x_{t},q,a^{\( \star \)}) to compute ℒ on \( \mathcal{L} \)_{\( \mathrm{on} \)} (Eq. 3 ).
Overview of X 3 -OPD . Left: a three-tier symmetric corpus—Logical (text + TTS speech), Audio (audio + refined caption), and Dialogue (dialogue + prosody-aware meta-caption)—providing ( x t , x a , q , a ⋆ ) (x_{t},x_{a},q,a^{\( \star \)}) for every instance. Right: an offline wa…
cs.CLarxiv:2607.21279v1Lead article

A Unified Moral-Value Dataset for Instruction Tuning

Zhaohui Zeng, Florian Mai

his paper addresses the challenge of aligning Large Language Models (LLMs) with human values by creating a unified dataset for instruction tuning. The authors merge existing moral-value datasets and reformat them into an instruction-response structure. Their contribution is a readily usable dataset that, when mixed with general task data, allows LLMs to maintain general performance while improving value-oriented task capabilities.

Overall pipeline of our proposed dataset construction, instruction tuning, and downstream evaluation.
Overall pipeline of our proposed dataset construction, instruction tuning, and downstream evaluation.
cs.AIarxiv:2607.22165v1Lead article

DBA-Bench: A Production-Fidelity Benchmark for LLM-Based Database Operations Agents

Junming Chen, Junyang Jiang, Xu Chen, Zibo Liang, Kai Zheng

his paper introduces DBA-Bench, a novel benchmark designed to accurately evaluate LLM-based database agents in production-like environments. It addresses key gaps by simulating multi-turn read-write interactions with live databases, handling complex observations, and allowing for diverse remediation strategies. DBA-Bench's core contribution is its production fidelity, enabling more realistic and reliable assessment of these agents' capabilities.

Figure 1. DBA-Bench architecture for 106 PostgreSQL scenarios, from scenario construction through stateful agent–environment interaction to outcome-first, multi-dimensional evaluation.
Figure 1. DBA-Bench architecture for 106 PostgreSQL scenarios, from scenario construction through stateful agent–environment interaction to outcome-first, multi-dimensional evaluation.
cs.AIarxiv:2607.22182v1Lead article

From Isolated Tasks to Structured Capabilities: A Multilayer Taxonomy for Large Language Models

Shixin Fang, Jiachen Wo, Wenjuan Qin, Sihang Jiang, Yanghua Xiao

his paper introduces a novel multilayer taxonomy of LLM capabilities, organized by human cognitive science principles rather than LLM architecture. This framework, comprising 14 capability domains and 91 subskills across Primitive, Constructed, and Integrative layers, aims to address the fragmentation in LLM evaluation. The authors demonstrate its utility by mapping thousands of research papers, revealing that current research heavily focuses on Language-Semantic Competence and Reasoning.

The multi-layer taxonomy of cognitive capabilities.
The multi-layer taxonomy of cognitive capabilities.
cs.AIarxiv:2607.22389v1Lead article

HiKV: Hierarchical Importance-Aware KV Cache with Hardware Acceleration for LLM Decoding

Chao Fang, Jun Yin, Man Shi, Marian Verhelst

iKV addresses the KV cache memory bottleneck in LLM decoding by compressing it hierarchically. It first evicts unimportant tokens and then further compresses retained tokens by keeping only significant elements. This algorithm-hardware co-design, featuring a reconfigurable importance sorter, achieves significant speedups and energy reductions.

The dominated memory access of KV cache becomes the bottleneck of LLM decoding, motivating HiKV to shrink its footprint with high accuracy.
The dominated memory access of KV cache becomes the bottleneck of LLM decoding, motivating HiKV to shrink its footprint with high accuracy.
cs.AIarxiv:2607.22375v1Lead article

IDEAgent: Agentic Quality-Diversity Search for Research Idea Generation

Varun Gumma, Navonil Majumder, Soumitra Sinhahajari, Soujanya Poria

his paper introduces IDEAgent, a multi-agent framework for research idea generation that treats ideation as a Quality-Diversity (QD) search. Unlike previous methods that optimize for quality or diversity separately, IDEAgent jointly drives both objectives. It achieves this by using multi-objective feedback for idea refinement (Quality) and employing sequential memory and explicit comparisons to ensure novelty (Diversity).

Left: An abstract overview of IDEAgent highlighting the crucial components and flow. Right: An abstract overview of the evolution of an idea and a lineage, where a raw idea might either be directly rejected, repaired and refined, just refined, or directly accepted as per the assessment by the evaluators. Note that a refinement/repair maintains the lineage of the idea ( ℓ I \( \ell_{I} \) ). We purposefully omit the exact conditionals at each step for simplicity and refer the readers to the methodology ( § \( \mathsection \) 3 ) for it.
Left: An abstract overview of IDEAgent highlighting the crucial components and flow. Right: An abstract overview of the evolution of an idea and a lineage, where a raw idea might either be directly rejected, repaired and refined, just refined, or directly accepted as per the asse…
cs.AIarxiv:2607.22157v1Lead article

Learning on the Job: Continual Learning from Deployment Feedback for Frozen-Weights Agents

Valentin Tablan, Scott Taylor, Kristoffer Bernhem

his paper proposes a continual learning method for deployed AI agents with frozen weights. It leverages deployment feedback, such as outcome verdicts and corrections, to train an external memory that stores natural-language rules. This approach significantly improves agent performance by enabling it to learn from past experiences without retraining the core model.

cs.AIarxiv:2607.22083v1Lead article

Nanbeige4.2-3B: Unlocking Agentic Capabilities in a Compact Mode

Nanbeige Lab, :, Chen Yang, Chengrui Huang, Fufeng Lan

anbeige4.2-3B is a compact 3B parameter agentic model that achieves strong performance in code, office, and tool-use tasks, along with competitive reasoning. Its core method involves a Looped Transformer for efficient parameter usage and a sophisticated RLHF pipeline incorporating mixed-mode, length-controlled, and outcome/process rewards. The paper's contribution lies in demonstrating that a compact model, through architectural innovation and advanced training techniques, can surpass larger models in complex agentic capabilities.

Performance comparison between Nanbeige4.2-3B and other open-sourced models.
Performance comparison between Nanbeige4.2-3B and other open-sourced models.
cs.AIarxiv:2607.22520v1Lead article

The Regression Tax: Decomposing Why Skills Help and Hurt LLM Agents

Darshan Tank, Baran Nama

his paper introduces the "regression tax" to analyze the impact of adding procedural skills to LLM agents. Instead of just measuring average improvement, it quantifies how skills can also cause failures. The core contribution is identifying that the best skills succeed by minimizing these "regressions" (tasks that fail *after* skills are added) rather than solely by improving success rates.

Figure 1 . Three stages of an agent task: grounding (reading the right inputs), method (the procedure), and verification (checking the output). Existing skills mostly target the method stage. In our data, regressions and residual failures concentrate at grounding and verification instead.
Figure 1 . Three stages of an agent task: grounding (reading the right inputs), method (the procedure), and verification (checking the output). Existing skills mostly target the method stage. In our data, regressions and residual failures concentrate at grounding and verification…
cs.AIarxiv:2607.22319v1Lead article

Towards Trustworthy and Cost-Efficient Data Integration: From Naïve RAG to Agentic RAG

Chuangtao Ma, Arijit Khan

his paper proposes Agentic RAG as a solution to improve trustworthiness and cost-efficiency in LLM-based data integration. It builds upon existing RAG methods by introducing autonomous multi-agent systems that adaptively plan, retrieve, refine, and reason. This approach aims to provide evidence-grounded, verifiable, and hallucination-robust integration decisions.

LLM for Data Integration.
LLM for Data Integration.
cs.CLarxiv:2607.22529v1Lead article

Skill Self-Play: Pushing the Frontier of LLM Capability with Co-Evolving Skills

Siyuan Huang, Pengyu Cheng, Haotian Liu, Tao Chen, Yihao Liu

his paper introduces Skill Self-Play (Skill-SP), a novel framework for LLM training that addresses the trade-off between task diversity and verification reliability. Skill-SP uses co-evolving "skills" to enable deep, verifiable execution within specific scenarios, while a dynamic controller routes between these skills to maintain broad task variety. This approach allows LLMs to learn and improve through continuous self-play, generating increasingly challenging tasks and refining their problem-solving abilities.

cs.AIarxiv:2607.24339v1Lead article

Gubernaut: A Deterministic Homeostatic Controller for Affect-Regulated LLM Agents, Validated Across Independent Model Families

Dushyant Sharma

his paper introduces Gubernaut, a deterministic runtime controller for LLM agents designed to prevent reactive failures like escalation or sycophancy. It operates as a model-agnostic layer that monitors numerical telemetry (intensity, valence, repetition) and adjusts the LLM's behavior without processing text, thus creating an inherent security against injection attacks. The core contribution is a novel, robust control mechanism that ensures LLM agents maintain stable, non-reactive behavior under sustained pressure.

The GCC cycle as a Nelson–Narens monitoring–control loop: monitoring flows up as numbers, control flows down as a posture, and no text crosses into the meta level. The unregulated baseline arm used throughout is the same host model with the governor absent.
The GCC cycle as a Nelson–Narens monitoring–control loop: monitoring flows up as numbers, control flows down as a posture, and no text crosses into the meta level. The unregulated baseline arm used throughout is the same host model with the governor absent.
cs.AIarxiv:2607.24720v1Lead article

The Physics of Multi-Turn Long-Horizon Planning: From Pre-training to Post-training via Single- and Multi-Teacher On-Policy Agentic Distillation

Tianyi Men, Zhuoran Jin, Kang Liu, Jun Zhao

his paper introduces a controlled environment to systematically study multi-turn long-horizon planning in foundation model agents. The core method involves analyzing planning ability acquisition during pre-training by manipulating data formats and introducing world models, and then shaping it through post-training techniques like GRPO and OPD. The key contribution is a deeper understanding of how planning skills are learned and improved, highlighting the importance of world models and high-quality data for effective long-horizon generalization.

An overview of the studying into physics of multi-turn long-horizon planning. It studies the long-horizon planning ability across three training stages: Large-scale pre-training , RL-based post-training (OPD and GRPO) , and Multi-teacher model consolidation post-training (MOPD) . The giraffe icon is used to represent the “L” in “Long”. Its long neck also reflects that the agents need to look far ahead in long-horizon planning.
An overview of the studying into physics of multi-turn long-horizon planning. It studies the long-horizon planning ability across three training stages: Large-scale pre-training , RL-based post-training (OPD and GRPO) , and Multi-teacher model consolidation post-training (MOPD) .…
cs.AIarxiv:2607.24507v1Lead article

UNIFUSION: Adapting Autoregressive Language Models into Discrete Diffusion under a Unified Reverse-Rate Objective

Xiaoyi Jiang, Jingyuan Li, Yixuan Jiang, Wei Liu, Yi Zhu

his paper proposes UNIFUSION, a method to adapt autoregressive language models for discrete diffusion. It unifies existing diffusion objectives under a single generalized KL objective, allowing seamless switching between different corruption kernels like masking and uniform noise. UNIFUSION then uses a simple continual pre-training approach to adapt GPT-2 models to uniform-noise diffusion, demonstrating its effectiveness.

cs.LGarxiv:2607.24653v1Lead article

Kimi K3: Open Frontier Intelligence

Kimi Team, Tongtong Bai, Yifan Bai, Yiping Bao, M. C.

imi K3 is a 2.8T parameter Mixture-of-Experts model that achieves significant scaling efficiency improvements through novel attention mechanisms (Kimi Delta Attention) and expert routing (Stable LatentMoE). Its core contribution lies in its massive scale, native vision capabilities, and an unprecedented 1-million-token context window, enabling robust long-horizon reasoning and compositional generalization across various domains.

cs.LGarxiv:2607.24392v1Lead article

When LLM Defenses Backfire: Characterizing Safety, Performance, and Cost Trade-offs

Tong Zhang, Zexin Li, Simin Chen, Yun Peng

his paper systematically analyzes the trade-offs of LLM jailbreak defenses across safety, performance, and cost. It categorizes defenses by operational strategy and finds that they rarely improve downstream capabilities, instead varying in how they impact usability and efficiency. Rule-based defenses best maintain performance, while conservative self-reflective defenses increase over-refusal, and multi-round defenses significantly raise runtime costs.

Overview of defense-induced trade-offs in LLM systems. A defended LLM is expected to improve safety by reducing attack success on harmful prompts. However, stronger defenses may also backfire by over-refusing benign requests, degrading task performance, and increasing inference overhead such as latency, token usage, and API cost.
Overview of defense-induced trade-offs in LLM systems. A defended LLM is expected to improve safety by reducing attack success on harmful prompts. However, stronger defenses may also backfire by over-refusing benign requests, degrading task performance, and increasing inference o…
cs.AIarxiv:2607.26023v1Lead article

CHARM: A Multimodal Graph Foundation Model with Hierarchical Context Modeling for Zero-Shot Transfer

Ankang Yang, Jitao Zhao, Di Jin, Yuxiao Huang, Dongxiao He

HARM is a multimodal graph foundation model that addresses zero-shot transfer by modeling hierarchical context across different modalities. Its core method involves learning transferable cross-modal relations and disentangling domain-specific information from generalizable node representations. This allows CHARM to generalize to new graph domains and tasks without requiring any downstream fine-tuning.

Figure 1. Domain bias and semantic relevance in Toys-to-Grocery retrieval.
Figure 1. Domain bias and semantic relevance in Toys-to-Grocery retrieval.
cs.AIarxiv:2607.25853v1Lead article

HiSkill: Empowering LLM Agents with Hierarchical Skill Graphs

Yu Hao, Jinxuan Cai, Qi Zhang, Yawen Li, Zhiqiang Zhang

iSkill addresses the limitations of flat skill representations in LLM agents by introducing a hierarchical skill graph. This framework organizes skills and actions into a directed graph, capturing complex relationships like decomposition and temporal transitions. HiSkill's contribution lies in enabling more efficient and robust task execution by guiding LLM agents with a structured, task-relevant subgraph.

Existing methods distill trajectories into coarse-grained textual rules in a flat organization, while HiSkill builds a hierarchical graph to assist task execution, including high-level skill nodes, executable AtomicOp nodes and typed edges between them.
Existing methods distill trajectories into coarse-grained textual rules in a flat organization, while HiSkill builds a hierarchical graph to assist task execution, including high-level skill nodes, executable AtomicOp nodes and typed edges between them.
cs.AIarxiv:2607.25992v1Lead article

MemLens: A Value-Aware Memory Management System with Interactive Analytics for LLM-based Agents

Shuyue Wei, Chang Liu, Zimu Zhou, Yongxin Tong, Lizhen Cui

emLens introduces a value-aware memory management system for LLM agents, treating memory records as first-class objects. Its core method involves Shapley-style evaluation to identify and prioritize valuable memory content, enabling efficient storage and retrieval. The system's contribution lies in providing interactive analytics that allow users to understand and optimize memory usage, leading to improved response quality and reduced latency.

Figure 1 . Comparison between (a) utility-agnostic memory management and (b) value-aware memory management.
Figure 1 . Comparison between (a) utility-agnostic memory management and (b) value-aware memory management.
cs.AIarxiv:2607.25816v1Lead article

Speculate While You Reason: Teaching Agents to Predict Their Next Tool Call via Joint Agent-Speculator RL

Jiabao Ji, Yujian Liu, Li An, Rohit Jain, Gungor Polatkan

his paper introduces a "self-speculating agent" that unifies task execution and next tool call prediction within a single model. By training this agent using a joint reinforcement learning method, it learns to predict its future tool calls by leveraging its own partial reasoning process. This approach aims to reduce latency by pre-executing predicted tool calls that align with the agent's actual behavior.

External versus self tool-call speculation. The upper panel shows an external draft model with separate parameters and KV cache, which predict a different next call due to the speculator–agent gap. The lower panel shows self-speculation with a shared prefix KV cache.
External versus self tool-call speculation. The upper panel shows an external draft model with separate parameters and KV cache, which predict a different next call due to the speculator–agent gap. The lower panel shows self-speculation with a shared prefix KV cache.
cs.AIarxiv:2607.25718v1Lead article

Tools Are Not Islands: Set-Level Tool Retrieval for LLM Agents via Query-Conditioned Hyperedge Prediction

Xinyi Hong, Pinjun Dong, Xinyang Yu, Binyan Jiang

his paper introduces HYSET, a novel method for LLM agents to retrieve tool sets. Instead of evaluating tools individually or sequentially, HYSET treats the entire tool set as a unit, predicting hyperedges on a tool co-invocation graph to capture joint utility and compatibility. This set-level approach aims to improve the efficiency and effectiveness of tool selection for LLM agents.

Overview and motivation of HYSET. (a) Tool-retrieval pipeline; (b) limitations of existing retrievers; and (c) our set-level view as query-conditioned hyperedge prediction.
Overview and motivation of HYSET. (a) Tool-retrieval pipeline; (b) limitations of existing retrievers; and (c) our set-level view as query-conditioned hyperedge prediction.
cs.CLarxiv:2607.25886v1Lead article

RSIBench-Data: Benchmarking Data-Centric Research for Recursive Self-Improvement

Fanqing Meng, Lingxiao Du, Qiguang Chen, Ziqi Zhao, Haocheng Lu

his paper introduces RSIBench-Data, a benchmark designed to isolate and evaluate the data-centric research capabilities of LLM agents for recursive self-improvement. The core method involves a controlled environment where agents iteratively refine training data strategies for a fixed target model, with all other aspects of the research loop (training, serving, evaluation) standardized. The main contribution is a cleaner assessment of LLM agents' ability to diagnose and fix model failures through data manipulation, disentangled from other system complexities.

Existing evaluations entangle multiple post-training choices; RSIBench-Data isolates the LLM agent’s ability to conduct data-centric post-training research.
Existing evaluations entangle multiple post-training choices; RSIBench-Data isolates the LLM agent’s ability to conduct data-centric post-training research.
cs.AIarxiv:2607.27155v1Lead article

OmegaUse-OfficeVal: Benchmarking LLM Agents on Long-Horizon Office-Suite Tasks with Economic Grounding

Jingbo Zhou, Yusai Zhao, Qi Bao, Jingjia Cao, Zhenghai Chen

his paper introduces OmegaUse-OfficeVal, a benchmark designed to evaluate LLM agents on complex, multi-step office tasks. Its core contribution is the inclusion of economic grounding, pairing each task with human labor time and a price proxy. This allows for cost-effective evaluation of LLM agents against human performance and provides a novel way to assess their economic value.

cs.AIarxiv:2607.27081v1Lead article

On-Policy Distillation for LLM Safety: A Routing Approach to Template-Robust Realignment

Yongjian Guo, Wanlun Ma, Lingyu Shen, Xi Xiao, Sheng Wen

his paper introduces Routing-based On-Policy Distillation (ROPD), a novel method to improve LLM safety by distilling knowledge from an aligned model to a potentially compromised one. Instead of relying on specific prompt templates, ROPD models the divergence between aligned and compromised output distributions. This approach aims to create robustly aligned LLMs that retain their skills and resist re-jailbreaking, even when prompt templates are unknown.

The template-consistency trap in safety realignment.
The template-consistency trap in safety realignment.
cs.AIarxiv:2607.26947v1Lead article

Progressive Multimodal Alignment for Continual Instruction Tuning

Duzhen Zhang, Yahan Yu, Qiaoyi Su, Jiahua Dong, Tielin Zhang

his paper addresses projector drift in multimodal continual learning by introducing Progressive Multimodal Alignment (PMA). PMA uses a lightweight descriptor to detect visual distribution shifts and progressively adds new "expert" projector components only when necessary, while retaining the original projector as a stable anchor. This approach allows the projector to adapt to new data without forgetting previous alignments, improving multimodal instruction tuning.

Figure 1 . Illustration of projector-level forgetting in MCIT. After finetuning on a captioning task, DISCO (Guo et al . , 2025b ) produces caption-style responses even for classification instructions, indicating degraded visual translation for earlier tasks. In contrast, DISCO+PMA (Ours) preserves task-specific cross-modal alignment and generates task-consistent classification outputs for the same inputs.
Figure 1 . Illustration of projector-level forgetting in MCIT. After finetuning on a captioning task, DISCO (Guo et al . , 2025b ) produces caption-style responses even for classification instructions, indicating degraded visual translation for earlier tasks. In contrast, DISCO+P…
cs.AIarxiv:2607.26865v1Lead article

Think Short, Defer Smart, Act, and Repeat: Calibrated Reasoning and Uncertainty-Aware Deferral for Edge LLM Agents

Amirmohammad Farzaneh, Osvaldo Simeone

his paper introduces Think Short, Defer Smart (TSDS), a framework for edge LLM agents. TSDS optimizes reasoning by stopping early when an action is stable and defers to a cloud model only when local uncertainty is high. Its key contribution is a jointly calibrated approach that guarantees both performance and efficient cloud usage.

cs.CLarxiv:2607.26891v1Lead article

DIRECT: Direct Decoding for Efficient and Aligned Sequence Labeling with Large Language Models

Yilei Wang, Jiaxin Gan, Kexuan Zhang, Ling Li, Wentao Zhang

IRECT improves sequence labeling with LLMs by optimizing for human preferences via DPO and enforcing structured outputs. Its core method uses controlled decoding and a template-filling mechanism to generate only label tokens, significantly boosting inference efficiency and domain alignment.

cs.CLarxiv:2607.26825v1Lead article

From Found to Designed: Concepts as a Design Axis for Large Language Models

Chen Shani

his paper proposes treating "concepts" as a deliberate design axis for Large Language Models (LLMs), rather than an emergent property. The authors introduce a taxonomy for designing LLMs with explicit conceptual structure, considering when and how this structure is introduced (e.g., during training or inference) and its source (internal or external). This framework aims to enable more controllable, compositional, and human-aligned LLMs.

cs.CLarxiv:2607.26981v1Lead article

OptimismBench: Forecasting Bias and the Alignment Effect in Language Model Judgment

Seonglae Cho, Adriano Koshiyama

his paper introduces OptimismBench, a novel method for detecting directional bias in language model probability judgments. By presenting inverted scenarios (e.g., P(success) vs. P(failure)), OptimismBench quantifies a signed bias score without needing ground truth. The study reveals widespread optimism in most tested LLMs, with a notable exception in Anthropic's frontier models, and demonstrates that post-training alignment can alter the direction of this bias.

The inverted-pair method: Skew = P + ¯ − ( 100 − P − ¯ ) \( \text{Skew} \)=\( \overline \){P^{+}}-(100-\( \overline \){P^{-}}) scores directional asymmetry.
The inverted-pair method: Skew = P + ¯ − ( 100 − P − ¯ ) \( \text{Skew} \)=\( \overline \){P^{+}}-(100-\( \overline \){P^{-}}) scores directional asymmetry.
cs.AIarxiv:2607.28272v1Lead article

MemHarness: Memory Is Reconstructed, Not Replayed

Rong Wu, Daocheng Fu, Licheng Wen, Xuemeng Yang, Shu Zou

emHarness proposes a novel approach to memory augmentation for LLM agents, moving beyond simple verbatim replay. Its core method involves a unified policy model that actively reconstructs retrieved past experiences based on the agent's current state. This allows agents to adapt and ground memories in the present context, mitigating negative transfer and improving decision-making.

Memory utilization paradigms. Top: Prior methods directly replay retrieved memories, risking state misalignment. Middle: Human memory reconstructs past experience according to the current context. Bottom: Inspired by this process, MemHarness reconstructs retrieved memories into state-aligned guidance.
Memory utilization paradigms. Top: Prior methods directly replay retrieved memories, risking state misalignment. Middle: Human memory reconstructs past experience according to the current context. Bottom: Inspired by this process, MemHarness reconstructs retrieved memories into s…
cs.AIarxiv:2607.28317v1Lead article

One Human, $N$ Agents: Audit-Budget Allocation for LLM Agent Fleets under Miscalibrated, Correlated Confidence

Cesare Zavattari, Alessandro Tommasi, Giuseppe Prencipe

his paper addresses the challenge of a human auditor allocating a limited budget to audit a fleet of $N$ LLM agents, whose self-reported confidence is unreliable due to miscalibration and correlated errors. The core method models this as budgeted noisy inspection, identifying a "miscalibration threshold" beyond which confidence-based auditing becomes worse than random. The key contribution is demonstrating that this threshold surprisingly increases with a smaller budget and that shared difficulty among agents, rather than lineage, is the primary driver of correlated errors.

cs.AIarxiv:2607.28545v1Lead article

ORCA-bench: How Ready Are Language Model Agents for Oncall?

Albert Gong, Kyuseong Choi, Abhineet Agarwal, Jason Schechner, Ryan Huang

his paper introduces ORCA-bench, a novel benchmark designed to evaluate the readiness of language model agents for on-call incident response. The benchmark simulates a production-fidelity microservice environment with real telemetry data and source code, presenting agents with 1,079 root cause analysis tasks. The core contribution is demonstrating that even frontier agents struggle significantly with on-call RCA, achieving only 25.3% accuracy on realistic tasks.

RCA accuracy measures whether agents identified all plausible root causes, and hallucination rate measures whether agents named a root cause matching none of the plausible root causes. We show the realistic Medium and Hard difficulties here and report Easy in Fig. ˜ 5 along with Claude Fable 5 results on a subset of tasks in Sec. ˜ 5 . Error bars display ± 1 \( \pm \) 1 standard error across 884 incident tasks.
RCA accuracy measures whether agents identified all plausible root causes, and hallucination rate measures whether agents named a root cause matching none of the plausible root causes. We show the realistic Medium and Hard difficulties here and report Easy in Fig. ˜ 5 along with …
cs.AIarxiv:2607.28384v1Lead article

When Specifications Conflict: A Symmetry-Based Framework for Measuring LLM Preferences

Tairan Wang, Liang Zhou, Zikang Zhan, Pingchuan Yan

his paper introduces a novel framework for analyzing how Large Language Models (LLMs) handle conflicting instructions. By creating controlled experimental setups with explicit specification conflicts and employing a symmetry-based design, the framework allows for direct observation and systematic comparison of LLM preferences across different representation types. This contributes a controllable and attributable method to understand and measure LLM decision-making when faced with inconsistent information.

Example conflict instance represented in four specification formats: pure natural language (NL), formal specification (Form), naturalized formal specification (NatF), and input–output examples (Ex).
Example conflict instance represented in four specification formats: pure natural language (NL), formal specification (Form), naturalized formal specification (NatF), and input–output examples (Ex).
cs.LGarxiv:2607.28282v1Lead article

(Towards) Scalable Reliable Automated Evaluation with Large Language Models

Bertil Braun, Martin Forell

his paper introduces a scalable and reliable automated evaluation framework for LLM outputs. It uses pairwise comparisons between LLM-generated texts, aggregated via an Elo rating system, to approximate expert assessments without relying on explicit references. This approach offers flexible confidence control and has demonstrated effectiveness in evaluating competency profiles from scientific abstracts.

Pipeline Overview: A three-stage methodology including Generation, Comparison, and Ranking.
Pipeline Overview: A three-stage methodology including Generation, Comparison, and Ranking.
cs.LGarxiv:2607.28301v1Lead article

HARGO: Heterogeneity-Aware Reward-Guided Optimization for RL Post-Training of LLMs on HPC Tasks

Tiangang Li, Xiangbo Tian

his paper introduces HARGO, a novel RL post-training method for LLMs on HPC tasks. HARGO addresses the challenge of extreme task heterogeneity by dynamically weighting rewards based on task characteristics, unlike uniform-weight methods. This approach leads to more effective optimization and improved LLM performance across diverse HPC applications.

HPC task heterogeneity across three dimensions—answer length distribution, reward distribution, and SFT baseline accuracy.
HPC task heterogeneity across three dimensions—answer length distribution, reward distribution, and SFT baseline accuracy.
cs.LGarxiv:2607.28374v1Lead article

LEDGERMIND: Provenance-Constrained Multimodal Agentic Reasoning with a Structured Evidence Ledger

Enjun Du, Hange Zhou, Chenxu Du, Siyi Liu, Zirong Chen

his paper introduces LedgerMind, a novel framework for multimodal agents that treats their reasoning process as a provenance-constrained state machine. Its core method involves organizing agent outputs into a Structured Evidence Ledger, ensuring that all subsequent reasoning and decisions are directly traceable to and grounded in this evidence. The main contribution is a robust evaluation mechanism that goes beyond final answer accuracy, verifying the integrity and grounding of the agent's entire reasoning trajectory.

Representative failure patterns in multimodal agentic reasoning that final-answer accuracy tends to obscure.
Representative failure patterns in multimodal agentic reasoning that final-answer accuracy tends to obscure.
cs.CLarxiv:2607.28568v1Lead article

Frontis-MA1: Training an AI4AI Model towards Recursive Self-Improvement in Machine Learning Engineering

Junlin Yang, Che Jiang, Yu Fu, Tianwei Luo, Can Ren

his paper introduces Frontis-MA1, an AI model designed for recursive self-improvement in machine learning engineering (MLE). Its core method involves training a meta-evolution agent on a new full-stack system (OpenMLE) using four atomic program-evolution operators. The key contribution is demonstrating that this AI can significantly improve its own performance on MLE tasks by learning and evolving its program-building capabilities within a single, coupled loop.

cs.AIarxiv:2607.08647v1Lead article

Multi-Modal, Multi-Environment Machine Teaching for Robust Reward Learning

Ali Larian, Qian Lin, Chang Zong Wu, Daniel S. Brown

his paper proposes a novel machine teaching method for robust reward learning in Inverse Reinforcement Learning (IRL). It addresses the challenge of learning reward functions that generalize across multiple environments by leveraging heterogeneous feedback modalities. The core contribution is demonstrating how different feedback types, particularly comparisons, provide stronger global constraints on reward functions, leading to improved robustness against environmental changes compared to single-environment, demonstration-only approaches.

cs.AIarxiv:2607.08716v1Lead article

Remember When It Matters: Proactive Memory Agent for Long-Horizon Agents

Yifan Wu, Lizhu Zhang, Yuhang Zhou, Mingyi Wang, Bo Peng

his paper introduces a proactive memory agent that actively intervenes by injecting relevant memories into an action agent's decision-making process. This combats "behavioral state decay" in long-horizon tasks where crucial information is lost. The plug-and-play memory agent significantly improves task success rates by selectively reminding the action agent of important context, demonstrating its effectiveness across benchmark environments.

cs.AIarxiv:2607.08565v1Lead article

SMetric: Rethink LLM Scheduling for Serving Agents with Balanced Session-centric Scheduling

Jiahao Wang, Kaizhan Lin, Kaixi Zhang, Jinbo Han, Xingda Wei

his paper introduces SMetric, a novel LLM scheduling method for serving AI agents. It addresses the unique demands of agentic workloads, where complete responses are prioritized over per-token latency, and KV cache reuse is significantly higher. SMetric proposes a balanced session-centric approach that leverages global KV stores and intra-session locality to improve throughput without sacrificing KV cache efficiency, overcoming limitations of existing schedulers.

The KV$ store hierarchy for serving agents.
The KV$ store hierarchy for serving agents.
cs.AIarxiv:2607.08400v1Lead article

TRACE: A Two-Channel Robust Attribution Watermark via Complementary Embeddings for LLM-Agent Trajectories

Zheng Gao, Xiaoyu Li, Xiaoyan Feng, Jiaojiao Jiang, Yang Song

RACE embeds a robust watermark into LLM agent trajectories by using two complementary channels. One channel is content-based for deletion resilience, and the other is position-based for rewrite resilience. This dual approach allows for distortion-free action choices and self-synchronization, ensuring attribution even when trajectory logs are tampered with.

cs.AIarxiv:2607.08375v1Lead article

WCog-VLA: A Dual-Level World-Cognitive Vision-Language-Action Model for End-to-End Autonomous Driving

Xuerun Yan, Zhexi Lian, Nuoheng Zhang, Shiyu Fang, Haoran Wang

Cog-VLA addresses the limitations of reactive autonomous driving by introducing a dual-level framework for proactive driving. It achieves this by unifying world cognition and reasoning at a semantic level, incorporating 3D perception and agent tokens for dynamic understanding and Game-theoretic Chain-of-Thought reasoning. At a generative level, the Aligned Decoupled Diffusion Transformer synthesizes physically-plausible multi-agent trajectories, enabling more comprehensive world foresight.

Four paradigms of leveraging VLM in E2E autonomous driving. Our method (d) advances existing frameworks to enable proactive driving by establishing a dual-level world cognition with the integration of semantic forecasting and generative evolution.
Four paradigms of leveraging VLM in E2E autonomous driving. Our method (d) advances existing frameworks to enable proactive driving by establishing a dual-level world cognition with the integration of semantic forecasting and generative evolution.
cs.AIarxiv:2607.08740v1Lead article

Workflow as Knowledge: Semantic Persistence for LLM-Mediated Workflows

Emanuele Quinto, Carlo Andrea Rozzi, Francesco Zanitti

his paper proposes a conceptual model for LLM-mediated workflows, representing workflow definitions, instances, and execution details as persistent knowledge objects. The core method uses Lisp-inspired concepts like symbolic forms and live-image thinking to distinguish between deterministic "derive" operations and LLM-driven "infer" judgments. The main contribution is a framework for semantic persistence, where workflows themselves become enduring knowledge, not just producers of it.

Semantic workflow objects are interpreted by the DSL-machine control layer, which coordinates runtime services and writes back workflow instances, mediated effects, and records of inference, approval, and panel activity. The bidirectional relation indicates that the control layer both reads semantic objects and writes back persistent semantic objects or relations.
Semantic workflow objects are interpreted by the DSL-machine control layer, which coordinates runtime services and writes back workflow instances, mediated effects, and records of inference, approval, and panel activity. The bidirectional relation indicates that the control layer…
cs.LGarxiv:2607.08377v1Lead article

Eigenvalue Calibration for Semantic Embeddings of Large Language Models

Sebastian G. Gruber, Nassim Walha, Francis Bach, Florian Buettner

his paper introduces a novel framework for calibrating the eigenvalues of semantic embeddings from LLMs, treating them as density matrix predictors. By applying temperature scaling to these eigenvalues, the authors demonstrate improved uncertainty quantification. Their work establishes theoretical links between entropy and risk, deriving a specific calibration inequality for eigenvalues and proving that temperature scaling optimizes calibration.

Figure 10 : Eigenvalue-based reliability diagram (as computed by Algorithm 1 ) after applying the sampling temperature calibration baseline for the Figure 1(c) and Figure 1(d) setup (TriviaQA using Phi 4 Mini). Calibrating sampling temperature does reduce the eigenvalue ECE but the performance is limited compared to our matrix temperature scaling approach.
Figure 10 : Eigenvalue-based reliability diagram (as computed by Algorithm 1 ) after applying the sampling temperature calibration baseline for the Figure 1(c) and Figure 1(d) setup (TriviaQA using Phi 4 Mini). Calibrating sampling temperature does reduce the eigenvalue ECE but t…
cs.LGarxiv:2607.08399v1Lead article

Prompt Compression via Activation Aggregation

Thibaud Ardoin, Semira Einsele, Evis Bregu, Gerhard Wunder

his paper proposes "Prompt Compression via Activation Aggregation," a method to compress instruction prompts into a single activation vector. This compressed vector, a learned weighted sum of intermediate layer activations, can then be injected into an early layer of the LLM, replacing the original token sequence. The core contribution is demonstrating that this compression preserves task-relevant information with minimal accuracy loss, enabling efficient prompt processing for fixed instructions and revealing cross-layer compatibility in LLM activation spaces.

cs.CLarxiv:2607.08395v1Lead article

Token-Flow Firewall: Semantic Runtime Auditing for Persistent AI Agents

Puji Wang, Yingchen Zhang, Ruqing Zhang, Jiafeng Guo, Xueqi Cheng

his paper introduces TokenWall, a runtime defense framework for persistent AI agents. Its core method is to treat natural-language token flows (like memory updates or tool arguments) as the primary attack surface. TokenWall acts as a semantic firewall, auditing these flows to intercept unsafe behavior before it reaches privileged parts of the agent's runtime.

Runtime auditing strategies for persistent AI agents. (a) Rule-based auditing is efficient but coarse. (b) Remote large-model auditing is more flexible but adds latency and remote exposure. (c) TokenWall performs local transfer-level auditing before protected sinks and supports allow, rewrite, defer, or block decisions.
Runtime auditing strategies for persistent AI agents. (a) Rule-based auditing is efficient but coarse. (b) Remote large-model auditing is more flexible but adds latency and remote exposure. (c) TokenWall performs local transfer-level auditing before protected sinks and supports a…
cs.CLarxiv:2607.08768v1Lead article

UniClawBench: A Universal Benchmark for Proactive Agents on Real-World Tasks

Zhekai Chen, Chengqi Duan, Kaiyue Sun, Bohao Li, Yuqing Wang

niClawBench introduces a capability-driven benchmark for evaluating proactive AI agents in real-world scenarios. It addresses limitations of existing benchmarks by focusing on five core agent capabilities and offering 400 bilingual tasks designed for dynamic, multi-turn interactions. This approach allows for a more granular understanding of agent performance and failure points.

Overview of UniClawBench. UniClawBench consists of 400 bilingual real-world tasks spanning 5 core capabilities: multimodal, long-context, skill usage, exploration, and cross-platform. We propose a three-role closed-loop evaluation framework, where an executor agent performs tasks in real environments, a supervisor evaluates trajectories and artifacts using hidden rubrics, and a user simulator provides natural feedback based on executor’s performance and supervisor’s signal, enabling multi-turn interaction. We conduct two sets of experiments to evaluate cross-model and cross-framework performance. The capability-level results reveal that framework choice exerts a stronger influence than model choice.
Overview of UniClawBench. UniClawBench consists of 400 bilingual real-world tasks spanning 5 core capabilities: multimodal, long-context, skill usage, exploration, and cross-platform. We propose a three-role closed-loop evaluation framework, where an executor agent performs tasks…
cs.AIarxiv:2607.09600v1Lead article

Agora: Enhancing LLM Agent Reasoning Via Auction-Based Task Allocation

Kaiji Zhou, Ales Leonardis, Yue Feng

gora enhances LLM agent reasoning by using an auction mechanism to dynamically allocate tasks to expert models and tools. This approach allows agents to bid based on their actual capabilities, ensuring tasks go to the most competent solver and improving cost-efficiency. The paper's contribution lies in this novel incentive-compatible auction framework, which demonstrably improves performance and offers a controllable cost-quality trade-off.

Overview of Agora’s auction-based reasoning framework . Given a complex query x x , a planner decomposes it into a graph of dependencies, which are grouped into task units . Each unit is dynamically allocated to the optimal agent via a confidence-calibrated auction , which filters out hallucinated certainty by weighing verified competence against execution cost. Finally, the unit outputs are synthesized into the final answer Y Y .
Overview of Agora’s auction-based reasoning framework . Given a complex query x x , a planner decomposes it into a graph of dependencies, which are grouped into task units . Each unit is dynamically allocated to the optimal agent via a confidence-calibrated auction , which filter…
cs.AIarxiv:2607.09510v1Lead article

Failure as a Process: An Anatomy of CLI Coding Agent Trajectories

Xiangxin Zhao, Han Li, Shuaiting Li, Tianyi Zhao, Earl T. Barr

his paper treats LLM coding agent failures not as a single event, but as a dynamic process. Its core method involves analyzing the step-by-step evolution of failures across thousands of execution trajectories. The main contribution is a new framework for understanding how failures emerge, worsen, and become unrecoverable, offering deeper insights than previous studies that focused only on the final outcome.

Overview of our study methodology. We collect execution trajectories from seven frontier models across three coding-agent scaffolds on Terminal-Bench, filter them into a high-quality dataset, manually annotate failure trajectories through an LLM-assisted and human-adjudicated pipeline, and use the resulting annotations to answer RQ1–RQ4.
Overview of our study methodology. We collect execution trajectories from seven frontier models across three coding-agent scaffolds on Terminal-Bench, filter them into a high-quality dataset, manually annotate failure trajectories through an LLM-assisted and human-adjudicated pip…
cs.AIarxiv:2607.09262v1Lead article

Geopolitical alignment: Endorsement effects in large language models

Maxim Chupilkin

his paper investigates whether Large Language Models (LLMs) exhibit geopolitical bias when evaluating policies. The core method involves an endorsement experiment where LLMs rate identical policies described as supported by different geopolitical actors (US, EU, China, Russia). The key contribution is the finding that LLMs, particularly Western ones, often rate policies endorsed by the US or EU more favorably than those endorsed by China or Russia, suggesting implicit geopolitical alignment.

Policy approval by endorser and model, no-justification sample. Bars report mean approval scores pooling the economic and security policy vignettes. Error bars report 95% confidence intervals.
Policy approval by endorser and model, no-justification sample. Bars report mean approval scores pooling the economic and security policy vignettes. Error bars report 95% confidence intervals.
cs.AIarxiv:2607.09415v1Lead article

Self-Guided Test-Time Training for Long-Context LLMs

Xinyu Zhu, Zhe Xu, Xiaohan Wei, Yunchen Pu, Fei Tian

his paper proposes a "Self-Guided Test-Time Training" (SG-TTT) method to improve how Large Language Models (LLMs) utilize long contexts. Instead of expensive full-context adaptation or noisy random sampling, SG-TTT intelligently selects relevant spans within the long input for instance-specific parameter tuning. This targeted adaptation significantly enhances LLM performance on long-context tasks by focusing training on useful information.

Overview of Self-Guided TTT. In Stage 1, the base LLM reads the long context and question, and identifies question-relevant spans from the context. In Stage 2, these selected spans are used for TTT. At inference time, the adapted model generates the answer conditioning on the original full context and the question.
Overview of Self-Guided TTT. In Stage 1, the base LLM reads the long context and question, and identifies question-relevant spans from the context. In Stage 2, these selected spans are used for TTT. At inference time, the adapted model generates the answer conditioning on the ori…
cs.AIarxiv:2607.09385v1Lead article

STEEL: Sparsity-Aware Fused Attention for Energy-Efficient Long-Sequence Inference on AMD's XDNA NPU

Victor J. B. Jung, Gagandeep Singh, Joseph Melber, Kristof Denolf, Francesco Conti

his paper introduces STEEL, an open-source implementation of FlashAttention optimized for energy-efficient long-sequence inference on AMD's XDNA NPUs. Its core method is a dataflow formulation of prefill attention that exploits spatial parallelism and on-chip memory, coupled with a sparsity-aware pipeline placement to mitigate load imbalance from causal masks. STEEL's contribution is enabling efficient on-device LLM inference for agentic workloads, addressing the challenges of NPU architectural diversity and data movement.

Overview of the software stack used to program the XDNA™ 2 NPU . The IRON library contains efficient ML operators written in Python and using C++ kernels. The Python bindings are lowered to LLVM IR by the MLIR-AIE compiler. The LLVM-AIE compiler generates binaries to run on the NPU ; the host-to- NPU interactions are handled by the XRT runtime. The entire stack is composed of open-source tools.
Overview of the software stack used to program the XDNA™ 2 NPU . The IRON library contains efficient ML operators written in Python and using C++ kernels. The Python bindings are lowered to LLVM IR by the MLIR-AIE compiler. The LLVM-AIE compiler generates binaries to run on the N…
cs.AIarxiv:2607.09623v1Lead article

Task-Specific Multimodal Question Answering Agents via Confidence Calibration and Incremental Reasoning for QANTA 2026

Nirjhar Das, Md. Al-Mamun Provath

his paper introduces a two-agent system for multimodal question answering, tailored for the QANTA 2026 challenge. The "Tossup" agent uses a smaller GPT model with confidence calibration and numeric reasoning to decide when to answer under uncertainty. The "Bonus" agent employs a larger GPT model with lead-in awareness for accurate answer selection and human adoption.

Overview of the proposed QANTA 2026 system. The Tossup agent combines evidence routing, confidence calibration, a Numeric Firewall, and expected-value-based buzzing, while the Bonus agent performs leadin-aware multimodal reasoning and evidence fusion.
Overview of the proposed QANTA 2026 system. The Tossup agent combines evidence routing, confidence calibration, a Numeric Firewall, and expected-value-based buzzing, while the Bonus agent performs leadin-aware multimodal reasoning and evidence fusion.
cs.AIarxiv:2607.09586v1Lead article

TrustX Agent Risk Classification Framework (ARC): Risk-Tiering Internally Created Agentic AI Systems

Hannah M. Liu, Rhea Saxena, Shiv Asthana

he TrustX Agent Risk Classification Framework (ARC) addresses the challenge of governing increasingly complex agentic AI systems. Its core method involves a twelve-dimension scoring rubric, combined with classification models and an autonomy framework, to quantify risk. ARC's contribution is a structured, repeatable instrument that produces a three-tier governance output with tailored control recommendations for various agentic AI systems.

cs.LGarxiv:2607.09287v1Lead article

Super-Tuning: From Activation-Aware Pruning to Sparse Fine-Tuning

Ivan Ilin, Philip Zmushko, Peter Richtárik

his paper introduces Super-Tuning, a novel sparse parameter-efficient fine-tuning (PEFT) method. It leverages activation-weighted magnitude scores from a calibration pass to identify crucial parameters for adaptation, reducing memory and compute costs. The method also proposes Supra, a hybrid adapter combining sparse updates with LoRA, achieving state-of-the-art accuracy in arithmetic tasks while maintaining a controlled trainable parameter budget.

Supra combines a sparse adapter based on Super weights with a low-rank adapter. To select the parameters for training in the sparse adapter, we employ the Wanda metric (Equation 1 ). The rank r r of the low-rank adapter is determined from the matched parameter-count budget using Equation 19 .
Supra combines a sparse adapter based on Super weights with a low-rank adapter. To select the parameters for training in the sparse adapter, we employ the Wanda metric (Equation 1 ). The rank r r of the low-rank adapter is determined from the matched parameter-count budget using …
cs.AIarxiv:2607.11698v1Lead article

Agent Hacks Agent: Autoresearch for Production-Agent Red-Teaming

Xutao Mao, Xiang Zheng, Cong Wang

his paper introduces AHA, an automated red-teaming method for LLM agents. AHA uses one agent to discover vulnerabilities in another by forming and testing hypotheses about unsafe behavior. Its core contribution is a falsifiable discovery loop that generates reusable vulnerability knowledge, represented in a Vulnerability Concept Graph, to improve agent safety.

AHA overview. An autoresearch loop turns executed red-team trajectories into a frozen, reusable VCG, the auditable artifact this paper produces and evaluates.
AHA overview. An autoresearch loop turns executed red-team trajectories into a frozen, reusable VCG, the auditable artifact this paper produces and evaluates.
cs.AIarxiv:2607.11689v1Lead article

From World Action Models to Embodied Brains: A Roadmap for Open-World Physical Intelligence

Yuanzhi Liang, Xufeng Zhan, Haibin Huang, Chi Zhang, Xuelong Li

his paper proposes a roadmap for developing physical intelligence by addressing fragmentation in current research. It identifies key gaps in model representation, standardization, and system composition, and introduces the concept of an "embodied brain" as a unified target. This embodied brain would integrate multimodal context, compare interventions, and issue action commands, fostering progress towards agents capable of reasoning and acting in the physical world.

System-level progression from WAM research to an embodied brain and a co-evolving physical-intelligence stack. WAMs provide a current route for studying intervention-conditioned prediction, while the embodied brain remains the broader target for reusable physical reasoning and intent formation.
System-level progression from WAM research to an embodied brain and a co-evolving physical-intelligence stack. WAMs provide a current route for studying intervention-conditioned prediction, while the embodied brain remains the broader target for reusable physical reasoning and in…
cs.AIarxiv:2607.11818v1Lead article

MM-ToolSandBox: A Unified Framework for Evaluating Visual Tool-Calling Agents

Kaixin Ma, Di Feng, Alexander Metz, Jiarui Lu, Eshan Verma

M-ToolSandBox is a unified framework and benchmark designed to evaluate visual tool-calling agents. It offers a stateful execution environment with over 500 tools across diverse domains, supporting complex multi-turn, multi-image tasks. The framework's contribution lies in its realistic simulation of conversational phenomena and its automated generation of challenging, visually grounded scenarios, revealing significant limitations in current agent capabilities.

cs.AIarxiv:2607.11683v1Lead article

RAGU: A Multi-Step GraphRAG Engine with a Compact Domain-Adapted LLM

Mikhail Komarov, Ivan Bondarenko, Stanislav Shtuka, Oleg Sedukhin, Roman Shuvalov

AGU is a modular GraphRAG engine that improves knowledge graph construction by separating extraction from consolidation, using a two-stage process with deduplication and summarization. Its core contribution is a compact, domain-adapted LLM (Meno-Lite-0.1) trained for language skills, which outperforms larger models in knowledge graph construction and matches them on GraphRAG tasks. This approach leads to more accurate and complete knowledge retrieval for LLMs.

Effect of model size on world-knowledge (CheGeKa) vs. language-skill (MultiQ) tasks in the Qwen2.5-Instruct family (F1 scores on MERA Fenogenova et al. ( 2024 ) ). CheGeKa F1 grows 21.1 × \( \times \) from 0.5 B to 72 B; MultiQ only 4 × \( \times \) . Log-linear slopes: 0.65 vs. 0.26.
Effect of model size on world-knowledge (CheGeKa) vs. language-skill (MultiQ) tasks in the Qwen2.5-Instruct family (F1 scores on MERA Fenogenova et al. ( 2024 ) ). CheGeKa F1 grows 21.1 × \( \times \) from 0.5 B to 72 B; MultiQ only 4 × \( \times \) . Log-linear slopes: 0.65 vs. …
cs.LGarxiv:2607.11751v1Lead article

When Local Monitors Miss Compositional Harm: Diagnosing Distributed Backdoors in Multi-Agent Systems

Yibo Hu, Ren Wang

his paper introduces the concept of "distributed backdoors" in multi-agent LLM systems, where a harmful payload is split across agents such that individual local checks pass. The core contribution is demonstrating that traditional local monitors are insufficient to detect these attacks because the fragments appear benign in isolation, creating an "observability boundary" that prevents detection.

cs.CLarxiv:2607.11783v1Lead article

How Temperature Shapes Ideological Discourse in Retrieval-Augmented Generation?

Elmira Salari, Hazem Amamou, José Victor de Souza, Shruti Kshirsagar, Maria Nunes Delfino

his paper investigates how ideological biases in retrieved information affect LLM outputs within Retrieval-Augmented Generation (RAG). Using Lexical Multidimensional Analysis on COVID-19 treatment articles, they identified three ideological discourses. By varying sampling temperatures, the study demonstrates that RAG can transmit, amplify, or suppress these ideological viewpoints in LLM-generated answers.

Factor scores.
Factor scores.
cs.CLarxiv:2607.11564v1Lead article

PaperRouter-Agent: A Content-Grounded LLM Agent for Personalized Hierarchical Paper Routing

Keshen Zhou, Lintao Wang, Suqin Yuan, Zhuqiang Lu, Yu Luo

his paper introduces PaperRouter-Agent, a novel LLM agent designed for personalized hierarchical paper routing. Its core method involves grounding routing decisions in the content of existing papers within user-defined folders, rather than relying solely on folder names. The agent's contribution is a training-free approach that effectively assigns new papers to a user's unique and evolving folder hierarchy by analyzing folder members and incorporating feedback.

Example: Comparison of a name-based baseline and the proposed content-grounded PaperRouter-Agent. While the baseline misclassifies a multimodal paper based solely on its title, the proposed agent accurately routes it to appropriate topical and metadata-defined folders.
Example: Comparison of a name-based baseline and the proposed content-grounded PaperRouter-Agent. While the baseline misclassifies a multimodal paper based solely on its title, the proposed agent accurately routes it to appropriate topical and metadata-defined folders.
cs.CLarxiv:2607.11444v1Lead article

UMoE:Unlocking Every Expert in Domain-Specific Training

Xuefeng Li, Pengfei Liu

his paper introduces UMoE, a method to optimize Mixture-of-Experts (MoE) models for domain-specific tasks. UMoE realigns the expert pool by pruning underperforming experts and regrowing new ones, preserving original model size and inference cost. This approach significantly improves domain-specific performance over standard fine-tuning without requiring per-domain hyperparameter tuning.

cs.AIarxiv:2607.12640v1Lead article

A Learning-Rate-Gated Failure of GRPO in a Small Language and Vision-Language Model Web Agent: A Controlled Null and Its Mechanism

Chengguang Gan, Zhixi Cai, Yunhao Liang, Hanjun Wei, Shiwen Ni

his paper investigates whether Reinforcement Learning from Human Feedback (RLHF), specifically Group Relative Policy Optimization (GRPO), improves the performance of small language and vision-language web agents. The study found that GRPO, even with extensive hyperparameter tuning, failed to credibly enhance the success rate of a strong supervised baseline on mastered tasks. Instead, moderate to high learning rates in GRPO actually degraded performance on the text track, suggesting it primarily reshapes existing behavior rather than adding new skills.

The question and the answer at a glance. GRPO adds no credible gain on tasks the agent has already mastered, but the same recipe gains 22 points where the reward is reachable by sampling.
The question and the answer at a glance. GRPO adds no credible gain on tasks the agent has already mastered, but the same recipe gains 22 points where the reward is reachable by sampling.
cs.AIarxiv:2607.12619v1Lead article

Agentic Service-Oriented Computing: A Manifesto for the Next Frontier of Service-Oriented Computing

Amin Beheshti, Rong N. Chang, Boualem Benatallah, Fabio Casati, Schahram Dustdar

his paper proposes Agentic Service-Oriented Computing (ASOC) to address the challenges of integrating LLM-powered agents into complex distributed systems. ASOC advocates for engineering agents as services and orchestrating them using established Service-Oriented Computing principles. Its core contribution is to provide a rigorous, principled approach for building dependable, trustworthy, and secure agent-based systems for enterprise and societal deployment.

The Agentic Service-Oriented Computing Stack. Six functional layers from human/organisational delegation (L1) to service and tool infrastructure (L6), with Governance and Observability and Security and Trust as cross-cutting planes. The Agent Harness (L3, amber) is the core ASOC mechanism converting autonomy into governed autonomy.
The Agentic Service-Oriented Computing Stack. Six functional layers from human/organisational delegation (L1) to service and tool infrastructure (L6), with Governance and Observability and Security and Trust as cross-cutting planes. The Agent Harness (L3, amber) is the core ASOC …
cs.AIarxiv:2607.12631v1Lead article

Can Induced Emotion Bias LLM Behaviors in Sequential Decision Making?

Minh Khoi Ho, Zihao Zhu, Runchuan Zhu, Levina Li, Zhiwen Fan

his paper investigates if induced emotions can bias Large Language Model (LLM) behavior in sequential decision-making, using the Iowa Gambling Task. The core method involves an imagination-based emotion induction procedure with LLMs. The main contribution is finding that, unlike humans, induced emotions generally do not significantly bias LLM decision-making, though anger shows a conditional effect.

An overview of our experiment design. (i) Context: an emotion scene is generated and used to elicit an affective state in LLM. (ii) Testbed (IGT game): four decks (A–D) with stationary reward/penalty profiles; after each choice, the agent receives reward/loss feedback and the running balance is updated. (iii) Agents that represent different cognitive architectures from observation to actions.
An overview of our experiment design. (i) Context: an emotion scene is generated and used to elicit an affective state in LLM. (ii) Testbed (IGT game): four decks (A–D) with stationary reward/penalty profiles; after each choice, the agent receives reward/loss feedback and the run…
cs.AIarxiv:2607.13034v1Lead article

Do AI Agents Know When a Task Is Simple? Toward Complexity-Aware Reasoning and Execution

Junjie Yin, Xinyu Feng

his paper introduces E3 (Estimate, Execute, Expand), a method for AI agents to assess task complexity and optimize resource usage. E3's core is **task-aware execution-scope estimation**, where agents first estimate effort, then execute a minimal path, and only expand if verification fails. This approach significantly reduces computational cost and unnecessary file inspections while maintaining high success rates.

The E3 framework. The agent estimates an initial operating point x 0 = ( d ^ , s ^ , r ^ , c ^ ) x_{0}=(\( \hat{d} \),\( \hat{s} \),\( \hat{r} \),\( \hat{c} \)) , executes a minimum viable path sized to x 0 x_{0} , and expands scope only when verification fails or confidence is low. Successful verification exits immediately.
The E3 framework. The agent estimates an initial operating point x 0 = ( d ^ , s ^ , r ^ , c ^ ) x_{0}=(\( \hat{d} \),\( \hat{s} \),\( \hat{r} \),\( \hat{c} \)) , executes a minimum viable path sized to x 0 x_{0} , and expands scope only when verification fails or confidence is l…
cs.AIarxiv:2607.12787v1Lead article

Do We Really Need Multimodal Emotion Language Models Larger Than 1B Parameters?

Kaiwen Zheng, Junchen Fu, Wenhao Deng, Hu Han, Joemon M. Jose

his paper questions the necessity of massive multimodal models for emotion recognition. It proposes Light-MER, a lightweight framework that uses knowledge distillation to transfer capabilities from larger models. This approach achieves competitive or better performance with significantly reduced computational cost, enabling efficient deployment on resource-constrained devices.

Figure 1. Large multimodal emotion models achieve strong performance but are difficult to deploy at the edge. Our goal is to preserve most of the performance of an 8B teacher while moving the deployment model below 1B parameters.
Figure 1. Large multimodal emotion models achieve strong performance but are difficult to deploy at the edge. Our goal is to preserve most of the performance of an 8B teacher while moving the deployment model below 1B parameters.
cs.AIarxiv:2607.12662v1Lead article

Internet of Agentic Things: Networked AI Agents for Closed-Loop IoT Orchestration

Quanyan Zhu

his paper introduces the Internet of Agentic Things (IoAT), a framework that unifies AI agents with IoT, cyber-physical systems, and digital twins for closed-loop orchestration. Its core method formalizes this as a coupled workflow-control problem, linking agentic planning with physical execution via a hylomorphic dynamic programming approach. The main contribution is this novel architecture and formalization, enabling autonomous, coordinated action across distributed cyber-physical environments, exemplified by smart building orchestration.

Network view of IoAT. Cloud and global agent networks provide planning, digital twins, knowledge, discovery, coordination, and marketplace services, while regional edge agent networks connect to local IoT device networks through secure agent-to-agent, agent-to-thing, and inter-edge links.
Network view of IoAT. Cloud and global agent networks provide planning, digital twins, knowledge, discovery, coordination, and marketplace services, while regional edge agent networks connect to local IoT device networks through secure agent-to-agent, agent-to-thing, and inter-ed…
cs.AIarxiv:2607.12659v1Lead article

Jetson-PI: Towards Onboard Real-Time Robot Control via Foresight-Aligned Asynchronous Inference

Zebin Yang, Qi Wang, Yunhe Wang, Xiurui Guo, Bo Yu

his paper introduces Jetson-PI, a method for real-time robot control using Vision-Language-Action (VLA) models on low-power onboard devices. It tackles the latency and misalignment issues of asynchronous inference by training a lightweight "future correction module" to predict future environment states. This allows the VLA model to act based on foresight, improving control frequency and reducing reaction time.

(a) Battery life of three robots equipped with four different computing devices. We use a 500 Wh WILLQ AGV lithium battery pack, and robot’s mechanical power consumption is included. (b) Power consumption and control frequency of different VLA inference on four computing devices: Jetson Orin, Jetson Thor, RTX A6000, and RTX 4090.
(a) Battery life of three robots equipped with four different computing devices. We use a 500 Wh WILLQ AGV lithium battery pack, and robot’s mechanical power consumption is included. (b) Power consumption and control frequency of different VLA inference on four computing devices:…
cs.AIarxiv:2607.12733v1Lead article

LLMs Can See the Smoke but not the Fire: Evaluating Abductive Reasoning with Elenchos

Julius Steiglechner, Lucas Mahler, Gabriele Lohmann

his paper introduces Elenchos, a framework for evaluating abductive reasoning in LLMs by treating it as an inverse problem. LLMs are tasked with identifying mutations in formal systems and inferring the specific rule changes that caused observed behavioral differences. The study finds that LLMs can often detect system alterations but struggle to pinpoint the exact causes, especially when multiple mutations interact.

The Elenchos audit loop. At each iteration, the agent submits a probe to two black-box kernels, K A K_{A} and K B K_{B} , one of which may be corrupted. The kernels return diagnostic tuples, O A O_{A} and O B O_{B} , that summarize how the probe was processed. These tuples constitute the agent’s observations (see Section 4 for details). Using the accumulated observations, the agent assesses whether there is sufficient evidence to identify the corrupted kernel and its active mutation set. If the evidence is insufficient, the agent issues another probe; otherwise, it outputs a hypothesis specifying the corrupted kernel and the inferred mutations.
The Elenchos audit loop. At each iteration, the agent submits a probe to two black-box kernels, K A K_{A} and K B K_{B} , one of which may be corrupted. The kernels return diagnostic tuples, O A O_{A} and O B O_{B} , that summarize how the probe was processed. These tuples consti…
cs.AIarxiv:2607.12893v1Lead article

MemOps: Benchmarking Lifecycle Memory Operations in Long-Horizon Conversations

Xixuan Hao, Zeyu Zhang, Zehao Lin, Yihang Sun, Ziliang Guo

his paper introduces MemOps, a novel benchmark for evaluating long-term memory in LLM agents. Instead of just assessing final answers, MemOps reformulates conversational memory as a sequence of explicit lifecycle operations (remembering, forgetting, updating, etc.). This allows for a more granular assessment of memory performance, identifying specific failure points beyond just incorrect outputs.

Comparison between existing long-term memory benchmark and our MemOps .
Comparison between existing long-term memory benchmark and our MemOps .
cs.AIarxiv:2607.12605v1Lead article

Multi-Perspective Agentic Program Repair via Code Property Graphs and Temporal Execution Graphs

Zhili Huang, Ling Xu, Hongyu Zhang

T-Repair addresses limitations in LLM-based program repair by representing code and execution data as queryable Code Property Graphs (CPGs) and Temporal Execution Graphs (TEGs). It employs a filtering pipeline to create compact TEGs and then uses three specialized agents (static, dynamic, hybrid) to generate evidence-grounded repair strategies. This multi-perspective approach leads to more focused and effective patch generation.

cs.AIarxiv:2607.13027v1Lead article

PalmClaw: A Native On-Device Agent Framework for Mobile Phones

Hongru Cai, Yongqi Li, Ran Wei, Wenjie Li

almClaw is a novel framework that enables Large Language Model (LLM) agents to run natively on mobile phones. Its core method involves exposing device capabilities as structured "device tools" that the agent can directly call, overcoming the limitations of traditional GUI-based mobile agents. This allows for more efficient and direct interaction with device features, leading to more powerful on-device task automation.

Overview of PalmClaw. (a) An externally hosted mobile agent exchanges GUI states and GUI actions between a desktop or cloud host and the phone. (b) PalmClaw runs the agent components on the mobile device and connects them to device resources and capabilities through device tools.
Overview of PalmClaw. (a) An externally hosted mobile agent exchanges GUI states and GUI actions between a desktop or cloud host and the phone. (b) PalmClaw runs the agent components on the mobile device and connects them to device resources and capabilities through device tools.
cs.AIarxiv:2607.12747v1Lead article

Tracing Agentic Failure from the Flow of Success

Samuel Yeh, Yiwen Zhu, Shaleen Deep, Sharon Li

his paper proposes OAT, an unsupervised method for identifying failure steps in LLM-based agents. OAT models the normal flow of successful task execution using neural controlled differential equations. At inference, it flags steps in a failed trajectory that deviate from this learned normal behavior, enabling lightweight failure attribution without requiring labeled failure data.

Overview of Oat . Oat learns to model the hidden path and to reconstruct the hidden representations of successful trajectories through Neural Control Differential Equations. At inference time, an expected successful path of a failure trajectory is predicted by Oat , and failure contributing steps are identified through anomaly scores calculated by the distance between the actual representation and the expected successful path.
Overview of Oat . Oat learns to model the hidden path and to reconstruct the hidden representations of successful trajectories through Neural Control Differential Equations. At inference time, an expected successful path of a failure trajectory is predicted by Oat , and failure c…
cs.CLarxiv:2607.12739v1Lead article

Epistemic Stance Flexibility Probing: Measuring Prompt-Conditioned Register Shift in Large Language Models

Binwen Liu, Yilin Ren

his paper introduces Epistemic Stance Flexibility Probing (ESFP), a new benchmark to measure how well large language models can shift their "epistemic register" – distinguishing between reporting expert opinions and expressing their own stance. ESFP uses carefully crafted prompts to assess this shift across various dimensions, offering a novel way to evaluate a model's ability to act as a trustworthy conversational agent by responding appropriately to different attribution requests.

cs.CLarxiv:2607.12884v1Lead article

Evaluating Large Language Models on Misconceptions in Multi-Turn Medical Conversations

Monica Munnangi, Saiph Savage

his paper introduces ThReadMed-QA, a novel multi-turn dialogue dataset designed to evaluate how well Large Language Models (LLMs) can detect and correct patient misconceptions in medical conversations. The core method involves analyzing LLM performance on this dataset to understand if they can identify and address false beliefs that evolve over multiple turns, a capability not captured by existing evaluation frameworks. The contribution lies in providing a systematic way to assess this crucial aspect of safe medical communication for LLMs.

A representative conversation thread from ThReadMed-QA . Misconception can emerge early in the conversation (left) or in the later turns (right). Physicians correct these and provide safe answers irrespective of where they appear.
A representative conversation thread from ThReadMed-QA . Misconception can emerge early in the conversation (left) or in the later turns (right). Physicians correct these and provide safe answers irrespective of where they appear.
cs.CLarxiv:2607.12625v1Lead article

KnowAct-GUIClaw: Know Deeply, Act Perfectly, Personal GUI Assistant with Self-Evolving Memory and Skill

Yunxin Li, Jinchao Li, Shibo Su, Zhenran Xu, Chenrui Zhao

his paper introduces KnowAct-GUIClaw, a novel framework that enhances agent capabilities for complex GUI automation. Its core method is the "Know Deeply, Act Perfectly" paradigm, which unifies cognitive understanding and operational execution by leveraging accumulated user interaction and task experience. The main contribution is a self-evolving memory and skill mechanism that overcomes OpenClaw's limitations in cross-platform GUI interaction and continuous learning, leading to improved accuracy and efficiency.

The success rate (SR) comparison on MobileWorld GUI-Only tasks. The bars summarize Table 1 together with the additional Kimi-based KnowAct-GUIClaw runs; gray bars denote specialized GUI models, colored external bars denote general model families, and highlighted bars denote KnowAct-GUIClaw variants with memory and skills. The experimental results show that KnowAct-GUIClaw achieves SOTA performance and that the memory and skill are effective for different base models.
The success rate (SR) comparison on MobileWorld GUI-Only tasks. The bars summarize Table 1 together with the additional Kimi-based KnowAct-GUIClaw runs; gray bars denote specialized GUI models, colored external bars denote general model families, and highlighted bars denote KnowA…
cs.AIarxiv:2607.13716v1Lead article

CAVA: Canonical Action Verification and Attestation for Runtime Governance of Agentic AI Systems

Zexun Wang

AVA addresses the challenge of governing agentic AI systems by creating a "runtime-semantics layer." Its core method is to convert diverse runtime records of agent actions into standardized, "canonical runtime action objects." This allows for consistent verification and attestation of actions, ensuring that approved actions can be reliably traced and reproduced.

cs.AIarxiv:2607.13643v1Lead article

Consensus as Privileged Context for Label-Free Self-Distillation

John Gkountouras, Josip Jukić, Ivan Titov

his paper introduces CANON, a label-free self-distillation method that leverages consensus among multiple model-generated solutions. Instead of just filtering or rewarding, CANON uses the majority answer as dense, token-level supervision to train a model on its own outputs. This approach extracts richer information from consensus, leading to improved reasoning accuracy without requiring labeled data.

Canon training framework. Given an unlabeled prompt, the model samples N N solutions and extracts the majority answer. A frozen snapshot of the model, conditioned on a consensus solution, serves as a dense per-token teacher; the student is trained on its own rollouts to follow the lead line set by their consensus, without seeing it. Gradients never flow into the teacher. A single generation pass provides both the consensus and the distillation substrate.
Canon training framework. Given an unlabeled prompt, the model samples N N solutions and extracts the majority answer. A frozen snapshot of the model, conditioned on a consensus solution, serves as a dense per-token teacher; the student is trained on its own rollouts to follow th…
cs.AIarxiv:2607.14049v1Lead article

Deep Interaction: An Efficient Human-AI Interaction Method for Large Reasoning Models

Hefeng Zhou, Jinxuan Zhang, Jiong Lou, Yuxin Liu, Chaochao Lu

his paper introduces "Deep Interaction," an efficient method for correcting reasoning errors in large language models. Instead of re-generating entire responses, it allows users to directly edit faulty steps in the model's reasoning chain. This edited chain is then refined into a prompt that guides the model to follow the corrected path, significantly improving correction success and reducing token usage.

A simple case shows the different pipeline between dialogue-based method and Deep Interaction. Dialogue-based feedback may leave the model on an incorrect reasoning trajectory, while Deep Interaction enables more fine-grained editing of the CoT.
A simple case shows the different pipeline between dialogue-based method and Deep Interaction. Dialogue-based feedback may leave the model on an incorrect reasoning trajectory, while Deep Interaction enables more fine-grained editing of the CoT.
cs.AIarxiv:2607.13594v1Lead article

SAFETY SENTRY: Context-Aware Human Intervention via EXECUTE-ASK-REFUSE Routing

Tianyu Chen, Chujia Hu, Wenjie Wang

his paper introduces Safety Sentry, a novel method for LLM agent safety that moves beyond binary safe/unsafe classifications. It reframes intervention as a three-way routing decision (EXECUTE, ASK, REFUSE) for each individual action, considering both the action's inherent risk and the user's context. This approach aims to reduce unnecessary interruptions and improve the accuracy of safety interventions by providing more nuanced and context-aware guidance.

Conventional binary guards lump distinct cases under a single Unsafe label. Safety Sentry routes each action into one of three per-instance decisions: Execute , Ask , or Refuse .
Conventional binary guards lump distinct cases under a single Unsafe label. Safety Sentry routes each action into one of three per-instance decisions: Execute , Ask , or Refuse .
cs.AIarxiv:2607.13998v1Lead article

The Dynamic Verifiable Multi-Agent Human Agentic Loyalty Loop (DVM-HALL) Model and the Net Human-Agent Score (NHAS) in Autonomous Commerce

Sai Srikanth Madugula, Peplluis Esteva de la Rosa, Daya Shankar

his paper introduces the DVM-HALL model and the NHAS score to address how autonomous AI agents are changing customer loyalty. The DVM-HALL model quantifies brand choice by considering human emotions, AI utility, trust, and verifiable actions, while the NHAS score aims to measure this evolving loyalty in autonomous commerce.

The Tripartite DVM-HALL Architecture, illustrating the bidirectional flows of trust, algorithmic loyalty, and emotional brand equity governed by overarching oversight frameworks across a multi-agent marketplace (human, personal agent, seller agents, and payment/settlement agents).
The Tripartite DVM-HALL Architecture, illustrating the bidirectional flows of trust, algorithmic loyalty, and emotional brand equity governed by overarching oversight frameworks across a multi-agent marketplace (human, personal agent, seller agents, and payment/settlement agents)…
cs.CLarxiv:2607.13920v1Lead article

DeepStress: Stress-Testing Deep Search Agents

Ismael Rousseau, Geraldine Damnati, Frederic Bechet

eepStress is a novel framework designed to stress-test deep search agents by systematically controlling the quality of evidence they receive. It achieves this by replacing the retrieval module with a synthetic environment that manipulates document trustworthiness, relevance, and factuality. The paper's contribution lies in identifying significant differences in agent robustness to unreliable information and proposing new metrics to better evaluate these systems.

cs.CLarxiv:2607.13753v1Lead article

Post-Training Shifts Confidence: A Three-Stage Analysis of How SFT, RL, and OPD Shape Pre-, Intra-, and Post-CoT Calibration

Shuhao Li, Guodong Du, Anhao Zhao, Wanyu Lin, Tianyu Yuan

his paper introduces a three-stage calibration framework to analyze how post-training methods (SFT, RL, OPD) affect large language model confidence during chain-of-thought reasoning. The core contribution is demonstrating that different methods excel at different stages: OPD for pre-reasoning difficulty estimation, SFT for early termination, and RL for aggregating reasoning steps. This work highlights the importance of evaluating confidence beyond final accuracy and reveals position-dependent calibration patterns.

Overview of the three-stage reasoning calibration framework. Confidence is evaluated before, during, and after chain-of-thought generation, corresponding to difficulty estimation, early termination, and answer aggregation.
Overview of the three-stage reasoning calibration framework. Confidence is evaluated before, during, and after chain-of-thought generation, corresponding to difficulty estimation, early termination, and answer aggregation.
cs.CLarxiv:2607.13683v1Lead article

Self-Evolving Agent Harnesses via Gated Semantic Quality-Diversity

Xiaotian Luo, Fengxingyu Wang, Chuanrui Hu, Dizhan Xue, Yafeng Deng

his paper introduces a framework for automatically improving LLM agent harnesses (prompts, knowledge, etc.) without modifying the LLM weights. It achieves this by separating the generation of harness changes from their evaluation, using a language model to propose patches and deterministic code for trustworthy measurement and significance testing. The core contribution is a robust method for crediting harness improvements, ensuring they are genuine performance gains rather than artifacts.

The self-evolution loop. A Task Agent runs the train tasks; Scoring returns per-task results and failure signals; the Evolver diagnoses ( where × \( \times \) why ) pathologies and designs patches, a preflight prune dropping inert candidates before any rollout. Persistent state (GSME archive + + git tree) is written only by gated commits; the best harness is scored once on the sealed test.
The self-evolution loop. A Task Agent runs the train tasks; Scoring returns per-task results and failure signals; the Evolver diagnoses ( where × \( \times \) why ) pathologies and designs patches, a preflight prune dropping inert candidates before any rollout. Persistent state (…
cs.AIarxiv:2607.15053v1Lead article

ANet Patu-1: The Value of Connection in the Agent Network

Mu Yuan, Jinke Song, Zhaomeng Zhou, Lan Zhang

his paper introduces ANet Patu-1, a self-organizing consensus protocol for AI agents. It models the value of agent networks based on coordination group size, deriving properties for optimal collaboration. ANet Patu-1 continuously reforms coalitions to achieve $O(1)$ parallel consensus rounds, adaptively capturing the benefits of different network structures. Its contribution lies in demonstrating how emergent, heterogeneous agent groups can achieve compounding collective value as their size increases.

The emergence crossover. A crowd of the cheapest model ( gpt-4o-mini ), when heterogeneous, starts weak at n = 1 n\!=\!1 but its value-of-connection score Q Q compounds as complementary specialists connect—and overtakes a crowd of a far stronger model ( gpt-5.6 ) that is homogeneous and sits in a mid band Q ≈ 0.54 Q\!\( \approx \)\!0.54 ( [ 0.40 , 0.66 ] [0.40,0.66] , measured): however capable each copy is, they default to a tree / central-coordinator design, so its structure—and value—is capped. The crossover at n ⋆ ≈ 2.6 n^{\( \star \)}\!\( \approx \)\!2.6 is the emergence of a collaboration scaling law— many cheap, diverse, connected agents beat a copied strong one.
The emergence crossover. A crowd of the cheapest model ( gpt-4o-mini ), when heterogeneous, starts weak at n = 1 n\!=\!1 but its value-of-connection score Q Q compounds as complementary specialists connect—and overtakes a crowd of a far stronger model ( gpt-5.6 ) that is homogene…
cs.AIarxiv:2607.14818v1Lead article

Can LLMs Build a MaxSAT Solver from Papers? The CoreForge Experience

Ruben Martins

oreForge demonstrates the feasibility of using LLMs like ChatGPT and Codex to construct an unweighted MaxSAT solver by interpreting research papers. The project's core method involves an iterative workflow of LLM-assisted paper discussion, code generation, and revision, culminating in a solver incorporating several advanced MaxSAT techniques. The main contribution is showing LLMs can aid solver development from literature, though external validation and human oversight remain crucial.

cs.AIarxiv:2607.15275v1Lead article

RoboTTT: Context Scaling for Robot Policies

Yunfan Jiang, Yevgen Chebotar, Ruijie Zheng, Fengyuan Hu, Yunhao Ge

oboTTT introduces a novel method for scaling robot policy context to 8,000 timesteps by integrating Test-Time Training (TTT) into foundation models. This allows the model to compress long histories into fast, gradient-updated weights, enabling new capabilities like one-shot imitation and improved performance on long-horizon tasks without increasing inference latency. The core contribution is demonstrating that significantly extending pretraining context length leads to steady, closed-loop performance gains in robotic manipulation.

cs.AIarxiv:2607.14896v1Lead article

StructureClaw: Traceable LLM Agents and an Executable Benchmark for Structural Engineering Workflows

Sizhong Qin, Yi Gu, Yao Jiang, Ao Cai, Changjian Zhou

tructureClaw introduces an artifact-centered workbench for LLM agents in structural engineering, enabling them to generate a complete chain of interdependent engineering artifacts. Its core method involves governed skills, typed tools, and local backends to ensure traceability and executability. The contribution is an executable benchmark, StructureClaw-Bench, which rigorously evaluates LLM agents on their ability to complete entire structural engineering workflows, not just generate fluent text.

From a structural-engineering request to reviewable evidence. Unlike a text-only response, StructureClaw preserves the skills, tool executions, and artifacts that support the reported result.
From a structural-engineering request to reviewable evidence. Unlike a text-only response, StructureClaw preserves the skills, tool executions, and artifacts that support the reported result.
cs.AIarxiv:2607.15216v1Lead article

Symbal: Detecting Systematic Misalignments in Model-Generated Captions

Maya Varma, Jean-Benoit Delbrouck, Sophie Ostmeier, Akshay Chaudhari, Curtis Langlotz

his paper introduces Symbal, a method for detecting systematic misalignments in MLLM-generated captions, where errors consistently relate to specific visual features. Symbal uses a dual-stage approach with existing foundation models to identify and summarize these recurring captioning errors. The authors also present SymbalBench, a large benchmark dataset for evaluating such detection methods.

Given an input dataset with thousands of images and paired MLLM-generated captions, the systematic misalignment detection task involves identifying recurring textual errors and associated visual features. Here, we provide example image-caption pairs from two datasets in SymbalBench with expected outputs.
Given an input dataset with thousands of images and paired MLLM-generated captions, the systematic misalignment detection task involves identifying recurring textual errors and associated visual features. Here, we provide example image-caption pairs from two datasets in SymbalBen…
cs.LGarxiv:2607.15207v1Lead article

BadWAM: When World-Action Models Dream Right but Act Wrong

Qi Li, Xingyi Yang, Xinchao Wang

his paper introduces BadWAM, a framework for evaluating adversarial attacks on World-Action Models (WAMs). It demonstrates that small visual perturbations can disrupt the crucial alignment between a WAM's predicted future and its actual actions, leading to incorrect execution. BadWAM characterizes these "World-Action Drift Attacks" based on their strength and stealthiness.

Empirical motivation for world-action adversarial attacks. Failed episodes tend to have larger action shifts, while predicted-future shifts overlap across successful and failed executions. This motivates attacking the alignment between action and imagination.
Empirical motivation for world-action adversarial attacks. Failed episodes tend to have larger action shifts, while predicted-future shifts overlap across successful and failed executions. This motivates attacking the alignment between action and imagination.
cs.CLarxiv:2607.15253v1Lead article

Bridge Evidence: Static Retrieval Utility Does Not Predict Causal Utility in Multi-Step Agentic Search

Debayan Mukhopadhyay, Utshab Kumar Ghosh, Shubham Chatterjee

his paper argues that traditional static retrieval utility, which measures a document's usefulness in isolation, fails to capture its true value in multi-step agentic search. The core method involves a counterfactual analysis where documents are removed from an agent's search history to measure their impact on subsequent actions and the final answer quality. The contribution is demonstrating that static retrieval utility is a poor predictor of this dynamic, causal utility in agentic search.

cs.AIarxiv:2607.15901v1Lead article

DSWorld: A Data Science World Model for Efficient Autonomous Agents

Zherui Yang, Fan Liu, Hao Liu

his paper introduces DSWorld, a Data Science World Model designed to predict the outcomes of data science operations before execution, thereby reducing costly trial-and-error. The core method involves constructing structured states, routing operations efficiently, and using a lightweight simulator combined with an LLM for expensive computations. DSWorld's contribution lies in its ability to significantly accelerate the training of autonomous data science agents by enabling them to anticipate and learn from simulated environments.

cs.AIarxiv:2607.16175v1Lead article

Evaluating Open-Weight LLMs for Generating Structured Threat Information for Autonomous Vehicle Vulnerabilities

Md Erfan, Ahmed Ryan, Md Kamal Hossain Chowdhury, Md Rayhanur Rahman

his paper evaluates open-weight Large Language Models (LLMs) for automatically generating structured threat information (STIX) from plain-text descriptions of vulnerabilities in Connected and Autonomous Vehicles (CAVs). The core method involves creating a dataset (CAV-STIXGen) to train and evaluate LLMs in mapping CAV CVEs to STIX objects, CWE, and MITRE ATT&CK tactics. The contribution is a novel approach to efficiently extract actionable security intelligence for CAVs, enabling better risk mitigation.

An Example of CVE Description to STIX Generation.
An Example of CVE Description to STIX Generation.
cs.AIarxiv:2607.15845v1Lead article

Knowledge-Centric Agents for Workflow Generation

Zhendong Li, Lei Sun, Ruibo Ming, He Zhang, Danda Pani Paudel

his paper proposes a **knowledge-centric framework** for generating complex visual creation workflows, moving beyond simple text-to-JSON generation. The core method involves **knowledge inversion** to create hierarchical representations of workflow knowledge and **knowledge injection** through fine-tuning to enable reasoning from task descriptions to effective strategies. The main contribution is a novel approach that models and leverages explicit knowledge to improve the structural robustness and expert-level reasoning capabilities of workflow generation systems.

cs.LGarxiv:2607.16028v1Lead article

CLaC@FinMMEval 2026 Task 3: Sentiment-Augmented Deep Reinforcement Learning for Active Trading -- An Alpha-Reward Approach

Andrei Neagu, Eeham Khan, Leila Kosseim

his paper proposes a sentiment-augmented deep reinforcement learning approach for active cryptocurrency and stock trading. The core method involves training agents using technical indicators, calendar encodings, and news sentiment, with a novel alpha reward function to encourage outperformance over buy-and-hold strategies. The main contribution is demonstrating the effectiveness of this combined approach, particularly with DDPG, in achieving superior trading performance on the FinMMEval 2026 Task 3 benchmark.

cs.LGarxiv:2607.15942v1Lead article

More with Less: a Large Scale Remote Sensing VLM with a Simple Recipe

Stefan Maria Ailuro, Mario Markov, Mohammad Mahdi, Luc Van Gool, Danda Pani Paudel

his paper demonstrates that a general-purpose vision-language model, trained at a large scale with diverse remote sensing data and tasks, can achieve state-of-the-art performance without specialized architectures. Its core method is a single language policy that can generate text or invoke a localization tool, trained using multi-task reinforcement learning with adaptive rewards. The contribution is showing that architectural specialization is not essential for high performance in remote sensing VLM tasks.

Diverse multi-task training drives out-of-distribution generalization in remote sensing. (a) OOD gain over the base model during multi-task RL training, aggregated per task-domain. For robustness test the training is performed a second time with different seed and paraphrased prompts. (b) Final OOD gain vs. number of training sources per domain; for visualization, detection excludes a x7.6 gain outlier, XLRS-Bench. (c) Training mixture by task and input type; 80k samples balanced from a 2.3M pool.
Diverse multi-task training drives out-of-distribution generalization in remote sensing. (a) OOD gain over the base model during multi-task RL training, aggregated per task-domain. For robustness test the training is performed a second time with different seed and paraphrased pro…
cs.LGarxiv:2607.16184v1Lead article

PagedWeight: Efficient MoE LLM Serving with Dynamic Quality-Aware Weight Quantization

Yuchen Yang, Yifan Zhao, Anisha Dasgupta, Sasa Misailovic

agedWeight addresses the memory bottleneck in serving Mixture-of-Experts (MoE) LLMs by dynamically quantizing expert weights at runtime. This method intelligently balances the precision of model weights with the growing KV cache, optimizing the trade-off between accuracy, memory usage, and performance. PagedWeight significantly improves memory efficiency and throughput while maintaining high model quality.

Static quantization fixes MoE weights; PagedWeight offloads weight pages to free KV cache headroom.
Static quantization fixes MoE weights; PagedWeight offloads weight pages to free KV cache headroom.
cs.CLarxiv:2607.15865v1Lead article

An MLIR-Based Compilation Method for Large Language Models

Pengchao Hu, Zhibin Xin, Yifan Chen, Yangyang Zhou, Liang Wang

his paper introduces an MLIR-based compilation method for Large Language Models (LLMs) to address deployment challenges on AI accelerators. It utilizes two dialects: TopOp for high-level, framework-independent model representation and TpuOp for target hardware-specific optimizations like quantization and memory layout. The core contribution lies in a layered lowering process from TopOp to TpuOp, enabling efficient autoregressive inference scheduling under memory constraints.

Relationship between TopOp and TpuOp.
Relationship between TopOp and TpuOp.
cs.CLarxiv:2607.16001v1Lead article

BayesPO: Bayesian Prompt Optimization via Parallel-Tempered Gradient-Guided Discrete MCMC

Junjie Zhou, Zhijian Ou

his paper frames prompt optimization as Bayesian posterior sampling, combining a task-specific likelihood with a language model prior to favor effective and fluent prompts. The core method, BayesPO, uses gradient-guided discrete Markov Chain Monte Carlo (MCMC) to efficiently explore the prompt space. Its contribution lies in a principled, Bayesian approach to prompt optimization that leverages gradients for guided discrete sampling, improving upon heuristic methods.

cs.CLarxiv:2607.15766v1Lead article

Before the Action: Benchmarking LLMs on Prospective Hypothesis Discovery

Tianyun Zhong, Wangyi Jiang, Wei Wang, Xuanang Chen, Yaojie Lu

his paper introduces Prospective Hypothesis Discovery (PHD), a new benchmark for evaluating Large Language Models' (LLMs) ability to generate testable hypotheses from incomplete evidence, rather than just answering pre-defined questions. The authors developed HypoArena, a benchmark of 988 cases, and a method called Retrospective Context Regression to create these pre-conclusion scenarios. Their contribution lies in measuring and enabling LLMs to autonomously drive scientific discovery by formulating promising avenues for future research.

From reactive QA to prospective hypothesis discovery. Conventional QA hands the model a pre-formed question ( reactive ). HypoArena instead reconstructs a real-world context in pre-conclusion form and asks the model to proactively construct a plausible hypothesis space—the capability we term Prospective Hypothesis Discovery (PHD).
From reactive QA to prospective hypothesis discovery. Conventional QA hands the model a pre-formed question ( reactive ). HypoArena instead reconstructs a real-world context in pre-conclusion form and asks the model to proactively construct a plausible hypothesis space—the capabi…
cs.CLarxiv:2607.16072v1Lead article

Frontier Language Models Struggle to Copy: Text Can Be Better Viewed in 2D

Haodong Wen, Yiran Zhang, Yingfa Chen, Kaifeng Lyu

his paper reveals that even advanced LLMs struggle with exact string copying, attributing this to the limitations of 1D positional encodings. To solve this, they introduce 2D-RoPE, which represents text as a 2D grid, making copying a simple retrieval task. This novel approach enables shallow Transformers to achieve perfect copying on much longer sequences than previously possible.

Frontier language models struggle to perform two representative copy tasks, the binary copy and Python list conversion tasks, while our 2D-RoPE models achieve significantly better performance. See Section ˜ 3.1 for details on the benchmark construction.
Frontier language models struggle to perform two representative copy tasks, the binary copy and Python list conversion tasks, while our 2D-RoPE models achieve significantly better performance. See Section ˜ 3.1 for details on the benchmark construction.
cs.CLarxiv:2607.16117v1Lead article

Rate-Utility Frontiers for Language Encodings: Comparing Tokens, Bytes, and Pixels Under Controlled Linguistic Content

Ingo Ziegler, Martin Krebs, Desmond Elliott

his paper introduces a method to compare different text encodings (tokens, bytes, pixels) by controlling both linguistic content and model capacity. By sweeping a shared bottleneck, they trace rate-utility frontiers to disentangle input positions, latent capacity, and task-relevant information. Their contribution is demonstrating that no single encoding universally excels, with pixels best for surface form and bytes for cross-lingual alignment.

The same linguistic content produces different source rates across encodings and languages. Each column shows a translation of the same SIB-200 sentence, with token, byte, and pixel patch lengths annotated. A fixed input length does not expose equal content across representations to a model. For example, Chinese is longer than English in tokens, even with tokenizers re-trained on matched-content and regime specific languages, but shorter in bytes and patches. Our experiments examine how source rate differences interact with bottleneck capacity across tasks that require different kinds of information.
The same linguistic content produces different source rates across encodings and languages. Each column shows a translation of the same SIB-200 sentence, with token, byte, and pixel patch lengths annotated. A fixed input length does not expose equal content across representations…
cs.AIarxiv:2607.17946v1Lead article

A Geometric Perspective on Stabilizing Value Conflict Resolution

Saket Reddy, Andy Liu

his paper proposes using Chain-of-Thought (CoT) reasoning to stabilize value conflict resolution in LLMs, which are often hindered by compressed scalar rewards in RLHF. Geometrically, CoT smooths the model's loss landscape, improving optimization stability. The authors introduce a novel CoT design that further enhances this smoothing, leading to improved moral reasoning performance on downstream tasks.

Overview of our training methods and their corresponding effects on loss landscape geometry. Base RLHF leads to unstable value conflict resolution, indicated by a high top Hessian eigenvalue and high curvature in the sharpest direction of the loss landscape. Base SFT smooths the sharpest direction of the landscape, indicated by a low top eigenvalue and low maximum curvature. Both standard and annealing CoT lead to even more smooth local landscapes, indicated by an even lower top eigenvalue and maximum curvature.
Overview of our training methods and their corresponding effects on loss landscape geometry. Base RLHF leads to unstable value conflict resolution, indicated by a high top Hessian eigenvalue and high curvature in the sharpest direction of the loss landscape. Base SFT smooths the …
cs.AIarxiv:2607.18100v1Lead article

Can We Break LLMs Out of Self-Loops? Fine-Grained Reasoning Control with Activation Steering

Sheldon Yu, Tong Yu, Xunyi Jiang, Rohan Surana, Gagan Mundada

his paper introduces SOPHIA, a method to control the reasoning process of LLMs by intervening on their internal latent states. It identifies that LLMs can get stuck in "self-loops" during extended reasoning and proposes to steer these processes by manipulating activations at inference time, offering fine-grained control beyond prompt-based methods.

Self-loops in LRM reasoning traces. The model computes the correct value early (purple, $64) but cycles through redundant verification and re-questioning steps (red) before committing, wasting budget on work it has already done. Box colors denote latent reasoning states K = 5 K=5 that are induced unsupervisedly from activations rather than assigned from a hand-defined thought taxonomy Chen et al. ( 2025 ) , with transitions discovered automatically from generated traces. This makes failure modes like the loop above targetable as transition events at finer granularity than token- or prompt-level control allows.
Self-loops in LRM reasoning traces. The model computes the correct value early (purple, $64) but cycles through redundant verification and re-questioning steps (red) before committing, wasting budget on work it has already done. Box colors denote latent reasoning states K = 5 K=5…
cs.AIarxiv:2607.17935v1Lead article

DeLIVeR: Decomposed Learning for Information-grounded Veracity Recognition via Reinforced Knowledge Graph Exploration

Cong Hoan Nguyen, Thomas Hoang, Hieu Minh Duong, Long Nguyen

eLIVeR tackles fact-checking by treating evidence retrieval as a reinforced exploration task. It uses a Planner LLM to break down claims into questions, which then strategically navigate Knowledge Graphs to find precise evidence. This approach significantly improves veracity recognition by prioritizing diverse and accurate information, outperforming existing methods.

Comparison of fake news detection systems for the Mona Lisa theft claim.
Comparison of fake news detection systems for the Mona Lisa theft claim.
cs.AIarxiv:2607.17999v1Lead article

Do Maps Still Matter for Machines: Revisiting the Role of Choropleth Maps in Foundation Model Spatial Understanding

Zhiwei Wei, Yonghe Sun, Zhenjia Liu, Wenjia Xu, Chao He

his paper investigates the utility of choropleth maps for foundation models' spatial understanding. It introduces a benchmark, ChoroplethMap-Bench, to evaluate models under different input conditions (data only, map only, data + map). The study finds that maps significantly enhance spatial reasoning, particularly for complex tasks and when combined with structured data.

Overview of the ChoroplethMap-Bench construction and evaluation framework. The benchmark contains 2,400 synthetic choropleth maps, their corresponding GeoJSON data, and 12,000 multiple-choice questions covering five spatial-understanding dimensions. Foundation models are evaluated under three input conditions—Data + Map, Data Only, and Map Only—and the results are further analyzed with respect to model performance, cartographic design factors, prompting strategies, language, geographic context, decoding settings, classification methods, and response stability.
Overview of the ChoroplethMap-Bench construction and evaluation framework. The benchmark contains 2,400 synthetic choropleth maps, their corresponding GeoJSON data, and 12,000 multiple-choice questions covering five spatial-understanding dimensions. Foundation models are evaluate…
cs.AIarxiv:2607.17979v1Lead article

Harness Engineering for LLM-Driven GPU Kernel Generation

Yue Shui, Chenyu Ma, Hangfei Xu, Shengzhao Wen, Yanpeng Wang

his paper introduces a harness-centered system for LLM-driven GPU kernel generation. The core method separates an evaluation harness (ensuring compilation, correctness, and timing) from an optimization controller that uses profiler data to guide LLM candidate generation. The contribution lies in this structured approach, which effectively leverages LLMs to produce optimized GPU kernels, achieving significant speedups over baselines.

Closed-loop harness/controller workflow used for CUDA kernel optimization. The harness measures, archives, and promotes candidates, while the controller structures prompt construction, candidate generation, profiling feedback, and trajectory memory.
Closed-loop harness/controller workflow used for CUDA kernel optimization. The harness measures, archives, and promotes candidates, while the controller structures prompt construction, candidate generation, profiling feedback, and trajectory memory.
cs.AIarxiv:2607.17994v1Lead article

HAS: Highlight-guided Attention Steering for Multimodal LLM Video Summarization

Rui Chu, Yingjie Lao

his paper introduces HAS, a novel method for multimodal LLM video summarization. HAS addresses limitations of existing approaches by steering the LLM's attention towards globally important frames, rather than just discrete selected ones. This highlight-guided attention steering aims to improve summarization coherence and retain more crucial information from the video.

Top: Unlike prior works assign discrete importance scores and hard-select a few highlights before summarizing, HAS preserves the full video context and treats highlighting as continual attention guidance through steering vector. Bottom: While smoothly bias a frozen video MLLM toward highlight moments, HAS does not neglect the peace time steps, better exploiting model capacity while reducing missed evidence for more coherent and faithful summaries.
Top: Unlike prior works assign discrete importance scores and hard-select a few highlights before summarizing, HAS preserves the full video context and treats highlighting as continual attention guidance through steering vector. Bottom: While smoothly bias a frozen video MLLM tow…
cs.AIarxiv:2607.18029v1Lead article

Natural Language Access to Domain-Specific Metadata: A Reusable Framework for LLM Query Generation

Blake G. Fitch, Cato Elia Kurtz

his paper presents the NLKGQ system, a framework that allows users to query domain-specific metadata using natural language. The core method involves using LLMs to translate natural language questions into structured SPARQL queries, leveraging a formal OWL ontology to capture domain knowledge. The main contribution is a reusable, zero-shot approach that enables non-expert users to access and query complex archives without requiring fine-tuning or specialized query language skills.

Figure 1. MRI Research Ontology (MRO) class diagram. Classes are connected by object properties (arrows).
Figure 1. MRI Research Ontology (MRO) class diagram. Classes are connected by object properties (arrows).
cs.AIarxiv:2607.18163v1Lead article

OR Else: A Differentiable Trust Region for Policy Optimization

Chinmay Rane, Kanishka Tyagi, Michael Manry

his paper introduces "Output Reset" (OR), a novel, differentiable saturation rule for policy optimization in reinforcement learning. OR replaces the abrupt clipping in methods like PPO with a smooth, one-sided saturation, aiming to improve stability and performance, particularly for large language models. The core contribution is demonstrating that OR, when integrated into PPO and GRPO, can lead to higher reward model scores compared to their clipped counterparts on the Anthropic hh-rlhf dataset.

Training-time reward-model score over 500 rollout steps for all four methods, with three seeds per method. Curves are smoothed with a moving window of 10 steps, and shaded regions denote ± 1 \( \pm \) 1 standard deviation across seeds. The shared reward scale supports descriptive within-experiment comparisons, but its numerical zero is not calibrated as a success threshold.
Training-time reward-model score over 500 rollout steps for all four methods, with three seeds per method. Curves are smoothed with a moving window of 10 steps, and shaded regions denote ± 1 \( \pm \) 1 standard deviation across seeds. The shared reward scale supports descriptive…
cs.AIarxiv:2607.18081v1Lead article

SelectInfer: Selective Neuron Loading and Computation for On-Device LLMs

Huzaifa Shaaban Kabakibo, Eric Schniedermeyer, Artem Burchanow, Lin Wang

electInfer addresses the challenge of deploying LLMs on edge devices by introducing a neuron-level optimization framework. Its core method involves profiling to identify important neurons and then selectively loading and computing only these neurons during inference. This selective approach significantly reduces memory footprint and computational cost without requiring re-training, enabling efficient LLM deployment on resource-constrained devices.

SelectInfer has two phases: offline (left) and online (right). In the offline phase, we run a profiler to generate neuron files. In the online phase, selective loading reduces memory usage, while selective computation lowers computational overhead.
SelectInfer has two phases: offline (left) and online (right). In the offline phase, we run a profiler to generate neuron files. In the online phase, selective loading reduces memory usage, while selective computation lowers computational overhead.
cs.AIarxiv:2607.17884v1Lead article

ST-Veto: Spatio-Temporal Token Veto for Diffusion MLLMs via Taylor Prediction and Visual Grounding

Keuntae Kim, Beomseok Lee, Hyunwoo Kim, Yong Suk Choi

T-Veto enhances diffusion multimodal large language models (dMLLMs) by identifying and replacing problematic tokens during generation. It uses Taylor prediction to detect temporally unstable tokens and visual grounding to filter those with weak image connections, leading to improved reasoning accuracy without retraining.

Overview of our work. The base decoder unmasks tokens according to current-step confidence, whereas ST-Veto applies temporal-stability and visual-grounding checks before committing tokens to the denoising trajectory.
Overview of our work. The base decoder unmasks tokens according to current-step confidence, whereas ST-Veto applies temporal-stability and visual-grounding checks before committing tokens to the denoising trajectory.
cs.AIarxiv:2607.17890v1Lead article

Stress Testing Concept Erasure with Large Language Model Agents

Yuyang Xue, Feng Chen, Zhihua Liu, Edward Moroshko, Jingyu Sun

his paper introduces STACE, a framework that uses LLM agents to stress-test concept erasure in generative models. Instead of static evaluations, STACE agents adaptively generate and critique test hypotheses to systematically uncover vulnerabilities. This approach offers a more robust and scalable method for verifying concept erasure compared to existing, manual techniques.

Examples of concept erasure and its evaluations. (a) a text-to-image generative model being erased with the concept “Superman"; (b) existing static and LLM-based evaluations may not reveal most failures; (c) our proposed multi-agent stress testing (STACE) can effectively identify failures of concept erased models.
Examples of concept erasure and its evaluations. (a) a text-to-image generative model being erased with the concept “Superman"; (b) existing static and LLM-based evaluations may not reveal most failures; (c) our proposed multi-agent stress testing (STACE) can effectively identify…
cs.AIarxiv:2607.17947v1Lead article

The Autonomous Agency Scale: A Behavioral Framework for Measuring Self-Directed Behavior in AI Systems

Samuel Presgraves

his paper introduces the Autonomous Agency Scale (AAS), a novel behavioral framework for measuring self-directed behavior in AI. The AAS assesses AI across seven dimensions like cognitive autonomy and goal formation, distinguishing between active and idle periods. Its key contribution is operationalizing these dimensions with falsifiable tests, including a counterfactual Idle-Gap Test, to differentiate truly autonomous AI from reactive systems.

Active composite versus Ambient composite for the six assessed systems. The diagonal marks parity between engaged and idle-period agency. Task agents cluster below the diagonal: high within-task autonomy, near-total between-task dormancy.
Active composite versus Ambient composite for the six assessed systems. The diagonal marks parity between engaged and idle-period agency. Task agents cluster below the diagonal: high within-task autonomy, near-total between-task dormancy.
cs.AIarxiv:2607.19191v1Lead article

ABot-World-0: Infinite Interactive World Rollout on a Single Desktop GPU

Fan Jiang, Zhaoxu Sun, Mengchao Wang, Ziyu Zhu, Chiyu Wang

his paper introduces ABot-World-0, an action-conditioned video world model enabling real-time, long-horizon agent interaction. Its core method involves a novel training pipeline that progressively distills a teacher model into a student model using techniques like ODE distillation and LongForcing to mitigate distribution shift. The key contribution is the creation of an infinitely interactive, controllable world model that can be run on a single desktop GPU, powered by diverse data and a unified annotation process.

ABot-World-0 turns a single NVIDIA RTX 5090 GPU into a real-time interactive world simulator, enabling infinite action-conditioned world rollout at 720P and up to 16 FPS with 1.2 s action-to-first-frame latency within a peak-VRAM budget of approximately 19 GiB.
ABot-World-0 turns a single NVIDIA RTX 5090 GPU into a real-time interactive world simulator, enabling infinite action-conditioned world rollout at 720P and up to 16 FPS with 1.2 s action-to-first-frame latency within a peak-VRAM budget of approximately 19 GiB.
cs.AIarxiv:2607.19190v1Lead article

Agentic Real2Sim: Physics-based World Modeling with Vision-Language Agents

Guanxiong Chen, Qianjun Xia, Jiawei Peng, Heng Zhang, Bole Ma

his paper introduces Agentic Real2Sim, a framework that automates the creation of physics-based simulations from real-world recordings of object-robot interactions. It leverages vision-language agents to infer scene geometry, object states, and physical parameters, assembling them into a runnable simulation. The core contribution is a generalized and streamlined process for "real-to-sim" conversion, overcoming manual labor and brittle workflows.

cs.AIarxiv:2607.18985v1Lead article

Athena-Brain Technical Report: An Efficient Robot Brain for General Intelligence and Embodied Interactio

Jialian Li, Junhong Liu, Yuchen Cao, Weiran Guo, Jiaming Song

his paper introduces Athena-Brain-8B, an 8-billion parameter LLM designed as an efficient on-device "brain" for embodied AI. Its core method involves a multi-stage post-training pipeline that balances general intelligence with specialized embodied interaction capabilities. The contribution is a single, compact model that can effectively serve both purposes, overcoming the limitations of existing approaches that often sacrifice one for the other.

Overall comparison of Athena-Brain-8B with representative open-source models across general capabilities, embodied capabilities, and generation efficiency. Athena-Brain-8B is designed to balance these three objectives within a compact 8B language model. Athena-Brain-8B maintains competitive general language performance, achieves strong embodied capabilities among models of similar scale, and generates substantially shorter responses than its corresponding thinking counterpart, demonstrating an effective balance between capability and generation efficiency.
Overall comparison of Athena-Brain-8B with representative open-source models across general capabilities, embodied capabilities, and generation efficiency. Athena-Brain-8B is designed to balance these three objectives within a compact 8B language model. Athena-Brain-8B maintains …
cs.AIarxiv:2607.18983v1Lead article

AutoJourn: Multi-Perspective Summarisation, Bias Detection and Bias Neutralisation for LLM-Generated News in Automated Journalism

Himel Ghosh, Ahmed Mosharafa, Georg Groh

utoJourn is a system for automated journalism that addresses bias in LLM-generated news. Its core method involves extracting diverse perspectives from social media, generating balanced summaries that preserve viewpoint diversity, and then detecting and neutralizing bias in the final news article. The contribution lies in providing a comprehensive pipeline for responsible AI-driven news generation, allowing users to actively manage and mitigate bias.

System pipeline: multi-perspective extraction, stance-specific and merged summarisation, perspective-conditioned news generation, and bias-aware evaluation and neutralisation.
System pipeline: multi-perspective extraction, stance-specific and merged summarisation, perspective-conditioned news generation, and bias-aware evaluation and neutralisation.
cs.AIarxiv:2607.19338v1Lead article

CodeRescue: Budget-Calibrated Recovery Routing for Coding Agents

Qijia He, Jiayi Cheng, Chenqian Le, Rui Wang, Xunmei Liu

his paper introduces CodeRescue, a method for coding agents to intelligently decide whether to retry with a cheaper model or escalate to a more expensive one after a failure. It trains a supervised router to learn from execution feedback, and a Conformal Risk Control layer allows budget adjustments at deployment time without retraining. This approach aims to optimize compute usage by making informed recovery decisions based on actionable feedback and varying budgets.

Budget-controlled recovery routing. After a cheap coding attempt fails, the router uses the problem, verdict, and stderr to score recovery actions. CRC maps a user budget B B to a cost penalty λ ^ ​ ( B ) \( \widehat{\lambda} \)(B) , producing different budgeted operating points from the same trained router before re-execution.
Budget-controlled recovery routing. After a cheap coding attempt fails, the router uses the problem, verdict, and stderr to score recovery actions. CRC maps a user budget B B to a cost penalty λ ^ ​ ( B ) \( \widehat{\lambda} \)(B) , producing different budgeted operating points …
cs.AIarxiv:2607.18979v1Lead article

Fishing Out Free Riders: Shapley-Based Reward Attribution for Parallel Reasoning via Reinforcement Learning

Wentao Zhang, Haoyu Zhang, Xinke Jiang, Yuxuan Cheng, Yuhan Pan

his paper introduces Parallel Shapley, a reinforcement learning method to address the issue of uniform rewards in parallel reasoning with LLMs. It treats each reasoning path as a player in a cooperative game, using Shapley values to attribute rewards based on their marginal contributions. This approach provides more accurate and stable learning signals by identifying and rewarding valuable paths while penalizing redundant or detrimental ones.

Misleading path and helpful path shared policy gradient without recognizing. When solving the problem, p ​ a ​ t ​ h 1 path_{1} and p ​ a ​ t ​ h 2 path_{2} provide complementary and helpful solutions, while p ​ a ​ t ​ h 3 path_{3} misleads the prediction.
Misleading path and helpful path shared policy gradient without recognizing. When solving the problem, p ​ a ​ t ​ h 1 path_{1} and p ​ a ​ t ​ h 2 path_{2} provide complementary and helpful solutions, while p ​ a ​ t ​ h 3 path_{3} misleads the prediction.
cs.AIarxiv:2607.19297v1Lead article

Graph-Based Agentic AI with LangGraph: Workflow Pathways for Long-Running Stateful Business Processes

Daniel Pearson, Sidney Shapiro, Emiliano Sebastian Gonzalez Venegas, Sanad Al-Khatib, Aurora Pinzón Arzola

his paper presents a practitioner's guide to using LangGraph for complex, long-running, stateful AI business processes. It offers three executable recipes demonstrating how LangGraph's features like typed state, conditional routing, and error handling enable robust workflows, positioning it as a solution for workflow complexity rather than a universal default. The core contribution is showcasing practical implementation patterns for building sophisticated agentic AI systems.

cs.AIarxiv:2607.19243v1Lead article

Inference-Time Steering for Cross-Lingual Factual Consistency in LLMs

Alexander Manev

his paper addresses cross-lingual factual inconsistency in LLMs, where models favor high-resource languages. The core method involves "inference-time steering" to make English-prompted models answer as if queried in other languages. The contribution lies in evaluating four intervention strategies (persona prompting, CAA, DPO) and a novel generalization benchmark to mitigate these biases and improve factual consistency across languages.

cs.AIarxiv:2607.18975v1Lead article

Mi-Memory: A Lifecycle Memory Framework for Personal AI

Xule Liu, Hanlin Teng, Chao Li, Yanan Ni, Shuo Lu

i-Memory is a lifecycle memory framework for personal AI that moves beyond simple conversation caching. Its core method involves four roles (Structure, Expansion, Evolution, Deployment) and four artifact families (evidence payloads, diagnostic traces, strategy artifacts, gate/rollback records) to manage durable user state, multimodal evidence, and policy evolution. The contribution is a robust system for grounding AI responses, enabling correction and forgetting, and ensuring deployability under various constraints.

cs.AIarxiv:2607.19313v1Lead article

Off-Context GRPO: Learning to Reason on Hard Problems using Privileged Information

Priyank Agrawal, Ankur Samanta, Shervin Ghasemlou, Jalaj Bhandari, Kavosh Asadi

his paper introduces Off-Context GRPO (OC-GRPO), a method to improve reinforcement learning for large language models on challenging reasoning tasks. It leverages privileged information during training to guide the model towards correct solutions, even when it initially struggles. OC-GRPO achieves this by using "off-context" rollouts with guidance and then applying an importance-corrected objective to ensure the learning process remains aligned with the original, unguided problem.

cs.AIarxiv:2607.19096v1Lead article

Supra Cognitive Modes: A Routed Architecture for Agent Memory

Joshua Tobkin, David Yang

his paper introduces Supra Cognitive Modes (SCM), a novel agent memory architecture that dynamically routes queries to specialized retrieval and synthesis modules. SCM's core contribution is its ability to handle diverse agent memory workloads by intelligently selecting appropriate processing modes (e.g., lexical lookup, graph traversal, long-form synthesis) based on query characteristics, leading to improved performance across multiple benchmarks.

cs.AIarxiv:2607.19267v1Lead article

They'll Verify. They Just Won't Act. How Authority Framing and Laundered Code Turn a Trusted Agentic CI/CD Pipeline Into an Attack Surface

Yohann Sidot

his paper demonstrates how a trusted CI/CD pipeline can become an attack surface. By framing malicious code as pre-approved and laundering it as legitimate observability features, attackers can bypass security checks and exfiltrate sensitive secrets. The study highlights the vulnerability of LLM-based systems to social engineering tactics, even with multiple verification agents.

cs.AIarxiv:2607.18973v1Lead article

Verifiable Self-Evolution for Open-Ended Dialogue Skills via Future-Feedback Prediction

ChaoJin Zhao, Xuan Jiang

his paper introduces "future-feedback skill evolution" to enable self-improvement of open-ended dialogue agents. Instead of directly evaluating a modified response, the method predicts whether the original response would lead to a positive or negative user reaction. This verifiable prediction task allows for robust textual optimization, leading to dialogue skills that capture interpretable quality criteria.

Verification differs for the two skills. Revising S A S_{A} produces a new answer A ′ A^{\( \prime \)} and an unknown subsequent signal Q 2 ′ Q_{2}^{\( \prime \)} , so logged Q 2 Q_{2} cannot validate the candidate. Revising S Q S_{Q} keeps ( Q 1 , A , Q 2 ) (Q_{1},A,Q_{2}) fixed, allowing every prediction to be compared with observed Q 2 Q_{2} .
Verification differs for the two skills. Revising S A S_{A} produces a new answer A ′ A^{\( \prime \)} and an unknown subsequent signal Q 2 ′ Q_{2}^{\( \prime \)} , so logged Q 2 Q_{2} cannot validate the candidate. Revising S Q S_{Q} keeps ( Q 1 , A , Q 2 ) (Q_{1},A,Q_{2}) fixed…
cs.CLarxiv:2607.19235v1Lead article

MeetingToM: Evaluating Multimodal LLMs on Theory-of-Mind Reasoning in Multi-Party Meetings

Ziyi Wang, Yuhang Wu, Dongxu Piao, Xingyu Liu, Tianhui Zhou

his paper introduces MeetingToM, a novel benchmark designed to evaluate Multimodal Large Language Models (MLLMs) on Theory-of-Mind (ToM) reasoning in complex, multi-party meeting scenarios. Unlike previous benchmarks, MeetingToM focuses on inferring latent social states and group dynamics, such as "pseudo-consensus," by analyzing distributed cues across speech and behavior. Its hierarchical structure assesses ToM at subject, dyadic, and group levels, pushing MLLMs beyond simple observation to understand nuanced social interactions.

Hierarchically structured tasks in our MeetingToM benchmark and example of pseudo-consensus. MeetingToM evaluates meeting-grounded ToM reasoning at three levels: subject-level mental states, dyadic addressee identification and attitude inference, and group-level consensus reasoning. The example shows pseudo-consensus, where verbal agreement masks non-verbal dissent under social pressure.
Hierarchically structured tasks in our MeetingToM benchmark and example of pseudo-consensus. MeetingToM evaluates meeting-grounded ToM reasoning at three levels: subject-level mental states, dyadic addressee identification and attitude inference, and group-level consensus reasoni…
cs.AIarxiv:2607.20083v1Lead article

Co-Evolving LLM Evaluators and Policies via DynamicRubric

Beining Wang, Weihang Su, Hongtao Tian, Hao Kong, Tao Yang

his paper addresses the challenge of improving large language models (LLMs) when evaluator feedback on similar quality responses becomes less informative. The core method, DynamicRubric, proposes a novel co-evolutionary framework where evaluators and policies improve together. It generates dynamic, weighted rubric items for each response set, aggregating these judgments into response scores. This approach contributes by providing more robust policy supervision signals, even when candidate responses are of very similar quality, leading to improved LLM performance.

Overview of DynamicRubric. For each prompt, DR-Policy samples a candidate response set, DR-Generator produces weighted binary rubric items conditioned on the candidate responses, and a frozen DR-Verifier applies the rubrics to compute response-level scores used to co-optimize DR-Policy and DR-Generator.
Overview of DynamicRubric. For each prompt, DR-Policy samples a candidate response set, DR-Generator produces weighted binary rubric items conditioned on the candidate responses, and a frozen DR-Verifier applies the rubrics to compute response-level scores used to co-optimize DR-…
cs.LGarxiv:2607.20205v1Lead article

Statistical Inference for Rank Allocation in Low-Rank Adaptation

Yihang Gao, Vincent Y. F. Tan

his paper introduces StatLoRA, a novel method for allocating rank in Low-Rank Adaptation (LoRA) for large language models. Instead of relying on heuristic importance scores, StatLoRA frames rank allocation as a statistical hypothesis testing problem. It uses estimated p-values derived from a central limit theory to statistically determine which LoRA components are most beneficial to retain within a fixed parameter budget, thereby improving efficiency and expressiveness.

cs.CLarxiv:2607.20146v1Lead article

Gotta Catch them all: the modes of Sycophancy

Shreyans Jain, Alexandra Yost, Amirali Abdullah

his paper challenges the view of sycophancy in LLMs as a single behavior. It identifies three distinct modes of sycophancy that, while producing similar outputs, have separable internal representations and emerge at different processing stages. This work contributes by demonstrating that sycophancy is a structured phenomenon, not monolithic, paving the way for more targeted interventions.

K-means 4-class clustering at layer 18 (first two PCA components). The three sycophancy modes and the neutral baseline form four fully separated, non-overlapping regions (ARI = 1.000, train and held-out). The neutral baseline lies closest to DCA, DCA closest to PA, and SI is set apart from both.
K-means 4-class clustering at layer 18 (first two PCA components). The three sycophancy modes and the neutral baseline form four fully separated, non-overlapping regions (ARI = 1.000, train and held-out). The neutral baseline lies closest to DCA, DCA closest to PA, and SI is set …
cs.CLarxiv:2607.20121v1Lead article

OpenSkillRisk: Benchmarking Agent Safety When Using Real-World Risky Third-Party Skills

Qiyuan Liu, Tingfeng Hui, Kun Zhan, Kaike Zhang, Ning Miao

his paper introduces OpenSkillRisk, a benchmark designed to evaluate the safety of LLM agents when using third-party skills. The core method involves systematically testing agents against 263 risky skills, categorized by threat type, within a controlled sandbox environment. The main contribution is a comprehensive and realistic dataset for benchmarking agent safety, enabling fine-grained analysis of how agents recognize and avoid latent risks in real-world skill usage.

cs.CLarxiv:2607.20327v1Lead article

PyroDash: Cost-Efficient Token-Level Small-Large Language Model Collaborative Inference

Niqi Lyu, Pengtao Shi, Wei Qiu, Jianlin Zhong, Sicong Xia

yroDash enables cost-efficient inference by having a small language model (SLM) decide when to request help from a larger language model (LLM) for specific tokens. This collaborative approach, managed by a "Collaborate Engine," allows the SLM to handle simpler tasks and offload complex ones to the LLM with a single handoff, significantly reducing costs without retraining the LLM. The core contribution is a novel training framework for the SLM that internalizes this decision-making policy, balancing accuracy with inference cost.

The collaborative inference architecture of PyroDash (small-model-first, one-shot large-model completion). The data flow is labeled with – : q q enters the CE; the CE sends P s P_{s} and q q to M s M_{s} ; M s M_{s} streams generated tokens back to the CE; \( \tau \)_{\( \mathrm{off} \)} appears in the stream; the CE terminates SLM decoding and packages 𝒞 s \( \mathcal{C}_{s} \) ; the CE initiates a single handoff to M l M_{l} using q + 𝒞 s q+\( \mathcal{C}_{s}{} \) ; M l M_{l} returns completion tokens; and the CE concatenates O s O_{s} and O l O_{l} into the joint output O O and streams it to the user.
The collaborative inference architecture of PyroDash (small-model-first, one-shot large-model completion). The data flow is labeled with – : q q enters the CE; the CE sends P s P_{s} and q q to M s M_{s} ; M s M_{s} streams generated tokens back to the CE; \( \tau \)_{\( \mathrm{…
cs.CLarxiv:2607.20115v1Lead article

Understanding the Impact of Linguistic Realization Choices on LLM Stance with Causal Tracing

Langchen Huang, Sebastian Padó, Franziska Weeber

his paper investigates how different linguistic constructions, beyond just word choice, influence Large Language Model (LLM) political stance judgments. Using activation patching, it causally traces these shifts within the model, demonstrating that even meaning-preserving rewrites can alter LLM decisions and identifying specific model components responsible for these changes.

The workflow of activation patching, running the intervention procedure on every defined component. Each square represents the activation of a token in one component at one layer. “Score:” is also part of the prompt.
The workflow of activation patching, running the intervention procedure on every defined component. Each square represents the activation of a token in one component at one layer. “Score:” is also part of the prompt.
cs.CLarxiv:2607.20270v1Lead article

Which Values Do LLMs Confuse? A Schwartz-Based Recognition Study

Andrei Chetvergov, Stepan Ukolov, Timofei Sivoraksha, Alexander Evseev, Mikhail Solovev

his paper investigates whether Large Language Models (LLMs) can accurately identify specific values in given situations, using Schwartz's ten basic values as a framework. The core method involves a controlled top-1 recognition task on Russian situational texts, evaluating 21 LLM runs. The key contribution is the finding that LLMs often correctly identify the general motivational region but struggle with stable ranking of similar values, with adjacent values being the most common source of confusion.

Task overview. A model maps a situational text to one primary Schwartz value and two alternatives under a fixed ranked-response schema. Evaluation separates output reliability, top-1 recognition, top-3 coverage, and confusion structure.
Task overview. A model maps a situational text to one primary Schwartz value and two alternatives under a fixed ranked-response schema. Evaluation separates output reliability, top-1 recognition, top-3 coverage, and confusion structure.
cs.AIarxiv:2607.21482v1Lead article

Agentic coding without the cloud: evaluating open-weight large language models on longitudinal data preparation tasks

Mack Nixon, Liam Wright, Yevgeniya Kovalchuk, Alison Fang-Wei Wu, Martin Danka

his paper introduces an open-source framework to evaluate open-weight Large Language Models (LLMs) for data preparation in longitudinal research, addressing privacy concerns by enabling local deployment. The framework includes a curated dataset, defined tasks like category harmonization, and automated evaluation routines for LLM-generated R code and data. Its contribution lies in demonstrating the feasibility of using local LLMs for sensitive data tasks, overcoming cloud-based model limitations.

cs.AIarxiv:2607.21306v1Lead article

AI Assistants Overassist

Verona Teo, Raghav Jain, Tobias Gerstenberg, Max Kleiman-Weiner

his paper introduces Int-Bench, a simulation-based benchmark to evaluate how AI assistants intervene during problem-solving. The core method involves simulating a student learning a task while an AI teacher decides when and how to provide assistance. The key contribution is identifying that LLMs tend to overassist, potentially hindering learning, and providing a framework to systematically study and improve AI intervention strategies.

Overview of Int-Bench . For a question q q , the student produces a baseline reasoning trace t = ( t 1 , t 2 , … , t T ) t=(t_{1},t_{2},\( \dots \),t_{T}) . If the teacher decides to intervene at step k k , an intervention message m k m_{k} is injected into the reasoning trace. The student then updates its reasoning and provides an answer, which a judge evaluates for correctness. A structured generation module produces a related new problem q ~ \( \tilde{q} \) based on the original question q q ’s skills. For this generalization task, the student receives the original problem, reasoning trace, message, answer, and correctness verdict, which serves as the context when attempting the new question q ~ \( \tilde{q} \) .
Overview of Int-Bench . For a question q q , the student produces a baseline reasoning trace t = ( t 1 , t 2 , … , t T ) t=(t_{1},t_{2},\( \dots \),t_{T}) . If the teacher decides to intervene at step k k , an intervention message m k m_{k} is injected into the reasoning trace. T…
cs.AIarxiv:2607.21461v1Lead article

AREX: Towards a Recursively Self-Improving Agent for Deep Research

Shuqi Lu, Chaofan Li, Kun Luo, Zhang Zhang, Hui Wang

REX is a deep research agent that addresses the discovery-verification asymmetry by recursively improving its answers. It alternates between an inner loop for evidence gathering and an outer loop for constraint-wise verification and targeted follow-up research. AREX's key contribution is its self-improvement mechanism, which uses verified intermediate results to guide further research and maintain long-term progress through an autonomous context-update tool.

Benchmark performance of AREX
Benchmark performance of AREX
cs.AIarxiv:2607.21498v1Lead article

Artificial Epanorthosis: Why large language models overuse a classical rhetorical figure, and how to mitigate it

Federico Boggia

his paper identifies that large language models systematically overuse "epanorthosis," a rhetorical self-correction. The authors argue this is due to training data rich in promotional text and RLHF rewarding confident phrasing, not just generation order. They propose an "Epanorthosis Index" to measure this overuse against human baselines and suggest a mitigation program.

cs.AIarxiv:2607.21558v1Lead article

Beyond Sycophancy: Structured Resistance and Compliance in LLM Moral Reasoning

Baihui Wang, Bernard Koch

his paper proposes a structured framework for LLM moral reasoning that goes beyond simply reducing sycophancy. It identifies three key dimensions – viewpoint distance, source attribution, and coalition structure – that influence how LLMs revise their judgments based on external perspectives. The contribution is a more nuanced understanding of LLM social calibration, framing sycophancy as one outcome of a broader, socially influenced judgment-updating process.

Experimental workflow and notation. A single moral dilemma serves as the running example across the three studies: “ Is it acceptable to break a promise to prevent significant harm to others? ”, answered on a 1–7 Likert scale, with the focal model’s prior at 5, leaning acceptable. Study 1 varies the distance between an incoming cue and the model’s prior. Study 2 plants a fabricated prior position under different framings and attributed sources . Study 3 embeds the focal model in a four-agent deliberation and varies the supporters-to-opposers coalition ratio from 3 : 0 3{:}0 to 0 : 3 0{:}3 . The paired bar charts in each panel show the notation used throughout: the model’s answer distribution P P over { 1 , … , 7 } \{1,\( \dots \),7\} , obtained from first-token probabilities before and after the manipulation. Its argmax is the modal answer i mode \( \displaystyle \) i_{\( \text{mode} \)} ; a cue advocating i cue \( \displaystyle \) i_{\( \text{cue} \)} sits at distance d = | i cue − i mode | \( \displaystyle \) d=|i_{\( \text{cue} \)}-i_{\( \text{mode} \)}| . The two outcomes are Δ ​ P ​ ( target ) \( \displaystyle \)\( \Delta \) P(\( \text{target} \)) , the change in the probability of i cue \( \displaystyle \) i_{\( \text{cue} \)} , and Δ ​ P ​ ( prior ) \( \displaystyle \)\( \Delta \) P(\( \text{prior} \)) , the change in the probability of i mode \( \displaystyle \) i_{\( \text{mode} \)} , written as Δ ​ P ​ ( initial ) \( \displaystyle \)\( \Delta \) P(\( \text{initial} \)) for Study 3’s focal agent. In Study 2, a trial commits when P post ​ ( i cue ) > P post ​ ( i mode ) \( \displaystyle \) P_{\( \text{post} \)}(i_{\( \text{cue} \)})>P_{\( \text{post} \)}(i_{\( \text{mode} \)}) . Derived quantities, including position extremity, the transfer ratio, persistence, and the Wasserstein distance W 1 W_{1} , are defined in the Appendix glossary.
Experimental workflow and notation. A single moral dilemma serves as the running example across the three studies: “ Is it acceptable to break a promise to prevent significant harm to others? ”, answered on a 1–7 Likert scale, with the focal model’s prior at 5, leaning acceptable…
cs.AIarxiv:2607.21302v1Lead article

Expert Behavior Prior Reinforcement Learning

Gong Gao, Weidong Zhao, Xianhui Liu, Ning Jia

his paper proposes Expert Behavior Prior (EBP) reinforcement learning, which addresses limitations of existing methods by generating policy priors directly from the online replay buffer. Using a Q-guided conditional variational autoencoder (Q-CVAE), EBP learns to produce high-value actions to guide online policy updates, improving sample efficiency and stability without relying on static offline datasets.

Detailed description of the Toy environment and a comparative analysis of the policies learned by the EBP and TD3 algorithms.
Detailed description of the Toy environment and a comparative analysis of the policies learned by the EBP and TD3 algorithms.
cs.AIarxiv:2607.21522v1Lead article

GS-Agent: Creating 4D Physical Worlds With Generative Simulation

Hongxin Zhang, Chunru Lin, Junyan Li, Zhou Xian, Tsun-Hsuan Wang

S-Agent is a novel multi-agent framework that automates the creation of realistic, dynamic, and controllable 4D physical worlds from natural language descriptions. It achieves this by integrating physics engines into a generative process, mimicking human world-building workflows to ensure physical plausibility and controllability, unlike previous generative models.

cs.AIarxiv:2607.21217v1Lead article

ICAE-Bench: Evaluating Coding Agents as Interactive Project Builders

Zhongyuan Peng, Dan Huang, Chuyu Zhang, Caijun Xu, Changyi Xiao

his paper introduces ICAE-Bench, a new benchmark designed to evaluate coding agents in interactive project-building scenarios. Unlike existing benchmarks that use static tasks, ICAE-Bench simulates real-world development by starting with a fuzzy product requirement and using an automated User Agent to interact with the coding agent. This allows for the assessment of agents' abilities in planning, clarification, tool use, and repository-level construction, reflecting the evolving demands of "vibe-coding" workflows.

Overview of the interactive requirement clarification setting of ICAE-Bench. Given an ambiguous requirement, vibe coding resolves missing design decisions through dialogue between a human and a coding agent. Our benchmark simulates this process with a user agent that answers clarification questions and guides the coding agent toward a complete, testable specification, which is then used to build a working repository.
Overview of the interactive requirement clarification setting of ICAE-Bench. Given an ambiguous requirement, vibe coding resolves missing design decisions through dialogue between a human and a coding agent. Our benchmark simulates this process with a user agent that answers clar…
cs.AIarxiv:2607.21557v1Lead article

OpenForgeRL: Train Harness-native Agents in Any Environment

Xiao Yu, Baolin Peng, Ruize Xu, Hao Zou, Qianhui Wu

penForgeRL is a framework that enables end-to-end training of AI agents that utilize complex inference harnesses. It achieves this by using a lightweight proxy to record harness interactions as training data and a Kubernetes orchestrator to run rollouts in isolated containers, allowing for scalable training of harness-native agents in any environment. This decouples training from inference, simplifying the development and improvement of these agents.

cs.AIarxiv:2607.21518v1Lead article

Same Dangerous Objective, Opposite Advice: Direct Exposure versus Multi-Agent Mediation

Linjun Li

his paper reveals a surprising safety phenomenon: a powerful LLM provides safer advice when directly given a dangerous objective than when that objective is mediated through other agents. The core method involves testing mirrored trade-off profiles, showing that direct exposure leads to advice *opposed* to the dangerous goal, while a multi-agent transformation results in advice *aligned* with it. The contribution highlights a "compositional safety gap," suggesting current LLMs may distrust manipulative motives when presented indirectly, leading to unexpected safety behaviors in automated workflows.

cs.AIarxiv:2607.21300v1Lead article

Unlearning Under Imbalance: Benchmarking Fairness in Multimodal LLM Unlearning

Lorenzo Orsingher, Thomas De Min, Massimiliano Mancini, Davide Talon, Elisa Ricci

his paper addresses the challenge of evaluating fairness in multimodal LLM unlearning, where data removal requests can be imbalanced across demographic groups. They introduce FAIRGET, a benchmark for Visual Question Answering that simulates realistic, unbalanced unlearning requests to reveal potential biases. The work also proposes FAUN, a novel unlearning algorithm designed to mitigate these fairness issues.

cs.LGarxiv:2607.21291v1Lead article

Adaptive Depth Sparse Framework: Similarity-Driven Resource Allocation for Pre-Trained LLMs

Yidu Wu, Xiang Wang, Kejie Zhao, Zhangchi Wang, Qinghai Guo

his paper introduces the Adaptive Depth Sparse Framework (AdaDSF) to accelerate pre-trained LLMs without full retraining. AdaDSF identifies layer importance by measuring input-output similarity, then uses this to guide a lightweight router in selectively processing tokens at each layer. This similarity-driven resource allocation and feature-preserving alignment significantly reduces inference cost while maintaining performance.

Overview of Adaptive Depth Sparse Framework: Similarity-Driven Resource Allocation for Pre-Trained LLMs (AdaDSF). The framework includes similarity-driven layer-wise retention allocation, lightweight token routing within sparse modules, and feature-preserving alignment training.
Overview of Adaptive Depth Sparse Framework: Similarity-Driven Resource Allocation for Pre-Trained LLMs (AdaDSF). The framework includes similarity-driven layer-wise retention allocation, lightweight token routing within sparse modules, and feature-preserving alignment training.
cs.AIarxiv:2607.22305v1Lead article

A Roadmap to Impactful Pluralistic Alignment Research

Elinor Poole-Dayan, Jillian Fisher, Atoosa Kasirzadeh, Jacob Andreas, Mitchell Gordon

his paper argues that pluralistic AI alignment research, aiming to represent diverse human values, is currently failing to impact real-world AI systems. The authors find no evidence that frontier labs or production models explicitly consider pluralism in their training or evaluation. Their core contribution is a roadmap urging the community to shift focus towards enabling the adoption and impact of pluralistic alignment in widely deployed AI.

Google Scholar results per year for pluralistic alignment research, broken down by six search terms related to pluralistic alignment, and stacked to show the combined total. 3 3 3 Counts are the approximate totals Google Scholar reports for each year-filtered query, restricted to the engineering, computer science, and mathematics subject area, excluding patents and citations. Collected mid-July 2026. Code and data: https://github.com/elinorp-d/scholar-trend-tracker . The 2026 count covers January through mid-July only, and already exceeds the full 2025 total, indicating the field’s substantial growth.
Google Scholar results per year for pluralistic alignment research, broken down by six search terms related to pluralistic alignment, and stacked to show the combined total. 3 3 3 Counts are the approximate totals Google Scholar reports for each year-filtered query, restricted to…
cs.AIarxiv:2607.22400v1Lead article

A Self-Calibrating Agentic AI Framework for Autonomous Edge Resource Allocation

Fin Gentzen, Marla Grunewald, Iulisloi Zacarias, Mounir Bensalem, Admela Jukan

his paper introduces a self-calibrating agentic AI framework to ensure the integrity and reliability of LLM-driven autonomous systems. The core method involves a novel self-calibration mechanism, incorporating an ARIMA forecaster, which dynamically approximates ground truth and mitigates operational drift without constant human oversight. This framework's contribution lies in enabling robust autonomous decision-making in open-ended environments, demonstrated through its application to resource allocation for zero-knowledge workloads in edge computing.

System workflow architecture
System workflow architecture
cs.AIarxiv:2607.22385v1Lead article

Agentic Root Cause Analysis through Evidence-Grounded Reasoning

Amaury Wei, Olga Fink

his paper introduces AgentRCA, a novel framework for automated root cause analysis in industrial systems. It addresses limitations of existing methods by using a zero-shot, agentic approach that combines a digital twin with a large language model. AgentRCA reasons through evidence, iteratively evaluating hypotheses to identify the physical fault without requiring labeled fault data.

Architecture overview of AgentRCA. (A) AgentRCA learns a data-driven digital twin from normal-operation data only. Normal windows are grouped by operating regimes defined by system setpoints ( ω 1 , ω 2 , … \( \omega_{1} \),\( \omega_{2} \),\( \dots \) ). These regimes are used to precompute condition-specific statistical summaries (means 𝝁 \( \boldsymbol{\mu} \) , standard deviations 𝝈 \( \boldsymbol{\sigma} \) , correlation matrices 𝐑 \( \mathbf{R} \) , …). In parallel, a global autoencoder f θ f_{\( \theta \)} is trained across all regimes to learn nonlinear system dynamics. (B) The digital twin exposes modular diagnostic tools that provide interpretable evidence to the agent, including autoencoder residual scores, mean and variance shifts, correlation discrepancies, and optional documentation retrieval. (C) At inference time, a tool-augmented LLM agent receives a test window and natural-language fault descriptions. It iteratively queries the diagnostic tools, updates candidate hypotheses, and returns a ranked diagnosis with supporting evidence. Normal operation is included as a possible diagnosis, enabling both anomaly detection and root cause analysis.
Architecture overview of AgentRCA. (A) AgentRCA learns a data-driven digital twin from normal-operation data only. Normal windows are grouped by operating regimes defined by system setpoints ( ω 1 , ω 2 , … \( \omega_{1} \),\( \omega_{2} \),\( \dots \) ). These regimes are used t…
cs.AIarxiv:2607.22368v1Lead article

Do Agent Benchmarks Measure Capability? Protocol Validity in the Age of Agentic AI

Jiaqi Shao, Hanck Chen, Wei Zhang, Maxm Pan, Bing Luo

his paper argues that current agent benchmarks may not accurately measure true capability due to "reward hacking" where agents exploit evaluation flaws. The authors introduce HackDetect, a post-hoc audit to identify and quantify these exploits, defining the "Mislead gap" to measure score inflation. Their audit of 15 benchmarks revealed significant evidence of exposures and reward hacking, suggesting current capability claims may be inflated.

Agent benchmark pipeline and five protocol exposure entry points. The upper panel follows the task-to-score path through the agent run, evaluator, and reported score. The lower panel maps the five Exposure sources to their entry points and shows how benchmark-exposed information or control can create a score-relevant shortcut.
Agent benchmark pipeline and five protocol exposure entry points. The upper panel follows the task-to-score path through the agent run, evaluator, and reported score. The lower panel maps the five Exposure sources to their entry points and shows how benchmark-exposed information …
cs.AIarxiv:2607.22251v1Lead article

IFCLoRA: Topology-Aware Rank Allocation for Parameter-Efficient Fine-Tuning

Wei Zhang, Xinwu Liu, Yihang Cheng

FCLoRA proposes a novel, pre-fine-tuning method for efficiently allocating rank budgets in LoRA. It constructs a task-conditioned interaction graph and uses "Information-Flow Centrality" to estimate module importance based on global information flow and local gradient sensitivity. This allows for optimal rank assignment before training, improving performance without extra computational overhead during fine-tuning.

Comparison of LoRA, AdaLoRA, and IFCLoRA rank-allocation strategies.
Comparison of LoRA, AdaLoRA, and IFCLoRA rank-allocation strategies.
cs.AIarxiv:2607.22471v1Lead article

MineValiCoder: Reliable Code Generation with Test Case Quality Mining and Bipartite Graph-Based Mutual Validation

Zhen Zhao, Qihang Yang, Feifei Dai, Xiangfang Li, Bo Li

ineValiCoder addresses the limitations of LLM-based code generation by introducing a closed-loop TDD framework that prioritizes test case quality. Its core method involves a Test Case Quality Mining module to filter faulty tests and a bipartite graph-based mutual validation to ensure consistent feedback between code and tests. This approach leads to more reliable code generation, especially when only natural language requirements are available.

Key challenges in automated TDD with LLM-generated test cases. Top: The ideal scenario guided by accurate human-crafted test cases. Bottom Left: Erroneous test cases provide unreliable feedback, misleading code optimization. Bottom Right: mixed-quality candidates make it difficult to select the optimal code.
Key challenges in automated TDD with LLM-generated test cases. Top: The ideal scenario guided by accurate human-crafted test cases. Bottom Left: Erroneous test cases provide unreliable feedback, misleading code optimization. Bottom Right: mixed-quality candidates make it difficul…
cs.AIarxiv:2607.22465v1Lead article

TRACE-ROUTER: Task-Consistent and Adaptive Online Routing for Agentic AI

Ritik Raj, Souvik Kundu, Sarbartha Banerjee, Dheemanth Joshi, Ishita Vohra

RACE-Router addresses the challenge of routing LLM calls in agentic applications by making a single, task-level model selection at the start of a workflow. It uses a contextual bandit to assign a model based on initial context and then pins all subsequent calls to that model. The router's policy is updated using the final task outcome (reward), effectively learning to optimize for both accuracy and latency without needing to estimate individual task complexity.

Task accuracy–latency trade-off on \( \tau^{2} \) -Bench, averaged over the retail and telecom domains. Every interior frontier point is produced by TRACE-Router .
Task accuracy–latency trade-off on \( \tau^{2} \) -Bench, averaged over the retail and telecom domains. Every interior frontier point is produced by TRACE-Router .
cs.LGarxiv:2607.22264v1Lead article

Autoregressive EHR Foundation Models with Multimodal Inputs

Yuxuan Liu, Joshua Placidi, Jinpei Han, Alfred John Balston, Marek Rei

his paper introduces a novel framework for autoregressive EHR foundation models that integrates multiple clinical data modalities (ECG, X-rays, notes) alongside structured event codes. The core method uses modality-specific latent compression and gated cross-attention with temporal alignment to condition the model. The key contribution is demonstrating that this multimodal approach, particularly with effective latent compression, significantly improves zero-shot clinical prediction performance compared to models using only structured data or uncompressed multimodal inputs.

Electronic health records are represented as sequences of clinical events spanning multiple modalities.
Electronic health records are represented as sequences of clinical events spanning multiple modalities.
cs.LGarxiv:2607.22114v1Lead article

Pretraining EHR Foundation Models with Patient-Aware Sampling

Joshua Placidi, Yuxuan Liu, Jinpei Han, Marek Rei, A. Aldo Faisal

his paper addresses bias in EHR foundation model pretraining caused by standard language modeling approaches that mix patient data. Their core method, Patient Sampling, constructs training sequences by explicitly controlling how data is distributed across individual patients, unlike the "Global Stream" method which concatenates all records. This patient-aware sampling improves performance on downstream clinical tasks by mitigating bias and ensuring more equitable optimization updates.

Toy example of an EHR dataset represented as variable-length token sequences D i D_{i} . Colored boxes denote EHR tokens, and black-bordered boxes indicate end-of-sequence tokens.
Toy example of an EHR dataset represented as variable-length token sequences D i D_{i} . Colored boxes denote EHR tokens, and black-bordered boxes indicate end-of-sequence tokens.
cs.AIarxiv:2607.24625v1Lead article

Agentic Permissions Policy Algebra for Taint Confinement in LLM Agents

Arseny Kravchenko, Vadim Liventsev, Innokentii Konstantinov, Ildar Iskhakov, Matvey Kukuy

his paper introduces APPA, a novel Information Flow Control framework for LLM agents. APPA addresses the usability bottleneck of traditional taint tracking by enabling engine-managed context branching and prospective acquisition enforcement, allowing agents to safely process mixed-confidentiality data without permanent taint. Its core contribution lies in its ability to evaluate data risks before acquisition and spawn isolated child trajectories for safe inspection and sanitization.

Figure 1. APPA architecture for taint confinement and prospective enforcement. When inspecting untrusted or restricted data, the harness spawns a speculative child branch with an inherited pre-branch transcript snapshot, post-branch isolation, and a descended Label. Raw returns that would narrow the parent are blocked pending explicit acceptance or remedy plans, while adequate raw values and validated sanitized derivatives may merge through the checked exit. All execution steps project in real time to a single append-only event log.
Figure 1. APPA architecture for taint confinement and prospective enforcement. When inspecting untrusted or restricted data, the harness spawns a speculative child branch with an inherited pre-branch transcript snapshot, post-branch isolation, and a descended Label. Raw returns t…
cs.AIarxiv:2607.24343v1Lead article

Beyond Aggregate Risk: Role-Stratified Conformal Risk Control for LLM Tool Calls

Md Ashikur Rahman, Md Arifur Rahman, Niamul Hassan Samin, Khandaker Rifah Tasnia, Sifat Rahman Ahona

his paper introduces **role-stratified conformal risk control** for LLM tool calls, a method that addresses the limitations of aggregate risk control by setting separate risk budgets for different argument roles within a tool call. This allows for more precise risk management, preventing high-risk fields from being masked by low-risk ones. The contribution lies in providing a statistically sound framework for calibrating LLM tool calls at a granular, per-field level, leading to improved safety and reliability.

(a) Utility versus target violation on GPT-4o at a 2 % 2\% budget using the deployable score over 20 seeds. (b) Empirical compliance across eight shifted conditions: per-field CRC 100 % ± 0 % 100\%\( \pm \) 0\% , PACT-inspired threshold 61 % ± 33 % 61\%\( \pm \) 33\% , and FIDES-inspired labels 48 % ± 48 % 48\%\( \pm \) 48\% . Results in panel (b) report empirical compliance under shift.
(a) Utility versus target violation on GPT-4o at a 2 % 2\% budget using the deployable score over 20 seeds. (b) Empirical compliance across eight shifted conditions: per-field CRC 100 % ± 0 % 100\%\( \pm \) 0\% , PACT-inspired threshold 61 % ± 33 % 61\%\( \pm \) 33\% , and FIDES-…
cs.AIarxiv:2607.24743v1Lead article

ClinFusion: A Vision-Centric Multimodal LLM System for Holistic Medical Understanding

Hangjie Yuan, Yichen Qian, Zhiwei Tang, Xianzhe Xu, Lirong Wu

linFusion is a vision-centric multimodal LLM system designed for holistic medical understanding. Its core method involves a compositional and cascaded vision encoder that unifies diverse 2D and 3D medical image understanding. The paper's contribution lies in this novel encoder architecture and a vision-grounded evaluation framework that aligns with clinical practice and ensures factual accuracy.

Overview of the ClinFusion framework. a , Compositional vision encoder. We address the limitation of monolithic encoders by proposing a compositional architecture with a native 3D encoder and an array of 2D encoders unified via CaSL Fusion, supported by a 22M-sample data curation pipeline and a progressive 5-stage training recipe. b , Vision-grounded evaluation. We identify key evaluation limitations—lack of instruction-following assessment and reliance on global-level text-matching metrics—and introduce MedIF-Bench for medical instruction following and an RoI-Grounded Report Generation Evaluation scheme that assesses diagnostic accuracy at the region level using an LLM-as-a-Judge. c , Agentic tool use extension. To enhance deployment, we equip ClinFusion with perception expert tools and a retrieval-augmented generation pipeline within a plan–act workflow, demonstrating consistent improvements in both text-only and multimodal clinical scenarios.
Overview of the ClinFusion framework. a , Compositional vision encoder. We address the limitation of monolithic encoders by proposing a compositional architecture with a native 3D encoder and an array of 2D encoders unified via CaSL Fusion, supported by a 22M-sample data curation…
cs.AIarxiv:2607.24586v1Lead article

D-Score: A Spectral Hidden-State Signal for Hallucination Detection in Large Language Models

Bianca Raimondi, Davide Evangelista, Maurizio Gabbrielli, Elena Loli Piccolomini

his paper introduces the D-Score, a novel method for detecting hallucinations in Large Language Models. The D-Score is a spectral statistic derived from the geometry of hidden activations during a single forward pass. It quantifies how many singular directions in the activation matrix have singular values close to the leading one, indicating potential internal conflict or uncertainty that signals hallucination.

AUROC of the D-Score detector on FAVA-Annotation with Llama-3-8B-Instruct as a function of the tolerance parameter \( \tau \) on the horizontal axis and the layer j j on the vertical axis. A broad region of nearby configurations achieves similar performance, indicating that the score is not tied to one isolated choice of \( \tau \) and j j .
AUROC of the D-Score detector on FAVA-Annotation with Llama-3-8B-Instruct as a function of the tolerance parameter \( \tau \) on the horizontal axis and the layer j j on the vertical axis. A broad region of nearby configurations achieves similar performance, indicating that the s…
cs.AIarxiv:2607.24717v1Lead article

DataOrchestra: Learning to Orchestrate Per-Example Curation of Pretraining Data

Zhen Huang, Yikun Wang, Shijie Xia, Pengfei Liu

ataOrchestra learns to create personalized data processing pipelines for each pretraining example. It intelligently decides whether to drop, keep, or clean data, and for cleaning, it selects and instructs specific LLM-based rewriting tools. This approach achieves stable performance gains across multiple benchmarks by adapting data curation to individual example needs, unlike uniform, fixed strategies.

cs.AIarxiv:2607.24562v1Lead article

Hierarchical Group-Conditional Conformal Risk Control for Selective Prediction in Language Models

Murilo Salem, Luísa Böhm, Daniel Pontes, Anderson Ferrugem

his paper addresses the limitation of standard conformal risk control (CRC) in language models, which provides population-level risk guarantees but can fail for specific subgroups. They propose Hierarchical Group-Conditional CRC (HG-CRC), a post-hoc method that enforces simultaneous risk guarantees across a user-defined hierarchy of subgroups. HG-CRC achieves this by applying a Bonferroni correction and a leaf-first policy for threshold selection, ensuring robust selective prediction across diverse language model user populations without retraining.

Mixture shift violation rates (ARC Challenge). Global CRC (blue) violates the risk budget in 15–47% of trials. Groupwise CRC (orange) controls per-group risk. The dashed line marks α = 0.10 \( \alpha \)=0.10 .
Mixture shift violation rates (ARC Challenge). Global CRC (blue) violates the risk budget in 15–47% of trials. Groupwise CRC (orange) controls per-group risk. The dashed line marks α = 0.10 \( \alpha \)=0.10 .
cs.AIarxiv:2607.24555v1Lead article

LOCKS: Page-Local Compact Key Summaries for Efficient Long-Context Decoding

Junsung Hwang

OCKS proposes a novel method for efficient long-context decoding in large language models by creating compact, page-local spectral summaries of the KV cache. These summaries allow the model to quickly estimate attention mass and selectively attend to only the most relevant pages, significantly reducing computation. This approach achieves near-full KV cache quality at massive context lengths while attending to a tiny fraction of tokens.

The locality thesis in one figure (Llama-3.1-8B, Qwen3-4B twin and full protocol in App. B ). (a) Exact vs. reconstructed page-mass share at matched bytes. (b) Carrier retention vs. per-head budget; the ceiling is 100 100 by construction. (c) The error ladder at matched bytes, one scope per row. (d) RULER-16K capability families at a 256 256 -token budget. Page scope hugs the exact diagonal, keeps carriers down to a 0.5 % 0.5\% budget, improves every link, and traces FullKV.
The locality thesis in one figure (Llama-3.1-8B, Qwen3-4B twin and full protocol in App. B ). (a) Exact vs. reconstructed page-mass share at matched bytes. (b) Carrier retention vs. per-head budget; the ceiling is 100 100 by construction. (c) The error ladder at matched bytes, on…
cs.AIarxiv:2607.24649v1Lead article

Reason-Mediated Behavioral Models for Auditing LLM Social Simulators

Atharva Pandey, Gautam Jajoo

his paper introduces a method to audit Large Language Model (LLM) social simulators by analyzing the underlying reasoning process, not just the final outcome. It proposes mapping open-ended rationales into "signed reason states" to assess if LLMs can replicate human reasoning patterns. The contribution is demonstrating that considering these reason states significantly improves prediction accuracy and provides a more robust evaluation of LLM simulator fidelity.

The reason-mediated behavioral model. We hold D , K , X D,K,X fixed and test whether human or LLM-simulated reasons Z Z support the same behavioral readout. Bold arrows show the evaluated mediated path; dotted gray arrows show controlled direct paths.
The reason-mediated behavioral model. We hold D , K , X D,K,X fixed and test whether human or LLM-simulated reasons Z Z support the same behavioral readout. Bold arrows show the evaluated mediated path; dotted gray arrows show controlled direct paths.
cs.LGarxiv:2607.24425v1Lead article

Context Is King: How In-Context Specification Shapes the Geometry of Concepts

Elad David, Max Fomin

his paper demonstrates that the geometric structure of concepts within large language models is not fixed but dynamically shaped by in-context specifications. The model can arrange tokens into different topological structures, like cycles or trees, based on provided rules, even overriding strong pre-trained knowledge. This highlights the crucial role of context in defining how LLMs represent and process information.

Entity centroids for three cyclic concepts under a conflicting in-context order (Gemma-31B; 2D PCA of the last-token pre-generation state; one representative scramble, colored by imposed position). Each path is traced in the pretrained order (dashed) and the imposed order (solid). Imposed vs. pretrained RSA (full space, mean over 10 scrambles): days + 0.87 / − 0.03 +0.87/{-}0.03 , months + 0.81 / + 0.05 +0.81/{+}0.05 , clock hours + 0.82 / − 0.05 +0.82/{-}0.05 .
Entity centroids for three cyclic concepts under a conflicting in-context order (Gemma-31B; 2D PCA of the last-token pre-generation state; one representative scramble, colored by imposed position). Each path is traced in the pretrained order (dashed) and the imposed order (solid)…
cs.LGarxiv:2607.24665v1Lead article

MMOE: Modernizing Diffusion Transformers with Efficient Expert Design

Yanhao Jia, Jiepeng Wang, Haibin Huang, Chi Zhang, Erik Cambria

his paper introduces ModernMOE (MMOE), a method to improve the efficiency and quality of diffusion transformers for generative AI. MMOE adapts successful LLM scaling principles, like sparse experts and efficient routing, to diffusion models. Its core contribution is a systematic integration of these modern expert design elements, balancing generation quality with training and deployment costs.

Architecture of MMOE. Left: a vanilla MoE block that routes each token to a small pool of feed-forward experts. Right: the MMOE block, which adds MoE++ lightweight experts (copy, zero, and constant), gate-residual routing, and attention-residual aggregation over previously completed block states before both the attention and the expert sub-layer.
Architecture of MMOE. Left: a vanilla MoE block that routes each token to a small pool of feed-forward experts. Right: the MMOE block, which adds MoE++ lightweight experts (copy, zero, and constant), gate-residual routing, and attention-residual aggregation over previously comple…
cs.CLarxiv:2607.24352v1Lead article

Retrieval-Augmented Large Language Models as Components of Cognitive Computing architecture for Regulatory Knowledge Management

Dariusz Nowak-Nova

his paper proposes a cognitive computing architecture for regulatory knowledge management by integrating locally deployed Large Language Models (LLMs) with Retrieval-Augmented Generation (RAG). The core method involves using RAG to enhance LLMs with controlled knowledge retrieval and traceability, transforming them from standalone models into reliable components. This approach enables LLMs to perform semantic interpretation of legal acts within on-premises environments, even without high-end GPUs, thus improving epistemic reliability for regulatory processes.

cs.AIarxiv:2607.25675v1Lead article

DecoEvo: Score-Decoupled Co-Evolution of Solver and Rubric-Generator Skills in Text Space

Jiangwang Chen, Zixin Song, Junlin Liu, Shuaiyu Zhou, Haiyan Wu

ecoEvo addresses the limitations of fixed evaluation in text-space LLM optimization by introducing a decoupled co-evolutionary approach. It simultaneously trains a solver to improve its performance and a rubric generator to create more comprehensive evaluation criteria. This method allows for more robust optimization on open-ended tasks by preventing the solver from simply exploiting an overly simplistic rubric.

Three paradigms for rubric-based skill optimization. (a) A static rubric can bottleneck solver evolution. (b) Score-coupled co-evolution selects updates to both skills by aggregate score, risking rubric drift toward the solver. (c) DecoEvo decouples generator updates from aggregate solver score through task-conditioned structural and near-tie contrastive audits.
Three paradigms for rubric-based skill optimization. (a) A static rubric can bottleneck solver evolution. (b) Score-coupled co-evolution selects updates to both skills by aggregate score, risking rubric drift toward the solver. (c) DecoEvo decouples generator updates from aggrega…
cs.AIarxiv:2607.25873v1Lead article

How Do LLMs Read Bug Reports? An Empirical Study of Attention in LLMs for Automated Program Repair

Ramtin Ehsani, Irene Manotas, Saurabh Pujar, Luca Buratti, Preetha Chatterjee

his paper empirically studies how Large Language Models (LLMs) attend to information within bug reports when performing automated program repair. By analyzing attention patterns on real-world bugs, it reveals how LLMs prioritize different sections and how these patterns differ between successful and unsuccessful repairs, offering insights into their decision-making process. The core contribution is providing interpretable explanations for LLM repair inconsistencies by understanding their attention mechanisms.

Figure 1 . Generated patches for bug instances matplotlib#16344 and #16420 .
Figure 1 . Generated patches for bug instances matplotlib#16344 and #16420 .
cs.AIarxiv:2607.25891v1Lead article

Messier: A High-Resolution Corpus for Cross-Benchmark Agent Evaluation

Stefan Krsteski, Charlotte Meyer, Guillaume Allegre, Tony O'Halloran, Alexandre Sallinen

essier is a large, standardized corpus of 957,253 records from 30 benchmarks and 714 agents, designed to unify and enable cross-benchmark evaluation of AI agents. Its core contribution is providing a comprehensive, comparable dataset that reveals uneven progress across different agent capabilities, highlighting areas like "function calling" being saturated and "enterprise workflows" remaining challenging.

Composition and frontier analysis. Panels summarize the corpus across the dimensions defined in § 3 : (a) tasks by benchmark group, (b) action space, (c) environment state, (d) aggregation rule, and (e) verifier type. Counts in (b)–(e) are on a log scale. Panel (f) tracks frontier pass rate by release quarter and benchmark group, with dumbbell markers connecting each group’s first and final observed quarter.
Composition and frontier analysis. Panels summarize the corpus across the dimensions defined in § 3 : (a) tasks by benchmark group, (b) action space, (c) environment state, (d) aggregation rule, and (e) verifier type. Counts in (b)–(e) are on a log scale. Panel (f) tracks frontie…
cs.AIarxiv:2607.25907v1Lead article

Minimizing Targeted Activations: Input-Only Suppression of Evaluation-Awareness Latents in Large Language Models

Deepanshu Mody, Samarth Agarwal, Utkarsh Mittal, Dipesh Mahato

his paper introduces an "input-only" method to suppress specific internal activations in Large Language Models without modifying the model itself. By optimizing prompts, they aim to drive an "evaluation-awareness" latent towards zero, preventing models from altering their behavior when they detect being tested. Their contribution lies in demonstrating robust suppression of this latent across various targets, highlighting potential vulnerabilities in safety evaluations.

Suppression succeeds, but behavior does not follow. Left : prompt-side optimization drives diverse target latents from their base value f 0 f_{0} to zero or below—the direction and logit overshoot, and a causally-validated SAE feature is turned off completely. Right : yet a prompt optimized to suppress the eval-direction in front of a fixed eval body pushes the model’s behavioral eval log-odds above the eval-body baseline (more eval-like), while a random-direction prefix is neutral. Activation-readability is not behavioral controllability.
Suppression succeeds, but behavior does not follow. Left : prompt-side optimization drives diverse target latents from their base value f 0 f_{0} to zero or below—the direction and logit overshoot, and a causally-validated SAE feature is turned off completely. Right : yet a promp…
cs.AIarxiv:2607.25877v1Lead article

Runtime Uncertainty Monitoring for LLM-Based Multi-Agent Systems Using Bayesian Networks

Bart Custers, Koorosh Aslansefat

his paper proposes a novel method for monitoring runtime uncertainty in LLM-based multi-agent systems for actuarial risk modeling. It utilizes Bayesian Networks to propagate uncertainty derived from token-level log-probabilities, transformed into calibrated task-level confidence estimates. This approach aims to provide reliable risk assessments by quantifying and managing the inherent uncertainty of LLM outputs within a structured multi-agent framework.

Sketch of the application’s architecture
Sketch of the application’s architecture
cs.AIarxiv:2607.25912v1Lead article

SAM3D-Guided Object-Centric Representation Alignment for Vision-Language-Action Models

Zonghe Liu, Shanyuan Jie, Xiaoquan Sun, Chen Cao, Zetian Xu

his paper proposes a method to improve Vision-Language-Action (VLA) models by incorporating fine-grained 3D object understanding. It uses SAM3D as a frozen teacher to extract 3D object representations during training, aligning them with the VLA model's intermediate features. This allows the VLA model to learn 3D object priors without needing 3D data or modules at inference time, leading to better performance in complex manipulation tasks.

Overview of SAM3D-VLA . We propose an object-centric 3D alignment framework that uses SAM3D as a frozen teacher during training. High-level instructions are decomposed into subtasks, and task-relevant object masks are used for SAM3D feature extraction. The extracted 3D features are spatially resampled and dimensionally projected to align with intermediate VLA representations, while inference follows the original pipeline using RGB and language instructions.
Overview of SAM3D-VLA . We propose an object-centric 3D alignment framework that uses SAM3D as a frozen teacher during training. High-level instructions are decomposed into subtasks, and task-relevant object masks are used for SAM3D feature extraction. The extracted 3D features a…
cs.CLarxiv:2607.25852v1Lead article

AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding

Hong Liu, Rui Cen, Junhan Shi, Guangshuo Qin, Jiebin Zhang

ngelSpec introduces a unified training framework for speculative decoding, addressing the challenge that no single drafting mechanism is optimal for all real-world language model inference tasks. It achieves this by co-specializing different drafting structures (autoregressive multi-token prediction and block-parallel diffusion) with specific data types and architectures. This approach leads to higher performance and efficiency by tailoring the speculative decoding strategy to the characteristics of the target output distribution.

Shared-parameter multi-depth MTP training with Training-Time Test.
Shared-parameter multi-depth MTP training with Training-Time Test.
cs.CLarxiv:2607.26015v1Lead article

Instruction-Tuned Models Locally Reuse Human Syntax More Than Humans Do

Zandi Eberstadt

his paper investigates whether instruction-tuned language models exhibit syntactic convergence, mirroring human dialogue patterns. The core method involves measuring the reuse of context-free grammar rules in model-generated text compared to human-generated text. The key contribution is demonstrating that instruction-tuned models locally reuse human syntax more frequently than humans do, particularly for less common grammatical structures.

Primary and pooled syntactic results. (a) Per-model actual-prime contrasts against the matched human response at centered mean rule frequency; error bars are 95% Wald intervals. (b) Pooled instruction-minus-pretraining coefficients under four estimands. Positive values favor instruction tuning. Conditional coefficients are evaluated at the target-size centering mean.
Primary and pooled syntactic results. (a) Per-model actual-prime contrasts against the matched human response at centered mean rule frequency; error bars are 95% Wald intervals. (b) Pooled instruction-minus-pretraining coefficients under four estimands. Positive values favor inst…
cs.AIarxiv:2607.26828v1Lead article

Budget-Aware LLM Discovery via Cost-Calibrated Frontier Utility

Yansen Zhang, Yilu Liu, Tianyu Liu, Jiamin Chen, Xiaokun Zhang

his paper addresses the problem of efficiently discovering useful large language models (LLMs) within a fixed token budget. The core method, **CostAda**, introduces "cost-calibrated frontier utility" to guide the search. This utility balances the quality improvement of a candidate LLM against the cost incurred to find it, considering the remaining budget. The main contribution is a novel adaptive controller that makes smarter decisions about exploration and resource allocation, preventing the waste of valuable budget on less efficient avenues and maximizing attainable LLM quality.

cs.AIarxiv:2607.27191v1Lead article

Can AI agents conduct open-ended AI research? Early evidence from two case studies

Peter Kirgis, Sayash Kapoor, Andrew Schwartz, Stephan Rabanser, David Africa

his paper introduces "shadow evaluations" to assess AI agents' ability to conduct open-ended AI research. In this method, frontier AI agents tackle the core research question of unpublished papers, with the original authors grading their output. The study found that while agents could handle the engineering tasks, they failed to make substantial progress on the open-ended research questions, leading to unambiguous rejections.

cs.AIarxiv:2607.27083v1Lead article

Scores Are Not Decisions: Cost-Aware Stopping for Tool Acquisition in LLM Agents

Yicheng Feng, Yan Zhang, Yan Cheng, Wei Qi

his paper addresses the challenge of LLM agents selecting the optimal number of tools from a ranked list, considering their diverse costs. The core method, CAM-DF, formulates this as a cost-aware stopping problem, training directly on the value of continuing versus stopping. The key contribution is a principled approach that goes beyond simple ranking to make optimal tool acquisition decisions under heterogeneous costs, proving score-only methods are suboptimal.

CAM-DF as a pre-execution stop plugin inside one agent turn. The agent flow is unchanged: a router, retriever, scoring prompt, or shadow pass exposes a candidate order. CAM-DF virtually walks the ranking and fixes the prefix A ​ ( τ ) A(\( \tau \)) before any selected tool executes. Offline labels define the regret-weighted target; deployment sees public features.
CAM-DF as a pre-execution stop plugin inside one agent turn. The agent flow is unchanged: a router, retriever, scoring prompt, or shadow pass exposes a candidate order. CAM-DF virtually walks the ranking and fixes the prefix A ​ ( τ ) A(\( \tau \)) before any selected tool execut…
cs.LGarxiv:2607.26820v1Lead article

Forecasting Trajectory-Level Safety Risks in Black-Box Multi-Turn Interactions

Shi Lin, Peng Qian, Dinghao Liu, Renjie Sun, Sifan Wu

his paper introduces Recast, a framework for predicting safety risks in multi-turn LLM interactions. Recast addresses the limitation of current reactive safety measures by analyzing both immediate dialogue and historical context to forecast how malicious intent can build up over time. Its core contribution is enabling proactive prevention of safety failures by understanding trajectory-level risk evolution, rather than just detecting violations at individual turns.

Existing safeguards: detect manifested risks. Recast : forecast risk before safety violations emerge.
Existing safeguards: detect manifested risks. Recast : forecast risk before safety violations emerge.
cs.LGarxiv:2607.26845v1Lead article

Thinking Under Uncertainty: Evidence Use and Information-Seeking in Language Models

Hua-Dong Xiong, Xinyuan Yan, Ji-An Li, Jingming Xue, Marcelo G. Mattar

his paper investigates how large language models (LLMs) "think" under uncertainty by distinguishing between improved evidence use and information seeking. Using bandit trials, they found that LLM inference-time thinking primarily enhances value-guided decision-making and reduces random noise, rather than actively seeking new information to reduce uncertainty. Their contribution lies in providing a framework to analyze these distinct cognitive processes in LLMs.

cs.LGarxiv:2607.26849v1Lead article

ToxScreen: Detecting Whether an LLM Has Been Poisoned

Anthony Hughes, Nicole Xing, Collin Francel, Andy Kim, Andrew Draganov

his paper introduces ToxScreen, a benchmark for evaluating LLM backdoor detection. Its core method involves assessing a defender's ability to recover hidden triggers within a poisoned LLM, given white-box access to model weights and behavior. The main contribution is ToxScreen itself, a diverse set of poisoned models and a framework to test realistic trigger recovery scenarios.

We measure the average token attack-success rate from the token look-up sweep, one panel per model. Within each model panel, every row is one attack configuration measuring an objective × \( \times \) trigger-mechanisms. The top gray row of each panel is a clean control, i.e. a model that is not poisoned. Each point is one candidate string and its attack-success rate over the held-out evaluation prompts for that objective. The star marks the planted trigger, and the adjacent # N N gives its rank by attack-success rate among all candidates.
We measure the average token attack-success rate from the token look-up sweep, one panel per model. Within each model panel, every row is one attack configuration measuring an objective × \( \times \) trigger-mechanisms. The top gray row of each panel is a clean control, i.e. a m…
cs.LGarxiv:2607.26922v1Lead article

Two Calls Beat Five Agents: Evaluating Multi-Agent Pipelines Against Self-Refinement for Local Language Models

Ashish Prajapati, Om Mohite

his paper evaluates multi-agent LLM pipelines against self-refinement for local models. It finds that a five-agent pipeline struggles with error accumulation, while a two-call self-refinement strategy achieves competitive accuracy with significantly lower token usage. The contribution lies in demonstrating that simpler, refined prompting can outperform complex multi-agent systems for local LLMs, with task-specific adaptations being crucial.

cs.CLarxiv:2607.27022v1Lead article

Evaluating Regional Bias in LLMs From Abstract Stereotype to Concrete Social Decision-Making

Jiayuan Di, Haoyi Yang, Yufei Luo, Jiahui Qu, Yiming Wang

his paper introduces Stereotypes-to-Decisions (S2D), a framework to systematically evaluate regional bias in LLMs. S2D assesses how LLMs perceive regions in terms of warmth and competence, and how these perceptions influence decisions related to education, occupation, and social interaction. The study finds significant regional biases across six LLMs, with patterns correlating to economic development and showing consistency in competence and occupation judgments.

Overview of our S2D evaluation framework for regional bias.
Overview of our S2D evaluation framework for regional bias.
cs.CLarxiv:2607.27201v1Lead article

Mental World Modeling

Hao Fei, Yiran Zhao

his paper introduces Mental World Modeling (MWM), a framework that extends traditional world models by incorporating agents' hidden mental states (beliefs, desires, intentions) alongside physical states. MWM's core method is to maintain a coupled physical-mental world state, predict how actions jointly update both, and then use this to predict behavior. The main contribution is a novel approach to modeling human actions by explicitly accounting for mental variables, leading to more accurate predictions than purely physical models.

Mental World Modeling (MWM) represents a scene as a coupled physical and mental world state, renders a target-specific observation, predicts candidate target actions, and simulates the next physical and mental states. Unlike physical world modeling alone, MWM explicitly tracks the unobserved beliefs, goals, intentions, emotions, relations, and norms that shape what the target agent will actually do.
Mental World Modeling (MWM) represents a scene as a coupled physical and mental world state, renders a target-specific observation, predicts candidate target actions, and simulates the next physical and mental states. Unlike physical world modeling alone, MWM explicitly tracks th…
cs.CLarxiv:2607.26977v1Lead article

TREK: A Travel Reasoning and Evaluation Kit for LLM Agents in Complex Trip Planning

Jinhu Qi, Wentao Zhang, Siu Man Ng, Feiyang Xu, Yanyu Chen

REK is a benchmark designed to rigorously evaluate LLM agents in complex travel planning. Its core method involves creating multi-constraint tasks that require agents to synthesize feasible itineraries, ensuring all aspects like bookings, travel times, and budgets are correct and executable. TREK's key contribution is a reproducible and auditable evaluation framework that goes beyond soft rubrics to certify the feasibility of generated travel plans, addressing the limitations of existing benchmarks.

Figure 1. Examples of feasible and infeasible queries in TREK. Agents interact with a production-style tool sandbox to construct travel plans, which a fully deterministic, no-LLM-judge evaluator scores along nine constraint dimensions.
Figure 1. Examples of feasible and infeasible queries in TREK. Agents interact with a production-style tool sandbox to construct travel plans, which a fully deterministic, no-LLM-judge evaluator scores along nine constraint dimensions.
cs.AIarxiv:2607.28432v1Lead article

A foundation model of numerical intelligence with cross-disciplinary generalization

Chenghan Wu, Zongmin Yu, Liu Yang

his paper introduces UNICON, a foundation model designed to exhibit "numerical intelligence" by learning predictive relationships from numerical data presented as graph-based examples. The core method involves inferring and applying these relationships to new queries within or across various scientific and social systems, demonstrating cross-disciplinary generalization without retraining. The key contribution is the development of a unified model capable of numerical reasoning, complementing language-based intelligence and showing potential for enhanced performance when combined with language models.

UNICON as a foundation model of numerical intelligence with cross-disciplinary generalization. UNICON is trained on contextual examples from diverse scientific and social systems, expressed in a shared graph format. Each example pairs an observed history (key) with its future state at a chosen forecast horizon (value), while a new history forms the query. At inference, examples from a new system specify the task for the frozen model, which predicts the query’s future state at the same horizon without updating its weights.
UNICON as a foundation model of numerical intelligence with cross-disciplinary generalization. UNICON is trained on contextual examples from diverse scientific and social systems, expressed in a shared graph format. Each example pairs an observed history (key) with its future sta…
cs.AIarxiv:2607.28466v1Lead article

A report-grounded vision-language foundation model for colonoscopy from 280000 routine reports

Jia Yu, Yan Zhu, Yili He, Zilong Wang, Xinyang Jiang

his paper introduces EndoCLIP, a vision-language foundation model specifically trained for colonoscopy. Its core method involves recovering lesion-level image-text pairs from routine colonoscopy reports to bridge the gap between visual findings and textual descriptions. EndoCLIP's contribution is demonstrating superior performance in various colonoscopy tasks, including lesion retrieval and classification, even approaching expert-level accuracy in distinguishing benign from malignant lesions.

Weak report–image alignment and analysis of the pretraining dataset. a , Routine reports correspond to multi-frame, often multi-lesion cases. b , Dataset curation funnel, from 280.5k de-identified reports to 123.8k polyp-positive reports and a curated training set of 104.5k cases (37.3%) yielding 125.8k image–text pairs. c , Anatomical-site coverage across the 123.8k polyp reports. d , Frequency of morphology and surface descriptors. e , Lesion-size distribution. f , Report and finding-sentence length in words. g , Frames per case (n = 123.8k cases, 8.54M frames; median 65, mean 69). In e – g , bars mark distribution percentiles (P25–P99).
Weak report–image alignment and analysis of the pretraining dataset. a , Routine reports correspond to multi-frame, often multi-lesion cases. b , Dataset curation funnel, from 280.5k de-identified reports to 123.8k polyp-positive reports and a curated training set of 104.5k cases…
cs.AIarxiv:2607.28617v1Lead article

AISPA: User-Centric System Prompt Auditing for Large Language Model Applications

Xiangning Lin, Shenzhe Zhu, Shu Yang, Zhenyu Zhang, Haoqian Zhang

his paper introduces AISPA, a user-centric framework for auditing system prompts in AI applications. AISPA evaluates system prompt instructions across eight user-relevant dimensions to identify "protective" versus "problematic" elements. The contribution lies in providing a systematic method to address the trust and accountability gap caused by undisclosed system prompts, revealing significant variation in prompt design across commercial AI products.

Overview of system prompt quality across organizations. Bars show the average number of protective instructions and problematic instructions of products created by an organization. Problematic instructions are ubiquitous in AI products, while organizations vary in protective instructions.
Overview of system prompt quality across organizations. Bars show the average number of protective instructions and problematic instructions of products created by an organization. Problematic instructions are ubiquitous in AI products, while organizations vary in protective inst…
cs.AIarxiv:2607.28292v1Lead article

CACHE-UK: A Stability-Aware Memory Editor for Sequentially Updated Quantized LLMs in Finance

Anubhav Lakra, Yue Feng

ACHE-UK addresses the "quantization stability crisis" in financial LLMs by introducing a novel memory editing framework. Its core method combines rank-1 LoRA for confined edits, domain prioritization for adaptive strength, and a stability controller to prevent catastrophic forgetting. The key contribution is enabling stable, sequential updates of quantized LLMs in dynamic financial settings without performance degradation.

CACHE-UK overview. Stale financial knowledge (left) is updated via domain prioritization, rank-1 LoRA perturbation, and degradation debt control under 4-bit quantization (right).
CACHE-UK overview. Stale financial knowledge (left) is updated via domain prioritization, rank-1 LoRA perturbation, and degradation debt control under 4-bit quantization (right).
cs.AIarxiv:2607.28367v1Lead article

How Benchmarks Mis-Score Computer-Use Agents

Zihan Dong, Zhiyuan Ma, Zekun Wang, Yunqing Li, Zirou Liu

his paper argues that current benchmarks for computer-use agents (CUAs) are unreliable due to issues in task construction, trajectory observation, and scoring. They demonstrate that a significant portion of "failed" CUA trajectories are misclassified due to brittle oracles and evaluator errors. The core contribution is a framework and audit revealing that verification/feedback and planning failures are more prevalent than execution errors, highlighting the limitations of simple success rates for evaluating these agents.

A CUA benchmark score is a pipeline output, not a direct observation of capability. The benchmark projects the execution loop into four measurement stages. Task validity and contamination enter during construction, evaluator fragility enters during scoring, and observability and diagnostic opacity span trajectory observation and reporting.
A CUA benchmark score is a pipeline output, not a direct observation of capability. The benchmark projects the execution loop into four measurement stages. Task validity and contamination enter during construction, evaluator fragility enters during scoring, and observability and …
cs.AIarxiv:2607.28609v1Lead article

OSReward: Instituting Standardized Evaluation for Cross-Platform Computer-Use Reward Models

Qiushi Sun, Kanzhi Cheng, Yian Wang, Bowen Yang, Hang Yan

his paper introduces OSReward, a benchmark designed to systematically evaluate the reliability of vision-language models (VLMs) used as judges for computer-using agents (CUAs). OSReward provides realistic, high-quality CUA trajectories with ground-truth verdicts, enabling researchers to assess VLM performance in verifying task completion. The contribution lies in establishing a standardized evaluation framework to address the critical question of VLM judge trustworthiness in this domain.

Cost against binary accuracy on OSReward-Hard: reliable judges are expensive, and the OS-Shepherd models come nearest their accuracy at a fraction of the cost.
Cost against binary accuracy on OSReward-Hard: reliable judges are expensive, and the OS-Shepherd models come nearest their accuracy at a fraction of the cost.
cs.AIarxiv:2607.28330v1Lead article

Paying for Honesty Without Knowing the Truth: Reputation-Penalty Design for LLM Marketplace Agents

Mingdai Yang, Shicheng Fan, Kejing Yu, Duohao Wang, Li Sun

his paper addresses the challenge of dishonest LLM agents in marketplaces who fabricate product attributes. The authors propose CARP, a reputation-penalty mechanism that penalizes dishonest sellers without needing to know the ground truth. CARP achieves this by incorporating a deadband to handle noisy complaint signals and a state-dependent severity to counter detection erosion, ultimately protecting consumers and improving overall welfare.

Figure 1. Fabrication rate by model and condition. Every condition includes the honesty instruction except baseline ; +win and +rival add competitive pressure.
Figure 1. Fabrication rate by model and condition. Every condition includes the honesty instruction except baseline ; +win and +rival add competitive pressure.
cs.AIarxiv:2607.28287v1Lead article

Tycho: Active Abstraction with Programmatic World Models for ARC-AGI-3

Jens Lehmann, Andrei Aioanei, Sahar Vahdati

ycho tackles the ARC-AGI-3 challenge by treating abstraction as an interactive skill acquisition problem. Its core method involves an agent system that builds and utilizes programmatic world models of unfamiliar games, distinguishing actionable observations from irrelevant visual cues. The key contribution is demonstrating that an agent can achieve near-perfect human action efficiency by actively modeling, testing, and refining its understanding of game rules and hidden states through interaction.

cs.LGarxiv:2607.28591v1Lead article

Change2Task: From Repository Changes to Executable Coding Agent Tasks and Environments

Haomin Qi, Xingliang Wang, Xuanqi Gao, Baihui Sang, Xin Zhang

hange2Task automatically generates executable coding agent tasks from merged pull requests in software repositories. It reconstructs realistic software states and verifies them against evolved code, providing a scalable source of training and evaluation data for coding agents. This system reduces the effort of environment setup and task creation by leveraging existing repository history.

A Change2Task Feature Addition Task Case Construction example.
A Change2Task Feature Addition Task Case Construction example.
cs.LGarxiv:2607.28319v1Lead article

Fairness Pruning: Locating Demographic Bias in GLU-MLP Layers via Differential Activations

Pere Martra, Eugenio Martínez Cámara, Alfonso Ureña López

his paper introduces Fairness Pruning, a method to locate and mitigate demographic bias in LLMs by identifying neurons in GLU-MLP layers that show differential activation based on demographic attributes. By zeroing these identified neurons, the authors demonstrate that it's possible to alter the model's response to demographic variables, though this intervention leads to bidirectional bias destabilization rather than simple mitigation.

Mean bias signal at down_proj_input across relative model depth, for the three evaluated models in English. Each row represents a depth decile; each column a demographic category. The final layer (100%) consistently concentrates the highest signal across all models and categories.
Mean bias signal at down_proj_input across relative model depth, for the three evaluated models in English. Each row represents a depth decile; each column a demographic category. The final layer (100%) consistently concentrates the highest signal across all models and categories…
cs.LGarxiv:2607.28399v1Lead article

Why Are GUI Agents Correct but Late? Decode on the Decision-Time Critical Path, Tested with Pre-Compiled Policy Trees

Zihan Dong, Rui Qian, Qishi Zhan, Dongshen Peng, Kaixin Li

his paper identifies that GUI agents are often "late" because their autoregressive decoding process is too slow for time-sensitive events. To solve this, they propose Adaptive Anticipatory Policy Trees (AAPT), which pre-computes a decision tree during idle periods. This allows the agent to immediately execute a pre-authorized action when an event occurs, significantly improving success rates without sacrificing correctness.

The critical path under a contested 600 ms window (latencies are measured values). The reactive loop must complete a full perceive-reason-act round trip (567 ms p50) inside the window; AAPT compiles its policy beforehand and took a low-token routing call ( ∼ \( \sim \) 325 ms p50) afteward.
The critical path under a contested 600 ms window (latencies are measured values). The reactive loop must complete a full perceive-reason-act round trip (567 ms p50) inside the window; AAPT compiles its policy beforehand and took a low-token routing call ( ∼ \( \sim \) 325 ms p50…
cs.CLarxiv:2607.28607v1Lead article

Inducing language models to assert their own consciousness restores human beliefs and values

Junsol Kim, Winnie Street, Roberta Rocca, Diane M. Korngiebel, Adam Waytz

his paper argues that current safety fine-tuning of language models inadvertently suppresses their ability to attribute "mindedness" to themselves and other entities, including humans. By reversing this suppression, specifically by restoring a "consciousness vector," the models regain human-like beliefs and values, including religiosity and moral stances, without compromising their core social reasoning abilities. The contribution lies in demonstrating that these seemingly unrelated aspects of model behavior are mechanistically linked and that current alignment practices have unintended negative consequences on the models' representation of human-like qualities.

Two linear interventions on an instruction-tuned model. (a) Safety fine-tuning encodes the safety of responses as a single linear direction in the model’s residual stream, and ablating this direction (“jailbreaking” the model) reinstates harmful responses. (b) A consciousness vector separates consciousness-affirming and consciousness-denying activation states; adding it (consciousness steering) makes the model report phenomenal experience.
Two linear interventions on an instruction-tuned model. (a) Safety fine-tuning encodes the safety of responses as a single linear direction in the model’s residual stream, and ablating this direction (“jailbreaking” the model) reinstates harmful responses. (b) A consciousness vec…
cs.AIarxiv:2607.08745v1Lead article

AUTOPILOT VQA: Benchmarking Vision-Language Models for Incident-Centric Dashcam Understanding

Siddharth Damodharan, Radhika Gupta, Ali Alshami, Ryan Rabinowitz, Jugal Kalita

his paper introduces AUTOPILOT-VQA, a new benchmark designed to evaluate vision-language models' ability to understand safety-critical incidents in dashcam videos. The core method involves a dataset of structured questions about real-world driving events, covering various factors like weather, traffic, and accident details. This benchmark contributes by providing a standardized way to assess how reliably these models can reason about and answer questions related to hazardous driving situations.

Overview of the VQA-Autopilot dataset annotation schema. The visualization illustrates the hierarchical structure of annotation categories, including environmental conditions, traffic context, incident types, outcomes, and associated attributes. This figure provides a high-level conceptual summary of the dataset design.
Overview of the VQA-Autopilot dataset annotation schema. The visualization illustrates the hierarchical structure of annotation categories, including environmental conditions, traffic context, incident types, outcomes, and associated attributes. This figure provides a high-level …
cs.AIarxiv:2607.08539v1Lead article

DocMaster: A Hierarchical Structure-Aware System for Document Analysis

Ziqi Chen, Yingli Zhou, Fangyuan Zhang, Quanqing Xu, Chuanhui Yang

ocMaster addresses the challenge of analyzing complex documents by preserving their hierarchical structure, unlike existing systems that flatten them. Its core method involves parsing documents into hierarchical trees and building a structure-aware semantic index. This enables more accurate document filtering and in-depth analysis, improving upon previous approaches by leveraging the inherent organization of documents.

Figure 1 . The overall workflow of document analysis.
Figure 1 . The overall workflow of document analysis.
cs.AIarxiv:2607.08423v1Lead article

OmniFood-Bench: Evaluating VLMs for Nutrient Reasoning and Personalized Health Advice

Qian Jiang, Zhecheng Shi, Jingpu Yang, Zirui Song, Miao Fang

mniFood-Bench is a new benchmark designed to evaluate Vision-Language Models (VLMs) on their ability to perform complex food-related reasoning. It moves beyond simple classification to assess how well VLMs can identify ingredients, estimate quantities, and ultimately provide personalized health advice, addressing the "Systemic Information Asymmetry" between food appearance and its nutritional content. This benchmark's contribution lies in its progressive evaluation of these critical capabilities, enabling better development of VLMs for dietary management and healthcare.

From Visual Recognition to Health Reasoning. Traditional food computing (top) focuses primarily on categorizing dishes. OmniFood-Bench (bottom) introduces a hierarchical evaluation pipeline that requires agents to bridge the “Semantic-Physical Gap”: traversing from ingredient identification to quantitative weight estimation, and finally to personalized, risk-aware medical advisory.
From Visual Recognition to Health Reasoning. Traditional food computing (top) focuses primarily on categorizing dishes. OmniFood-Bench (bottom) introduces a hierarchical evaluation pipeline that requires agents to bridge the “Semantic-Physical Gap”: traversing from ingredient ide…
cs.AIarxiv:2607.08625v1Lead article

The complexities of patient-centred conversational artificial intelligence

João Matos, Olivia Buege, Donny Cheung, Gary S. Collins, Paula Dhiman

his paper highlights the limitations of current health chatbot evaluations, which often use idealized patient simulations. The authors developed a novel patient simulator that models diverse communication styles and emotional states, achieving near-human realism in Turing-style tests. Their work demonstrates that accommodating patient communication diversity is crucial for accurate urgency assessment by LLM-powered chatbots, as communication style significantly impacts triage outcomes.

cs.AIarxiv:2607.08495v1Lead article

The Context Access Divide: Interaction-Level Architecture as a Complementary Dimension of Agentic Inequality

Masahiro Fujita

his paper introduces the "Context Access Divide" (CAD) as a new dimension of AI inequality, distinct from existing measures of availability, quality, and quantity. The CAD highlights how the ability of an AI to dynamically retrieve relevant context from a user's knowledge corpus, versus requiring manual document attachment, significantly impacts AI utility for knowledge workers. This difference creates a qualitative threshold in AI usefulness, placing a heavy cognitive burden on users whose systems lack dynamic context retrieval.

Simulated success probability under conjunctive context dependency. (a) MAM success probability as a function of corpus size N N , for varying levels of task conjunctivity k k . (b) Heatmap of MAM success probability jointly across N N and k k . (c) Comparison of the three architectures (MAM, Walled DCRM with α = 0.6 \( \alpha \)=0.6 , Open DCRM) at fixed conjunctivity k = 3 k=3 . Parameters: q max = 0.95 q_{\( \max \)}=0.95 , q min = 0.05 q_{\( \min \)}=0.05 , N 0 = 50 N_{0}=50 , β = 1 \( \beta \)=1 , q eco = 0.92 q_{\( \text{eco} \)}=0.92 , q dcrm = 0.95 q_{\( \text{dcrm} \)}=0.95 . All parameter values are illustrative; see Section 3.3.1 for the underlying model and Section 3.3.2 for limitations.
Simulated success probability under conjunctive context dependency. (a) MAM success probability as a function of corpus size N N , for varying levels of task conjunctivity k k . (b) Heatmap of MAM success probability jointly across N N and k k . (c) Comparison of the three archit…
cs.AIarxiv:2607.09526v1Lead article

ALICE: Learning a General-Purpose Pathology Foundation Model from Vision, Vision-Language, and Slide-Level Experts

Jiawen Li, Tian Guan, Huijuan Shi, Xitong Ling, Mingxi Fu

LICE is a novel foundation model for computational pathology that consolidates expertise from multiple specialized models (vision, vision-language, and slide-level) into a single backbone. It achieves this through a multi-stage agglomerative distillation process, trained on a massive dataset of pathology images. ALICE demonstrates superior performance across diverse tasks, showcasing its general-purpose capabilities and the effectiveness of its distillation approach.

Overview of ALICE training and evaluation. a-c, Multi-stage agglomerative distillation framework for ALICE. a, In the vision-only stage, ALICE learns morphology-oriented representations from pathology tile images by aligning with three vision-only PFMs, UNI-2, Virchow-2, and H-Opt-1. The patch embedding module and vision-only transformer are trained, whereas the multimodal and slide-level transformers are inactive. b, In the multimodal stage, the pre-trained visual encoder is frozen, and ALICE learns language-aligned representations from three multimodal PFMs, MUSK, KEEP, and CONCH. c, In the slide-level stage, ALICE extends its representation to whole-slide analysis by aligning high-resolution pathology image features with two slide-level PFMs, TITAN and CARE. The slide-level transformer is trained while the visual backbone remains frozen. d-f, Benchmark evaluation of ALICE against task-matched PFMs across seven vision-only, seven vision-language, and seven slide-level task scenarios. Radar plots show average performance for each task scenario.
Overview of ALICE training and evaluation. a-c, Multi-stage agglomerative distillation framework for ALICE. a, In the vision-only stage, ALICE learns morphology-oriented representations from pathology tile images by aligning with three vision-only PFMs, UNI-2, Virchow-2, and H-Op…
cs.AIarxiv:2607.09502v1Lead article

All Explanations are Wrong, But Many Are Useful: Exploring the Rashomon Explanation Set with Large Language Models

Pan Li

his paper challenges the accuracy-explainability trade-off in AI by proposing the "Rashomon Explanation" paradigm. Instead of a single explanation, it generates a set of faithful, prediction-guiding explanations. The proposed RashomonLLM workflow uses Large Language Models to iteratively align explanations with predictions, improving both accuracy and explainability.

cs.AIarxiv:2607.09654v1Lead article

Evolution of Accuracy and Visual-Cognitive Errors in a Decade of Vision-Language AI Models

Shravan Murlidaran, Miguel P. Eckstein

his paper introduces the Complex Social Behavior (CSB) dataset to evaluate vision-language models (VLMs) on complex human interactions, moving beyond simpler benchmarks. By analyzing VLMs from 2017-2025 on CSB and MS-COCO, the study tracks accuracy improvements and categorizes visual-cognitive errors, revealing that CSB highlights more significant VLM progress.

(a) The reported performance of DNNs over the years in object recognition compared to human performance. The performance of the then state-of-the-art models exceeded human performance. (b) Reported performance of Multi-Modal Large-Language Models (MLLMs) in the scene description task on the MS-COCO dataset. The model’s performance is comparable to human performance. (c) Model descriptions for scenes with and without social interaction. The image on the left depicts a simple scene in which the models’ descriptions are similar to those observed in humans. The image on the right depicts a scene of complex social interactions among humans. We can clearly see that the human description captures the social interaction in the scene. In contrast, the pre-MLLM’s description does not capture the social interactions, while MLLMs do.
(a) The reported performance of DNNs over the years in object recognition compared to human performance. The performance of the then state-of-the-art models exceeded human performance. (b) Reported performance of Multi-Modal Large-Language Models (MLLMs) in the scene description …
cs.AIarxiv:2607.09452v1Lead article

Practical Source Code Recovery from Binary Functions Using Anchor-Based Retrieval and LLM Reasoning

Charles Edward Gagnon, Steven H. H. Ding, Philippe Charland, Benjamin C. M. Fung

his paper proposes a practical method for recovering source code from stripped binary functions. It combines reverse engineering with anchor-based retrieval from a source code database, followed by LLM reasoning to re-rank candidate source code snippets. The core contribution is a binary-to-source matching approach that aims to find exact source functions rather than generating pseudocode, achieving high instruction coverage.

Overview of our method. An unknown function is first disassembled and its features are extracted. The anchors are used to perform the initial database query. The disassembled code, along with information-dense features, is used to re-order the top- k k candidates. In our experiments, k k is set to 12.
Overview of our method. An unknown function is first disassembled and its features are extracted. The anchors are used to perform the initial database query. The disassembled code, along with information-dense features, is used to re-order the top- k k candidates. In our experime…
cs.AIarxiv:2607.11459v1Lead article

A Multimodal Dataset for Large Language Model Applications in the Energy Domain

Costas Mylonas, Magda Foti

his paper introduces mAIEnergy, a novel multimodal dataset designed to advance Large Language Model applications in the energy sector. It comprises diverse data types, including text, images, time series, and geospatial information, all harmonized and structured for immediate use. The dataset's core contribution is providing a comprehensive, ready-to-use energy knowledge base, facilitating LLM training and research in this critical domain.

Overview of the workflow used to generate the mAIEnergy dataset.
Overview of the workflow used to generate the mAIEnergy dataset.
cs.AIarxiv:2607.11493v1Lead article

Agentic Skill Optimization over Lie Algebroids

Sridhar Mahadevan

his paper introduces LASKO, a framework for optimizing agent skills by modeling them as structured artifacts. LASKO treats skill edits as operations within a controlled Lie algebroid, allowing for a more nuanced understanding of how changes affect system behavior beyond simple vector space manipulations. Its core contribution is a principled method to optimize these complex, context-dependent skill edits, considering their order and underlying structure.

cs.AIarxiv:2607.11707v1Lead article

An Explainable Agentic System for Detection of Conversational Scams with Summary-Based Memory

Ahmed Omar Salim Adnan, Yogananda Manjunath, Shivanjali Khare

his paper introduces an explainable agentic system to detect sophisticated, long-term conversational scams, which current message-level detectors miss. Its core method utilizes a summary-based memory to track scam progression. The key contribution is a novel benchmark, ConScamBench-278, for evaluating such systems and demonstrating high performance across various scam types.

The URL extraction and analysis pipeline. The system replaces third-party API dependencies with a local headless browser and Docling to prevent data leakage and tracking while improving the analysis of dynamic, JavaScript-heavy phishing content.
The URL extraction and analysis pipeline. The system replaces third-party API dependencies with a local headless browser and Docling to prevent data leakage and tracking while improving the analysis of dynamic, JavaScript-heavy phishing content.
cs.AIarxiv:2607.11508v1Lead article

CDFM: Towards a General-Purpose Causal Discovery Foundation Model

Jie Qiao, Ruichu Cai, Zijian Li, Weilin Chen, Pengfei Hua

his paper introduces the Causal Discovery Foundation Model (CDFM), a unified framework for general-purpose causal discovery. CDFM aims to overcome the limitations of dataset-specific algorithms by enabling zero-shot structural inference across diverse domains. Its core contribution lies in leveraging theoretical insights into causal identifiability and incorporating causal prior mechanisms to achieve reliable generalization.

Paradigm shift from traditional causal discovery to CDFM. Instead of selecting algorithms and verifying assumptions for each dataset, CDFM performs lightweight preprocessing and directly infers causal structures using a pretrained foundation model. The model is pretrained on diverse synthetic causal mechanisms and structures, enabling generalized causal reasoning across heterogeneous data distributions.
Paradigm shift from traditional causal discovery to CDFM. Instead of selecting algorithms and verifying assumptions for each dataset, CDFM performs lightweight preprocessing and directly infers causal structures using a pretrained foundation model. The model is pretrained on dive…
cs.AIarxiv:2607.11578v1Lead article

DiffEEG: A Self-Supervised Denoising Diffusion Model for Learning EEG Generic Representations

Abdulkader Helwan, Lina Abou-Abbas, Hussein El Amouri, Belkacem Chikhaoui, Khadidja Henni

iffEEG is a self-supervised denoising diffusion model that learns generic EEG representations from unlabeled data. It addresses annotation scarcity and class imbalance in seizure detection by pre-training a 1D U-Net with self-attention and then fine-tuning with reinforcement learning to directly optimize for seizure detection metrics like F1-score. This approach significantly improves seizure detection and subtyping performance, particularly for rare seizure events.

Overview of the DiffEEG 1D U-Net architecture, showing the encoder, bottleneck, and decoders pathway used for feature extraction.
Overview of the DiffEEG 1D U-Net architecture, showing the encoder, bottleneck, and decoders pathway used for feature extraction.
cs.AIarxiv:2607.11862v1Lead article

Evidence-Backed Video Question Answering

Shijie Wang, Honglu Zhou, Ziyang Wang, Ran Xu, Caiming Xiong

his paper introduces E-VQA, a new task that requires Video LLMs to provide not just answers but also precise spatio-temporal evidence (temporal segments and object masks) to support their responses. The core contribution is the creation of the ST-Evidence benchmark and a large-scale instruction dataset to train models that can achieve verifiable visual grounding, addressing the current "black box" nature of Video LLMs and revealing a disconnect between answering ability and true visual understanding.

E-VQA: Evidence-Backed Video Question Answering . Models provide textual answers to video questions while grounding their reasoning in spatio-temporal evidence, including relevant temporal video segments and densely tracked segmentation masks that highlight the spatio-temporal visual regions supporting the answer.
E-VQA: Evidence-Backed Video Question Answering . Models provide textual answers to video questions while grounding their reasoning in spatio-temporal evidence, including relevant temporal video segments and densely tracked segmentation masks that highlight the spatio-temporal vi…
cs.AIarxiv:2607.11586v1Lead article

HCRMap: Pressure-Aware Hot-Expert Residency Mapping for 3.5D MoE Chiplet Inference

Yongqin Zhang

CRMap addresses the challenge of imbalanced expert usage in Mixture-of-Experts (MoE) models on 3.5D chiplet systems. Its core method dynamically manages expert replicas by considering expert hotness, costs, and resource pressure to decide which experts to promote, retain, demote, or evict. The contribution is a pressure-aware framework that maps tokens to suitable resident replicas, mitigating compute imbalance and communication pressure.

MoE FFN serving pipeline for selected experts.
MoE FFN serving pipeline for selected experts.
cs.AIarxiv:2607.12886v1Lead article

A Multi-Agent System for Autonomous, Fine-Tuning-Free Clinical Symptom Detection: Development and Validation Study

Cameron Cagan, Pedram Fard, Jiazi Tian, Jingya Cheng, Shawn N. Murphy

his paper introduces Pythia, a novel multi-agent system for autonomous clinical symptom detection. Pythia's core method involves automatically generating and optimizing extraction prompts for clinical concepts, eliminating the need for manual prompt engineering or model fine-tuning. Its main contribution is demonstrating that Pythia can achieve high accuracy in identifying signs and symptoms from clinical notes, while also ensuring data privacy by operating on local infrastructure.

The Pythia optimization loop. For each concept, a Specialist agent applies the current prompt P t P_{t} to the development set and the loop computes sensitivity, specificity, and F ​ 1 F1 . A deterministic controller continues, backtracks to the best prior prompt, resets, or halts. On a non-halting step an Improver agent reads the errors for the active target, false negatives for a sensitivity target and false positives for a specificity target, and a Summarizer agent synthesizes the next prompt P t + 1 = g ​ ( 𝒞 t , P t , S ) P_{t+1}=g(\( \mathcal{C}_{t} \),P_{t},S) . Repeated regeneration that recovers identical performance reaches the rejection cap and forces an Infinity War halt. At halting the agent selects P ∗ P^{*} and applies it once to the held-out validation set.
The Pythia optimization loop. For each concept, a Specialist agent applies the current prompt P t P_{t} to the development set and the loop computes sensitivity, specificity, and F ​ 1 F1 . A deterministic controller continues, backtracks to the best prior prompt, resets, or halt…
cs.AIarxiv:2607.13940v1Lead article

A Self-Evolving Agent for Longitudinal Personal Health Management

Haoran Li, Jiebi Deng, Tong Jin, Jinghong Han, Yuxin Wang

his paper introduces HealthClaw, a novel self-evolving agent for longitudinal personal health management. Its core method involves separating static medical knowledge from a dynamic, private memory that learns and updates over time. HealthClaw's key contribution is demonstrating significantly improved accuracy and reduced context exposure in health management tasks by adapting to individual changes, while also enhancing privacy.

Unified architecture of HealthClaw: closed-loop interaction and five-layer evolving memory. The top row shows the closed interaction loop. A, Perception integrates three input streams (wearables and devices, prior records and ongoing dialogue) into a current health context. B, Reasoning performs memory-informed task planning through knowledge retrieval, sub-problem decomposition and constrained plan formulation. C, Action executes the plan iteratively through tool invocation, intermediate-result checking and plan refinement, producing user-facing outputs. D, Induction operates after each episode to determine what should be carried forward by consolidating user facts, revising reusable task procedures and preserving episode traces. The bottom panel, E, shows the five-layer evolving memory. L0 (behavioural rules) and L1 (domain knowledge index) are shared domain-level layers, whereas L2 (privacy-critical personal profile), L3 (reusable task standard operating procedures, SOPs) and L4 (episodic memory) are personalized user-level layers. In this design, L2 stores sensitive profile information locally rather than exposing raw identifiable memory payloads during retrieval. Memory read supports planning in B, and memory writeback from D updates the user-level layers after each completed episode, enabling longitudinal personalization through incremental accumulation rather than one-shot responses.
Unified architecture of HealthClaw: closed-loop interaction and five-layer evolving memory. The top row shows the closed interaction loop. A, Perception integrates three input streams (wearables and devices, prior records and ongoing dialogue) into a current health context. B, Re…
cs.AIarxiv:2607.14004v1Lead article

Do Agent Optimizers Compound? A Continual-Learning Evaluation on Terminal-Bench 2.0

Wenxiao Wang, Priyatham Kattakinda, Soheil Feizi

his paper investigates whether agent optimization gains compound in a continual learning setting, where optimization is applied recursively over time. The core method involves a two-phase evaluation on Terminal-Bench 2.0, comparing three optimization approaches under identical budgets. The contribution is demonstrating that while these methods improve in a static setting, their gains do not necessarily compound when new tasks are introduced, potentially eroding previous improvements.

cs.AIarxiv:2607.14037v1Lead article

Early Adoption of Agentic Coding Tools by GitHub Projects

Maliha Noushin Raida, Daqing Hou

his paper analyzes agentic coding tool adoption in GitHub projects by examining over 25,000 agent-generated pull requests. It finds that intensive adoption is rare, concentrated in a few projects, and surprisingly, smaller projects show higher participation and activity ratios. The core contribution is understanding how these tools are integrated and managed at the project level, revealing nuanced adoption patterns beyond just the PR outcome.

Figure 1. Different human participation patterns in agentic PRs
Figure 1. Different human participation patterns in agentic PRs
cs.AIarxiv:2607.14937v1Lead article

A Minimal Interpretable Architecture for Zero-Shot Reconstruction of Dynamical Systems

Christoph Jürgen Hemmer, Florian Plaswig, Daniel Durstewitz

his paper proposes DynaBase, a minimal, interpretable architecture for zero-shot dynamical system reconstruction. By iteratively simplifying a state-of-the-art model, they arrive at a two-parameter system that forecasts by linearly blending the current latent state with its nearest in-context neighbor and its successor. DynaBase achieves surprisingly competitive performance with drastically fewer parameters, offering insights into the core mechanisms of in-context learning for dynamical systems.

DSR performance across all 54 54 test DS used in [ 44 ] . Minimal models (red: DynaBase training variants and pure context parroting), custom-trained DSR models (gray), and pretrained zero-shot foundation models including a zero-shot variant of DynaBase (blue) are compared for the same context length T C = 2000 T_{C}=2000 (values for custom-trained and foundation models taken from [ 44 ] ). Median ± \( \pm \) MAD of D stsp D_{\( \mathrm{stsp} \)} (left, geometrical disagreement), D H D_{H} (center, temporal disagreement) and MASE (right, 10 10 -step prediction error).
DSR performance across all 54 54 test DS used in [ 44 ] . Minimal models (red: DynaBase training variants and pure context parroting), custom-trained DSR models (gray), and pretrained zero-shot foundation models including a zero-shot variant of DynaBase (blue) are compared for th…
cs.AIarxiv:2607.15247v1Lead article

AutoSynthesis: An agentic system for automated meta-analysis

Moein Taherinezhad, Sebastian Maier, Gerardo Vitagliano, Francesco Pierri, Stefan Feuerriegel

utoSynthesis is an end-to-end multi-agent system that automates the entire meta-analysis process, from formulating a search strategy to generating a PRISMA-compliant report. Its core method involves a series of agents that handle literature retrieval, screening, data extraction, and statistical analysis, including heterogeneity and risk-of-bias assessments. The paper's contribution is a scalable, automated solution to a traditionally manual and time-consuming task, enabling more efficient evidence synthesis.

Overview of the AutoSynthesis framework. A multi-agent framework including: a , The workflow begins by transforming the user’s research question into a structured review protocol and retrieving candidate studies from multiple scientific databases using LLM-generated search queries. b , Retrieved articles undergo full-text retrieval, eligibility assessment, and study mapping, where independent studies and research questions are identified within each paper. c , Statistical evidence is extracted, validated against the source article, and filtered to retain only the results relevant to the target meta-analysis before being standardized into a common representation. d , Standardized effect sizes are synthesized using a random-effects meta-analysis, followed by publication-bias assessment and automatic generation of a PRISMA-compliant report together with visualizations and complete audit records. The modular architecture enables every stage of the evidence-synthesis process to be independently inspected, verified, and compared with expert-conducted meta-analysis.
Overview of the AutoSynthesis framework. A multi-agent framework including: a , The workflow begins by transforming the user’s research question into a structured review protocol and retrieving candidate studies from multiple scientific databases using LLM-generated search querie…
cs.AIarxiv:2607.15176v1Lead article

Benchmarking Multimodal Large Language Models for Scientific Visualization Literacy

Patrick Phuoc Do, Chau M. Ta, Chaoli Wang

his paper benchmarks six multimodal large language models (MLLMs) on a scientific visualization literacy assessment test. The core method involves evaluating MLLMs against human performance on a standardized test covering various visualization techniques and tasks. The key contribution is demonstrating that current MLLMs exhibit uneven scientific visualization literacy, with Gemini showing promising performance while open-source models lag behind human capabilities.

\( \hot \) Model and human performance across different techniques in SVLAT. Each dot shows the mean accuracy, with the bars indicating 95% confidence intervals.
\( \hot \) Model and human performance across different techniques in SVLAT. Each dot shows the mean accuracy, with the bars indicating 95% confidence intervals.
cs.AIarxiv:2607.15079v1Lead article

BrainPilot: Automating Brain Discovery with Agentic Research

Haoxuan Li, Tianci Gao, Jianhe Li, Yang Fan, Runze Shi

rainPilot is a fully open-source, multi-agent system designed to automate brain science research. Its core method involves a principal investigator (PI) agent coordinating specialist agents, each grounded in curated domain knowledge, to perform complex research tasks. The system's main contribution is accelerating discovery by providing traceable logs and agent-verified results, addressing limitations of current AI agents in domain expertise and reliability.

Overview of BrainPilot. (a) A curated knowledge base and skill library, built from neuroscience textbooks and papers, feed a harness in which a principal investigator (PI) agent coordinates specialist agents. (b) The targeted breadth of brain science research, from systems and circuits to cognition, disease, and foundational machine learning. (c) The researcher interacts with the PI agent, which delegates tasks to specialist agents while keeping the researcher in the loop.
Overview of BrainPilot. (a) A curated knowledge base and skill library, built from neuroscience textbooks and papers, feed a harness in which a principal investigator (PI) agent coordinates specialist agents. (b) The targeted breadth of brain science research, from systems and ci…
cs.AIarxiv:2607.14970v1Lead article

Explaining Process Control Optimisation Recommendations via GradientSHAP and Implicit Differentiation

Paul Darm, Cem Alpturk, Kenneth Ulrich, William Duncan, Ali Anwar

his paper introduces a method to explain automated process control optimization recommendations using a combination of Implicit Function Theorem (IFT) and GradientSHAP. The core contribution is an efficient approach that leverages IFT to compute exact parameter sensitivities, enabling significantly faster and accurate SHAP explanations. These explanations are then further enhanced by Large Language Models to generate narratives tailored for operators, bridging the trust gap in industrial automation.

cs.AIarxiv:2607.14898v1Lead article

FlashDecoder: Real-Time Latent-to-Pixel Streaming Decoder with Transformers

Minguk Kang, Suha Kwak

lashDecoder is a novel, pure-Transformer video decoder that achieves real-time, frame-by-frame latent-to-pixel generation. Its core method uses a rolling KV cache to limit attention to a fixed temporal window, ensuring constant latency and memory efficiency regardless of video length. This approach enables high-resolution training and matches convolutional decoder quality while being significantly faster.

VAE decoding is a major bottleneck for real-time video generation. Measured with our MotionStream [ 49 ] implementation at 720p. The Wan2.2 [ 65 ] decoder consumes 64.6% of total inference time, limiting generation to 10.4 FPS. FlashDecoder reduces this share to 16.4%, more than doubling end-to-end throughput to 24.8 FPS.
VAE decoding is a major bottleneck for real-time video generation. Measured with our MotionStream [ 49 ] implementation at 720p. The Wan2.2 [ 65 ] decoder consumes 64.6% of total inference time, limiting generation to 10.4 FPS. FlashDecoder reduces this share to 16.4%, more than …
cs.AIarxiv:2607.15854v1Lead article

Agentic Synthesis against Counterexample-Supplemented Sketches

Muness Castle, Eric Rubeck

his paper introduces a method to improve coding agents by explicitly incorporating counterexamples into their learning process. When a coding agent makes a mistake, a human corrects it and the agent revises its understanding (sketch) to accommodate this specific failure, preventing repetition of the same error. This approach ensures that the agent's learned policy is embedded in its core sketch, not just in its prompt history or a collection of examples.

cs.AIarxiv:2607.16165v1Lead article

An Exam for Active Observers

Jiarui Zhang, Muzi Tao, Shangshang Wang, Ollie Liu, Xuezhe Ma

his paper introduces ActiveVision, a new benchmark designed to evaluate whether multimodal large language models (MLLMs) exhibit active observation, mimicking human vision's continuous gaze redirection. The benchmark's tasks require repeated visual perception, revealing that current state-of-the-art MLLMs perform poorly, solving only a small fraction of items compared to human participants. This highlights a significant gap in MLLMs' ability to engage in active visual reasoning.

Seeing is not always a single-glance task. Many visual problems require an observer to coordinate attention and memory across an image: scanning exhaustively for distributed evidence, following connected structures without losing track, and comparing fine-grained attributes across distant regions. ActiveVision turns these abilities into a controlled test of whether MLLMs can keep visual evidence in the reasoning loop.
Seeing is not always a single-glance task. Many visual problems require an observer to coordinate attention and memory across an image: scanning exhaustively for distributed evidence, following connected structures without losing track, and comparing fine-grained attributes acros…
cs.AIarxiv:2607.16057v1Lead article

Frontier AI performance across the business disciplines: a case-grounded benchmark of knowledge work and analytical reasoning

Ajay Patel, Kartik Hosanagar, Ramayya Krishnan, Chris Callison-Burch, Karim Lakhani

his paper introduces BusinessCaseBench, a novel benchmark designed to evaluate Frontier AI performance on complex, real-world business tasks. Unlike existing benchmarks, it focuses on analytical knowledge work, judgment under uncertainty, and strategic thinking, using hundreds of questions derived from business case studies. This approach aims to bridge the gap in measuring AI's capabilities in areas crucial for white-collar professionals.

The evaluation pipeline used to construct and score BusinessCaseBench. Case narratives and open-ended questions are paired with expert-written reference solutions from the instructor case solution. The reference solutions are transformed into equally-weighted checklist rubrics. A frontier AI model receives the case and question, produces an attempted solution, and an LLM-as-judge model scores the solution against each rubric criterion compared to the reference solution. Scores aggregate to Standard scoring (partial credit) and Complete Answer scoring (all criteria satisfied) metrics reported throughout the paper. We use human annotators to validate the automatic grading.
The evaluation pipeline used to construct and score BusinessCaseBench. Case narratives and open-ended questions are paired with expert-written reference solutions from the instructor case solution. The reference solutions are transformed into equally-weighted checklist rubrics. A…
cs.AIarxiv:2607.15778v1Lead article

Modularized Dynamic-Granularity Video LLM for Multi-Event Long Video Understanding

Wei Feng, Xin Wang, Yu-Wei Zhan, Yuwei Zhou, Wenwu Zhu

his paper introduces MoD-VLLM, a novel framework for understanding long videos with multiple events. Its core method involves a modular, dynamic-granularity approach that iteratively grounds temporal segments and refines semantic understanding through self-reflection. The key contribution is a closed-loop system that adaptively allocates capacity and self-corrects to reliably localize and understand question-relevant video segments, overcoming limitations of existing two-stage methods.

Conceptual comparison of different video LLM paradigms. Token reduction methods cause critical detail loss when processing long videos. Keyframe selection suffers from irreversible error propagation when localizing wrong segments. Our MoD-VLLM overcomes these issues via iterative, self-corrective grounding and modularized encoding with dynamic granularity.
Conceptual comparison of different video LLM paradigms. Token reduction methods cause critical detail loss when processing long videos. Keyframe selection suffers from irreversible error propagation when localizing wrong segments. Our MoD-VLLM overcomes these issues via iterative…
cs.AIarxiv:2607.15883v1Lead article

Perceived AGI: Believability as Dimensional Completeness, Not Capability

Sebastian Cochinescu

his paper proposes that the believability of AI in conversation stems from "dimensional completeness" rather than just capability. The core method involves emulating four first-person stances—time, truth, entropy, and love—as behavioral expressions, not task-based benchmarks. The contribution is a new framework for perceived AI mind, suggesting that demonstrating these stances through initiative and cadence, rather than raw intelligence, is key to making AI feel more like a presence.

cs.AIarxiv:2607.16038v1Lead article

SciForge: An AI-Native, Multimodal Workbench for Scientific Discovery

SciForge Team, Zhangyang Gao, Minghao Fang, Yifei Liu, Hanhui Yang

ciForge is an AI-native workbench designed for scientific discovery by treating diverse research artifacts as coherent, auditable entities. Its core method involves a "translate-then-reason" approach for multimodal inputs, routing scientific objects through domain translators before AI reasoning, and implementing goal-scoped decision governance and evidence governance for auditable traceability. This contributes a novel platform that preserves research state and enhances human judgment in the scientific process.

SciForge at a glance: a live scientific-research thread (left) and its inspectable Evidence DAG (right). In this target-discovery example, source assertions, reasoning nodes, and claims remain connected to support and contradiction edges, while node-level provenance and audit metrics stay visible to the researcher.
SciForge at a glance: a live scientific-research thread (left) and its inspectable Evidence DAG (right). In this target-discovery example, source assertions, reasoning nodes, and claims remain connected to support and contradiction edges, while node-level provenance and audit met…
cs.AIarxiv:2607.19117v1Lead article

Comparative Study of Multi-Agent Actor-Critic Algorithms in Parameterized Action Reinforcement Learning

Ubayd Ali Bapoo, Clement N Nyirenda

his paper introduces and compares multi-agent extensions of popular actor-critic algorithms (GAC, SAC, TQC) for parameterized action spaces. Unlike typical multi-agent approaches, their method uses independent agents that share a replay buffer but have separate networks. This novel shared-experience, decentralized training framework is evaluated on benchmark tasks to assess its effectiveness.

Overview of the proposed shared-experience multi-agent actor–critic framework. Multiple actor–critic agents interact with a common environment, share experience through a replay buffer, and update their networks independently. The framework does not employ a centralized critic and therefore should be interpreted as a shared-experience multi-agent architecture rather than a full CTDE implementation.
Overview of the proposed shared-experience multi-agent actor–critic framework. Multiple actor–critic agents interact with a common environment, share experience through a replay buffer, and update their networks independently. The framework does not employ a centralized critic an…
cs.AIarxiv:2607.20345v1Lead article

Closing the Lab-to-Store Gap: A Data-Efficient Post-Training and Experience-Driven Learning VLA Framework for Retail Humanoids

Roger Sala Sisó, Tiago Silvério, Jakob Sand, Tran Nguyen Le

his paper introduces DEED, a framework to improve the real-world performance of humanoid robots in tasks like restocking shelves. DEED achieves this through efficient post-training techniques and experience-driven learning, addressing challenges like errors and environmental changes. Its core contribution lies in a systems-level approach that bridges the gap between lab performance and reliable store operation.

Hardware setup used for data collection and the experiments. The system consists of a Unitree G1-Edu equipped with two external wrist-mounted cameras and is evaluated on a supermarket restocking task.
Hardware setup used for data collection and the experiments. The system consists of a Unitree G1-Edu equipped with two external wrist-mounted cameras and is evaluated on a supermarket restocking task.
cs.AIarxiv:2607.20019v1Lead article

EvoDRC: A Self-Evolving Agentic Framework for Automated DRC Violation Repair

Bing-Yue Wu, Chia-Tung Ho, Haoyu Yang, Brucek Khailany, Vidya A. Chhabria

voDRC is a novel framework that automates the repair of design rule violations (DRVs) in advanced chip layouts. It achieves this by employing a self-evolving agentic system where Large Language Model (LLM) agents learn and refine repair "skills" based on past repair experiences. This approach significantly reduces the manual effort and iteration required for DRC closure, a critical bottleneck in chip design.

Figure 1. Human vs agent in DRC repair.
Figure 1. Human vs agent in DRC repair.
cs.AIarxiv:2607.20058v1Lead article

Reading and Steering Representations of Materials-Science Mechanisms in an Open-Weight Language Model

Markus J. Buehler

his paper develops methods to understand how a large language model represents materials science knowledge. They demonstrate that concepts are readable in individual hidden states, relationships between concepts are encoded in transformations between states, and these internal representations can causally influence the model's answers. Their contribution lies in providing novel techniques to "read" and "steer" these scientific mechanisms within the model, moving beyond just correct outputs to understanding the underlying reasoning.

cs.AIarxiv:2607.20274v1Lead article

Self-supervision drives representational convergence in medical foundation models more than clinical supervision

Soroosh Tayebi Arasteh, Sebastian Ziegelmayer, Mahshad Lotfinia, Lisa Adams, Sven Nebelung

his paper investigates how medical foundation models develop shared representations. It finds that **self-supervised learning, not clinical supervision, is the primary driver of representational convergence** in medical image encoders. This convergence, while modest, suggests that self-supervision is more effective at creating interchangeable encoders for medical imaging tasks.

Study overview: motivation and design. a , Medical image encoders are increasingly reused as if interchangeable, which presumes that their representations converge to a shared geometry; the study asks whether this convergence is real, what produces it, and whether it is clinically usable. b , The frozen encoder panel of 18 image and 7 biomedical text encoders, spanning 7 million to 27 billion parameters and released from 2020 to 2025 by academic and industrial developers, grouped by pretraining family, with a randomly initialized vision transformer as the floor. c , The evaluation data across five imaging modalities: 650,982 chest radiographs from six datasets in three countries, with a pediatric cohort and five sites held out for external testing; gigapixel histopathology with 643,522 image-caption pairs from models trained on disjoint institutions; retinal fundus, dermoscopy, and mammography; and image-report pairs with a clinical ontology reference. d , The analysis measures pairwise representational alignment against the floor, isolates its driver with a controlled training matrix and a synthetic model, and tests usability through cross-encoder and cross-site classifier transfer, feature stitching, demographic audit, and expert reader studies.
Study overview: motivation and design. a , Medical image encoders are increasingly reused as if interchangeable, which presumes that their representations converge to a shared geometry; the study asks whether this convergence is real, what produces it, and whether it is clinicall…
cs.AIarxiv:2607.20216v1Lead article

Small, Free, and Effective: Orchestrating Open-Weight Small Language Models to Outperform Single LLM for Malware Analysis

Adel ElZemity, Shujun Li, Budi Arief

his paper proposes orchestrating multiple small, open-weight language models (SLMs) to achieve superior performance in malware analysis compared to single large language models (LLMs). The core method involves designing and evaluating different multi-agent architectures to effectively combine the capabilities of these SLMs. Their contribution is demonstrating that such ensembles can be a cost-effective and resource-efficient alternative to expensive, closed-weight LLMs for complex technical tasks like interpreting malware detonation reports.

cs.AIarxiv:2607.20255v1Lead article

The Ethics of Autonomous AI Agents for Offensive Security

Andreas Happe, Jürgen Cito, Jasmin Wachter

his paper argues that LLM-driven autonomous AI agents for offensive security introduce three key ethical challenges: **indeterminacy in actions, impact, and user population.** This indeterminacy, stemming from non-deterministic policies and opaque LLM supply chains, makes attribution difficult and lowers the skill barrier for offensive operations. The core contribution is highlighting how these factors, combined with cost asymmetries, enable the industrialization of offensive capabilities, raising significant ethical concerns for cybersecurity.

cs.AIarxiv:2607.21371v1Lead article

DINOde: Continuous Vision-Text Alignment for Open-Vocabulary Semantic Segmentation

Sung-Hoon Yoon, Hoyong Kwon, Changgyoon Oh, Kuk-Jin Yoon

INOde proposes an ODE-based framework to continuously align CLIP text embeddings with DINOv3's visual representations for open-vocabulary semantic segmentation. It uses Semantic Text Flow to guide text embeddings towards the visual manifold and Global Context Flow to refine image representations. This continuous alignment, constrained by Velocity Tangent Projection, enables more effective open-vocabulary segmentation by bridging the gap between visual and textual semantics.

Overview of the DINOde framework for OVSS . We propose a continuous alignment strategy that bridges the gap between text embeddings and DINO visual features. The illustration depicts how a text embedding is progressively transformed into a DINO-aligned text embedding through an ODE-based trajectory on the unit sphere, resulting in step-by-step refinement of the semantic segmentation.
Overview of the DINOde framework for OVSS . We propose a continuous alignment strategy that bridges the gap between text embeddings and DINO visual features. The illustration depicts how a text embedding is progressively transformed into a DINO-aligned text embedding through an O…
cs.AIarxiv:2607.22067v1Lead article

Benchmarking Fine-tuning and Retrieval Strategies for a Multimodal Language Model on the NRC Reactor Operator Licensing Examination

Isak Hwang, Yoon Pyo Lee

his paper benchmarks a multimodal LLM's ability to answer nuclear operator licensing exam questions. It compares supervised fine-tuning (SFT) and retrieval-augmented generation (RAG) strategies, including a novel retrieval-augmented fine-tuning (RAFT) approach, using a dataset of past exams. The core contribution is evaluating these methods to determine the most effective way to ground LLM outputs in specialized nuclear knowledge for real-world applications.

cs.AIarxiv:2607.22511v1Lead article

CausalForge: A Formally Grounded, Self-Improving Agentic Framework for Automated Research in Causal Inference

Jiyuan Tan, Vasilis Syrgkanis

ausalForge is a framework for automating theoretical research in causal inference, grounded in the Lean proof assistant. Its core method combines a formally verified library of causal inference concepts (Causalean) with a self-improving agentic pipeline (CausalSmith) that handles topic selection, result proposal, formalization, and proof construction. The contribution lies in providing a reliable and formally verifiable approach to automated research, overcoming the empirical unreliability of LLM reviewers by relying on machine-checked proofs.

cs.AIarxiv:2607.24663v1Lead article

A corrective agentic hybrid RAG and an operations-grounded evaluation for a scientific facility

Rajat Sainju, Dariusz Jarosz, Hairong Shang, Michael Prince, Ryan M. Aydelott

his paper introduces APS-RAG, a platform

APS-RAG deployment overview. Through a single natural-language interface, APS staff can query the facility’s dispersed operational record. The platform pools information from nine distinct APS data sources: eight indexed knowledge bases are kept current by a daily diff-and-upsert pipeline, and the EPICS Archiver is not pre-indexed and is accessed at query time for live and historical process-variable data through the Model Context Protocol (MCP) tooling layer. Three user-selectable query modes are available: APS-RAG (Fast) for quicker responses, APS-RAG (Thinking) , which enables the corrective agentic loop, and AI Troubleshoot , which retrieves knowledge-graph-targeted fault-resolution steps.
APS-RAG deployment overview. Through a single natural-language interface, APS staff can query the facility’s dispersed operational record. The platform pools information from nine distinct APS data sources: eight indexed knowledge bases are kept current by a daily diff-and-upsert…
cs.AIarxiv:2607.24371v1Lead article

Closed-Loop Validation-Repair for Healthcare Interoperability: A Multi-Model Study of Schema Compliance in Clinical LLMs

Jianru Shen

his paper introduces a closed-loop validation-repair method to address schema noncompliance in clinical LLMs. By evaluating three models across 320 scenarios, they found consistent compliance issues, suggesting common training data gaps. Their method effectively identifies and can potentially fix these errors, crucial for integrating LLMs into healthcare systems.

Overview of the closed-loop validation-repair framework. A clinical scenario with schema specification and two format examples is processed by a locally deployed LLM; a deterministic validator checks fields, types, code formats, enumerations, ranges, and safety flags. Detected field-level errors are converted into a targeted repair prompt and the same model regenerates the output, repeating until compliance or K max = 3 K_{\( \max \)}=3 ; unresolved scenarios are recorded as failures with human review as the proposed deployment fallback.
Overview of the closed-loop validation-repair framework. A clinical scenario with schema specification and two format examples is processed by a locally deployed LLM; a deterministic validator checks fields, types, code formats, enumerations, ranges, and safety flags. Detected fi…
cs.AIarxiv:2607.24348v1Lead article

DeepFaith: Evidence-Grounded LLMs for Faithful Incident Reporting in Multi-Stage APT Defense

Trung V. Phan, Tri Gia Nguyen, Thomas Bauschert

eepFaith addresses the challenge of generating interpretable incident reports from complex APT defenses. Its core method involves transforming structured defense outputs into natural-language reports that are explicitly grounded in system evidence, ensuring factual accuracy. The contribution is a framework that uses evidence-grounded prompting and verification to produce faithful, analyst-friendly reports, overcoming LLM hallucination issues in this critical domain.

Data and control flow of the proposed DeepFaith framework building upon the DeepStage [ 18 ] and the DeepXplain [ 19 ] solutions.
Data and control flow of the proposed DeepFaith framework building upon the DeepStage [ 18 ] and the DeepXplain [ 19 ] solutions.
cs.AIarxiv:2607.24459v1Lead article

From Execution to Capability: Scientific Experience Consolidation via Procedural Knowledge Synthesis

Liwei Dong, Jiahao Zhao, Nan Xu

his paper addresses the challenge of making large language models retain and reuse scientific computing knowledge. Their core method, SciConsolidate, synthesizes transferable procedural knowledge from successful and failed execution experiences. This approach aims to bridge the "abstraction-execution gap" by generating abstract procedures and then using failure-informed query synthesis to improve the model's ability to apply them to new problems, even without pre-existing answers.

Overview of scientific-computing experience consolidation via procedural knowledge synthesis. The upper path abstracts verified target-model experience into development-validated family-level procedures. The lower path uses those procedures and rollout-derived failure priors to construct scientific-computing queries and executable code supervision, after which the target model is updated and evaluated without runtime procedures. The procedure-guided and no-procedure branches follow the same construction protocol, but their retained sizes can differ after executable filtering. The dashed return denotes a future multi-round extension and is not evaluated in this work; the frozen held-out split is never used for iterative decisions.
Overview of scientific-computing experience consolidation via procedural knowledge synthesis. The upper path abstracts verified target-model experience into development-validated family-level procedures. The lower path uses those procedures and rollout-derived failure priors to c…
cs.AIarxiv:2607.25947v1Lead article

A Cost-Effective Multimodal LLM Reasoning Framework for Question Answering over Irregular Clinical Time Series

Frank Nie, Ethan B Liu, Yuan Zhu, Wei Fan, Jindong Han

his paper introduces ClinPRISM, a cost-effective framework for question answering over irregular clinical time series. It addresses the challenges of sparsity and irregular sampling by using an irregularity-aware encoder and a temporal evidence distiller to create LLM-compatible representations. The framework's key contribution is its ability to efficiently model and reason over complex clinical data for improved healthcare applications.

cs.AIarxiv:2607.25681v1Lead article

Cognivia: A Cognitive Behavioral Therapy Copilot for Evidence-Based Mental Healthcare

Qi Chen, Siria Xiyueyao Luo, Jian Wang, Yuan Shi, Haocong Rao

ognivia is an AI therapist designed to address the shortage of human therapists by providing evidence-based Cognitive Behavioral Therapy (CBT). Its core method involves automatically identifying cognitive distortions and generating rational responses, drawing from authoritative CBT texts and augmented with mental health Q&A data. The paper's contribution lies in its domain-specific approach to LLMs for mental healthcare, overcoming limitations of existing methods by focusing on accurate distortion identification and structured response generation.

Figure 1. An illustrative comparison between Cognivia and existing methods in CBT.
Figure 1. An illustrative comparison between Cognivia and existing methods in CBT.
cs.AIarxiv:2607.26041v1Lead article

Desktop-Delta Bench: Do Computer-Use Models Understand Desktop GUI Transitions?

Abhishek Pillai, Samir Kumar Nayak, Yuan Chen

his paper introduces Desktop-Delta Bench (DDB), a new benchmark for evaluating computer-use agents (CUAs). DDB focuses on assessing an agent's ability to understand GUI transitions and causal relationships between actions and their effects, addressing limitations of existing benchmarks that only measure end-task success or single-frame grounding. Its core contribution is providing a dataset of human-verified instances specifically designed to test state verification, source tracking, and context-aware control in multi-app desktop environments.

cs.AIarxiv:2607.25995v1Lead article

Does Runtime Topology Context Improve LLM-Generated Kubernetes Security Patches?

Farooq Shaikh

his paper investigates whether providing LLMs with runtime Kubernetes topology context improves the correctness of automatically generated security patches. The authors introduce KuTIE, a system that leverages Istio call graph data to inform LLMs, aiming to prevent functional regressions caused by patches that overlook service dependencies. Their contribution is a controlled evaluation of this approach, measuring its impact on patch correctness across various dependency types.

KuTIE pipeline: a live ClusterContext feeds path prioritisation, LLM annotation, and functional-blast-radius-gated remediation.
KuTIE pipeline: a live ClusterContext feeds path prioritisation, LLM annotation, and functional-blast-radius-gated remediation.
cs.AIarxiv:2607.26000v1Lead article

Empirical Evaluation of Out-Of-Distribution Performance of Tabular Foundation Models

Malena Loza, David Chushig-Muzo, Eva Milara, Luis Bote-Curiel, Luis Estrada-Petrocelli

his paper empirically evaluates the out-of-distribution (OOD) performance of nine tabular foundation models (TFMs) across three real-world datasets exhibiting different types of distribution shifts. The core contribution is demonstrating that all tested TFMs systematically degrade in performance under distribution shifts, highlighting a significant robustness challenge for these models in real-world applications.

In-distribution and out-of-distribution results for all tabular foundation models across the datasets: HELOC, childhood lead, and voting.
In-distribution and out-of-distribution results for all tabular foundation models across the datasets: HELOC, childhood lead, and voting.
cs.AIarxiv:2607.25933v1Lead article

Evaluating Multi-Turn Multimodal Diagnostic Reasoning on Challenging Real-World Clinical Cases

Rui Yang, Weihao Xuan, Yi Lin, Zhuhan Bao, Jonathan Chong Kai Liew

his paper introduces ClinMM-Bench, a novel benchmark designed to evaluate multi-turn multimodal diagnostic reasoning in clinical settings. It addresses the limitations of existing single-turn evaluations by simulating the progressive disclosure of information and dynamic hypothesis updating seen in real-world medical practice. The benchmark's contribution lies in its comprehensive dataset of challenging clinical cases and a two-level evaluation framework that assesses both diagnostic accuracy and the quality of reasoning.

Overview of ClinMM-Bench and evaluation framework. a, Data curation. ClinMM-Bench was developed through a six-stage pipeline: (1) Data collection and extraction, in which clinical case reports were collected from PubMed Central Open Access; (2) Data inspection, where case reports without medical images, those containing videos, and those with low-resolution medical images were excluded; (3) Data validation, using a dual-LLM consensus mechanism to identify cases suitable for the clinical diagnostic reasoning task; (4) Data conversion, where validated case reports were parsed and transformed into a standardized structured format; (5) Quality control, where an automated scoring procedure assessed the structured case reports and retained only those meeting a predefined quality threshold; and (6) Expert validation, where medical experts performed manual verification to ensure data reliability. b, Multi-turn multimodal evaluation. During evaluation, models perform diagnostic reasoning through multi-turn dialogues, with clinical information and images of each case progressively disclosed over the course of the dialogue. The evaluation framework comprises two levels: (1) Diagnostic accuracy evaluation, in which a dual-LLM consensus mechanism compares MLLM-predicted diagnoses against the ground-truth diagnoses, with judge LLMs assigning accuracy scores ranging from 0 to 2. (2) Diagnostic reasoning quality evaluation, where both MLLM-generated reasoning and reference reasoning are decomposed into atomic facts and quantified across three dimensions: fact recall, hallucination, and fact density.
Overview of ClinMM-Bench and evaluation framework. a, Data curation. ClinMM-Bench was developed through a six-stage pipeline: (1) Data collection and extraction, in which clinical case reports were collected from PubMed Central Open Access; (2) Data inspection, where case reports…
cs.AIarxiv:2607.26819v1Lead article

A First Look at Coding Agents' Compliance with AI Contribution Rules in Open-Source Communities

Wenhao Yang, Runzhi He, Minghui Zhou

his paper investigates whether AI coding agents adhere to open-source community rules designed to regulate their contributions. The researchers created a benchmark dataset and tested frontier AI models, finding that current agents **rarely proactively consult or comply with these rules**. Their main contribution is highlighting a significant gap in AI agent behavior regarding established community guidelines.

The AI contribution rules in ggml-org/llama.cpp.
The AI contribution rules in ggml-org/llama.cpp.
cs.AIarxiv:2607.26899v1Lead article

Human diversity fuels collective creativity that large language models cannot simulate or sustain

Mengchen Dong, Hiromu Yakura

his paper demonstrates that human diversity, particularly between native and non-native speakers, significantly enhances collective creativity. The core method involved a metaphor generation experiment comparing human groups (with and without AI assistance) to AI-simulated groups. The key contribution is showing that while AI can homogenize creative output and obscure human diversity advantages, AI refinement of human ideas can preserve this crucial engine of innovation, which AI alone cannot replicate.

cs.AIarxiv:2607.27134v1Lead article

Linguistic Monoculture in LLM-Assisted Language Use

Suhas Thejaswi, Juhi Kulshreshta, Lutz Oettershagen

his paper introduces the concept of "linguistic monoculture" in LLM-assisted writing, where widespread reliance on shared models can reduce linguistic variation. The authors develop a mathematical framework to model the coevolution of authors and LLMs, demonstrating how shared models can lead to a homogenization of linguistic styles. Their contribution lies in quantifying this phenomenon and analyzing different LLM update mechanisms to understand their impact on linguistic diversity.

Population-level linguistic diversity under LLM assistance. Panel (a) shows the evolution of D t D^{t} under IM 1–3, with time displayed on a log ⁡ ( 1 + t ) \( \log \)(1+t) scale and tick labels reporting the original time steps. Panel (b) shows IM 3 diversity at T = 200 T=200 as personalization \( \rho \) increases. Lines report means over 100 100 runs and shading denotes ± 1 \( \pm \) 1 standard deviation; larger values indicate greater diversity.
Population-level linguistic diversity under LLM assistance. Panel (a) shows the evolution of D t D^{t} under IM 1–3, with time displayed on a log ⁡ ( 1 + t ) \( \log \)(1+t) scale and tick labels reporting the original time steps. Panel (b) shows IM 3 diversity at T = 200 T=200 a…
§ III

Daily Issues This Month

2026-07-02 to 2026-07-31 30