pith. sign in

arxiv: 2308.01157 · v2 · pith:LKLCRJX6new · submitted 2023-08-02 · 📊 stat.ML · cs.AI· cs.LG

LLMs Understand Glass-Box Models, Discover Surprises, and Suggest Repairs

classification 📊 stat.ML cs.AIcs.LG
keywords llmsmodelsanomaliesapproachknowledgerepairsadditiveadopting
0
0 comments X
read the original abstract

We show that large language models (LLMs) are remarkably good at working with interpretable models that decompose complex outcomes into univariate graph-represented components. By adopting a hierarchical approach to reasoning, LLMs can provide comprehensive model-level summaries without ever requiring the entire model to fit in context. This approach enables LLMs to apply their extensive background knowledge to automate common tasks in data science such as detecting anomalies that contradict prior knowledge, describing potential reasons for the anomalies, and suggesting repairs that would remove the anomalies. We use multiple examples in healthcare to demonstrate the utility of these new capabilities of LLMs, with particular emphasis on Generalized Additive Models (GAMs). Finally, we present the package $\texttt{TalkToEBM}$ as an open-source LLM-GAM interface.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Agentic-imodels: Evolving agentic interpretability tools via autoresearch

    cs.AI 2026-05 unverdicted novelty 7.0

    Agentic-imodels evolves scikit-learn regressors via an autoresearch loop to jointly boost predictive performance and LLM-simulatability, improving downstream agentic data science tasks by up to 73% on the BLADE benchmark.

  2. AnTenA: Actionable and Explainable Tensor Analysis System with Large Language Models

    cs.CL 2026-06 unverdicted novelty 4.0

    AnTenA uses task-agnostic and task-specific LLM prompts to explain co-clustered patterns from tensor decomposition and evaluates them on forward and backward inference tasks.