atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Trust Regions for Explanations via Black-Box Probabilistic Certification

ICML 2024 · Learning theory and algorithms › Prediction and decision losses · approach: Provable post-hoc explanations · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Introduces black-box probabilistic certification of feature-based explanations, finding the largest l-infinity trust region where an explanation's fidelity stays above a threshold, via three query strategies (unif, unifI, adaptI) with finite-sample and EVT bounds.

Problem

Explanations for black-box models come without guarantees on how stable or widely applicable they are; the goal is to find the largest hypercube around an example where an explanation's quality (e.g., fidelity) provably meets a threshold, using only query access.

Approach

Formulate explanation certification as a search for the largest l-infinity trust region with probabilistic guarantees; propose three sampling strategies (uniform, uniform incremental with Gaussian prototypes, adaptive incremental that concentrates queries on promising prototypes) within a binary-search-like outer loop, with finite-sample bounds and EVT-based asymptotic bounds.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Ecertify instead of ZO$^+$Synthetic certification with adaptI · Synthetic d=10^4, Q=10^4time (s): $4384.76$ -> $88.342$Helped
Use adaptI rather than unifEcertify · Synthetic d=10^4, Q=10^4certified half-width: $8.9\times 10^{-5}$ -> $9.4\times 10^{-5}$Mixed
Use unif for low-dimensional data, unifI for intermediate dimensions, and adaptI for high dimensionsEcertify · Synthetic benchmarks across dimensionscertified half-widthMixed
Use certified trust-region coverage to select covered HELOC examples for explanation reuseLIME explanations · HELOCmodel query savings: 80%Helped

Surprising findings

Limitations

Experimental setup

Datasets: ImageNet CIFAR10 HELOC Arrhythmia synthetic piecewise linear function

Benchmarks: synthetic piecewise linear function ImageNet CIFAR10 HELOC Arrhythmia

Metrics: certified half-width running time (s) fidelity threshold satisfaction query savings explanation similarity (top-5 intersection, Spearman rank co

Baselines: ZO+ (zeroth-order toolbox)

Builds on: LIME SHAP randomized smoothing extreme value theory

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy