Large Language Models are Interpretable Learners
<|reference_start|>Large Language Models are Interpretable Learners: The trade-off between expressiveness and interpretability remains a core challenge when building human-centric predictive models for classification and decision-making. While symbolic rules offer interpretability, they often lack expressiveness, whereas neural networks excel in performance but are known for being black boxes. In this paper, we show a combination of Large Language Models (LLMs) and symbolic programs can bridge this gap. In the proposed LLM-based Symbolic Programs (LSPs), the pretrained LLM with natural language prompts provides a massive set of interpretable modules that can transform raw input into natural language concepts. Symbolic programs then integrate these modules into an interpretable decision rule. To train LSPs, we develop a divide-and-conquer approach to incrementally build the program from scratch, where the learning process of each step is guided by LLMs. To evaluate the effectiveness of LSPs in extracting interpretable and accurate knowledge from data, we introduce IL-Bench, a collection of diverse tasks, including both synthetic and real-world scenarios across different modalities. Empirical results demonstrate LSP's superior performance compared to traditional neurosymbolic programs and vanilla automatic prompt tuning methods. Moreover, as the knowledge learned by LSP is a combination of natural language descriptions and symbolic rules, it is easily transferable to humans (interpretable), and other LLMs, and generalizes well to out-of-distribution samples.<|reference_end|>
@article{wang2024large,
    title={Large Language Models are Interpretable Learners},
    author={Ruochen Wang and Si Si and Felix Yu and Dorothea Wiesmann and Cho-Jui
  Hsieh and Inderjit Dhillon},
    journal={arXiv preprint arXiv:2406.17224},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.17224},
    primaryClass={cs.AI cs.CL cs.CV cs.LG cs.SC}
}