paper-with-me

홈 › Papers

Distilling LLM Reasoning into an Interpretable Policy Tree for Human-AI Collaboration

2026-06-07 · Beiwen Zhang, Yongheng Liang, Guowei Zou, Haitao Wang, Hejun Wu arxiv

Constructing efficient and reliable policies to assist humans is indispensable for human-AI collaboration. Existing methods mainly follow two lines of work. Most prior work relies on multi-agent reinforcement learning (MARL) to learn black-box policies, which limits interpretability and raises safety concerns. Recent methods query large language models (LLMs) at each decision step, causing slow responses and high inference costs. We propose Collaboration Policy Tree (Co-pi-tree), a closed-loop method that learns an executable policy tree consisting of a partner-behavior prediction tree and an agent-action selection tree. Co-pi-tree constructs a policy by distilling LLM reasoning into policy tree code. It then evaluates the policy through partner interaction, obtains feedback, and uses natural language to summarize the interaction feedback to improve problematic branches. Experiments in Overcooked-AI show that Co-pi-tree improves average reward by 35.4% over the baseline average, while reducing the number of LLM queries by 77.7% and test-time latency by 97.1%. Project page: https://beiwenzhang.github.io/Co-pi-tree/

📄 PDF Abstract BibTeX arXiv:2606.08596

Code (0)

등록된 구현이 없습니다.

Tasks

Multi-agent Reinforcement Learning

Similar Papers 제목 키워드 기반

ORCAID: Oblique Rule-Based Continuous-Action Interpretation for Deep RL Policies

2026-07-08 · Ignacio D. Lopez-Miguel, Ezio Bartocci, Thomas Eiter, Martin Tappler arxiv

Explainability remains a key issue in reinforcement learning (RL). Distilling an interpretable policy from an agent trained in a complex environment is particularly challenging when the action space is continuous. We int…

Reinforcement Learning

Distilling interpretable causal trees from causal forests

2024-08-02 · Patrick Rehill

Machine learning methods for estimating treatment effect heterogeneity promise greater flexibility than existing methods that test a few pre-specified hypotheses. However, one problem these methods can have is that it ca…

Distilling Black-Box Travel Mode Choice Model for Behavioral Interpretation

2019-10-30 · Xilei Zhao, Zhengze Zhou, Xiang Yan, Pascal Van Hentenryck

Machine learning has proved to be very successful for making predictions in travel behavior modeling. However, most machine-learning models have complex model structures and offer little or no explanation as to how they …

BIG-bench Machine Learning

A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees

2025-10-21 · Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri 외 arxiv

We present a new approach for distilling boosted trees into decision trees, in the objective of generating an ML model offering an acceptable compromise in terms of predictive performance and interpretability. We explain…

Decomposing Visual Classification: Assessing Tree-Based Reasoning in VLMs

2025-09-10 · Sary Elmansoury, Islam Mesabah, Gerrit Großmann, Peter Neigel 외 arxiv

Vision language models (VLMs) excel at zero-shot visual classification, but their performance on fine-grained tasks and large hierarchical label spaces is understudied. This paper investigates whether structured, tree-ba…