We lifted 3 functions out of this paper's own repositories and ran 3 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| google/TrustScore | canonical | 3 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| run_linear_svc | Ran | google/TrustScore/trustscore/trustscore_evaluation.py code served (permissive licence) · get_code("2b461b9210d198bc") |
| run_logistic | Ran | google/TrustScore/trustscore/trustscore_evaluation.py code served (permissive licence) · get_code("f452e830d26150ef") |
| run_random_forest | Ran | google/TrustScore/trustscore/trustscore_evaluation.py code served (permissive licence) · get_code("40cb566dcc905a26") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Knowing when a classifier's prediction can be trusted is useful in many applications and critical for safely using AI. While the bulk of the effort in machine learning research has been towards improving classifier performance, understanding when a classifier's predictions should and should not be trusted has received far less attention. The standard approach is to use the classifier's discriminant or confidence score; however, we show there exists an alternative that is more effective in many situations. We propose a new score, called the trust score, which measures the agreement between the classifier and a modified nearest-neighbor classifier on the testing example. We show empirically that high (low) trust scores produce surprisingly high precision at identifying correctly (incorrectly) classified examples, consistently outperforming the classifier's confidence score as well as many other baselines. Further, under some mild distributional assumptions, we show that if the trust score for an example is high (low), the classifier will likely agree (disagree) with the Bayes-optimal classifier. Our guarantees consist of non-asymptotic rates of statistical consistency under various nonparametric settings and build on recent developments in topological data analysis.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1805.11783")
get_code_for_paper("1805.11783")
have("1805.11783")
Connect an agent — have() is free.