Interlocking-free Selective Rationalization Through Genetic-based Learning
About
A popular end-to-end architecture for selective rationalization is the select-then-predict pipeline, comprising a generator to extract highlights fed to a predictor. Such a cooperative system suffers from suboptimal equilibrium minima due to the dominance of one of the two modules, a phenomenon known as interlocking. While several contributions aimed at addressing interlocking, they only mitigate its effect, often by introducing feature-based heuristics, sampling, and ad-hoc regularizations. We present GenSPP, the first interlocking-free architecture for selective rationalization that does not require any learning overhead, as the above-mentioned. GenSPP avoids interlocking by performing disjoint training of the generator and predictor via genetic global search. Experiments on a synthetic and a real-world benchmark show that our model outperforms several state-of-the-art competitors.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Hate Speech Detection | HateXplain (test) | Macro F1 Score69.71 | 24 | |
| Rationalization | Toy (test) | HI-F176.02 | 12 | |
| Rationalization | HateXplain Synthetic Skew (test) | HI-F10.4281 | 7 | |
| Classification | Toy Synthetic Skew (test) | F1 Score99.46 | 7 | |
| Classification | HateXplain Synthetic Skew (test) | Clf-F169.89 | 7 | |
| Rationalization | HateXplain (test) | HI-F142.62 | 5 | |
| Classification | Toy (test) | F1 Score99 | 5 |