This evaluation probes a model's ability to synthesize interpretable surrogate models (decision diagrams) that explicitly trade off prediction fidelity against structural simplicity. It measures how well a method can navigate the Pareto front between accuracy and explainability without collapsing them into a single weighted objective. Use when the user wants to benchmark on Airplane Perception Module (AP), Bank Loan Predictor (BL), Theorem Prover Solvability Predictor (TP), or asks about eval...
Scanned 9/11/2026
Install to Claude Code
npx -y skills add qhjqhj00/research-skills-pool --skill pareto-interpretation-eval --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of Pareto Interpretation Eval?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/qhjqhj00-pareto-interpretation-eval)More formats (shields.io, HTML) on the badges page.
---
name: pareto-interpretation-eval
description: This evaluation probes a model's ability to synthesize interpretable surrogate models (decision diagrams) that explicitly trade off prediction fidelity against structural simplicity. It measures how well a method can navigate the Pareto front between accuracy and explainability without collapsing them into a single weighted objective. Use when the user wants to benchmark on Airplane Perception Module (AP), Bank Loan Predictor (BL), Theorem Prover Solvability Predictor (TP), or asks about evaluating this task. Reports accuracy.
metadata:
skill_kind: dataset_eval
source_arxiv: 2108.07307
bibtex_key: torfah2021pareto
confidence: high
---
# pareto-interpretation-eval
> Synthesizing Pareto-Optimal Interpretations for Black-Box Models — Torfah et al. (2021) (arXiv:2108.07307, 2021)
## What this evaluates
This evaluation probes a model's ability to synthesize interpretable surrogate models (decision diagrams) that explicitly trade off prediction fidelity against structural simplicity. It measures how well a method can navigate the Pareto front between accuracy and explainability without collapsing them into a single weighted objective.
## Datasets
- **Airplane Perception Module (AP)** — total ?; splits: test (-1)
- **Bank Loan Predictor (BL)** — total ?; splits: test (-1)
- **Theorem Prover Solvability Predictor (TP)** — total ?; splits: test (-1)
## Metrics
- `accuracy` **(primary)** — range: [0, 1]
- Standard classification accuracy: fraction of correctly predicted labels out of total samples in the evaluation set.
- `explainability_score` — range: other
- A structural measure favoring decision diagrams with fewer nodes (size) and predicates with fewer branchings. Lower raw values indicate higher explainability.
## Input / output format
**Input**: Feature vectors specific to each benchmark: (1) time of day, cloud types, and initial positioning for AP; (2) age and income for BL; (3) percentage of unit clauses and average clause length for TP.
**Output**: A decision diagram (interpretation) representing a synthesized trade-off solution between correctness and explainability.
## Scoring recipe
```python
def evaluate(predictions, gold):
accuracy = sum(p == g for p, g in zip(predictions, gold)) / len(gold)
dd = predictions.diagram
dd_size = count_nodes(dd)
branching = count_branchings(dd)
explainability = -(dd_size + branching) # Higher is better
return {'accuracy': accuracy, 'explainability': explainability}
```
## Common pitfalls
- Comparing with single-objective methods (e.g., MinDS) is unfair because they do not guarantee exploration of the full Pareto-optimal space.
- Sample sizes are not fixed; they are derived from statistical confidence (δ) and error margin (ε), so direct comparison across different settings requires normalization.
- Explainability is defined structurally (decision diagram size and branching) rather than via standard human-study metrics, limiting direct cross-domain benchmarking.
## Evidence (verbatim from paper)
> We used accuracy for correctness, and explainability measure that favored decision diagrams of smaller size and predicates with a fewer number of branchings.
## Citation
```bibtex
@misc{torfah2021pareto,
title={Synthesizing Pareto-Optimal Interpretations for Black-Box Models},
author={Torfah et al. (2021)},
year={2021},
note={arXiv:2108.07307}
}
```
- arXiv: 2108.07307
Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.
No comments yet. Be the first to comment!