arXiv AI By Weihong Lin, Lin Sun, Xiangzheng Zhang

When Do Prompt-Side Agent Playbooks Transfer? Accuracy, Cost, and Runtime Shift in Agent Deployment

Read the original on arXiv AI →

arXiv:2608. 05778v1 Announce Type: new Abstract: Prompt-side playbooks can improve tool-using language agents without retraining, but their portability beyond the source setting is unclear.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Computation and Language
Oct 12

Proactive Agentic Orchestration

The paper introduces POrchestra, a proactive agentic orchestration framework that lets sub‑agents request harness adjustments during execution, enhancing adaptability to dynamic environments. It also proposes On‑Policy Orchestration Distillation (OPOD), which uses hindsight feedback from sub‑agents’ requests to provide targeted improvement signals for training the orchestration policy. Experiments on three long‑horizon benchmarks show that POrchestra boosts task success by about 9.1% over the best baseline, and with OPOD the improvement rises to 10.0%, while also improving cost‑performance trade‑offs.

By Xueyang Feng, Chaozhuo Li, Xiaohe Bo, Jiakai Tang, Chenxi Li, Qiwei Ye, Xu Chen
arXiv Machine Learning
Oct 23

Conservative Meta-Agent Search: Architecture Adaptation under Non-Stationarity

The paper introduces Conservative Meta-Agent Search (CMAS), a method for adapting agent architectures in non‑stationary environments. CMAS retrieves archived designs, proposes typed graph edits, and evaluates them through paired shadow replay with variance‑penalized scoring and a simulated canary stage before promotion. Using the MetaInvest‑Bench simulator, CMAS reduces surrogate dynamic‑oracle regret and improves held‑out utility across 96 financial streams, while maintaining low false‑promotion rates and modest inference cost.

By Ali Atiah Alzahrani
arXiv AI
Sep 25

Benchmarking the Limits of In-Context Reinforcement Learning for Ad-Hoc Teamwork

The paper introduces ICRL4AHT, a large-scale benchmark for evaluating In-Context Reinforcement Learning (ICRL) in Ad-Hoc Teamwork (AHT) scenarios using Overcooked-V2. It provides a diverse teammate suite, a reproducible pipeline, and evaluates history-conditioned ICRL algorithms such as Algorithm Distillation and Decision-Pretrained Transformer. The results show that these methods often perform worse than random baselines and do not improve with longer horizons, underscoring the difficulty of strategic inference under partial observability in AHT.

By Yuheng Jing, Kai Li, Ziwen Zhang, Jiajun Zhang, Zeyao Ma, Jiaxi Yang, Lei Zhang, Zhe Wu, Jinmin He, Junliang Xing, Jian Cheng