Learning Structured Declarative Rule Sets -- A Challenge for Deep Discrete Learning
Arguably the key reason for the success of deep neural networks is their ability to autonomously form non-linear combinations of the input features, which can be used in subsequent layers of the network. The analogon to this capability in inductive rule learning is to learn a structured rule base, where the inputs are combined to learn new auxiliary concepts, which can then be used as inputs by subsequent rules. Yet, research on rule learning algorithms that have such capabilities is still in their infancy, which is - we would argue - one of the key impediments to substantial progress in this field. In this position paper, we want to draw attention to this unsolved problem, with a particular focus on previous work in predicate invention and multi-label rule learning
Code (0)
등록된 구현이 없습니다.
Tasks
PositionSimilar Papers 제목 키워드 기반
Declarative Knowledge Distillation from Large Language Models for Visual Question Answering Datasets
Visual Question Answering (VQA) is the task of answering a question about an image and requires processing multimodal input and reasoning to obtain the answer. Modular solutions that use declarative representations withi…
Knowledge DistillationQuestion AnsweringVisual Question AnsweringVisual Question Answering (VQA)Harnessing Deep Neural Networks with Logic Rules
Combining deep neural networks with structured logic rules is desirable to harness flexibility and reduce uninterpretability of the neural models. We propose a general framework capable of enhancing various types of neur…
named-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)Sentiment AnalysisDeclarative Statistical Modeling with Datalog
Formalisms for specifying statistical models, such as probabilistic-programming languages, typically consist of two components: a specification of a stochastic process (the prior), and a specification of observations tha…
Probabilistic ProgrammingSystemT: Declarative Text Understanding for Enterprise
The rise of enterprise applications over unstructured and semi-structured documents poses new challenges to text understanding systems across multiple dimensions. We present SystemT, a declarative text understanding syst…
Document ClassificationEntity Extraction using GANRelation ExtractionSemantic Parsing+1Foundations of MT-PDCL: Measure-Theoretic Probabilistic Definite Clause Logic
Standard probabilistic logic programming frameworks typically rely on grounding logic programs into discrete propositional representations. This operational requirement restricts exact inference to finite domains and dis…