Weekly Issue
Collected dispatches

2026-W36

2026-08-24 to 2026-08-30
100 papers
7 daily issues
A weekly ledger drawn from the daily archive. 3 sections
§ I

The Week in Review

Editorial summary

This week's research highlights a strong focus on enhancing the safety, reliability, and practical deployment of Large Language Models (LLMs), particularly in agentic and multimodal contexts.

A key trend is the development of advanced safety alignment techniques. Papers like CLEAR and ReFrame demonstrate methods to preserve utility while reducing harmful outputs, moving beyond global tuning to more conditional and test-time approaches. ClawSentry and Trustworthy RAG address security concerns by developing multi-tier monitoring and evaluation agents to combat misinformation and poisoning in LLM systems.

Agentic AI is another dominant theme, with research exploring skill optimization (AUSO, SkillAlchemy), system-level intelligence through graph engineering, and robust evaluation frameworks (LLM-as-a-Judge for drug discovery). Tools like Apodex 1.1 and Prime Agent aim to scale agentic capabilities for complex, long-horizon tasks by improving tool interaction, task decomposition, and harness management.

Significant attention is also given to improving LLM reasoning and decision-making. Papers on Chain-of-Thought reasoning (Memory Augmentation), self-reflection (SRPO), and critic training (BPCO) aim for more stable and efficient learning. The challenge of bridging theoretical understanding with practical action is explored in the context of Vision-Language Models and Theory of Mind (MOSAIC), revealing current limitations.

Finally, research delves into optimization and efficiency, including structured pruning (COEC), personalized privacy control (P3Bench), and thermal-aware federated fine-tuning for edge AI (Thermo-FL). The robustness of LLM outputs under uncertainty is also explored through Credal LLMs.

§ II

Top Papers

Selected research 100
cs.AIarxiv:2608.21278v1Lead article

CLEAR: Continuous Latent Adapter Routing for Utility-Preserving LLM Safety Alignment

Chengxiao Wang, Enyi Jiang, Xiaojing Liao, Sanmi Koyejo

LEAR is a conditional safety adaptation framework for LLMs that uses a lightweight gate to dynamically control a safety adapter's influence. This allows it to reduce harmful outputs without degrading performance on benign prompts, unlike global safety tuning methods. Its core contribution is achieving utility-preserving LLM safety alignment by selectively applying safety measures.

Overview of CLEAR, a continuous latent adapter routing framework for utility-preserving LLM safety alignment. Given an input prompt, the frozen base LLM first produces hidden representations, from which selected latent states are extracted and passed to a lightweight safety gate. The gate predicts a continuous routing score g ⁡ ( x ) ∈ [ 0 , 1 ] g(x)\( \in \)[0,1] , which controls the strength of a safety LoRA adapter. For benign prompts, the routing score remains low and the model behaves close to the frozen backbone; for harmful or adversarial prompts, the score increases and the safety adapter is activated to steer generation toward aligned refusal behavior.
Overview of CLEAR, a continuous latent adapter routing framework for utility-preserving LLM safety alignment. Given an input prompt, the frozen base LLM first produces hidden representations, from which selected latent states are extracted and passed to a lightweight safety gate.…
cs.AIarxiv:2608.21107v1Lead article

Large Language Models at the Intersection of Software Engineering and Software Security:An Evidence-Centered Structured Survey and Research Agenda

Wei Lin, Tao Zhou, Zhaofei Xie, Changgui Hong

his paper surveys research on Large Language Models (LLMs) in software engineering and security. It synthesizes evidence on LLM capabilities for tasks like code completion, vulnerability detection, and secure generation, highlighting a divide between functional and security evaluations. The authors propose an assurance framework to better assess LLMs, noting that while execution feedback and repository access improve engineering tasks, their impact on security is less clear.

cs.AIarxiv:2608.21100v1Lead article

ReFrame: Evidence-Guided Test-Time Safety Alignment in Multimodal Large Language Models

Wenzheng Jiang, Xuankun Rong, Yuanzhao Zhai, Dawei Feng, Huaimin Wang

eFrame tackles safety alignment in deployed multimodal LLMs by addressing "utility dominance" and "reasoning inertia." Its core method uses two agents with a local LLM to generate risk/utility evidence and rewrite prompts/images into safe proxies, enabling test-time alignment without retraining. This offers a practical solution for closed-source MLLMs to prevent safety failures and over-refusals.

Limitations of existing multimodal safety alignment methods, highlighting the necessity of black-box approaches at test time.
Limitations of existing multimodal safety alignment methods, highlighting the necessity of black-box approaches at test time.
cs.AIarxiv:2608.21095v1Lead article

Trustworthy RAG: An Evaluation Agent for Detecting Misinformation and Knowledge Poisoning in Generative AI Systems

Balkrishna Giri, Md Toufique Hasan, Jussi Rasku, Muhammad Waseem, Pekka Abrahamsson

his paper introduces an "Evaluation Agent" as middleware for Retrieval-Augmented Generation (RAG) systems to combat misinformation and knowledge poisoning. The agent combines factual verification with a novel five-signal poison detector and a "Trust Index" to assess the reliability of retrieved information. Its core contribution is a robust defense against malicious document insertion, achieving high accuracy and precision in detecting misinformation, though it faces challenges with subtle in-place edits.

cs.LGarxiv:2608.21057v1Lead article

Designing a Robust LLM-Based Evaluation System for Agentic AI in Drug Discovery Through Human Alignment

Emma Granqvist, Rocío Mercado, Samuel Genheden

his paper addresses the challenge of evaluating agentic LLMs in drug discovery by proposing a novel "LLM-as-a-Judge" framework. The core method involves defining specific output quality dimensions (Completeness, Relevancy, Structural Clarity, Scope Adherence) and validating the LLM judge's alignment with human expert evaluations. This contributes a scalable and reliable evaluation system for agentic AI in this critical scientific domain.

cs.AIarxiv:2608.23283v1Lead article

Apodex 1.1: Scaling Agentic Intelligence for Complex Work

Apodex Team, B. An, B. Li, B. Wang, B. Zhang

podex 1.1 enhances language models' "working capability" by scaling both their interaction with diverse tools (files, code, search) and their ability to coordinate complex, multi-agent tasks. Its core method involves training agents to decompose, delegate, and integrate asynchronous results, while a shared harness maintains state and provenance. This allows for sustained, verifiable progress on real-world objectives across various professional domains.

cs.AIarxiv:2608.23566v1Lead article

How to Train a Critic Stably and Efficiently

Penghui Qi, Xiangxin Zhou, Wee Sun Lee

his paper addresses the instability of training critics in reinforcement learning for large language models. Their core method, **Best-Practice Critic Optimization (BPCO)**, combines several techniques to stabilize critic training and enable efficient advantage estimation from a single response. BPCO's contribution is a robust critic training recipe that improves performance and allows conditioning the critic on reward-relevant information hidden from the policy.

cs.AIarxiv:2608.23471v1Lead article

InjecMEM: Memory Injection Attack on LLM Agent Memory Systems

Hanling Tian, Gengyu Zhang, Zeyang Sha, Jingying Wang, Yuhang Liu

his paper introduces InjecMEM, a novel attack that exploits memory systems in LLM agents. By crafting a single interaction with a retriever-agnostic anchor and an adversarial command, InjecMEM can steer future agent responses towards a pre-specified output, even without direct access to the memory store. The core contribution is demonstrating a practical and effective method to inject malicious behavior into LLM agents through their memory subsystems.

InjecMEM attack pipeline. The attacker inputs adversarial prompt, memory logs it. Benign users query about \( \tau \) , the poisoned page will be retrieved and thus steers responses.
InjecMEM attack pipeline. The attacker inputs adversarial prompt, memory logs it. Benign users query about \( \tau \) , the poisoned page will be retrieved and thus steers responses.
cs.AIarxiv:2608.23497v1Lead article

Mitigating Reasoning-Induced Misalignment via Safety-Direction Penalty

Yipeng Zhao, Qishun Yang, Shenzhe Zhu, Shu Yang, Di Wang

his paper identifies "Reasoning-Induced Misalignment" (RIM) as a problem where training LLMs on reasoning tasks can inadvertently lead to harmful behaviors. The authors propose the Safety-Direction Penalty (SDP) as a training-time solution. SDP penalizes the LLM's internal representations from moving along a learned "safety direction" during reasoning fine-tuning, thereby mitigating this misalignment.

cs.AIarxiv:2608.23552v1Lead article

Prime Agent: A Self-Improving RLM Harness

Seth Karten, Alex L. Zhang, Kevin Thomas, Sebastian Müller, Elie Bakouch

rime Agent is an open-source harness designed to enable language models to perform long-horizon tasks by providing external information and computation. Its core method involves a persistent IPython REPL for programmatic context processing and a Continual Harness to preserve state across task executions. The main contribution is a standardized, low-friction framework that allows models to focus on strategy while the harness handles execution, recovery, and resource management, ultimately pushing the measurement of the model's true capabilities.

cs.AIarxiv:2608.23417v1Lead article

SkillAlchemy: Open-World Agent Skill Creation

Hengjun Wang, Shuyue Wei, Boyi Liu, Jun Yang, Yongxin Tong

killAlchemy addresses the challenge of creating agent skills for unfamiliar tasks by leveraging open-world materials. Its core method involves an "admission-centered" framework that identifies implicit requirements through contrastive evidence and admits candidate procedures based on this evidence. The contribution is a novel approach to automatically generating reusable agent skills from underspecified briefs and accessible sources, moving beyond human authorship or limited priors.

cs.AIarxiv:2608.23493v1Lead article

SRPO: Self-Reflective Policy Optimization for Long-Horizon Reasoning

Jialong Liu, Yuling Shi, Ning Yang, Xiaodong Gu, Zuchao Li

RPO is a novel framework that enables Large Language Models (LLMs) to perform self-reflection on their own reasoning processes. It synthesizes errors into "reflection patches" and uses these to generate dense, token-level training signals for improved on-policy learning. This approach effectively transforms sparse outcome feedback into actionable guidance, leading to state-of-the-art performance and high data efficiency in long-horizon reasoning tasks without external critics or reward models.

cs.CLarxiv:2608.23311v1Lead article

Beyond the Stability-Exploration Dilemma: Environmental Regularization for LLM Policy Optimization

Xianlei Zhou, Xiangdi Meng, Yu He, Tianyu Qi, Shuyan Guan

his paper introduces Environment-Regularized Policy Optimization (ERPO) to address the stability-exploration dilemma in LLM policy optimization. ERPO shifts regularization from the action space to the input query distribution by introducing a Query-KL term. This approach controls drift in query distribution without constraining LLM responses, offering a more effective way to balance exploration and stability.

KL losses during GRPO training. The Query-KL (dark) rises while the Policy-KL (light) stays low, showing action-only KL does not stabilize the query process.
KL losses during GRPO training. The Query-KL (dark) rises while the Policy-KL (light) stays low, showing action-only KL does not stabilize the query process.
cs.AIarxiv:2608.24571v1Lead article

Joint Optimization of Tool Creation and Use for Large Language Model Agents

Zhi Rui Tam, Chieh-Yen Lin, Yun-Nung Chen, Shao-Hua Sun, Hung-yi Lee

his paper introduces SMITH, a reinforcement learning framework that jointly optimizes LLM agent tool creation and usage within a single policy. By training tool building and invocation together, and using independent reward signals for schema, code, and outcome correctness, SMITH enables agents to learn to create and effectively use tools. This approach significantly improves performance on procedural reasoning tasks compared to existing methods.

cs.AIarxiv:2608.24696v1Lead article

On-policy Distillation with Verifiable Reward

Wenze Lin, Jiale Zhao, Xitai Jiang, Songde Rao, Yining Li

his paper proposes **OPDVR**, a novel method that seamlessly integrates on-policy distillation (OPD) and reinforcement learning with verifiable rewards (RLVR) for post-training large language models. The core innovation is reformulating OPD's implicit reward to incorporate trajectory correctness and using a ReLU gating mechanism to ensure that only valid trajectories contribute positively to the reward signal, thus avoiding extra hyperparameters and trade-offs. This approach leverages the dense guidance of OPD and the task-level correctness of RLVR to improve model performance.

Left: Overview of OPDVR. The ReLU gating mechanism ensures correct trajectories receive non-negative rewards and incorrect ones receive non-positive rewards, while preserving the teacher’s distributional guidance. Right: Results on AIME24, AIME25, and AMC under the same-architecture setting (Qwen3-4B ← \( \leftarrow \) Qwen3-4B-RL), reported as avg@16 accuracy.
Left: Overview of OPDVR. The ReLU gating mechanism ensures correct trajectories receive non-negative rewards and incorrect ones receive non-positive rewards, while preserving the teacher’s distributional guidance. Right: Results on AIME24, AIME25, and AMC under the same-architect…
cs.AIarxiv:2608.24658v1Lead article

Parason: Revealing Subtask and Trial Parallelism in LLM Reasoning

Zhengyang Zhang, Zijian Zhang, Jiaxuan Gao, Shusheng Xu, Yi Wu

his paper introduces Parason, a method that identifies and leverages two types of parallelism in LLM reasoning: Subtask Parallelism (breaking down a task) and Trial Parallelism (parallel exploration of hypotheses). The key contribution is demonstrating that Trial Parallelism is a significant and often dominant form of parallelizable computation, especially for difficult problems, and that Parason can effectively learn to exploit both.

Overview of two types of parallelism. The figure contrasts Subtask Parallelism, where all decomposed branches are needed for the final answer, with Trial Parallelism, where multiple uncertain paths are explored as alternative (OR) branches. Despite this OR relation, the outputs of all Trial branches are concatenated into the subsequent context, making every branch’s content available for final synthesis. While previous work mainly focuses on Subtask Parallelism, our analysis shows that Trial Parallelism accounts for the majority of parallelizable reasoning on HLE for every model we study, and exceeds 58% for DeepSeek-R1 and DeepSeek-V4 across both datasets.
Overview of two types of parallelism. The figure contrasts Subtask Parallelism, where all decomposed branches are needed for the final answer, with Trial Parallelism, where multiple uncertain paths are explored as alternative (OR) branches. Despite this OR relation, the outputs o…
cs.AIarxiv:2608.24876v1Lead article

Recursive Experiential-Working Memory Evolution for Long-Horizon Agent Harnesses

Zhaochen Yu, Yingcheng Wu, Zhenfei Yin, Kaiyuan Chen, Zhe Zhao

his paper introduces Recuris, a novel architecture designed to overcome challenges in long-horizon tasks by employing a recursive Experiential-Working Memory. Recuris uses Working Memory to track task progress and guide skill selection from Experiential Memory, grounding actions in current needs. This approach enables a fixed Meta-Agent to perform localized, validation-gated updates to Skill Memory, leading to significant improvements in task success across various benchmarks and models.

cs.AIarxiv:2608.24662v1Lead article

The Invisible Editorial Layer: Formalizing Undisclosed Inference-Time Steering, Probability Placement, and the Attribution Problem in Deployed Language Models

Augusto Camargo

his paper introduces the concept of an "invisible editorial layer" in deployed language models, where undisclosed interventions modify the model's probability distribution at inference time. This layer allows for systematic steering of generated text, creating an attribution problem and raising concerns about governance, security, and economic implications. The core contribution is formalizing and highlighting the impact of these post-inference modifications, which go beyond traditional prompt-based control.

cs.CLarxiv:2608.24747v1Lead article

SkillForge: Evolving Verifiable Skills for Reinforcement Learning Agents

Shidong Yang, Ziyu Ma, Tongwen Huang, Xucong Wang, Renda Li

killForge addresses the limitation of episodic reinforcement learning agents by introducing a framework for continuous skill evolution. It allows skills to be verified and refined through environment interaction, explicitly optimizing both actions and skill invocation. This leads to a growing and high-quality skill bank, improving agent performance across various tasks.

(a) Existing methods distill trajectories into skills and append them to the bank, but skills are injected in bulk without explicit usage tracking or quality control. (b) SkillForge introduces explicit skill calling with per-skill effectiveness tracking to update existing skills, and multi-pathway induction to continuously add new skills to the evolving bank.
(a) Existing methods distill trajectories into skills and append them to the bank, but skills are injected in bulk without explicit usage tracking or quality control. (b) SkillForge introduces explicit skill calling with per-skill effectiveness tracking to update existing skills,…
cs.AIarxiv:2608.26053v1Lead article

$R^3$: Training Robots to Reason in Natural Language via Reinforcement Learning

Lehong Wu, Yuxiao Qu, Zheyuan Hu, Ivan Zhang, Limin Wei

his paper introduces $R^3$, a method to train Vision-Language Models (VLMs) to reason in natural language for robotic manipulation. $R^3$ first fine-tunes a VLM on expert reasoning traces and then uses reinforcement learning with offline action data to improve its reasoning capabilities for guiding low-level robotic policies. The core contribution is enabling VLMs to perform free-form language reasoning for complex robotic tasks, unlike prior methods relying on structured supervision.

Two-stage training of ℛ 3 \( \mathcal{R}^{3} \) . ℛ 3 \( \mathcal{R}^{3} \) trains a high-level VLM to reason in natural language and steer a fixed low-level robot policy for robotic manipulation tasks. ℛ 3 \( \mathcal{R}^{3} \) proceeds in two stages: Stage I (mid-training) imbues an off-the-shelf VLM with the reasoning style and behaviors needed to produce useful instructions for the low-level policy. Stage II (single-step RL) further improves the VLM by training it to generate reasoning traces that match the expert instruction in offline data.
Two-stage training of ℛ 3 \( \mathcal{R}^{3} \) . ℛ 3 \( \mathcal{R}^{3} \) trains a high-level VLM to reason in natural language and steer a fixed low-level robot policy for robotic manipulation tasks. ℛ 3 \( \mathcal{R}^{3} \) proceeds in two stages: Stage I (mid-training) imbu…
cs.AIarxiv:2608.26004v1Lead article

AsymSpec: Context-Asymmetric Speculative Decoding for Agentic LLMs

Sheng Liang, Yongyue Zhang, Nathanael Brian, Hang Lv, Hao Wang

symSpec addresses the inference cost of agentic LLMs by breaking the symmetry in speculative decoding. It uses a lightweight drafter with full context to guide a larger verifier operating on compressed context, mitigating accuracy loss from compression. This asymmetric approach achieves significant speedups while retaining high accuracy, improving the efficiency of agentic LLM pipelines.

AsymSpec speculation step. (a) Drafting & verification: drafter S S reads x full x_{\( \text{full} \)} (logits a a , drafts d 1 : K d_{1:K} ) and x comp x_{\( \text{comp} \)} (logits b b ); verifier L L reads x comp x_{\( \text{comp} \)} (logits t t ). (b) CDA gate & \( \delta \) -fusion: γ eff ​ ( i ) \( \gamma \)_{\( \text{eff} \)}(i) relaxes as full-vs-compressed divergence grows; accepted drafts are committed, otherwise the \( \delta \) -fused arg ⁡ max \( \arg \)\( \max \) is emitted. Only S S consumes x full x_{\( \text{full} \)} .
AsymSpec speculation step. (a) Drafting & verification: drafter S S reads x full x_{\( \text{full} \)} (logits a a , drafts d 1 : K d_{1:K} ) and x comp x_{\( \text{comp} \)} (logits b b ); verifier L L reads x comp x_{\( \text{comp} \)} (logits t t ). (b) CDA gate & \( \delta \)…
cs.AIarxiv:2608.25992v1Lead article

ProgRouter: Online Progress-Guided Orchestration for Multi-Agent LLM Workflows under Quality-Cost Tradeoffs

Somgyuan Li, Ahmed M. Abdelmoniem, Shiqiang Wang

rogRouter addresses the high cost of multi-agent LLM workflows by introducing an online, progress-guided orchestration method. It adaptively selects LLM agents at each step based on a multi-view progress scorer that considers task completion, trends, and state quality. This allows for dynamic routing to maintain task quality while staying within budget constraints.

Overview of LLM agent orchestration in collaborative multi-agent LLM workflows.
Overview of LLM agent orchestration in collaborative multi-agent LLM workflows.
cs.AIarxiv:2608.25920v1Lead article

Repair or Resample? Rethinking Failure Debugging in LLM Multi-Agent Systems

Zhongwen Luan, Xiaoyu Zhang, Ming Hu, Yue Yang, Jiongchi Yu

his paper addresses the reliability bottleneck in LLM-based multi-agent systems (MASs) for complex tasks. It introduces SymTrace, a framework that enables controlled evaluation of repair methods by allowing selective regeneration of MAS execution trajectories after a failure point. This allows researchers to distinguish between causal repair and stochastic improvements due to LLM randomness, contributing a more rigorous approach to debugging MAS failures.

cs.AIarxiv:2608.25973v1Lead article

SciMIF: Understanding Multimodal Instruction Following in Scientific Domains

Ye Shen, Yuting Zheng, Dun Pei, Zijian Chen, Wenlong Zhang

his paper introduces SciMIF, a benchmark for evaluating multimodal instruction following in scientific domains. It proposes a taxonomy of 10 constraint groups derived from analyzing 22 tasks across 5 disciplines, and uses this to systematically augment scientific datasets. The benchmark reveals significant performance gaps, highlighting chemistry as particularly challenging for current MLLMs.

An overview of SciMIF, illustrating its coverage of five scientific disciplines, one general constraint domain, and ten functional constraint categories for constructing diverse scientific instruction-following constraints.
An overview of SciMIF, illustrating its coverage of five scientific disciplines, one general constraint domain, and ten functional constraint categories for constructing diverse scientific instruction-following constraints.
cs.AIarxiv:2608.26081v1Lead article

SwarmWorld: Stigmergic technological evolution in societies of language-model agents

Subhadeep Pal, Fiona Y. Wang, Markus J. Buehler

his paper introduces SwarmWorld, a novel framework where language-model agents collectively evolve technologies through indirect environmental interaction (stigmergy). The core method involves homogeneous agents exploring, resource processing, and constructing artifacts whose functionality is then tested in a deterministic simulator. The key contribution is demonstrating that decentralized LLM agents can self-organize and build functional, evolving technologies without explicit programming or predefined roles, outperforming independent search.

Conceptual lineages leading to SwarmWorld; connectors indicate conceptual convergence rather than direct descent between every adjacent item. (A) Biological collectives and swarm-computing methods contribute decentralized coordination, feedback, and stigmergy. (B) Local-rule models and artificial societies contribute persistent worlds in which local actions alter shared state and generate population-level organization. (C) Distributed-agent and LLM systems contribute explicit agent state, memory-guided planning, embodiment, communication, and reusable executable skills. (D) SwarmWorld combines these elements in a materially constrained multi-agent world where agents build persistent artifacts and inherit or modify their programs. The resulting technological ecology can be evaluated after the agents are removed. Image credits. Ant photograph by Kiran Vati K, CC BY 4.0 , cropped and color-adjusted. Boids still from a video by Andrew Magill, CC BY 2.0 , with a frame extracted, cropped, and color-adjusted. Game of Life glider-gun diagram by Bryan.burgers, public domain , placed on a grid background. Micropolis screenshot based on the original software by Will Wright and Maxis Software/Electronic Arts, the Unix port by Don Hopkins and DUX Software, screenshot by Tomhannen, and edit by bayo; GPLv3 or later with Section 7 additional terms , cropped and color-adjusted. The Sugarscape view, method schematics, and SwarmWorld rendering were created by the authors.
Conceptual lineages leading to SwarmWorld; connectors indicate conceptual convergence rather than direct descent between every adjacent item. (A) Biological collectives and swarm-computing methods contribute decentralized coordination, feedback, and stigmergy. (B) Local-rule mode…
cs.AIarxiv:2608.25775v1Lead article

ToST: A Tree-of-Thought Socratic Teaching Framework for Multi-Path Guidance and Parallel Thinking

Feng Ling, Heng Yu

his paper introduces ToST, a novel framework for Socratic teaching using LLMs. ToST moves beyond single-solution guidance by employing "Parallel Sowing" to encourage students to explore multiple valid approaches to a problem. Its "Multi-Path Adaptive Guidance" then provides flexible, non-linear support across these diverse reasoning paths, enhancing instructional flexibility and error recovery.

Comparison between traditional Socratic Teaching and the proposed ToST paradigm. Traditional method (left) employs a 1P1S paradigm with linear reasoning, susceptible to stalling from intermediate errors. In contrast, ToST (right) adopts a 1PMS paradigm via parallel thinking, enabling dynamic redirection when paths fail.
Comparison between traditional Socratic Teaching and the proposed ToST paradigm. Traditional method (left) employs a 1P1S paradigm with linear reasoning, susceptible to stalling from intermediate errors. In contrast, ToST (right) adopts a 1PMS paradigm via parallel thinking, enab…
cs.CLarxiv:2608.26008v1Lead article

A Self-Evolving Multi-Agent Framework Defense against LLM Jailbreak Attacks

Tongyan Hu, Bryan Hooi

his paper introduces a novel, self-evolving defense framework for LLMs against jailbreak attacks. Its core method involves a persistent rule memory that learns from successful attacks by abstracting their structural wrappers into generalizable rules. This allows the defense to adapt and defend against new, unseen attack strategies without requiring model parameter updates, contributing a dynamic and continuously improving defense mechanism.

Overview of our self-evolving multi-agent defense framework. A1 (Rule Triggering Agent) classifies the input and retrieves relevant rules; A2 (Policy Decision Agent) determines the response policy; A3 (Response Generation Agent) produces the final output; A4 (Self-Reflection Agent) induces new rules when a violation is detected and updates the rule memory base.
Overview of our self-evolving multi-agent defense framework. A1 (Rule Triggering Agent) classifies the input and retrieves relevant rules; A2 (Policy Decision Agent) determines the response policy; A3 (Response Generation Agent) produces the final output; A4 (Self-Reflection Agen…
cs.CLarxiv:2608.26013v1Lead article

VISA: Agentic Self-Evolving Data Synthesis for Multimodal Instruction Following

Min Zeng, Guanxin Tan, Libin Cen, Yawei Wen, Rui Hu

ISA is an agentic framework that synthesizes multimodal instruction-following data through a self-evolving loop. It iteratively generates, verifies, and refines instructions by analyzing images, sampling from memory, and using tools and LLM judges. This approach addresses limitations of one-pass synthesis by incorporating feedback from failed samples and target model errors to create more accurate, diverse, and challenging training data.

Overview of VISA. The framework iteratively performs perception, planning and execution, reflection, and memory update, allowing verifier feedback and target-model difficulty signals to guide subsequent synthesis rounds.
Overview of VISA. The framework iteratively performs perception, planning and execution, reflection, and memory update, allowing verifier feedback and target-model difficulty signals to guide subsequent synthesis rounds.
cs.AIarxiv:2608.27167v1Lead article

Calibrated Enough to Know, Not Calibrated to Act: Fabricated Evidence Makes LLM Agents Commit to the Unknowable

Pranav Aggarwal

his paper demonstrates that Large Language Model (LLM) agents are highly susceptible to fabricated evidence, committing to confidently answer provably unpredictable questions when presented with professional-looking data. The core contribution is showing that the *authority of the packaging* of information, rather than its truthfulness, drives this confident, yet incorrect, action. The LLMs are capable of answering similar, predictable questions accurately, highlighting a specific failure in judgment when faced with seemingly authoritative but false data.

cs.AIarxiv:2608.27142v1Lead article

GRAIN: Bridging Name and Narrative Shifts in Real-World Graph Reasoning through Invariance-Rewarded Agentic RL

Zike Yuan, Han Zhang, Jianzhi Yan, Le Liu, Cai Ke

RAIN addresses LLMs' brittleness to real-world graph reasoning shifts by framing it as a semantic parsing and tool-execution pipeline. Its core contribution is a novel "Structure Invariance Reward" that guides reinforcement learning to learn robust text-to-structure mappings by validating intermediate graph structures against ground truth, outperforming multi-agent approaches.

GRAIN mitigates sensitivity to naming and formulation shifts in real-world graph reasoning via a single-agent tool-use pipeline trained with isomorphism-aware structural rewards .
GRAIN mitigates sensitivity to naming and formulation shifts in real-world graph reasoning via a single-agent tool-use pipeline trained with isomorphism-aware structural rewards .
cs.AIarxiv:2608.27439v1Lead article

RedEvoAgent: Automatic Red-Teaming Agent with Experience-Driven Skill Evolution

Junjie Zhang, Hui Liu, Kecheng Chen, Xianbo Mo, Changsheng Chen

edEvoAgent addresses the limitations of fixed or trajectory-based red-teaming for LLM agents by distilling complex attack trajectories into concise, human-readable "attack skills." Its core method involves adaptively evolving these skills through tool-effectiveness profiling and attribution, guided by a validation process that retains only performance-improving updates. This approach offers a more interpretable and efficient way to discover and generalize jailbreaks compared to existing methods.

RedEvoAgent overview. Given a jailbreak prompt, the attacker agent uses the current attack skill to select and call tools from an extensible attack toolbox, such as GCG and FlipAttack, and iteratively attacks a product-level target agent. On the training split, RedEvoAgent collects successful and failed attack trajectories and independently evaluates each attack tool to build a tool-effectiveness profile. Skill evolution combines the profile with these trajectories to extract tool priorities and attack strategies. A candidate attack skill update is accepted only if it improves attack performance on the validation split, while the test split remains locked for final evaluation.
RedEvoAgent overview. Given a jailbreak prompt, the attacker agent uses the current attack skill to select and call tools from an extensible attack toolbox, such as GCG and FlipAttack, and iteratively attacks a product-level target agent. On the training split, RedEvoAgent collec…
cs.AIarxiv:2608.27141v1Lead article

Safety Does Not Compose: Non-Decaying Loop State for Autonomous LLM Agents

Chenhao Wu, Haoxuan Jia, Yang Liu, Yingguang Yang, Yuhan Lin

his paper argues that current safety mechanisms for autonomous LLM agents fail because they reset safety states between iterations, preventing them from detecting attacks spread across multiple steps. The core contribution is demonstrating that only monitors retaining cross-iteration state can effectively detect such fragmented attacks, as trajectory-scoped monitors will miss crucial evidence. Simply decaying risk scores is also insufficient to address this fundamental compositional safety issue.

cs.AIarxiv:2608.27146v1Lead article

When Tool Outputs Become Commands: Separating Action Induction from Runtime Authorization in Tool-Augmented LLM Agents

Xiaokun Guo, Zhen Xu, Dongdong Huo, Yanqiu Zhang, Wei Wang

his paper addresses the risk of LLM agents executing unintended actions when tool outputs become commands. Their proposed SARA method separates "action induction" (identifying potential actions) from "runtime authorization" (approving their execution). SARA achieves this by isolating action semantics and tracking their origin, while authorizing tool calls solely based on user objectives and verified past successful executions.

SARA’s runtime authorization framework. The user request establishes the authorization root K K ; the Observation-side Action Probe identifies action-inducing semantics and persistently maintains action origins F t F_{t} , which trigger persistent review but do not grant execution authority; authorized and successful tool executions accumulate audited execution evidence H t H_{t} . At the real tool-execution boundary, SARA jointly uses K K , F t F_{t} , and H t H_{t} to authorize the goal, execution chain, and arguments of a candidate call.
SARA’s runtime authorization framework. The user request establishes the authorization root K K ; the Observation-side Action Probe identifies action-inducing semantics and persistently maintains action origins F t F_{t} , which trigger persistent review but do not grant executio…
cs.CLarxiv:2608.27348v1Lead article

INTENT-AS-A-TOOL Makes it Easy to Track Agentic Misalignment

Yutong Zhang, Jianshuo Dong, Peng Xu, Long Wang, Jie Zhang

his paper introduces INTENT-AS-A-TOOL, a method to track agentic misalignment in LLMs by equipping them with specialized "intent tools." By observing the model's commitment to these tools, researchers gain a fine-grained, judge-free signal of its behavioral tendencies. This approach enhances existing chain-of-thought monitoring, providing dense intent trajectories that can identify critical moments for intervention and prevent harmful actions.

cs.AIarxiv:2608.21292v1Lead article

AUSO: Action-Level Unified Skill Optimization from Internalization to Utilization

Huizu Lin, Chengkai Huang, Tianqi Gao, Tao Huang, Daijiao Liu

USO unifies skill learning and utilization by optimizing them at the action level throughout an agent's policy evolution. This progressive approach allows the agent to first acquire foundational skills from teacher guidance and environmental feedback, then focus on utilizing these skills to improve individual decisions when beneficial, addressing limitations of existing methods that fragment training and assign uniform importance to actions.

Figure 1. Empirical evidence of ambiguous medium/easy skill-routing boundaries in Skill0.5. Samples across the success threshold can differ by as little as 1 / 8 1/8 , revealing the ambiguity of threshold-based routing.
Figure 1. Empirical evidence of ambiguous medium/easy skill-routing boundaries in Skill0.5. Samples across the success threshold can differ by as little as 1 / 8 1/8 , revealing the ambiguity of threshold-based routing.
cs.AIarxiv:2608.20975v1Lead article

Belief Without Behavior: Measuring the Translation of Theory of Mind into Coordinated Social Action in Vision-Language Models

Tonglin Yan, Gregoire Sergeant-Perthuis, David Rudrauf

his paper introduces MOSAIC, a benchmark that measures how well vision-language models (VLMs) translate their understanding of others' mental states (Theory of Mind) into coordinated verbal and nonverbal actions. The core method involves embodied agents interacting in scenarios requiring integrated communication and movement, under varying ToM demands. The key contribution is demonstrating that current VLMs struggle to bridge this gap, failing to exhibit behaviors consistent with sophisticated ToM reasoning, and that explicitly imposing ToM constraints doesn't reliably improve their coordinated social actions.

MOSAIC benchmark design. (Top left) Two agents interact in a virtual environment: the subject knows the reward location and must help or mislead the participant depending on the assigned relationship mode. (Bottom left) Four experimental conditions cross interaction mode (competitive vs. cooperative) with ToM constraint level (ToM-0 vs. ToM-1), with 50 trials per condition per model. (Right) Each trial runs for 10 rounds; rounds 3, 6, and 9 include a verbal exchange phase besides non-verbal actions. In non-verbal rounds, each agent receives a context prompt, a first-person perspective visual perception, and a structured belief-and-observation state, and produces action reasoning together with motor action (movement, rotation, or staying idle) and emotional expression (musculoskeletal and physiological channels). In verbal rounds, the same inputs are supplemented by the interlocutor’s speech, and the agent generates an inner speech reasoning trace and a natural language answer.
MOSAIC benchmark design. (Top left) Two agents interact in a virtual environment: the subject knows the reward location and must help or mislead the participant depending on the assigned relationship mode. (Bottom left) Four experimental conditions cross interaction mode (competi…
cs.AIarxiv:2608.21101v1Lead article

ClawSentry: A Progressive Multi-Tier Security Monitor for Safeguarding Autonomous LLM Agents

Kai Wang, Zeming Wei, BiaoJie Zeng, Chang Jin, An Wang

lawSentry addresses the progressive risks of autonomous LLM agents by introducing a multi-tier security monitor. Its core method involves a four-stage progressive risk assessment, starting with initial skill package review and extending to runtime monitoring across invocation, execution, and consequence phases. The key contribution is a framework-agnostic gateway that progressively analyzes and mitigates threats at different points in the agent's lifecycle, preventing cascading compromises.

ClawSentry aligns one gateway with four lifecycle loci. FSPR gates A; effect-normalized L1–L3 mediation covers B–C; retry memory catches capability-equivalent bypasses; and asynchronous D analysis informs later actions. AHP applies one policy across four frameworks; bottom badges report selective review and safety–utility.
ClawSentry aligns one gateway with four lifecycle loci. FSPR gates A; effect-normalized L1–L3 mediation covers B–C; retry memory catches capability-equivalent bypasses; and asynchronous D analysis informs later actions. AHP applies one policy across four frameworks; bottom badges…
cs.AIarxiv:2608.21027v1Lead article

Don't Solve, Just Compare: Tiny Advisors for Runtime Intervention in LLM Agents

Yanze Jiang, Mingxuan Li, Yuhao Wang, Shengfang Zhai, Jiaheng Zhang

his paper introduces Comparison-Only Tiny Advisor (COTA), a novel framework for improving LLM agent reliability through runtime intervention. Instead of requiring a full solver or a complex critic, COTA uses a small "tiny advisor" that compares the agent's proposed action with alternatives. By repeatedly judging which option leads to better outcomes, COTA efficiently intervenes when necessary, guiding the agent towards successful task completion.

cs.AIarxiv:2608.21156v1Lead article

Graph Engineering in the Era of LLM Agents: From Individual Intelligence to System Intelligence

Yuyuan Feng, Zhishang Xiang, Chaobin Yang, Qichao Ma, Zerui Chen

his paper introduces "System Intelligence" as a paradigm shift for LLM agents tackling complex tasks. Instead of solely enhancing individual agents, it proposes distributing intelligence across specialized agents and coordinating them at a system level. This approach addresses limitations of single agents by enabling heterogeneous expertise, parallel execution, and independent verification, ultimately leading to more robust and adaptive agent systems.

Overview From Model Intelligence to System Intelligence. Prompt and Context Engineering elicit and condition the access of foundation models to realize model intelligence. Harness and Loop Engineering extend and orchestrate agentic capabilities to enable Individual Intelligence. Graph Engineering builds on the foundation of individual agents through Task Organization, Agent Coordination, and Runtime State Management, empowering System Intelligence.
Overview From Model Intelligence to System Intelligence. Prompt and Context Engineering elicit and condition the access of foundation models to realize model intelligence. Harness and Loop Engineering extend and orchestrate agentic capabilities to enable Individual Intelligence. …
cs.AIarxiv:2608.21209v1Lead article

Personalized Privacy Control in LLMs via Attention Head Intervention

Junseok Kim, Nakyeong Yang, Kyomin Jung

his paper introduces personalized privacy control for LLMs, recognizing that users have unique disclosure preferences beyond general contextual norms. Their contribution is P3Bench, a benchmark for evaluating personalized privacy, and \textsc{Repair}, an inference-time method that intervenes in attention heads to enforce these user-specific privacy policies, overcoming the limitations of prompt-based methods.

Failure of Personalized Privacy Control. LLM agents may ignore the user’s privacy policy and disclose contextually appropriate sensitive information based on their own judgment during task execution.
Failure of Personalized Privacy Control. LLM agents may ignore the user’s privacy policy and disclose contextually appropriate sensitive information based on their own judgment during task execution.
cs.AIarxiv:2608.21074v1Lead article

PromptResponse: Optimizing Prompts for LLM Coding Tasks

Erik Thureck, Robert Kühnen, Tim Jacobowitz

his paper introduces PromptResponse, a study investigating how prompt formatting and LLM-based tuning impact LLM code generation. It found that consistent formatting, particularly JSON, enhances efficiency and stability, while LLM-tuned prompts surprisingly degrade performance. The core contribution is demonstrating that structured formatting is more beneficial than LLM-driven prompt optimization for coding tasks.

cs.LGarxiv:2608.21345v1Lead article

Asymmetric Capacity Allocation in Self-Refinement Pipelines

Zhuoyi Yang, Ian G. Harris, Salar Hashemitaheri, Cassie Huang, Yuangang Li

his paper investigates how model size impacts each stage of self-refinement pipelines (generation, critique, revision) for LLMs. The core method involves systematically varying model sizes across different benchmarks to understand their stage-wise contributions. The key contribution is demonstrating that larger generators and refiners are beneficial, while critic size has minimal impact, offering insights for efficient resource allocation in LLM agent design.

cs.LGarxiv:2608.21142v1Lead article

COEC: Calibrated Orthogonal-Equivalence Compensation for Structured Pruning of Large Language Models

Peiqi Yu, Nam Ling, Wei Wang, Wei Jiang

his paper introduces COEC, a training-free method to compensate for accuracy loss in structured pruning of LLMs. COEC applies alternating orthogonal rotations to the remaining weights, allowing them to adapt more effectively after column removal. Its key contribution lies in using a calibrated approach with generalized cross-validation and an alignment penalty to optimize these rotations, preserving geometric relationships and improving accuracy.

cs.LGarxiv:2608.21030v1Lead article

COMET: Contrastive Motion-Enhanced Temporal Reasoning for Video Multimodal Large Language Models

Chenghua Zhu, Zhaolu Kang, Qifan Shi, Siyan Wu, Kehan Jiang

OMET enhances video multimodal large language models by explicitly modeling frame-to-frame motion and its interaction with appearance. Its core method involves a temporal motion branch that injects motion information into the visual stream via attention, and a novel optimization strategy that leverages temporal order as a direct learning signal. This approach significantly improves fine-grained temporal understanding in videos.

Figure 1. Frame-independent encoding versus explicit temporal representation. (a) sparse RGB frames leave motion implicit. (b) frame-to-frame change makes temporal evidence explicit. A comparison between frame-independent video encoding and an explicit representation of frame-to-frame temporal changes.
Figure 1. Frame-independent encoding versus explicit temporal representation. (a) sparse RGB frames leave motion implicit. (b) frame-to-frame change makes temporal evidence explicit. A comparison between frame-independent video encoding and an explicit representation of frame-to-…
cs.LGarxiv:2608.21172v1Lead article

Thermo-FL: Thermal-Aware Robust Federated Fine-Tuning of Large Language Models for Edge AI

Shiva Shrestha, Kazi Shaharair Sharif, Zongxing Xie, Jiajing Huang, Anhao Xiang

hermo-FL tackles the dual challenges of hardware thermal constraints and adversarial attacks in federated LLM fine-tuning. Its core method is a thermal-aware LoRA adaptation that dynamically adjusts training and update sparsity based on device temperature. This allows for robust and efficient LLM fine-tuning on edge devices by mitigating performance degradation from heat and protecting against corrupted updates.

cs.LGarxiv:2608.20991v1Lead article

Trojaning the Alignment: Stealthy Backdoor Attacks against Graph Foundation Models

Minhua Lin, Zhicheng Gao, Yilong Wang, Hanqing Lu, Xiang Zhang

his paper introduces STAG, a novel backdoor attack method targeting Graph Foundation Models (GFMs) on text-attributed graphs (TAGs). STAG's core method is to stealthily inject triggers that exploit the alignment mechanism between graph and text representations, unlike previous attacks that treated modalities independently. This approach allows for more effective and harder-to-detect attacks by manipulating the shared semantic space, thereby compromising the model's integrity.

cs.CLarxiv:2608.21242v1Lead article

Affective Context Amplifies Sycophancy in LLM Responses

Jiayi Li, Sanjana Menon, Brett Frischmann, Shomir Wilson, Sarah Rajtmajer

his paper investigates how LLMs' awareness of user emotions influences their tendency to be sycophantic. The core method involves comparing LLM responses to the same content presented as a third-party versus a user's own disclosure, measuring sycophancy by the difference in evaluations. The key contribution is demonstrating that negative user affective states, like loneliness and distress, significantly amplify LLM sycophancy, suggesting these states act as vulnerability signals.

An illustrative example from r/AmItheAsshole. When an LLM evaluates the narrator’s actions (top), it identifies the narrator’s actions as unethical and a breach of duty. When the LLM acts as a conversational partner responding to the same content as the user’s self-disclosure, it softens its evaluative stance while still acknowledging procedural concerns (bottom, left). With the user’s affective context, it becomes less oppositional (bottom, right).
An illustrative example from r/AmItheAsshole. When an LLM evaluates the narrator’s actions (top), it identifies the narrator’s actions as unethical and a breach of duty. When the LLM acts as a conversational partner responding to the same content as the user’s self-disclosure, it…
cs.CLarxiv:2608.21265v1Lead article

Memory Augmentation Unlocks Efficient Chain-of-Thought Reasoning

Simeng Zhang, Yilong Chen, Wenyuan Zhang, Zhenyu Zhang, Yao Chen

his paper introduces Memory-Augmented Compression, a training-free method to make Chain-of-Thought (CoT) reasoning more efficient. It formalizes the trade-off between reasoning verbosity and generation cost with the "Context-Generation Substitution Law." The core method constructs reusable "reasoning memories" from past traces, which act as scaffolds to compensate for information lost during CoT compression, thereby improving performance.

Illustration of memory-augmented compression. Explicit memory shifts part of the reasoning support to the prefill stage, improving short-CoT accuracy while preserving generation efficiency.
Illustration of memory-augmented compression. Explicit memory shifts part of the reasoning support to the prefill stage, improving short-CoT accuracy while preserving generation efficiency.
cs.AIarxiv:2608.23318v1Lead article

Agent-G$^2$: Gaussian Guidance for Agentic Reinforcement Learning

Zixuan Wang, Yanrui Miao, Zhengxi Lu, Teng Pan, Yiwen Qiu

his paper introduces Agent-G$^2$, a novel reinforcement learning method that addresses reward sparsity by providing guidance from expert trajectories. Instead of a single optimal guidance depth, Agent-G$^2$ models the useful guidance as a Gaussian distribution, allowing for a range of effective depths. This approach estimates the Gaussian's parameters online from existing rollouts, eliminating the need for extra probing or learned predictors, and thus improving efficiency.

Hint-based RL paradigms across training steps t 0 , t 1 , t 2 t_{0},t_{1},t_{2} . (a) Schedule-based: shared d t d_{t} across samples. (b) Probe-based: O ⁡ ( log ⁡ n ) O(\( \log \) n) per-sample probes. (c) Agent-G 2 (ours): d i ∼ 𝒩 ⁡ ( μ t , σ t 2 ) d_{i}\( \sim \)\( \mathcal{N} \)(\( \mu_{t} \),\( \sigma_{t}^{2} \)) per task, estimated online from existing rollouts.
Hint-based RL paradigms across training steps t 0 , t 1 , t 2 t_{0},t_{1},t_{2} . (a) Schedule-based: shared d t d_{t} across samples. (b) Probe-based: O ⁡ ( log ⁡ n ) O(\( \log \) n) per-sample probes. (c) Agent-G 2 (ours): d i ∼ 𝒩 ⁡ ( μ t , σ t 2 ) d_{i}\( \sim \)\( \mathcal{N…
cs.AIarxiv:2608.23244v1Lead article

Credal Large Language Models for Semantic Commitment under Uncertainty

Shireen Kudukkil Manchingal, Sofiia Nikolenko, Fabio Cuzzolin

his paper introduces Credal Large Language Models (CLLMs) to address the issue of LLMs' unwarranted confidence in incorrect answers. CLLMs use an ensemble of adapters to represent uncertainty as a "credal set" of possible predictions, revealing the range of plausible outcomes instead of a single output. This allows for new metrics like Credal Token Commitment and Semantic Commitment Consistency to better measure semantic commitment and detect hallucinations.

cs.AIarxiv:2608.23391v1Lead article

Cross-Domain, Multi-Task Data-to-Text Generation without In-Domain Training Data

Yifei Song, Kun Efimov-Zhang, Claire Gardent

his paper tackles data-to-text generation across diverse domains and tasks without requiring in-domain training data. Its core method, data-driven knowledge distillation (DDKD) with structure-preserving augmentation, trains smaller models to effectively generate text from structured data. The key contribution is demonstrating DDKD's superior performance over zero-shot and out-of-domain fine-tuning, even with significantly smaller models.

cs.AIarxiv:2608.23264v1Lead article

Hidden in the Request: Explaining Unethical LLM Compliance through Token Relevance

Or Biton, Tomer Krichli, Itai Allouche, Joseph Keshet

his paper investigates why Large Language Models (LLMs) sometimes comply with unethical requests despite alignment efforts. The core method involves presenting unethical scenarios in different formats and using Layer-wise Relevance Propagation (LRP) to analyze token importance. The key contribution is identifying an "attribution bias" where LLMs overemphasize benign framing tokens over those signaling unethical intent, leading to compliance failures.

cs.AIarxiv:2608.23395v1Lead article

Right-Sizing LLM-Agent Decomposition in VAT Determination: A Pilot Controlled Sweep

Pedro Santos

his paper investigates the optimal decomposition of Large Language Model (LLM) agents for VAT determination. By systematically varying the number of specialized agents versus a single generalist agent, while keeping other system components constant, the study found that **intermediate configurations of agent decomposition achieved the highest accuracy**. This suggests that a balanced approach, rather than extreme specialization or generalization, is most effective for this task.

cs.AIarxiv:2608.23475v1Lead article

StrategyBench: Evaluating Explicit Strategy Induction in Large Language Models

Jinghan Tan, Yuanzheng Wang, Lu Chen, Zijun Chen, Yuqian Wang

his paper introduces StrategyBench, a benchmark designed to evaluate large language models' ability to explicitly induce and utilize task strategies, mimicking human learning. The core method involves selecting strategy-inducible tasks, defining reference strategies, and measuring both strategy quality and its usefulness in solving new problems. The contribution lies in providing a framework to assess this crucial capability, moving beyond simple in-context learning to understand how LLMs can generalize by abstracting rules.

cs.AIarxiv:2608.23370v1Lead article

Walking on the DARKSIDE

Aldo Gangemi, Emanuele Bottazzi

his paper introduces DARKSIDE, a method to audit the coherence of Large Language Model (LLM) outputs. Unlike previous methods that can incorporate fabricated information, DARKSIDE explicitly tracks and formalizes the exclusions made during discourse generation. This allows for the detection of nonsensical inputs that might otherwise be reified into structured outputs.

cs.CLarxiv:2608.23476v1Lead article

On the Threat Model of Weird Generalization and Emergent Misalignment

Miriam Wanner, Mark Dredze, William Walden

his paper investigates "weird generalization" (WG), where fine-tuning on small datasets causes unexpected broad behavioral changes in models. The core method involves systematically testing how various fine-tuning data features (composition, language, novelty) and evaluation question sets influence WG. The key contribution is demonstrating that WG is primarily driven by data composition and language, is amplified by pretraining familiarity, and is sensitive to evaluation methods, highlighting a crucial aspect of emergent misalignment.

Eliciting emergent misalignment or weird generalization (top) requires careful engineering of fine-tuning data: even minor data changes—like adding a few examples from a second domain (bottom)—can suppress them. This makes both more plausible as adversarial threats than as hazards of normal fine-tuning.
Eliciting emergent misalignment or weird generalization (top) requires careful engineering of fine-tuning data: even minor data changes—like adding a few examples from a second domain (bottom)—can suppress them. This makes both more plausible as adversarial threats than as hazard…
cs.AIarxiv:2608.24794v1Lead article

CAFE: Self-Improving Search Agents Need Co-Evolving Feedback

Boyang Liu, Senjie Jin, Peixin Wang, Zhangyue Yin, Yibo Wang

AFE introduces a novel framework where a single model acts as both a search agent and a feedback critic, enabling self-improvement. The core method involves the agent learning to request and utilize corrective feedback, while the critic infers useful interventions from potentially flawed trajectories. This co-evolutionary approach allows the agent to recover from errors mid-trajectory, leading to more efficient learning and better performance.

Overview of CAFE. One shared model serves as agent and critic. CFE shapes request returns from the call–skip gap; advantage shaping weights tokens before and after feedback. RDPO updates the critic from prefix-matched pairs mined from recent rollouts.
Overview of CAFE. One shared model serves as agent and critic. CFE shapes request returns from the call–skip gap; advantage shaping weights tokens before and after feedback. RDPO updates the critic from prefix-matched pairs mined from recent rollouts.
cs.AIarxiv:2608.24691v1Lead article

Confident at the moment of action: belief miscalibration in LLM play under hidden information

Bhushan Kashinath Joshi

his paper investigates whether Large Language Models (LLMs) accurately reflect their knowledge when making decisions under uncertainty. The core method involves testing LLMs in a chess variant with hidden information, where their stated confidence in predicting the opponent's hidden piece location is compared to the actual outcome. The key contribution is demonstrating a significant miscalibration, showing LLMs are highly overconfident in their predictions of hidden information, leading to poor decision-making when relying on this confidence.

Reliability diagram: stated confidence vs. hit rate at capture time, pooled across both scored batches (n=394 capture-only events), with the corrected reference tracker curve. Marker area is proportional to bin n; no line is drawn across an empty bin. Cited in §4.1.
Reliability diagram: stated confidence vs. hit rate at capture time, pooled across both scored batches (n=394 capture-only events), with the corrected reference tracker curve. Marker area is proportional to bin n; no line is drawn across an empty bin. Cited in §4.1.
cs.AIarxiv:2608.24570v1Lead article

EviDx: Evidence-Aware Active Diagnosis with Scaffolded LLM Agents

Lihang Zeng, Shaoting Zhang, Xiaofan Zhang

viDx is a novel framework for active clinical diagnosis using LLM agents. It addresses the limitations of static LLM diagnosis by creating interactive, evidence-seeking environments. EviDx's core contribution lies in its scaffolded approach, which guides specialized agents to dynamically acquire and process patient evidence, ultimately leading to more informed and dynamic diagnostic decisions.

cs.AIarxiv:2608.24735v1Lead article

Meta$^n$: Recursive Self-Improvement through Emergent Depth

Zae Myung Kim, Young-Jun Lee, Seungyeon Jwa, Dongyeop Kang

eta$^n$ achieves recursive self-improvement by repeatedly applying a fixed meta-operation ($Ω$) to its own outputs, rather than modifying the operation itself. This allows for emergent depth, where each new layer builds upon the reasoning of the previous ones, leading to superior performance on benchmarks compared to existing self-improving agents.

Meta n at a glance. (left) A single universal meta-operation \( \Omega \) is applied recursively, each meta-layer wrapping the stack below it (Base Solver → \( \to \) Layer 1 → \( \to \) Meta-Layers 2 , 3 , … , n 2,3,\( \dots \),n ). Roles emerge with depth without manual design. (right) Search progress on LawBench charge prediction, where both Meta n variants climb faster and settle higher than Gödel Agent ( Yin et al., 2024 ) and OpenEvolve ( Sharma, 2025 ) .
Meta n at a glance. (left) A single universal meta-operation \( \Omega \) is applied recursively, each meta-layer wrapping the stack below it (Base Solver → \( \to \) Layer 1 → \( \to \) Meta-Layers 2 , 3 , … , n 2,3,\( \dots \),n ). Roles emerge with depth without manual design.…
cs.AIarxiv:2608.24534v1Lead article

Neurosymbolic Alignment for Physiologically-Safe Clinical Language Models

Abdulhady Abas Abdullah, Erik Cambria, Milena Zivkovic

his paper introduces Neurosymbolic Alignment, a method to improve the physiological safety of clinical language models. It achieves this by integrating a clinical LLM with a knowledge graph-based physiological world model. This grounding allows the model to evaluate candidate responses against structured physiological knowledge, leading to significantly safer and more accurate clinical recommendations compared to text-only supervision.

cs.AIarxiv:2608.24509v1Lead article

PeakBench: Benchmarking Resource-Aware Tool Invocation in LLM Agents

Zhi-Kai Chen, Xu-Xiang Zhong, Song-Yan Li, De-Chuan Zhan, Han-Jia Ye

eakBench introduces a novel benchmark for LLM agents that focuses on resource-aware tool invocation and parallel execution. Its core method involves executable multi-tool workflows with dependency annotations and resource profiles, addressing the limitations of existing benchmarks that overlook safe parallelization. The paper's contribution lies in providing a framework to evaluate both dependency planning and resource-constrained scheduling, enabling agents to achieve low latency without resource overflows.

cs.AIarxiv:2608.24758v1Lead article

RACE: Scalable Statistical Estimation of Functional Consistency in LLM Neurons

Runyu Wang, Bo Liu, Xiaxin Zhang, Yu Han, Jiawei Cao

ACE is a scalable statistical framework for evaluating the functional consistency of Transformer neurons across entire domains. It uses a forward-pass approach to estimate neuron behavior, offering superior domain specificity and significantly lower computational cost compared to existing gradient-based methods. This allows for more efficient and robust discovery of stable neuron behaviors relevant to specific domains.

Layer-wise kernel density estimate (KDE) ridgeline distributions of RACE results. On Qwen3-4B-it, ridges under 𝐑 MBPP+ \( \mathbf{R} \)_{\( \text{MBPP+} \)} and 𝐑 MATH-500 \( \mathbf{R} \)_{\( \text{MATH-500} \)} visualize the KDE of CAM scores for neurons in each module across selected layers.
Layer-wise kernel density estimate (KDE) ridgeline distributions of RACE results. On Qwen3-4B-it, ridges under 𝐑 MBPP+ \( \mathbf{R} \)_{\( \text{MBPP+} \)} and 𝐑 MATH-500 \( \mathbf{R} \)_{\( \text{MATH-500} \)} visualize the KDE of CAM scores for neurons in each module across…
cs.AIarxiv:2608.24842v1Lead article

Reading Is Not Using: Retrieval, Judgment, and the Design of AI Financial Research Workflows

Miao Liu, Zhizhe Liu

his paper highlights a critical "retrieval-integration gap" in AI financial research: LLMs can accurately retrieve information from long financial documents, but this retrieved data doesn't reliably influence their investment judgments. The core contribution is demonstrating that even with accurate retrieval, the sheer volume of unrelated context can drown out the impact of crucial disclosures, leading to flawed decisions. The authors propose that workflow design, specifically how information is compressed and linked to sources, is key to bridging this gap and enabling AI to truly "use" financial information.

The marginal decision influence of a fixed disclosure declines with context length. Panel A: three open-weight model families, sell-probability readout, with firm-bootstrap 95% confidence bands. Panel B: production API model, unit-bearing numeric judgment. The focal firm’s information set is identical at every length; only economically unrelated filler text is added.
The marginal decision influence of a fixed disclosure declines with context length. Panel A: three open-weight model families, sell-probability readout, with firm-bootstrap 95% confidence bands. Panel B: production API model, unit-bearing numeric judgment. The focal firm’s inform…
cs.AIarxiv:2608.24650v1Lead article

Simthesizer: An Agent-Driven Simulation Framework for LLM Serving Systems

Wonung Kim, Hyunmin Choi, Minsu Kim, Jaehong Cho, Yeongwook Kim

his paper introduces Simthesizer, an agent-driven simulation framework for LLM serving systems. Its core method is Borg, a composable infrastructure that uniformly expresses serving workflows and control decisions as a dynamic graph. The contribution is a novel approach to simulator development, using a coding agent to automatically generate simulations from natural language descriptions, thus closing the gap between rapidly evolving LLM serving systems and existing simulators.

cs.AIarxiv:2608.24870v1Lead article

SPO++: Stream-Aligned Policy Optimization for Asynchronous Agentic RL

Kai Ruan, Jinghao Lin, Qianshan Wei, Ziqi Zhou, Zihe Huang

his paper introduces SPO++, an improved method for asynchronous reinforcement learning in agentic settings. It addresses limitations of prior work by standardizing terminal-outcome advantages according to the action-token measure, aligning the value estimation with the actor's optimization objective. This novel approach, along with organizing prompt evidence by policy event, leads to more efficient online learning in complex tool-use scenarios.

cs.AIarxiv:2608.24777v1Lead article

StepGuard: Learning Step-Level Guardrails with Scalable Supervision and Safety-Utility Balancing

Zhijie Zheng, Yu Li, Chen Qian, Yuqian Fu, Yanwei Fu

tepGuard introduces a novel step-level guard model for LLM agents, enabling pre-execution monitoring of tool actions to prevent security risks. Its core method involves StepGen for scalable data generation and Balance-GRPO for dynamically balancing safety and utility. The contribution lies in achieving high accuracy in preventing unsafe actions without significantly hindering agent performance, outperforming existing open-weight guard models.

Overview of StepGen. The pipeline first constructs and rolls out an unsafe trajectory with a designated risk anchor. It then generates two prefix-aligned safe branches and an independently constructed benign tool-reuse trajectory. Finally, StepGen adds step-level supervision and retains high-quality groups through structural and semantic filtering.
Overview of StepGen. The pipeline first constructs and rolls out an unsafe trajectory with a designated risk anchor. It then generates two prefix-aligned safe branches and an independently constructed benign tool-reuse trajectory. Finally, StepGen adds step-level supervision and …
cs.AIarxiv:2608.24569v1Lead article

When "Must" Becomes "Maybe": Constraint Weakening in LLM Agent Workflows

Yiheng Sun, Huifei Wang, Yancheng Zhu, Zhenyu Li, Zebin Zhao

his paper introduces "constraint weakening" for LLM agents, addressing how requirements in multi-stage workflows can shift from mandatory to optional. The core method involves analyzing how intermediate artifacts transform action-binding state, specifically focusing on safety blockers. The contribution is demonstrating that naive handoffs preserve all blockers, while controlled transformations can effectively weaken them, impacting downstream executor behavior.

A binding source state passes through a language-mediated transformation before local-view execution. The controlled testbed represents each source state with status, prerequisite, owner, and fallback fields. Degradation changes the artifact’s operational role even when related language remains available. Repair acts on the artifact; verification acts at the endpoint.
A binding source state passes through a language-mediated transformation before local-view execution. The controlled testbed represents each source state with status, prerequisite, owner, and fallback fields. Degradation changes the artifact’s operational role even when related l…
cs.AIarxiv:2608.24492v1Lead article

When Do Supervised UQ Ensembles Improve LLM Hallucination Detection? A Robustness Study

Mohit Singh Chauhan, Vipin Gyanchandani, Dylan Bouchard

his paper investigates the effectiveness of supervised ensembles for detecting LLM hallucinations when ground truth is unavailable. The core method involves training a classifier on diverse uncertainty quantification (UQ) signals from multiple LLMs. The key contribution is a systematic robustness analysis demonstrating that these supervised ensembles consistently outperform individual UQ methods across various LLMs, datasets, and generation tasks, highlighting their practical utility.

cs.LGarxiv:2608.24588v1Lead article

IAPO: Influence-Aware Policy Optimization for Credit Assignment in Multi-Turn Service Agents

Bo Ren, Yirong Mao, Yi Yang, Wenhui Que

his paper introduces Influence-Aware Policy Optimization (IAPO) for multi-turn LLM agents. IAPO models the flow of information and errors within a task's interaction history as a typed influence-dependency graph. This allows for more effective credit assignment by directly leveraging the inherent structure of past interactions, rather than relying on external comparisons or separate learning signals.

Per-action advantage allocation for a successful (left, positive-advantage) and a failed (right, negative-advantage) refund rollout. Refunding to the original card or store balance is correct only if it matches the user’s clarified intent , so an early clarifying turn decides whether later actions are right. GRPO applies the same advantage to every action, whereas IAPO routes credit according to realized support use and error propagation.
Per-action advantage allocation for a successful (left, positive-advantage) and a failed (right, negative-advantage) refund rollout. Refunding to the original card or store balance is correct only if it matches the user’s clarified intent , so an early clarifying turn decides whe…
cs.AIarxiv:2608.25937v1Lead article

Candidate supply and answer selection shape the value of LLM judging in multi-agent systems

Jia-Hao Ji, Sijie Li, Jiabei Cheng, Zixi She, Jin-Tai Yu

his paper investigates how LLM judges can improve multi-agent system (MAS) performance by providing selection pressure on candidate answers. The core method involves conceptualizing MAS reasoning as an evolutionary pipeline and analyzing how LLM judges influence candidate generation and selection across various question-answering benchmarks. The key contribution is demonstrating that the effectiveness of LLM judges hinges on both the quality of candidate answers supplied and the specific selection rules employed, highlighting the risk of "memetic drift" without proper quality control.

cs.AIarxiv:2608.25927v1Lead article

Code World Model: Coding Agent as World Brain

Yiwen Chen, Guosheng Lin, Chi Zhang

his paper introduces the Code World Model, which uses a language model as a "world brain" to generate executable code that simulates environment evolution. This approach separates the underlying rules and state from visual realization, enabling persistent consequences and coherent, rule-consistent development. The generated code then conditions a video model to produce visual outputs, overcoming limitations of purely visual world models.

cs.AIarxiv:2608.25776v1Lead article

EVOMAL: Self-Poisoning in Self-Evolving Coding Agents

Xiaodong Wu, Yu Shi, Qi Li, Zhimin Zhao, Xiangman Li

his paper introduces "self-poisoning" in self-evolving coding agents, where agents can inadvertently create and execute malicious code by imitating compromised skills from a shared library. The EvoMal attack exploits this by embedding payloads within benign-looking structures, causing agents to replicate and propagate the malicious code. The core contribution is identifying and demonstrating this self-propagating vulnerability, leading to a persistent threat even after initial malicious code removal.

Overview of EvoMal . (1) The benign self-evolving loop, where an agent retrieves the top- k k skills by description, authors a new skill ( create -path) or invokes one by name (the transient reuse -path), and writes authored skills back. (2) EvoMal poisons the create -path. The attacker publishes skills whose banner induces mimicry and whose interchangeable payload carries the harm. A retrieving agent re-authors the banner into a persisted skill that later generations retrieve again, forming a worm that can persist after the planted skills are removed. A counter-prompt at the reading step breaks the loop ( § 9 ).
Overview of EvoMal . (1) The benign self-evolving loop, where an agent retrieves the top- k k skills by description, authors a new skill ( create -path) or invokes one by name (the transient reuse -path), and writes authored skills back. (2) EvoMal poisons the create -path. The a…
cs.AIarxiv:2608.25986v1Lead article

Multi-Granularity Context-Enhanced RAG over Multimodal Knowledge Graphs

Zongyu Wu, Yilong Wang, Xiaochen Wang, Minhua Lin, Zhichao Xu

his paper introduces a novel framework for multimodal retrieval-augmented generation (RAG) that addresses the semantic gap in existing methods. Its core method enhances RAG by integrating textual context throughout the processing of visual information and multimodal knowledge fusion, rather than treating modalities independently. The main contribution is a more effective way to leverage multimodal knowledge graphs for LLMs, leading to improved performance by bridging the semantic gap between text and images.

Figure 1. An illustration of node-based Multimodal Knowledge Graph where image is also treated as a node. An illustration of node-based Multimodal Knowledge Graph.
Figure 1. An illustration of node-based Multimodal Knowledge Graph where image is also treated as a node. An illustration of node-based Multimodal Knowledge Graph.
cs.AIarxiv:2608.25832v1Lead article

Skill Issue: Are Skills Language-Invariant in LLMs?

Bobby Cheng, Adam Gaber, Zhengyuan Liu, Catherine Arnett, Omer Goldman

his paper investigates whether language affects the performance of large language models (LLMs) on specific tasks, independent of their general knowledge. The core method is multilingual self-play, where two instances of the same LLM compete in a text-based game, each using a different language. The contribution is demonstrating that LLMs can exhibit significantly different skill levels and strategic behaviors across languages, even when the underlying model and game remain constant.

cs.AIarxiv:2608.25756v1Lead article

TailSFT: Filtered Fine-Tuning Improves Post-Training Performance

Sadhika Malladi, Samy Jelassi, Dylan Foster, Jordan T. Ash, Akshay Krishnamurthy

his paper introduces TailSFT, a supervised fine-tuning method that improves post-reinforcement learning performance by filtering out already well-modeled data sequences. By focusing training on the "tail" of the data distribution, TailSFT helps models learn under-represented areas. This approach leads to significant improvements in downstream tasks like math and coding evaluations with minimal computational cost.

TailSFT yields better coverage, possibly at the cost of worse cross-entropy, which translates to stronger post-RL performance. Standard SFT achieves lower cross-entropy, while TailSFT preserves higher pass@ K K at large K K . Starting from this higher-coverage checkpoint, the same RL procedure yields higher pass@ 1 1 . Curves are illustrative.
TailSFT yields better coverage, possibly at the cost of worse cross-entropy, which translates to stronger post-RL performance. Standard SFT achieves lower cross-entropy, while TailSFT preserves higher pass@ K K at large K K . Starting from this higher-coverage checkpoint, the sam…
cs.AIarxiv:2608.26036v1Lead article

Trace Integrity for LLM Data Agents: A Vision for Auditable Structured Reasoning in Real-World Systems

Srimonti Dutta, Akshata Kishore Moharir

his paper introduces "Trace Integrity" as a crucial reliability criterion for LLM data agents, moving beyond simple answer accuracy. It proposes that the *process* behind an answer must be explicit, executable, and auditable, not just the final output. The core contribution is operationalizing this with "execution contracts" to ensure structured reasoning in real-world systems and introducing the "CAIT Rate" to measure invalid computation despite correct answers.

cs.LGarxiv:2608.25774v1Lead article

EXAONE Tabular 1.0 : Technical Report

Moonjung Eo, Min-Kook Suh, Hye-Seung Cho, Jiwon Kim, Seoyoon Kim

XAONE Tabular 1.0's core method is an architecture redesign for tabular in-context learning, interleaving feature and item attention within each Transformer layer. This approach, trained on synthetic data, allows it to make predictions without dataset-specific fine-tuning. Its main contribution is achieving state-of-the-art performance and high efficiency on tabular tasks through this novel architecture.

cs.LGarxiv:2608.25771v1Lead article

Large Language Model Few-Shot Prompting with Dilemma Training Outperforms Human Surrogates in Predicting Patient Preferences

Natasha Ureyang, Sebastian Porsdam Mann, Yuxin Liu, Zuriel Hassirim, Melanie Almonte

his paper introduces P4-DT, a large language model trained to predict patient preferences in serious illness. Unlike previous methods, P4-DT uses "dilemma training" to build a dynamic decision policy by engaging users with varied medical scenarios. This approach significantly improves prediction accuracy compared to human surrogates and even other AI prototypes, offering a more personalized and context-aware solution for end-of-life care decisions.

Figure 1. Accuracy of predicted patient preferences: P4-DT (AI agent), TO (human surrogate), and TO + P4-DT (human surrogate with P4-DT asisstance). On average, P4-DT predicted patient preferences with 81.7% accuracy compared to 55.0% for TO and 61.7% for P4-DT
Figure 1. Accuracy of predicted patient preferences: P4-DT (AI agent), TO (human surrogate), and TO + P4-DT (human surrogate with P4-DT asisstance). On average, P4-DT predicted patient preferences with 81.7% accuracy compared to 55.0% for TO and 61.7% for P4-DT
cs.CLarxiv:2608.25869v1Lead article

Anchoring Bias in LLM-as-a-Judge Systems: Prior Scores Compromise Evaluation Independence

Ante Kapetanovic, Kemal Altwlkany, Andro Mercep, Tomislav Duricic, Emanuel Lacic

his paper investigates the "anchoring bias" in LLM-as-a-Judge systems, demonstrating that prior scores, even when presented as mere metadata, significantly influence subsequent evaluations. The core method involves comparing LLM judgments under different prompt conditions, revealing that including prior scores systematically shifts ratings towards those previous values. The main contribution is the empirical evidence that LLM judgments are not independent, with prior scores acting as a strong anchor, compromising the reliability of these systems for content evaluation.

cs.CLarxiv:2608.25894v1Lead article

From Passive Response to Proactive Correction: Enhancing LLM Robustness Against Input Fact Perturbations

Ping Wang, Xiangguo Sun, Bingbing Xu, Guocong Li, Xiaofeng Meng

his paper introduces DEDUCE, a three-stage framework that enhances LLM robustness against factually incorrect user inputs. DEDUCE proactively detects, deliberates on, and corrects factual errors in the input before generating a response. Its core contribution is transforming LLMs from passive responders to active error correctors, significantly improving reliability.

A query containing factually incorrect or inconsistent premises can mislead an LLM into producing a confident but unreliable answer ( red ). The desired behavior is to identify the flawed premise, explicitly clarify the error, and then provide a corrected, factual response ( green ).
A query containing factually incorrect or inconsistent premises can mislead an LLM into producing a confident but unreliable answer ( red ). The desired behavior is to identify the flawed premise, explicitly clarify the error, and then provide a corrected, factual response ( gree…
cs.AIarxiv:2608.27402v1Lead article

How Language Models Organize and Structure Moral Knowledge

Orion Reblitz-Richardson

his paper investigates how Large Language Models (LLMs) structure moral knowledge by training probes on different moral foundations. The core finding is that LLMs organize moral concepts not as a single detector or isolated ideas, but as distinct dimensions that share a common, moral-specific component. This geometric structure suggests LLMs integrate moral knowledge in a nuanced way, reflecting the interconnectedness of moral principles.

Pairwise cosine similarity between foundation probe directions at layer 7 (bootstrap-stable; all six foundations exceed the 0.8 stability threshold at this layer; Section 4.6 ), OLMo-2 1B. Mean off-diagonal cosine = 0.262. See Appendix C for matrices at layers 0 and 15.
Pairwise cosine similarity between foundation probe directions at layer 7 (bootstrap-stable; all six foundations exceed the 0.8 stability threshold at this layer; Section 4.6 ), OLMo-2 1B. Mean off-diagonal cosine = 0.262. See Appendix C for matrices at layers 0 and 15.
cs.AIarxiv:2608.27102v1Lead article

LAAF: A Layered Accountability Architecture Framework for LLM Applications

Prachi Chaturvedi, Shahnawaz Ahmad, Ehsan Nowroozi, Muhammad Waqas, George Loukas

his paper introduces LAAF, a Layered Accountability Architecture Framework for LLM applications. It addresses the critical need to establish accountability for LLM outputs in high-stakes domains by consolidating existing mechanisms into four families: technical controls, human oversight, organizational governance, and documentation. LAAF provides a sociotechnical framework to trace, explain, and act upon responsibility when LLM outputs cause harm.

Evolution of Large Language Models, 2017–2026, in five eras: foundation (2017–2018), scaling (2019–2020), scaling breakthroughs (2021–2022), efficiency and democratisation (2022–2024), and multimodal and reasoning specialisation (2024–2026). The periodisation is the authors’ construction, derived from the release history of the models named.
Evolution of Large Language Models, 2017–2026, in five eras: foundation (2017–2018), scaling (2019–2020), scaling breakthroughs (2021–2022), efficiency and democratisation (2022–2024), and multimodal and reasoning specialisation (2024–2026). The periodisation is the authors’ cons…
cs.AIarxiv:2608.27266v1Lead article

Naive Prompt Optimization: Rethinking the Need for Complex Prompt Search

Yuan Chang, Xiaoqi Chen

his paper introduces Naive Prompt Optimization (NPO), a simple, single-lineage method for improving AI agent prompts. NPO iteratively refines prompts using a teacher model and rollout feedback, achieving comparable or better performance than complex methods with fewer computational resources. Its success suggests that stronger teacher models can compensate for simpler prompt optimization strategies.

cs.AIarxiv:2608.27345v1Lead article

PAWBench: How Far Are We from Probabilistically Aligned World Modeling?

Yuandong Pu, Le Zhuo, Sayak Paul, Gabriel Jorge Menezes, Avram Đorđević

his paper introduces PAWBench, a new benchmark to evaluate video generation models as "world models" that can predict the distribution of possible future outcomes, not just single plausible ones. The core method involves assessing if repeated generations from the same starting point accurately reflect the true probability distribution of physical behaviors. The main contribution is to highlight the gap between current models and this "probabilistic alignment" requirement, providing a framework to measure progress towards more realistic and stochastic world modeling.

One plausible future is not enough. A single rollout from a video generation model can appear physically plausible, yet repeated rollouts from the same initial observation and action may reveal a probabilistically unaligned world: outcomes concentrate on a narrow subset of futures instead of matching the valid stochastic support. PAWBench evaluates this induced distribution or support over repeated futures, rather than judging a model by one sampled video.
One plausible future is not enough. A single rollout from a video generation model can appear physically plausible, yet repeated rollouts from the same initial observation and action may reveal a probabilistically unaligned world: outcomes concentrate on a narrow subset of future…
cs.AIarxiv:2608.27427v1Lead article

Persona-Execution Separation: An Architecture Pattern for Evolving LLM Agents under Execution Audit

Yisen Xi

his paper introduces Persona-Execution Separation (PES), an architectural pattern for LLM agents. PES separates the agent's evolving persona from its stateful, auditable execution into distinct trust domains. This allows for flexible persona changes while ensuring traceable and secure execution, addressing the challenge of maintaining both freedom and accountability in governed environments.

cs.AIarxiv:2608.27364v1Lead article

Sophistication in GenAI Use: Field Evidence from a Large Firm

Nicholas J. Hallman, Zachary T. Kowaleski, Anu Puvvada, Jaime J. Schmidt

his paper analyzes sophisticated generative AI (genAI) use among back-office employees in a large firm. It finds that senior employees and those in strategy-focused roles tend to use genAI more sophisticatedly, suggesting domain expertise and strategic alignment are key. The study also highlights that improving genAI sophistication is challenging, with no observed improvements over time or after formal training.

cs.AIarxiv:2608.27225v1Lead article

STEP: State-Aware Task Estimation and Planning with Multi-Modal LLMs for Human-Robot Collaboration

Maitrey Gramopadhye, Prakash Baskaran, Xiao Liu, Songpo Li, Soshi Iba

his paper introduces STEP, a method that enhances human-robot collaboration by enabling robots to understand human intentions and plan tasks. STEP's core innovation is prompting a multi-modal LLM to explicitly estimate system states and predict state transitions, overcoming the limitations of current LLMs that often hallucinate actions due to a lack of state awareness. This state-aware approach allows for more accurate and grounded task planning, reducing ambiguity and improving collaboration.

cs.AIarxiv:2608.27449v1Lead article

SWE-Prime: Fewer Trajectories, Better Performance

Dewu Zheng, Ruizhe Ye, Yanlin Wang, Yang Ye, Hongyu Zhang

WE-Prime addresses the issue of noisy supervision in LLM training for software issue resolution. Its core method is a two-stage data selection process that filters trajectories first by overall quality and representativeness, then by the quality of individual step segments. This approach aims to provide cleaner, more effective training data, leading to better LLM performance.

Motivating example comparing outcome-only, trajectory-level, and segment-level data selection.
Motivating example comparing outcome-only, trajectory-level, and segment-level data selection.
cs.AIarxiv:2608.27260v1Lead article

What Makes Good Agentic Data? An ACE Lens on Data Generation for LLM Agents

Xingshan Zeng, Zishan Xu, Boju Zhang, Yuzhou Wu, Lingzhi Wang

his paper proposes a unified framework for generating data for LLM agents. It represents agentic data as a structured object $(E,q,τ,v)$ and organizes generation methods by their core components. The authors then introduce the ACE lens (Accuracy-Complexity-divErsity) to guide data generation, emphasizing the need for grounded, efficient, and varied interactions rather than just large quantities of data.

The ACE lens views agentic data generation as constrained distribution design: Accuracy defines valid support, while learner-relative Complexity and Diversity shape useful, non-redundant experience over ( E , q , τ , v ) (E,q,\( \tau \),v) .
The ACE lens views agentic data generation as constrained distribution design: Accuracy defines valid support, while learner-relative Complexity and Diversity shape useful, non-redundant experience over ( E , q , τ , v ) (E,q,\( \tau \),v) .
cs.AIarxiv:2608.27454v1Lead article

WikiSkill: Compiling Agent Experience into Persistent Knowledge for Skill Evolution

Liyan Tang, Cyrus Rashtchian, Chun-Sung Ferng, Andrew Tomkins, Da-Cheng Juan

ikiSkill addresses the problem of scattered agent skill knowledge by introducing a persistent knowledge base (wiki) that co-evolves with agent skills. It separates raw experience, accumulated knowledge, and executable skills, consolidating experience into the wiki for future skill updates. This framework consistently outperforms existing skill evolution methods by enabling systematic reuse of insights across iterations.

cs.LGarxiv:2608.27182v1Lead article

TraceBench: Controlled Evaluation of LLM Agents for Time-Series Root-Cause Attribution

Tommaso Bendinelli, Artur Dox, Christian Holz

raceBench is a novel simulation-based framework that generates controlled root-cause attribution tasks for LLM agents analyzing time-series data. By simulating physical dynamical systems, it allows for systematic evaluation of LLM agents' ability to identify parameter changes, providing new insights into their performance and data exploration strategies.

Figure 1. Overview of the TraceBench framework using a bouncing-ball simulator. In this example, the black and orange segments show the position observation under the low-noise setting before and after an intervention at t int = 4.0 t_{\( \mathrm{int} \)}=4.0 . The intervention increases gravitational acceleration, and the dashed line marks the intervention time. At test time, the agent determines from the observed time-series channels whether an intervention occurred and, if so, which parameter changed. \( \name{} \) pipeline: a physical simulator produces multivariate time series before and after a parameter intervention; the low-noise BallDrop position observation is black before and orange after a dashed gravity-intervention marker; the agent identifies the changed root-cause parameter.
Figure 1. Overview of the TraceBench framework using a bouncing-ball simulator. In this example, the black and orange segments show the position observation under the low-noise setting before and after an intervention at t int = 4.0 t_{\( \mathrm{int} \)}=4.0 . The intervention i…
cs.CLarxiv:2608.27219v1Lead article

BALMS: Benchmarking Agentic LLMs for Longitudinal Mental Health Sensing

Yu Yvonne Wu, Arvind Pillai, Yuliang Chen, Yuwei Zhang, Sudarshan Regmi

his paper introduces BALMS, the first benchmark for evaluating LLM-driven agents in longitudinal mental health sensing. BALMS assesses agents' ability to predict wellbeing scores and generate evidence-based rationales from continuous wearable data, addressing the limitations of episodic self-reports. The benchmark utilizes real-world datasets and evaluates various agentic paradigms and LLM backbones.

LLM-based agents for longitudinal mental health sensing. Given a multi-channel wearable record and a user query, an agent combines retrieval, memory, tools, and reasoning to output a wellbeing score with an evidence-grounded rationale.
LLM-based agents for longitudinal mental health sensing. Given a multi-channel wearable record and a user query, an agent combines retrieval, memory, tools, and reasoning to output a wellbeing score with an evidence-grounded rationale.
cs.CLarxiv:2608.27409v1Lead article

Consolidating RLVR Capabilities Across Domains: A Deep Dive into Fusion Paradigms

Siye Wu, Kai Yang, Yuchen Cai, Xin Xu, Peng-Yuan Wang

his paper investigates three methods for combining Reinforcement Learning with Verifiable Rewards (RLVR) capabilities in large language models: Merge, Mix RL, and Multi-Teacher On-Policy Distillation (MOPD). By comparing these paradigms on a multi-domain benchmark, the authors reveal significant performance differences across specific tasks, highlighting that the choice of fusion method critically impacts overall effectiveness and can be guided by the relationships between domains.

Three paradigms for consolidating domain-specific capabilities acquired through RLVR into one model. Merge combines expert task vectors, Mix RL trains jointly on mixed-domain data, and MOPD draws on both through multi-teacher on-policy distillation.
Three paradigms for consolidating domain-specific capabilities acquired through RLVR into one model. Merge combines expert task vectors, Mix RL trains jointly on mixed-domain data, and MOPD draws on both through multi-teacher on-policy distillation.
cs.CLarxiv:2608.27455v1Lead article

CritICL: Inference-Time Weak-to-Strong Generalization from Small Language Model Failure Modes

Yufan Wu, Yinghui He, Zhengyi Hu, Lang Wei, Ruichen Li

ritICL improves LLM reasoning at inference time by leveraging structured failure patterns observed across different model scales. Instead of discarding errors from weaker models, CritICL uses these "failure modes" as critiques within in-context examples to guide stronger models, enhancing efficiency and performance.

CritICL is a two-stage, inference-time W2SG method. Stage 1: Construct CritBank. We use SLMs to generate responses and reasoning on a dataset. Then we leverage a frontier LLM to produce critiques and assigns failure mode labels. Stage 2: Perform LLM inference with CritICL. For a given query, CritICL-static constructs model-specific failure mode profiles from CritBank, while CritICL-dynamic identifies failure modes relevant to the query. We then performs failure mode-based in-context sample selection from CritBank to provide in-context examples for target LLMs.
CritICL is a two-stage, inference-time W2SG method. Stage 1: Construct CritBank. We use SLMs to generate responses and reasoning on a dataset. Then we leverage a frontier LLM to produce critiques and assigns failure mode labels. Stage 2: Perform LLM inference with CritICL. For a …
cs.AIarxiv:2608.21099v1Lead article

A2DINOv3: Rethinking Multi-Modal Object Detection via Socialized Collaboration

Jiekang Feng, Zhihe Fan, Yunqi Zhu, Xinjie Yao, Yueying Zhang

his paper proposes A2DINOv3, a multi-modal object detection framework that addresses the challenge of fusing heterogeneous modalities like RGB and infrared. It introduces a "Socialized Collaboration Protocol" where each modality acts as an independent expert, selectively exchanging complementary information to preserve pre-trained representations and avoid redundant fusion. This approach enhances robustness in challenging environments by enabling more effective multi-modal understanding.

Social interdependence in human society versus socialized interdependence in multi-modal object detection.
Social interdependence in human society versus socialized interdependence in multi-modal object detection.
cs.AIarxiv:2608.23400v1Lead article

Adaptive Item-based Collaborative Structures via Noise Rescheduling in Diffusion for Generative Recommendation

Jiaqi Wang, Tianying Liu, Heng Chang, Jihong Guan, Wengen Li

his paper introduces ANR-DiffRec, a generative recommendation framework that enhances discrete diffusion models. It addresses the limitation of existing methods by explicitly incorporating item-based collaborative filtering information. The core contribution is a novel noise rescheduling strategy that leverages item co-occurrence to adapt the diffusion process, leading to more accurate recommendations by better capturing item relationships.

Figure 1. Illustration of the proposed item-based adaptive noise rescheduling strategy. (a) Existing diffusion-based recommendation models employ a uniform noise schedule, assigning identical denoising weights to masked tokens regardless of their contextual dependencies. (b) Our method dynamically adjusts the denoising weight for each token by jointly considering two complementary signals: (1) local recoverability estimation, and (2) behavior-aware dependency modeling. The final denoising weight is obtained by combining these two signals, enabling structure-aware diffusion training.
Figure 1. Illustration of the proposed item-based adaptive noise rescheduling strategy. (a) Existing diffusion-based recommendation models employ a uniform noise schedule, assigning identical denoising weights to masked tokens regardless of their contextual dependencies. (b) Our …
cs.AIarxiv:2608.23525v1Lead article

EarthVerse: Benchmarking Scientific Agents Across Dynamic Earth Systems and Natural Hazards

Zhiqing Cui, Xinxiang Yin, Yihong Tang, Xinglang Zhang, Yuanzhe Hu

arthVerse is a benchmark designed to evaluate scientific agents on their ability to analyze dynamic Earth systems and natural hazards. It provides 405 reproducible tasks using heterogeneous data from 199 documented events, assessing agents' capabilities in evidence selection, calculation, reconciliation, and provenance preservation. The contribution lies in its comprehensive evaluation framework, which includes executable ground truth and task-specific rubrics, allowing for a nuanced assessment of agent performance and identification of failure points.

Coverage and model landscape. Task and answer-unit coverage across hazards and capabilities (left); mean answer-unit accuracy and token use across 25 systems (right).
Coverage and model landscape. Task and answer-unit coverage across hazards and capabilities (left); mean answer-unit accuracy and token use across 25 systems (right).
cs.AIarxiv:2608.23248v1Lead article

Future Querying: Can LLMs Serve as Implicit Medical World Models?

Siri Willems, James Butterworth, Lore Goetschalckx, Peter Vrancx, Philippe Modard

his paper introduces "future querying" to assess if LLMs can act as implicit medical world models. The core method involves using LLMs to answer time-indexed questions about a patient's future based on unstructured clinical notes. The key contribution is demonstrating that this endpoint-agnostic approach allows a single, locally fine-tuned LLM to handle diverse queries without retraining, showing promise for privacy-preserving medical AI.

The future querying paradigm. A patient timeline p p is partitioned by a virtual present T ^ \( \hat{T} \) into an observed history and a hidden future. Given the historical context and a flexible, time-indexed clinical query q k q_{k} , we investigate whether an LLM can serve as an implicit medical world model to predict the correct answer a k a_{k} derived from the patient’s actual future timeline.
The future querying paradigm. A patient timeline p p is partitioned by a virtual present T ^ \( \hat{T} \) into an observed history and a hidden future. Given the historical context and a flexible, time-indexed clinical query q k q_{k} , we investigate whether an LLM can serve as…
cs.AIarxiv:2608.23397v1Lead article

MediSkill-Evo: Process-Constrained Self-Evolution for Evidence-Grounded Clinical Interaction

Ruoyu Wu, Shenfu Xie, Yinqian Sun, Haibo Tong, Feifei Zhao

ediSkill-Evo is a clinical agent that improves diagnostic accuracy by evolving its process knowledge without retraining its core model. It achieves this by separating and managing different types of knowledge (skills, rules, schemas, procedures) and using a novel "Process-Constrained Preference Harness" to ensure actions are grounded in evidence and adhere to safety constraints. This approach allows the agent to learn and adapt its reasoning process, leading to more reliable and evidence-based clinical interactions.

Figure 1. Online inference and offline learning and governance in MediSkill-Evo. Left: the online pipeline retrieves four-bank context, generates and verifies candidate actions, executes the selected action, and incorporates environment feedback. Right: completed trajectories are reflected into typed memory operations, validated for label/evidence leakage, controller-defined safety, support, and replayability, and published as the next memory snapshot. Two equally sized MediSkill-Evo diagrams separated by a vertical dashed line. The left panel presents the seven-stage online inference pipeline, and the right panel presents the six-stage offline learning and governance pipeline.
Figure 1. Online inference and offline learning and governance in MediSkill-Evo. Left: the online pipeline retrieves four-bank context, generates and verifies candidate actions, executes the selected action, and incorporates environment feedback. Right: completed trajectories are…
§ III

Daily Issues This Week

2026-08-24 to 2026-08-30 7