Predicting Decisions of AI Agents from Limited Interaction through Text-Tabular Modeling episode artwork

EPISODE · May 15, 2026 · 24 MIN

Predicting Decisions of AI Agents from Limited Interaction through Text-Tabular Modeling

from Daily Paper Cast · host Jingwen Liang, Gengyu Wang

🤗 Upvotes: 43 | cs.LG, cs.AI, cs.CL, cs.MA Authors: Eilam Shapira, Moshe Tennenholtz, Roi Reichart Title: Predicting Decisions of AI Agents from Limited Interaction through Text-Tabular Modeling Arxiv: http://arxiv.org/abs/2605.12411v1 Abstract: AI agents negotiate and transact in natural language with unfamiliar counterparts: a buyer bot facing an unknown seller, or a procurement assistant negotiating with a supplier. In such interactions, the counterpart's LLM, prompts, control logic, and rule-based fallbacks are hidden, while each decision can have monetary consequences. We ask whether an agent can predict an unfamiliar counterpart's next decision from a few interactions. To avoid real-world logging confounds, we study this problem in controlled bargaining and negotiation games, formulating it as target-adaptive text-tabular prediction: each decision point is a table row combining structured game state, offer history, and dialogue, while $K$ previous games of the same target agent, i.e., the counterpart being modeled, are provided in the prompt as labeled adaptation examples. Our model is built on a tabular foundation model that represents rows using game-state features and LLM-based text representations, and adds LLM-as-Observer as an additional representation: a small frozen LLM reads the decision-time state and dialogue; its answer is discarded, and its hidden state becomes a decision-oriented feature, making the LLM an encoder rather than a direct few-shot predictor. Training on 13 frontier-LLM agents and testing on 91 held-out scaffolded agents, the full model outperforms direct LLM-as-Predictor prompting and game+text features baselines. Within this tabular model, Observer features contribute beyond the other feature schemes: at $K=16$, they improve response-prediction AUC by about 4 points across both tasks and reduce bargaining offer-prediction error by 14%. These results show that formulating counterpart prediction as a target-adaptive text-tabular task enables effective adaptation, and that hidden LLM representations expose decision-relevant signals that direct prompting does not surface.

Episode metadata supplied by the publisher feed · Published May 15, 2026

Embed this episode

NOW PLAYING

Predicting Decisions of AI Agents from Limited Interaction through Text-Tabular Modeling

0:00 24:59

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Daily Paper Cast?

This episode is 24 minutes long.

When was this Daily Paper Cast episode published?

This episode was published on May 15, 2026.

Can I download this Daily Paper Cast episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!