Injecting Logical Constraints into Neural Networks via Straight-Through Estimators
Not on the map. Why?
Abstract (arXiv)
Injecting discrete logical constraints into neural network learning is one of the main challenges in neuro-symbolic AI. We find that a straight-through-estimator, a method introduced to train binary neural networks, could effectively be applied to incorporate logical constraints into neural network learning. More specifically, we design a systematic way to represent discrete logical constraints as a loss function; minimizing this loss using gradient descent via a straight-through-estimator updates the neural network's weights in the direction that the binarized outputs satisfy the logical constraints. The experimental results show that by leveraging GPUs and batch training, this method scales significantly better than existing neuro-symbolic methods that require heavy symbolic computation for computing gradients. Also, we demonstrate that our method applies to different types of neural networks, such as MLP, CNN, and GNN, making them learn with no or fewer labeled data by learning directly from known constraints.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 18 of its 38 references that are in the map. First posted on arXiv 10 Jul 2023.
Builds on
18 of 38 references.
References · 18
- 2018Relational inductive biases, deep learning, and graph networkscited by 1,341
- 2016XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networkscited by 829
- 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
- 2019Neural Probabilistic Logic Programming in DeepProbLogcited by 389
- 2019The Neuro-Symbolic Concept Learner: Interpreting Scenes, Words, and Sentences From Natural Supervisioncited by 369
- 2017A Semantic Loss Function for Deep Learning with Symbolic Knowledgecited by 267
- 2019Understanding Straight-Through Estimator in Training Activation Quantized Neural Netscited by 225
- 2019Differentiation of Blackbox Combinatorial Solverscited by 224
- 2018Learning a SAT Solver from Single-Bit Supervisioncited by 198
- 2017Neural-Symbolic Learning and Reasoning: A Survey and Interpretationcited by 195
- 2019SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solvercited by 173
- 2019Neural-Symbolic Computing: An Effective Methodology for Principled Integration of Machine Learning and Reasoningcited by 149
6 more
- 2020Complex Query Answering with Neural Link Predictorscited by 98
- 2020Graph Neural Networks Meet Neural-Symbolic Computing: A Survey and Perspectivecited by 93
- 2021From Statistical Relational to Neurosymbolic Artificial Intelligence: a Surveycited by 72
- 2017Recurrent Relational Networkscited by 71
- 2020Neural-Symbolic Integration: A Compositional Perspectivecited by 45
- 2019Plug-in, Trainable Gate for Streamlining Arbitrary Neural Networkscited by 6
Built on by
Citing papers per year: 2023: 1; 2024: 4; 2025: 4; 2026: 3.
12 papers.
- 2024Learning with Logical Constraints but without Shortcut Satisfactioncited by 10
- 2024Efficient Rectification of Neuro-Symbolic Reasoning Inconsistencies by Abductive Reflectioncited by 9
- 2025Self-Supervised Transformers as Iterative Solution Improvers for Constraint Satisfactioncited by 6
- 2025AlignSAE: Concept-Aligned Sparse Autoencoderscited by 4
- 2023LogicMP: A Neuro-symbolic Approach for Encoding First-order Logic Constraintscited by 3
- 2024Edge Detectors Can Make Deep Convolutional Neural Networks More Robustcited by 2
- 2026Logic Tensor Network-Enhanced Generative Adversarial Networkcited by 2
- 2025Curriculum Abductive Learningcited by 1
- 2025Beyond Discreteness: Sample Complexity Analysis of Straight-Through Estimator for 1-bit Quantizationcited by 1
- 2026Neurosymbolic LoRA: Why and When to Tune Weights vs. Rewrite Promptscited by 1
- 2024Learning-driven Physically-aware Large-scale Circuit Gate Sizingcited by 0
- 2026Generate in the Chart, Not on the Boundary: Function-Symbol Grounding for Hard Constraints in LTN-GANscited by 0
- 2026Generate in the Chart, Not on the Boundary: Function-Symbol Grounding for Hard Constraints in LTN-GANs21 Aug 2026
- 2026Neurosymbolic LoRA: Why and When to Tune Weights vs. Rewrite Prompts19 Jan 2026
- 2026Logic Tensor Network-Enhanced Generative Adversarial Network7 Jan 2026
- 2025AlignSAE: Concept-Aligned Sparse Autoencoders1 Dec 2025
- 2025Beyond Discreteness: Sample Complexity Analysis of Straight-Through Estimator for 1-bit Quantization23 May 2025
- 2025Curriculum Abductive Learning18 May 2025
- 2025Self-Supervised Transformers as Iterative Solution Improvers for Constraint Satisfaction18 Feb 2025
- 2024Efficient Rectification of Neuro-Symbolic Reasoning Inconsistencies by Abductive Reflection11 Dec 2024
- 2024Learning-driven Physically-aware Large-scale Circuit Gate Sizing13 Mar 2024
- 2024Learning with Logical Constraints but without Shortcut Satisfaction1 Mar 2024
- 2024Edge Detectors Can Make Deep Convolutional Neural Networks More Robust26 Feb 2024
- 2023LogicMP: A Neuro-symbolic Approach for Encoding First-order Logic Constraints27 Sep 2023