Name
Abstract | ||
|---|---|---|
Optimal selection of a subset of items from a given set is a hard problem that requires combinatorial optimization. In this paper, we propose a subset selection algorithm that is trainable with gradient-based methods yet achieves near-optimal performance via submodular optimization. We focus on the task of identifying a relevant set of sentences for claim verification in the context of the FEVER task. Conventional methods for this task look at sentences on their individual merit and thus do not optimize the informativeness of sentences as a set. We show that our proposed method which builds on the idea of unfolding a greedy algorithm into a computational graph allows both interpretability and gradient-based training. The proposed differentiable greedy network (DGN) outperforms discrete optimization algorithms as well as other baseline methods in terms of precision and recall. |
Year | Venue | DocType |
|---|---|---|
2018 | CoRR | Journal |
Volume | Citations | PageRank |
abs/1810.12464 | 0 | 0.34 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Powers | 1 | 0 | 0.34 |
| Rasool Fakoor | 2 | 9 | 3.79 |
| Siamak Shakeri | 3 | 0 | 0.68 |
| Abhinav Sethy | 4 | 363 | 31.16 |
| Amanjit Kainth | 5 | 0 | 0.34 |
| Abdel-rahman Mohamed | 6 | 3772 | 266.13 |
| Ruhi Sarikaya | 7 | 698 | 64.49 |