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.
In safety-critical machine learning applications, it is crucial to defend models against adversarial attacks -- small modifications of the input that change the predictions. Besides rigorously studied $\ell_p$-bounded additive perturbations, recently proposed semantic perturbations (e.g. rotation, translation) raise a serious concern on deploying ML systems in real-world. Therefore, it is important to provide provable guarantees for deep learning models against semantically meaningful input transformations. In this paper, we propose a new universal probabilistic certification approach based on Chernoff-Cramer bounds that can be used in general attack settings. We estimate the probability of a model to fail if the attack is sampled from a certain distribution. Our theoretical findings are supported by experimental results on different datasets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2109.10696")
get_code_for_paper("2109.10696")
have("2109.10696")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2109.10696.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2109.10696)
Connect an agent — have() is free.