arXiv:2301.07629
공식 코드 · Papers with Code
Generalisation Through Negation and Predicate Invention
원문 초록
The ability to generalise from a small number of examples is a fundamental challenge in machine learning. To tackle this challenge, we introduce an inductive logic programming (ILP) approach that combines negation and predicate invention. Combining these two features allows an ILP system to generalise better by learning rules with universally quantified body-only variables. We implement our idea in NOPI, which can learn normal logic programs with predicate invention, including Datalog programs with stratified negation. Our experimental results on multiple domains show that our approach can improve predictive accuracies and learning times.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Probing the Geometry of Truth: Consistency and Generalization of Truth Directions in LLMs Across Logical Transformations and Question Answering Tasks
CROC: Evaluating and Training T2I Metrics with Pseudo- and Human-Labeled Contrastive Robustness Checks
FormalMATH: Benchmarking Formal Mathematical Reasoning of Large Language Models
negativas: a prototype for searching and classifying sentential negation in speech data
Efficient Model Editing with Task-Localized Sparse Fine-tuning
Is CLIP ideal? No. Can we fix it? Yes!
토론
이 논문과 연결된 포럼 글이 아직 없습니다.