paper-with-me

Papers

CoPS: Empowering LLM Agents with Provable Cross-Task Experience Sharing

2024-10-22 · Chen Yang, Chenyang Zhao, Quanquan Gu, Dongruo Zhou

Sequential reasoning in agent systems has been significantly advanced by large language models (LLMs), yet existing approaches face limitations. Reflection-driven reasoning relies solely on knowledge in pretrained models, limiting performance in novel scenarios, while experience-assisted reasoning often depends on external experiences and lacks clear principles for selecting representative experiences. We address these limitations by proposing CoPS (Cross-Task Experience Sharing), a generalizable algorithm that enhances sequential reasoning by cross-task experience sharing and selection. In detail, CoPS leverages agents' experiences on previous tasks, selecting distribution-matched experiences via a provable pessimism-based strategy to maximize utility while minimizing risks from distribution shifts. Extensive experimental results on benchmarks like Alfworld, Webshop, and HotPotQA demonstrate that CoPS consistently outperforms state-of-the-art baselines, with superior sample efficiency suitable for resource-constrained scenarios. Theoretically, we show that the performance of our algorithm depends on both the quality of the pretrained LLM and the matching between the agent's task-dependent trial distribution and that generated by the LLM. Our work bridges the gap between existing sequential reasoning paradigms and validates the effectiveness of leveraging cross-task experiences, shedding light on the potential to improve agents' generalization and adaptability across diverse tasks. Our codes are available at $\href{https://github.com/uclaml/COPS}{\text{https://github.com/uclaml/COPS}}$.

📄 PDF Abstract BibTeX arXiv:2410.16670

Code (1)

uclaml/cops 공식 구현

Similar Papers 제목 키워드 기반

Constrained Bayesian Optimization Under Partial Observations: Balanced Improvements and Provable Convergence

2023-12-06 · Shengbo Wang, Ke Li

The partially observable constrained optimization problems (POCOPs) impede data-driven optimization techniques since an infeasible solution of POCOPs can provide little information about the objective as well as the cons…

Bayesian Optimization

DocOps: A Verifiable Benchmark for Autonomous Agents in Complex Document Operations

2026-07-22 · Jiazhen Jiang, Boxi Cao, Lingyong Yan, Yaojie Lu 외 arxiv

As autonomous agents rapidly evolve, their ability to reliably manipulate ubiquitous digital documents has become critical for enabling general-purpose AI assistants and automating complex workspace workflows. In this pa…

A Particle Swarm Inspired Approach for Continuous Distributed Constraint Optimization Problems

2020-10-20 · Moumita Choudhury, Amit Sarker, Md. Mosaddek Khan, William Yeoh

Distributed Constraint Optimization Problems (DCOPs) are a widely studied framework for coordinating interactions in cooperative multi-agent systems. In classical DCOPs, variables owned by agents are assumed to be discre…

Scheduling

HiSkill: Empowering LLM Agents with Hierarchical Skill Graphs

2026-07-28 · Yu Hao, Jinxuan Cai, Qi Zhang, Yawen Li 외 arxiv

Skills have become an important abstraction for enabling large language model (LLM) agents to reuse past experience in long-horizon interactive tasks. However, existing trajectory-to-skill methods often produce flat coll…

Asymmetric Distributed Constraint Optimization Problems

2014-02-04 · Tal Grinshpoun, Alon Grubshtein, Roie Zivan, Arnon Netzer 외

Distributed Constraint Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned by different agents. Many multi-agent probl…