Tapilot-Crossing: Benchmarking and Evolving LLMs Towards Interactive Data Analysis Agents

Jinyang Li, Nan Huo, Yan Gao, Jiayi Shi, Yingxiu Zhao +5 more
3/8/2024
cs.AI

No official code found. Best implementation: tapilot-crossing/tapilot_code (45 stars, MIT, last commit 2024-06-27).

Abstract

Interactive Data Analysis, the collaboration between humans and LLM agents, enables real-time data exploration for informed decision-making. The challenges and costs of collecting realistic interactive logs for data analysis hinder the quantitative evaluation of Large Language Model (LLM) agents in this task. To mitigate this issue, we introduce Tapilot-Crossing, a new benchmark to evaluate LLM agents on interactive data analysis. Tapilot-Crossing contains 1024 interactions, covering 4 practical scenarios: Normal, Action, Private, and Private Action. Notably, Tapilot-Crossing is constructed by an economical multi-agent environment, Decision Company, with few human efforts. We evaluate popular and advanced LLM agents in Tapilot-Crossing, which underscores the challenges of interactive data analysis. Furthermore, we propose Adaptive Interaction Reflection (AIR), a self-generated reflection strategy that guides LLM agents to learn from successful history. Experiments demonstrate that Air can evolve LLMs into effective interactive data analysis agents, achieving a relative performance improvement of up to 44.5%.

View on arXivView PDF

Code Implementations(1)

MIT
4510Shell, PythonMar 20, 20242 years agoMIT

Similar Papers

Cite this paper

@article{li2024tapilotcrossing,
  title  = {Tapilot-Crossing: Benchmarking and Evolving LLMs Towards Interactive Data Analysis Agents},
  author = {Jinyang Li and Nan Huo and Yan Gao and Jiayi Shi and Yingxiu Zhao and Ge Qu and Yurong Wu and Chenhao Ma and Jian-Guang Lou and Reynold Cheng},
  year   = {2024},
  eprint = {2403.05307},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.05307v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.05307.svg)](https://codeofpaper.com/paper/2403.05307)

Discussion