Modeling word or character substitutions as a simplex and using interval bound propagation yields text classifiers whose robustness can be certified in two forward passes, at a small nominal accuracy cost.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation
Modeling word or character substitutions as a simplex and using interval bound propagation yields text classifiers whose robustness can be certified in two forward passes, at a small nominal accuracy cost.