We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Intuitively, one would expect accuracy of a trained neural network's prediction on test samples to correlate with how densely the samples are surrounded by seen training samples in representation space. We find that a bound on empirical training error smoothed across linear activation regions scales inversely with training sample density in representation space. Empirically, we verify this bound is a strong predictor of the inaccuracy of the network's prediction on test samples. For unseen test sets, including those with out-of-distribution samples, ranking test samples by their local region's error bound and discarding samples with the highest bounds raises prediction accuracy by up to 20% in absolute terms for image classification datasets, on average over thresholds.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.08365")
get_code_for_paper("2106.08365")
have("2106.08365")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.08365.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.08365)
Connect an agent — have() is free.