Large language models (LLMs) are increasingly used as classifiers, yet they operate as opaque systems whose decisions are difficult to interpret, which complicates their use in regulated domains such as credit scoring or medical diagnosis. We propose an evolutionary framework that iteratively discovers natural language feature definitions (rubrics) for interpretable classification. An LLM generates candidate binary features, evaluates each sample against them, and the resulting vectors can be used to train a transparent classifier such as logistic regression. The feature set evolves over multiple iterations guided by classification errors, per-class activation rates, and feature ablation scores. We evaluate across three benchmarks, including a credit risk dataset representative of regulated domains, comparing single-shot LLM rubrics, evolved rubrics, and direct zero-shot LLM classification. Evolved features improve over single-shot rubrics by +2.9 pp on average and outperform zero-shot LLM classification on two of three tasks, while providing fully auditable decision logic. On the credit risk task, the zero-shot LLM performs at chance (50.7%) with a strong bias toward a single class, whereas evolved features achieve balanced, interpretable predictions. Crucially, this failure is invisible in aggregate accuracy and surfaces only under per-class auditing. Analysis reveals that evolution is most effective when label boundaries cannot be inferred from category names alone or when the LLM lacks reliable domain-specific reasoning.
Figures & tables
Figure 1: Overview of the evolutionary feature discovery framework. An LLM generates binary feature definitions (the rubric), evaluates each training sample against them, and a logistic regression classifier is trained on the resulting feature matrix. Classification errors, per-class activation rates, and feature ablation scores are fed back to guide the next rubric proposal (dashed arrows).
Figure 2
Figure 2: Comparison of three LLM classification approaches. (a) An LLM generates a static rubric of feature definitions in a single pass, evaluated by an LLM. (b) Our framework uses an LLM to iteratively generate and refine features via evolutionary feedback from classifier performance. (c) A zero-shot LLM classifies directly without explicit features. Only (a) and (b) produce transparent, auditable classifiers; only (b) adapts features to the data.
Dataset
TF-IDF
Zero-shot features
Evolved features
Zero-shot LLM
AG News
80.0 ± 4.1
82.7 ± 0.5
81.3 ± 2.6
89.7 ± 1.2
GoEmotions
31.3 ± 8.2
34.7 ± 6.2
41.0 ± 1.6
38.7 ± 3.7
HELOC
62.3 ± 6.0
65.3 ± 5.7
69.0 ± 2.2
50.7 ± 1.7
Average
57.9
60.9
63.8
59.7
Table 1: Test accuracy (%) across 3 evaluation splits (mean ± std). Best per dataset in bold .
Figure 3: Cross-validation accuracy over evolutionary iterations. Solid lines show best-accepted CV score; shaded regions show the range across 3 seeds. Evolution makes decisive improvements early in the search on tasks where the initial rubric is suboptimal.
Method
Classifier training calls
LLM inference calls
TF-IDF + logistic regression
0
0
Zero-shot features
501
1
Evolved features (ours)
5,010
1
Zero-shot LLM classifier
0
1
Table 2: LLM calls required for training (feature discovery) and inference (per sample). Evolved features assume T=10 iterations with n=500 training samples.
Figure 4: Aggregate accuracy hides a per-class failure on HELOC. (a) Both methods sit near or above the majority baseline, so neither looks broken. (b) On the balanced 50/50 test set, the zero-shot LLM predicts at_risk for 81% of applicants (a systematic single-class bias), whereas evolved features stay balanced. The failure surfaces only under per-class auditing.
#
Feature definition
∣wˉ∣
1
Net Fraction Of Revolving Burden > 40 (high revolving debt)
0.652
2
Number Of Satisfactory Trades < 15 (few satisfactory trades)
0.539
3
Months Since Last Illegal Trade between 0 and 12 (recent illegal-trade activity)
0.505
4
Percentage Of Legal Trades < 90 (low legal-trade share)
0.399
5
Months Since First Trade < 100 and Nr Trades Initiated In Last Year ≥ 3 (short history with recent activity)
0.374
6
Nr Banks With High Ratio ≥ 2 (multiple lenders stressed)
0.314
Table 3: Evolved rubric for HELOC, the task on which the zero-shot LLM performs at chance with a strong single-class bias. Evolution discovers numerical thresholds that act as decision stumps expressed in natural language, each checkable against a credit report.
Appendix figures & tables9 assets
Supplementary material from the paper’s appendix.
Appendix
Figure 5: Evolved rubrics for all three datasets, showing which features were retained from the initial rubric (blue) and which were newly discovered by evolution (green). Evolution replaces generic features with task-specific discriminators, with the degree of replacement reflecting task difficulty.
#
Feature definition
∣wˉ∣
1
Contains sports-specific terminology (athlete names, team abbreviations, sport league names like NHL, NBA, or position/play descriptions)
Table 4: Final evolved rubric for AG News (4-class topic classification) after 15 iterations. The initial rubric (iteration 0) was never improved upon. Features ordered by average absolute classifier coefficient.
We introduce an iterative framework that automates the extraction of interpretable, schema-bound categorical features from unstructured text for tabular prediction models. To navigate the feature space, a generator LLM proposes semantic definitions, a separate extractor LLM materializes the features, and a downstream tabular model evaluates their predictive performance. We optimize this search by translating explicit model errors, such as AUC ranking inversions, into natural-language feedback, steering the LLM to resolve specific predictive failures. Evaluated across three public datasets, this error-driven loop accelerates feature discovery by up to 3× compared to unguided search. Empirically, the generated features demonstrate strong multi-view complementarity, strictly outperforming any subset when combined with TF-IDF and dense embeddings. Finally, the framework guarantees instance-level interpretability: the discovered features dominate SHAP importance rankings and provide a fully transparent, semantic audit trail for every prediction.
Interpretable text representations should expose coordinates that are not only predictive, but also meaningful enough for independent auditors to apply. Existing discriminative representations often use anonymous embedding directions, while concept-bottleneck and LLM-assisted methods attach natural-language names to features without ensuring that those definitions are reproducible or distinct from the target label. We propose an operational criterion for interpretable discriminative text representations: each coordinate should satisfy conceptual clarity, measured by chance-adjusted agreement between independent annotators applying the feature definition, and label disentanglement, meaning the feature should not merely paraphrase the prediction target. We instantiate this criterion in LLM-assisted Feature Discovery (LFD), an iterative method that proposes lexical and semantic features from contrastive outcome-opposed text pairs, screens candidates using cross-LLM Cohen's κ, and selects features by residual held-out predictive gain. A stylized analysis connects the κ screen to a per-feature annotation-noise bound, formalizing agreement as a reliability check. Across ten text-classification tasks spanning seven corpora, LFD matches the predictive performance of a strong text bottleneck baseline while producing substantially clearer and less label-entangled features. Human audits with 232 raters show that LFD features achieve higher human--human and human--LLM agreement than baseline concepts, and raters consistently judge them as less label-leaking. These results suggest that agreement-tested, label-disentangled coordinates provide a practical auditability standard for interpretable text classification.
Tong Wang, Yiqing Xu, Leo Yang Yang
School of Management Yale University New Haven, CT, US, 06511 · Department of Accountancy, Economics and Finance Hong Kong Baptist University Kowloon, Hong Kong SAR
Large language models (LLMs) have shown promise in translating model-based explanations into human-readable narratives. This study evaluates whether LLMs can serve as post-hoc explainability interfaces for credit risk models, focusing on their ability to preserve feature-importance rankings and generate autonomous explanations. Using a LendingClub dataset, we compare LLM outputs with SHAP and coefficient-based attributions on three major LLMs, including GPT-4-turbo, Claude-Sonnet-4.5, and Gemini-2.5-Flash. Results indicate that LLMs reliably reproduce reference rankings under controlled prompts but show limited alignment when generating explanations autonomously. These findings suggest that LLMs are best deployed as narrative interfaces rather than substitutes for formal attribution methods in credit risk governance.
Wenxi Geng, Dingyuan Liu, Liya Li +1
Citigroup, Irving, TX, United States · University of North Carolina at Chapel Hill, Chapel Hill, NC, United States · Georgia Institute of Technology, Atlanta, GA, United States +1