EvoTS-Agent is a self‑evolving large language model agent designed for autonomous change‑point detection in financial time series. It begins with curated exploratory data analysis to set up candidate models, then iteratively refines its detection pipeline using three operators—Revision, Alternative Strategy, and Recombination—guided by validation feedback. Across four benchmark datasets, EvoTS-Agent consistently outperforms existing LLM‑based agents and achieves a 100% execution success rate on all tested backbone LLMs.
By Lei Jiang, Ye Wei, Xinyu Xi, Jordan Langham-Lopez, Yifan Bao, Raad Khraishi, Yihao Ang, Anthony K. H. Tung, Lukasz Szpruch, Hao Ni
The paper introduces D$^2$ACCI, a dual-loop diagnostic protocol designed to improve evidence-preserving memory in large language model agents. It provides a structured framework that uses paired evidence, protected-slice monitoring, and trace-level localizability to decide whether to promote, flag, or reject memory interventions. The authors also present DCR, a metric for measuring failure localizability, and D$^2$ACCI‑Eval, a reusable artifact for gate replay, demonstrating significant performance gains on three public benchmarks and highlighting the importance of traceable, statistically grounded diagnostics.
By Xule Liu, Yijun Liu, Chao Li, Shao Kun
PlanPO introduces a group planning-aware policy optimization method for multi-turn agentic large language models, addressing the issue of advantage collapse caused by treating all successful trajectories equally. By incorporating coarse-to-fine advantage signals that reflect differences in trajectory and turn lengths, PlanPO encourages agents to learn generalizable planning and generation behaviors. Experiments show a 27.2% average improvement over GRPO on benchmarks such as ALFWorld, WebShop, and SciWorld, with minimal extra training cost.
By Dayang Liang, Liyuan He, Xuan Feng, Shuxin Li, Bo An, Yunlong Liu
The paper introduces a task-aware harness provisioning method for large language model agents used in mission‑critical infrastructure operations. By mapping each task to an optimal harness configuration—determined through mathematical task classification and empirical agent execution data—the authors propose a map‑guided escalation algorithm that starts with a minimal harness and expands only when necessary. Experiments on liquid‑cooling and power‑grid tasks show that this approach can improve accuracy and reduce token usage compared to full harness provisioning, revealing a domain‑dependent accuracy‑cost trade‑off.
By Liangtao Lin, Qingang Zhang, Zhaomeng Zhu, Tianwei Zhang, Yonggang Wen
The paper investigates whether large language model (LLM) agents can design AI methods that outperform or differ from human-designed approaches. By mapping both human- and agent-designed methods into task‑specific algorithmic design spaces, the authors evaluate performance and algorithmic differences across multiple modalities. Results show that while agents occasionally match or exceed human state‑of‑the‑art performance, 96.8% of their designs fall within human‑derived spaces, often recombining or exactly matching existing human algorithms.
By Yikang Yang, Zhengxin Yang, Luzhou Peng, Minghao Luo, Yanqi Kan, Wanling Gao, Jianfeng Zhan
The paper introduces FACA, a Feedback‑Aware Credit Assignment method that aligns each agent reaction with the preceding user‑to‑user segment, computes a locally normalized reaction advantage, and adds it to the terminal outcome advantage without requiring an extra critic or rollout. Experiments show that FACA improves performance across nine domains, especially in Telecom, and maintains the same ordering of gains in zero‑shot benchmarks such as Pare‑Bench and Co‑Gym.
By Yiwen Zhao, Zhihao Wen, Yuchen Mao, Mingxuan Jiang, Yihao Hu, Pan Wang, Xin Zhang, Wei Wu
The paper introduces SGHA, a fully automated system that discovers research problems by structuring scientific literature into evidence-linked objects and a typed evidence graph. SGHA operates entirely on a local 9B open‑weight language model, avoiding proprietary frontier‑model APIs, and outputs traceable research‑problem families with assumptions, objectives, success criteria, and ambiguities. Comparative experiments in five machine‑learning domains show that SGHA’s corpus‑first, evidence‑constrained approach yields inspectable research‑problem formulation without relying on external models.
By Sarvesh Gharat, Junpei Komiyama
The paper introduces RATTL (Risk-Adversarial Total-Reward Learning), a framework that adjusts an agent’s caution based on epistemic uncertainty by using a Bayesian posterior over dynamics and a Wasserstein ambiguity set whose radius depends on that posterior. As evidence accumulates, the radius shrinks, smoothly transitioning the agent’s behavior from worst-case robustness to risk-neutral reward maximization. The authors prove a Safety Sandwich theorem showing RATTL’s value lies between the uninformed robust value and the full-knowledge optimum, and demonstrate the method on a binary-hazard example where the criterion reduces to Conditional Value-at-Risk.
By Deep Kumar Ganguly, Jan Kretinsky
StartupBench is a new benchmark that evaluates general-purpose agents on end-to-end workflows derived from AI startup products that have proven market adoption. It translates real-world product workflows into deliverable-oriented tasks and assesses them with detailed rubrics. The study finds that even the best models complete only about 30% of these tasks, highlighting challenges such as complex instruction following and domain expertise.
By Liya Zhu, Xin Ma, Tao Liu, Haodong Wang, Ge Zhang, Jingzhe Ding, Qingshui Gu, Yongjie Zhong, Jinxiang Meng, Yuan Gao, Yunqiu Zhou, Hao Zhu, Jifeng He, Yongzhi Liao, Xinyi Zhang, Chaoxin Li, Yi Zhu, Xi Lin, Duju Zeng, Xiang Gao, Wen Zhang, Yunyang Wang, Duo Wang, Huan Zhou, Zuo Wang, Jin Chen, Kaiyuan Zhang, Chuqian Yu, Tianhao Yu, Longxiang Liu, Jianbo Xue, Huimin Che, Jiahao Wang, Yujia Qin, Jiaheng Liu, Shen Yan, Xiaolong Chang, Wenhao Huang
The paper re‑evaluates memory‑based self‑improving agents by adding multiple runs to measure variance and by randomizing task order. It finds that agent performance is noisy in complex, multi‑step environments and that improvement depends heavily on the sequence of tasks, revealing a hidden curriculum effect. The authors suggest that underspecification of tasks and environments contributes to this fragility and demonstrate that adding detailed rubrics and feedback can partially mitigate performance drops, though gaps remain.
By Qinyuan Ye, Yu Li, Yada Pruksachatkun, Jiaxin Zhang, Chien-Sheng Wu
CityReal is a modular framework that uses large language model agents to simulate human-aligned urban behavior. It models agents as intention-driven decision makers who pursue coherent mobility and activity plans, learning habits and preferences over time. By training textual adapters to align agent decisions with observed population statistics, CityReal improves realism at both micro and macro levels and can scale to tens of thousands of agents for analyzing crowd density, place popularity, mobility flows, and well‑being under various urban scenarios.
By Nicolas Bougie, Xiaotong Ye, Narimasa Watanabe
PathPocket is a multimodal AI co‑pilot that grounds pathology decision‑making in evidence. It builds the largest pathology evidence corpus (≈110,472 documents) and a hypergraph of 4.55 million entities and 7.10 million relations to support traceable reasoning. The system handles text and multimodal queries, including ROI and gigapixel whole‑slide images, and outperforms current state‑of‑the‑art models on a benchmark of over 200,000 real‑world cases, improving pathologists’ diagnostic accuracy and confidence.
By Zhe Xu, Zhengyu Zhang, Zhiyuan Cai, Jiahao Xu, Yijie Lin, Ziyi Liu, Junlin Hou, Hongyi Wang, Yuxiang Nie, Yihui Wang, Jiabo Ma, Ling Liang, Yingxue Xu, Zhengrui Guo, Guanghao Wu, Danyi Li, Ziqi Zhou, Donglin Tan, Zhijian Cen, Ying Tan, Xiaolin Liu, Qi Xie, Xiaoying Tang, Xi Peng, Cheng Deng, Lijuan Qu, Ronald Cheong Kin Chan, Li Liang, Hao Chen
The paper presents dynamic shields for AI-controlled autonomous systems, enabling runtime safety enforcement that adapts to changing safety specifications without recomputing from scratch. Unlike traditional static shields, these dynamic shields are pre-designed for a set of possible safety parameters and can quickly adjust as the true specification becomes known during operation. Experiments on robot navigation in unknown terrains show that dynamic shields require only a few minutes offline and a fraction of a second to a few seconds online, outperforming brute-force recomputation by up to five times.
By Davide Corsi, Kaushik Mallik, Andoni Rodriguez, Cesar Sanchez
The paper proposes Novelty and Surprise Prioritized Experience Replay (NSPER) for image-based reinforcement learning, combining novelty to highlight underrepresented states and surprise to reveal gaps in the agent’s knowledge. An extended version, NSPER+R, also uses these signals as intrinsic rewards to enhance both replay quality and exploration. Experiments on DeepMind Control Suite tasks demonstrate that NSPER and NSPER+R accelerate training and improve convergence compared to existing methods.
By Hoda Yamani, Henry Williams, Bruce A. MacDonald
Graphectory Viewer is a web-based tool that enables interactive, process‑centric analysis of software‑agent trajectories. It converts heterogeneous raw trajectories into phase‑aware graphs, linking low‑level execution details with higher‑level behavioral structures. The tool supports multiple agent frameworks, offers node‑level inspection, search and filtering over large collections, and Sankey‑style summaries of problem‑solving phase transitions, allowing researchers to inspect individual runs, identify patterns, compare successes and failures, and analyze large corpora beyond final outcomes.
By Charlie Jyu, Shuyang Liu, Reyhaneh Jabbarvand
The paper introduces eXplainable DFT (XDFT), a self‑evolving computational agent that transforms experiment‑simulation mismatches into executable searches for physical mechanisms. XDFT formalizes candidate mechanisms as hypotheses, tests them against experimental data, and refines its search strategy through a learning loop. In a benchmark of 112 cases where standard calculations predicted a metal but experiments found a semiconductor, XDFT resolved 105 cases with evidence‑supported mechanisms, and its top‑ranked hypotheses improved dramatically over initial expert priors.
By Yue Li, Penghui Yang, Yushan Xiao, Zhonghan Zhang, Jianguo Huang, Yuhao Lu, Cuntai Guan, Bo An, Bijun Tang, Zheng Liu
FM‑Bench is a new benchmark that tests large language model agents on long‑horizon decision‑making by having them run a football club for 20 in‑game years. The agent must manage a squad, trade players, negotiate contracts, invest in facilities, set lineups, and respond to a board that can fire it, all while a deterministic engine aggregates the outcomes into a final score without human judgment. The benchmark evaluates six behavioral capabilities and compares 15 frontier models in solo and arena tracks, revealing that managerial behavior—not computational scale—drives performance.
AI code agents are increasingly deployed to resolve real software issues, yet their reliability under superficial code variations remains poorly understood. We evaluate whether coding agents that repa...
Metasurfaces have revolutionized the development of photonic devices by enabling unprecedented precision in light manipulation. However, their design processes are often constrained by computationally...