TL;DR
PRover is an interpretable transformer model that jointly answers questions over rule-bases and generates formal proofs, demonstrating strong accuracy and generalization in reasoning tasks.
Contribution
It introduces a novel proof-generating transformer model that produces valid proof graphs, improving interpretability and reasoning capabilities over prior QA models.
Findings
Achieves 87% proof accuracy and up to 6% QA improvement over RuleTakers.
Generalizes better to higher reasoning depths with 15% improvement.
Reaches 98% QA accuracy with only 40% training data.
Abstract
Recent work by Clark et al. (2020) shows that transformers can act as 'soft theorem provers' by answering questions over explicitly provided knowledge in natural language. In our work, we take a step closer to emulating formal theorem provers, by proposing PROVER, an interpretable transformer-based model that jointly answers binary questions over rule-bases and generates the corresponding proofs. Our model learns to predict nodes and edges corresponding to proof graphs in an efficient constrained training paradigm. During inference, a valid proof, satisfying a set of global constraints is generated. We conduct experiments on synthetic, hand-authored, and human-paraphrased rule-bases to show promising results for QA and proof generation, with strong generalization performance. First, PROVER generates proofs with an accuracy of 87%, while retaining or improving performance on the QA task,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
