Explainiverse
Explainiverse is a beta Python library for constructing and evaluating machine-learning explanations. Its public registry records what each explainer has actually been audited to do; it does not rank methods by quality or claim that one method is appropriate for a particular deployment.
Release 0.14.0 declares Python 3.10 through 3.13. Its source distribution and wheel are built
from the tagged v0.14.0 revision and include the accuracy-remediation changes described below.
Accuracy status
Registry entries use three statuses:
verified: the implementation and its tests support the specificclaim_scoperecorded in the registry.quarantined: the code remains available for compatibility, but must not be represented as the canonical named method.unverified: no formula-level accuracy claim is made yet.
verified is deliberately narrow. It does not mean that an explanation is causal, useful,
fair, stable, or faithful for a particular model and dataset. Those conclusions require
task-specific evidence.
Use the runtime metadata as the authoritative explainer inventory:
from explainiverse import default_registry
print(default_registry.summary())
print(default_registry.get_meta("lime").claim_scope)
Evaluation endpoints have an equivalent authoritative inventory:
import explainiverse.evaluation as evaluation
metrics = evaluation.default_metric_registry
metrics.validate_inventory(evaluation.__all__)
print(metrics.summary())
print(metrics.get_meta("compute_aopc").claim_scope)
The metric registry distinguishes formula-verified endpoints, quarantined compatibility
aliases, explicit adaptations, score direction, stochastic estimators, and instance/batch/
dataset scope. A verified endpoint remains limited to its callable documentation and
claim_scope; it is not automatically a canonical reproduction of an entire paper protocol.
The audited registry currently groups as follows:
| Status | Registry keys | Boundary |
|---|---|---|
| Verified tabular/local | lime, shap, treeshap, anchor_tabular, protodash |
shap is the KernelSHAP wrapper; TreeSHAP is limited to declared tree/output contracts; anchor_tabular certifies only rules whose sequential KL lower bound strictly exceeds the requested threshold under the uniform empirical joint distribution of its background rows |
| Verified gradient/local | integrated_gradients, deeplift, deepshap, smoothgrad, saliency, lrp |
CPU-verified only. DeepLIFT, DeepSHAP, SmoothGrad, and Saliency are flat tabular-vector APIs; Integrated Gradients and LRP also declare narrower image contracts |
| Verified concept/global | tcav |
CPU-verified only. Dataset-level fraction of positive directional derivatives for one target-class input set; canonical TCAV requires declared class-logit scores |
| Verified CAM | gradcam, hirescam, xgradcam, layercam, eigencam, scorecam, ablationcam |
CPU-verified only. One compatible spatial layer and the exact target/output restrictions in each claim_scope; scorecam is specifically the paper Algorithm-1 raw-output/channel-softmax variant, not the paper's later probability-weighting convention |
| Verified global | permutation_importance, partial_dependence, ale, sage |
Tabular contracts; ALE implements continuous first-order ALE, not nominal ALE |
| Quarantined compatibility APIs | anchors, counterfactual, eigengradcam, gradcam_elementwise |
Fixed-sample Anchors-style search, constrained counterfactual search, and two library-defined CAM variants |
Grad-CAM++ is not exposed. The previous implementation used only first derivatives and could
not establish the general higher-derivative formula. The verified anchor_tabular key is the
confidence-certified continuous-numeric implementation; the historical anchors key remains
the fixed-sample compatibility heuristic. The historical counterfactual key does not claim
the DiCE optimisation algorithm.
Evaluation scope
The evaluation namespace contains canonical formulas, explicitly named adaptations, and library-defined diagnostics. It is an API inventory, not a count of distinct scientific metrics and not a quality leaderboard.
| Family | Audited interpretation |
|---|---|
| Core faithfulness | Deterministic baseline-replacement PGI/PGU specialisations; tabular ERASER adaptations; Bhatt fixed-size subset correlation |
| Extended faithfulness | Insertion/deletion, sensitivity-n, infidelity, IROF, selectivity/AOPC, region perturbation, pixel flipping, ROAD, and monotonicity APIs, each under its documented perturbation and target contract |
| Robustness/stability | Sampled Yeh Max-Sensitivity; Agarwal RIS/RRS/ROS equations; Dasgupta consistency; finite-sample local diagnostics. Avg-Sensitivity is a noncanonical mean heuristic |
| Localisation | Pre-pooled scalar attribution maps with exact mask/shape contracts. Attribution IoU is library-defined |
| Randomisation | MPRT-family, random-logit, and data-randomisation sensitivity diagnostics; their values are not explanation-quality verdicts |
| Axiomatic | Bounded completeness, Nguyen Non-Sensitivity, compensated translation, and conditional symmetry checks; no global axiom proof is inferred |
| Agreement/complexity | Ranking overlap/correlation and attribution-distribution statistics; no human-interpretability conclusion is inferred |
| Fairness-related audits | Group and sensitive-feature disparity diagnostics plus exact fidelity-gap formulas; diagnostic parity is not a fairness certificate |
Undefined quantities, incompatible targets, incomplete feature mappings, unsupported model outputs, and non-finite inputs are intended to fail explicitly rather than receive fabricated fallback scores.
Installation from a checkout
Base dependencies:
python -m pip install -e .
PyTorch/Captum and image extras:
python -m pip install -e ".[all]"
For development, synchronize the locked all-extras environment:
poetry sync --all-extras --with dev,tutorial --no-interaction
Minimal tabular example
This example uses the verified LIME wrapper scope. Its returned coefficients describe the fitted local surrogate; they are not causal effects.
from sklearn.datasets import load_iris
from sklearn.ensemble import RandomForestClassifier
from explainiverse import SklearnAdapter, default_registry
iris = load_iris()
feature_names = iris.feature_names
class_names = iris.target_names
model = RandomForestClassifier(n_estimators=20, random_state=0)
model.fit(iris.data, iris.target)
adapter = SklearnAdapter(
model,
feature_names=feature_names,
class_names=class_names,
task="classification",
)
explainer = default_registry.create(
"lime",
model=adapter,
training_data=iris.data,
feature_names=feature_names,
class_names=class_names,
random_state=0,
)
explanation = explainer.explain(iris.data[0])
print(explanation.target_class)
print(explanation.get_top_features(k=4))
default_registry.filter(...) performs metadata matching. The historical
default_registry.recommend(...) name only orders metadata-compatible entries; it does not
recommend the best method or predict suitability, accuracy, runtime, or explanation quality.
BaseExplainer.explain intentionally has a generic abstract signature because local, global,
dataset-level, and feature-oriented explainers do not share one honest input contract. Consult
the concrete class and registry scope before use.
ExplanationSuite.run(...) executes only local explainers, checks both constructor and method
arguments, and leaves exact array shape to each concrete contract. Required method arguments
such as ProtoDash reference data must be supplied through explainer_call_kwargs or
call_kwargs_by_explainer. ExplanationSuite.compare() requires the same ordered feature
identity, explained target, and explicit caller-asserted metadata["comparison_contract"]
across multiple outputs. Built-in explainers do not currently emit that contract. The
allow_incommensurate=True escape hatch is a warned descriptive display, not a mathematical
comparison.
Explanation.to_dict() returns a defensive-copy dictionary. Payload values keep their
original Python or NumPy types, so the result is not promised to be directly JSON serializable.
Tutorials and other packages
The LIME, KernelSHAP, and TreeSHAP notebooks under tutorials/ are deterministic, offline
teaching artifacts verified against this checkout. Each published notebook contains a dated
execution record, package version, Python/platform record, and canonicalized poetry.lock
digest. The repository harness statically rejects common package-install/network access paths,
adds a non-loopback Python socket guard, executes a clean in-memory copy, and fails on stale
source, output, runner, package-tree, or lock provenance:
poetry run python scripts/execute_tutorials.py
The guard prevents accidental network dependence in the reviewed notebooks; it is not a security sandbox for hostile notebook code.
These examples verify their stated API and numerical contracts; they are not research benchmarks or evidence that an explanation is causal or suitable for deployment.
The TypeScript package under packages/js/ is private and experimental. It is not a published
JavaScript equivalent of the Python implementation.
Verification and contribution gate
Before adding a method or metric:
- identify the primary formula and its assumptions;
- declare target, score-space, perturbation, shape, and unsupported-domain contracts;
- add analytical or official-reference tests and invariants;
- mark adaptations and heuristics in the public name, metadata, and result payload;
- run formatting, lint, type, test, build, and package-smoke gates appropriate to the change.
The reproducible checkout gate is:
poetry sync --all-extras --with dev,tutorial --no-interaction
poetry check --lock
poetry run python -m pip check
poetry run black --check src tests scripts
poetry run isort --check-only src tests scripts
poetry run mypy src scripts
poetry run pytest --strict-config --strict-markers --cov=explainiverse --cov-branch
poetry run python scripts/execute_tutorials.py
poetry build
CPU CI permits the four explicitly allowlisted CUDA skips plus the conditional Python 3.10 / XGBoost-before-3.1 vector-intercept skip; any other skipped test fails the corresponding pytest job. CUDA execution is outside the verified device scope until a GPU runner is part of the release gate. Reference packages are imported explicitly before tests, and the built wheel and source distribution are each exercised in isolated consumer environments.
See the accuracy roadmap for current priorities. The former competitive comparison was withdrawn in SOTA_COMPARISON.md because raw API counts and cross-library marketing claims were not scientifically comparable.
License and citation
The Python distribution declares the MIT license; see LICENSE. The separate private
packages/js workspace declares UNLICENSED in its own package metadata and is not a
published JavaScript distribution.
If you use a particular explainer or metric, cite its primary source as well as the exact
software revision and configuration you ran. For release 0.14.0, cite the v0.14.0 tag (or its
commit hash) and your configuration; the PyPI 0.14.0 artifacts are built from that revision.
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file explainiverse-0.14.0.tar.gz.
File metadata
- Download URL: explainiverse-0.14.0.tar.gz
- Upload date:
- Size: 272.3 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via:
twine/6.2.0 CPython/3.12.2
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
e2ab525f720d9970f25c307be84b9a5a6bb5feb612a4457ba9d72925cf2af68b
|
|
| MD5 |
1eab57e68d1ebb87e3b9e4313f91daa2
|
|
| BLAKE2b-256 |
c7861f7aa3ae685a2f76e27a40cf64d2d1a92d6bb1c10e05a950be103ba775f2
|
File details
Details for the file explainiverse-0.14.0-py3-none-any.whl.
File metadata
- Download URL: explainiverse-0.14.0-py3-none-any.whl
- Upload date:
- Size: 311.2 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via:
twine/6.2.0 CPython/3.12.2
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
b1b98dfdfc0acbc8dc2113d8db87d40ae9cec2f958ed25b00bc6e30d43db41d4
|
|
| MD5 |
e8f2cd750b1e314ceb783104f4e7b384
|
|
| BLAKE2b-256 |
e2ec2e0d9635c183a1daba82e5a17b1b7eceb1ef527bcc61d18c4397be18cb00
|