arXiv Machine Learning
Oct 8

From Prompts to Trees: Effective LLM-Guided Tree Generation for Few-Shot Tabular Classification

The paper introduces a three‑stage framework that uses Large Language Models (LLMs) to generate rules and assemble them into decision trees for few‑shot tabular classification. By distilling LLM knowledge into interpretable trees, the method avoids the high inference costs and limited interpretability of direct LLM application while outperforming traditional decision trees in low‑data settings. Experiments on real‑world datasets show superior accuracy and interpretability with lower prompting overhead compared to existing baselines.

By Yue Qiu, Zekang Du, Yiqun Diao, Bingsheng He, Qinbin Li
arXiv Computation and Language
Aug 25

Beyond Factual Knowledge: Benchmarking and Learning Step-Level Procedural Rule Reasoning in Large Language Models

arXiv:2608.22753v1 Announce Type: new Abstract: Large language models (LLMs) excel at text understanding and generation, yet still struggle to reliably understand and apply externally provided proced...

By Bohan Yu, Pengfei Cao, Chen Han, Chenxi Zhou, Zhiheng Zhang, Zhiyang Xie, Wenhao Teng, Xiangwen Liao, Jun Zhao, Kang Liu