Fetching from the wire…
Public story · 2026-09-06 · high
WAND reuses the same math that scores an outlier to say which features caused the flag, skipping the extra computation SHAP and LIME require.
Why now: The paper posted to arXiv on 2026-09-06.
Anomaly detectors are good at telling you something is wrong and bad at telling you why. A model flags a transaction or a sensor reading as an outlier, and the score alone doesn't say which feature drove that call. Teams that need a reason bolt on SHAP or LIME after the fact, and both work by re-running the detector thousands of times per flagged point to approximate an explanation.
A new paper on arXiv proposes skipping that step. WAND scores a point by measuring how far its projection strays from a sub-Gaussian extreme-value baseline. Because that measurement already happens in feature space, the same directions that produced the anomaly score double as the per-feature explanation. No extra detector queries, no approximation step.
The paper tested this across 47 datasets from ADBench, a standard benchmark suite for anomaly detection, and WAND posted the best mean Friedman rank on ROC among the methods compared.
That's a real result on accuracy, but it's a different claim than "the explanation is good." ROC rank tells you the anomaly score works. It says nothing about whether the projection direction attached to that score matches what a human investigator would call the cause. SHAP and LIME are slow and approximate, but they're built around a specific, debated definition of feature attribution. WAND's attribution comes from the geometry of the detector itself, and the paper's benchmark doesn't test whether that geometry lines up with human judgment about causes.
Fraud and intrusion detection systems get the clearest benefit: the same accuracy, zero added cost for explanations. Whether an auditor accepts "this point's projection deviated most strongly along these three axes" as a reason is a separate question the paper doesn't answer.
Each link below shares sources, entities, or timing with this story.
DSEffi-Bench covers 1,000 instances across 10+ libraries with stress-testing harnesses and human-validated references, evaluated on 16 models (arXiv 2608.30248). GPT-5.4 leads correctness at 66.9% Pass but its 71.7% efficiency score barely beats GPT-5.4-mini's 71.6% despite so...
Using CoderForge-Preview, described as the largest open dataset of coding agent trajectories, ensemble methods with SHAP attribution predict agent success before any run. Dominant drivers are patch fragmentation (how many places a fix has to touch) and repository scale. Prompt...
Best-in-class computer-use models scored 42% on OSWorld-Verified in early 2025. Today the leader (Claude Fable 5) scores 85%. The human tester baseline is roughly 72%. a16z published the aggregation on August 10, pulling from production interviews and llm-stats leaderboard dat...
If you're tuning an agent system, upgrade the model doing the tuning before you rewrite a single line of the harness. That's the finding from HarnessOpt-Bench (arXiv 2608.06301, Scale AI), which tests whether frontier models can improve an agent *system* rather than write code...
ORCA-bench pairs a live OpenTelemetry-instrumented microservice system (six days of metrics, logs and traces via Prometheus, Jaeger and OpenSearch, plus full source access) with 1,079 RCA tasks varying report specificity and co-occurring faults. Best result across five frontie...
UK AI Safety Institute found model capability at 10M tokens jumped from 1.7 to 9.8 steps completed on a 32-step corporate network attack. Each 10x compute increase yields 59% more steps. No plateau found. Best run: 22/32 steps — 6 hours of a 14-hour human expert workload. Source
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.