paper-with-me

Papers

multiPRover: Generating Multiple Proofs for Improved Interpretability in Rule Reasoning

2021-06-02 · NAACL 2021 4 · Swarnadeep Saha, Prateek Yadav, Mohit Bansal

We focus on a type of linguistic formal reasoning where the goal is to reason over explicit knowledge in the form of natural language facts and rules (Clark et al., 2020). A recent work, named PRover (Saha et al., 2020), performs such reasoning by answering a question and also generating a proof graph that explains the answer. However, compositional reasoning is not always unique and there may be multiple ways of reaching the correct answer. Thus, in our work, we address a new and challenging problem of generating multiple proof graphs for reasoning over natural language rule-bases. Each proof provides a different rationale for the answer, thereby improving the interpretability of such reasoning systems. In order to jointly learn from all proof graphs and exploit the correlations between multiple proofs for a question, we pose this task as a set generation problem over structured output spaces where each proof is represented as a directed graph. We propose two variants of a proof-set generation model, multiPRover. Our first model, Multilabel-multiPRover, generates a set of proofs via multi-label classification and implicit conditioning between the proofs; while the second model, Iterative-multiPRover, generates proofs iteratively by explicitly conditioning on the previously generated proofs. Experiments on multiple synthetic, zero-shot, and human-paraphrased datasets reveal that both multiPRover models significantly outperform PRover on datasets containing multiple gold proofs. Iterative-multiPRover obtains state-of-the-art proof F1 in zero-shot scenarios where all examples have single correct proofs. It also generalizes better to questions requiring higher depths of reasoning where multiple proofs are more frequent. Our code and models are publicly available at https://github.com/swarnaHub/multiPRover

📄 PDF Abstract BibTeX arXiv:2106.01354

Code (1)

swarnaHub/multiPRover 공식 구현 pytorch

Tasks

Multi-Label ClassificationMUlTI-LABEL-ClASSIFICATION

Similar Papers 제목 키워드 기반

Evaluating Explanations: An Explanatory Virtues Framework for Mechanistic Interpretability -- The Strange Science Part I.ii

2025-05-02 · Kola Ayonrinde, Louis Jaburi

Mechanistic Interpretability (MI) aims to understand neural networks through causal explanations. Though MI has many explanation-generating methods, progress has been limited by the lack of a universal approach to evalua…

Philosophy

Neural Theorem Proving: Generating and Structuring Proofs for Formal Verification

2025-04-23 · Balaji Rao, William Eiers, Carlo Lipizzi

Formally verifying properties of software code has been a highly desirable task, especially with the emergence of LLM-generated code. In the same vein, they provide an interesting avenue for the exploration of formal ver…

Automated Theorem Proving

Compact Proofs of Model Performance via Mechanistic Interpretability

2024-06-17 · Jason Gross, Rajashree Agrawal, Thomas Kwa, Euan Ong 외

We propose using mechanistic interpretability -- techniques for reverse engineering model weights into human-interpretable algorithms -- to derive and compactly prove formal guarantees on model performance. We prototype …

model

Generating Natural Language Proofs with Verifier-Guided Search

2022-05-25 · Kaiyu Yang, Jia Deng, Danqi Chen

Reasoning over natural language is a challenging problem in NLP. In this work, we focus on proof generation: Given a hypothesis and a set of supporting facts, the model generates a proof tree indicating how to derive the…

Hallucinationvalid

pvCNN: Privacy-Preserving and Verifiable Convolutional Neural Network Testing

2022-01-23 · Jiasi Weng, Jian Weng, Gui Tang, Anjia Yang 외

This paper proposes a new approach for privacy-preserving and verifiable convolutional neural network (CNN) testing, enabling a CNN model developer to convince a user of the truthful CNN performance over non-public data …

Privacy Preserving