Ensembling Graph Predictions for AMR ParsingDownload PDF

21 May 2021, 20:46 (edited 14 Jan 2022)NeurIPS 2021 PosterReaders: Everyone
  • Keywords: Abstract Meaning Representation, Graph ensemble, Deep Learning, Natural Language Processing
  • TL;DR: A method for ensembling graph predictions. Validated on AMR parsing problems and achieved new state-of-the-art results.
  • Abstract: In many machine learning tasks, models are trained to predict structure data such as graphs. For example, in natural language processing, it is very common to parse texts into dependency trees or abstract meaning representation (AMR) graphs. On the other hand, ensemble methods combine predictions from multiple models to create a new one that is more robust and accurate than individual predictions. In the literature, there are many ensembling techniques proposed for classification or regression problems, however, ensemble graph prediction has not been studied thoroughly. In this work, we formalize this problem as mining the largest graph that is the most supported by a collection of graph predictions. As the problem is NP-Hard, we propose an efficient heuristic algorithm to approximate the optimal solution. To validate our approach, we carried out experiments in AMR parsing problems. The experimental results demonstrate that the proposed approach can combine the strength of state-of-the-art AMR parsers to create new predictions that are more accurate than any individual models in five standard benchmark datasets.
  • Supplementary Material: pdf
  • Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
  • Code: https://github.com/IBM/graph_ensemble_learning
11 Replies