Skip to content
Preprint

How Simple Can It Get? From Interpretable Equations to Readable Rules for Financial Decision Making

Aug 2026 · 0 citations · 24 references
Computer Science

TL;DR

Across four financial datasets, it is found that pruning is nearly free and that fidelity can erode faster than predictive performance, allowing simpler rules to remain effective classifiers without faithfully reproducing the original model.

Abstract

In regulated domains such as finance, a model that cannot be explained cannot be deployed, yet many interpretable classifiers defeat their own purpose by producing formulas with dozens of features that no regulator could read. We take the reverse direction. Starting from an interpretable classifier expressed as a single equation over the input features, we progressively simplify it into more readable forms, including a pruned monomial, a directional if--then rule, and the integer scorecards and tallies that finance already deploys. Because the equation is itself the predictive model rather than a post-hoc explanation we can directly quantify what is lost under each simplification. Across four financial datasets, we find that pruning is nearly free and that fidelity can erode faster than predictive performance, allowing simpler rules to remain effective classifiers without faithfully reproducing the original model. A human assessment shows that simplification improves perceived readability, while preferences for different representations vary by professional background. Beyond measuring these losses empirically, we show that some can be anticipated from the original model: we derive a bound on the change caused by pruning and predict how faithfully a rule retaining only the direction of each feature's effect preserves the original ranking.

View source

Similar papers

Open access 2026

Scored Rule Sets for Interpretable Multiclass Classification

This paper analyzes structural relationships among established algorithms and identifies indications of research siloing, and provides a formal definition of scored rule sets, showing how they generalize classical rule-based models, and illustrating concrete transformations from logicGP, ExSTraCS, and CART representati...

Robin Nunkesser · 2 citations
Preprint Aug 2026

Evidential Rule Learning for Interpretable Classification with Abstention

Fast Evidential Rule Learning (FERL) is introduced, a method that learns interpretable, accurate fuzzy rule models whose outputs are evidential, and is Lipschitz stable, which means that its evidential outputs vary smoothly with the input.

Javier Fumanal-Idocin, Javier Andreu-Perez · 0 citations

Toward Defeasible Machine Learning: When Learned Rule Sets Become Defeasible Theories

This work identifies a single structural condition on learned conjunctive rule sets, called strict global exception closure, under which every prediction the classifier makes is provably a defeasible entailment and analyses what breaks when the condition fails, revealing insights for both machine learning and nonmonoto...

Ruvarashe J. Madzime, T. Meyer · 0 citations
Book Open access Jul 2026

Can LLM’s Pick Up Where GP Left off? Investigating LLM Mathematical Expression Simplification Capabilities

This work investigates the use of Large Language Models as a post-hoc simplification layer for GP-derived mathematical expressions, examining two prompting strategies; Few-Shot Prompting and In-Context Learning across two contemporary LLMs: GPT-5.4-mini and Nemotron-3-Super.

Mark Connor · 0 citations
Review Aug 2026

Confidence Estimation for Financial Vision-Language Models in Chart and Document Understanding

This work evaluates seven confidence estimators, three inference-only and four trained internal probes, across five open-weight LVLMs and four conditions from three financial visual question-answering benchmarks, one bilingual; every probe is trained only on natural images and applied to finance without adaptation, so...

Mohammad M. Ghassemi, Simerjot Kaur, Charese H. Smiley et al. · 0 citations
Open access Jul 2026

Explorations on Improving Interpretability of Decision Making Processes of Rule-Based Classifiers

This paper presents an illustrative example for the exploratory research methodology where the sets of rules are induced in the continuous input domain, but next, they are transformed by discretisation procedures, which results in a simplified representation of the data and knowledge patterns learnt.

Urszula Stańczyk · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.