Semantic Strengthening of Neuro-Symbolic Learning
Kareem Ahmed, Kai-Wei Chang, Guy Van den Broeck

TL;DR
This paper introduces a method to improve neuro-symbolic learning by iteratively strengthening probabilistic constraints, effectively balancing computational feasibility and semantic accuracy across various tasks.
Contribution
It proposes a novel approach that computes mutual information between constraints conditioned on learned features, enhancing neuro-symbolic integration without intractable computations.
Findings
Improves performance on pathfinding, matching, and Sudoku tasks.
Restores dependence between constraints to enhance approximation quality.
Sidesteps intractability issues common in probabilistic inference.
Abstract
Numerous neuro-symbolic approaches have recently been proposed typically with the goal of adding symbolic knowledge to the output layer of a neural network. Ideally, such losses maximize the probability that the neural network's predictions satisfy the underlying domain. Unfortunately, this type of probabilistic inference is often computationally infeasible. Neuro-symbolic approaches therefore commonly resort to fuzzy approximations of this probabilistic objective, sacrificing sound probabilistic semantics, or to sampling which is very seldom feasible. We approach the problem by first assuming the constraint decomposes conditioned on the features learned by the network. We iteratively strengthen our approximation, restoring the dependence between the constraints most responsible for degrading the quality of the approximation. This corresponds to computing the mutual information between…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Evolutionary Algorithms and Applications
MethodsTest
