Boolean Logic as an Error feedback mechanism

• URL: http://arxiv.org/abs/2401.16418v1
• Date: Mon, 29 Jan 2024 18:56:21 GMT
• Title: Boolean Logic as an Error feedback mechanism
• Authors: Louis Leconte
• Abstract summary: The notion of Boolean logic backpagation was introduced to build neural networks with weights and activations being Boolean numbers. Most of computations can be done with logic instead of real arithmetic during training and phases.
• Score: 0.5439020425819
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The notion of Boolean logic backpropagation was introduced to build neural networks with weights and activations being Boolean numbers. Most of computations can be done with Boolean logic instead of real arithmetic, both during training and inference phases. But the underlying discrete optimization problem is NP-hard, and the Boolean logic has no guarantee. In this work we propose the first convergence analysis, under standard non-convex assumptions.

Related papers

• Practical Boolean Backpropagation [0.0]
  We present a practical method for purely Boolean backpropagation for networks based on a single specific gate we chose.<n>Initial experiments confirm its feasibility.
  arXiv  Detail & Related papers  (2025-05-01T12:50:02Z)
• BoolQuestions: Does Dense Retrieval Understand Boolean Logic in Language? [88.29075896295357]
  We first investigate whether current retrieval systems can comprehend the Boolean logic implied in language. Through extensive experimental results, we draw the conclusion that current dense retrieval systems do not fully understand Boolean logic in language. We propose a contrastive continual training method that serves as a strong baseline for the research community.
  arXiv  Detail & Related papers  (2024-11-19T05:19:53Z)
• Boolean-aware Boolean Circuit Classification: A Comprehensive Study on Graph Neural Network [2.1080766959962625]
  The graph structure-based Boolean circuit classification can be grouped into the graph classification task. We first define the proposed matching-equivalent class based on its Boolean-aware'' property. We present a commonly study framework based on graph neural network(GNN) to analyze the key factors that can affect the Boolean-aware circuit classification.
  arXiv  Detail & Related papers  (2024-11-13T08:38:21Z)
• Boolean Matching Reversible Circuits: Algorithm and Complexity [16.397487896227766]
  We show that the equivalence up to input negation and permutation is reversible in quantum time, while its classical complexity is exponential. This result is arguably the first demonstration of quantum exponential speedup in solving automation problems.
  arXiv  Detail & Related papers  (2024-04-18T13:47:17Z)
• Circuit Transformer: A Transformer That Preserves Logical Equivalence [20.8279111910994]
  We introduce a generative neural model, the "Circuit Transformer", which produces logic circuits strictly equivalent to given Boolean functions. A Markov decision process formulation is also proposed for optimizing certain objectives of circuits.
  arXiv  Detail & Related papers  (2024-03-14T03:24:14Z)
• Boolean Variation and Boolean Logic BackPropagation [0.0]
  The notion of variation is introduced for the Boolean set and based on which Boolean logic backpropagation principle is developed. Deep models can be built with weights and activations being Boolean numbers and operated with Boolean logic instead of real arithmetic.
  arXiv  Detail & Related papers  (2023-11-13T16:01:43Z)
• Empower Nested Boolean Logic via Self-Supervised Curriculum Learning [67.46052028752327]
  We find that any pre-trained language models even including large language models only behave like a random selector in the face of multi-nested logic. To empower language models with this fundamental capability, this paper proposes a new self-supervised learning method textitCurriculum Logical Reasoning (textscClr)
  arXiv  Detail & Related papers  (2023-10-09T06:54:02Z)
• Neuro-Symbolic Inductive Logic Programming with Logical Neural Networks [65.23508422635862]
  We propose learning rules with the recently proposed logical neural networks (LNN) Compared to others, LNNs offer strong connection to classical Boolean logic. Our experiments on standard benchmarking tasks confirm that LNN rules are highly interpretable.
  arXiv  Detail & Related papers  (2021-12-06T19:38:30Z)
• Logical Credal Networks [87.25387518070411]
  This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
  arXiv  Detail & Related papers  (2021-09-25T00:00:47Z)
• Neural Logic Reasoning [47.622957656745356]
  We propose Logic-Integrated Neural Network (LINN) to integrate the power of deep learning and logic reasoning. LINN learns basic logical operations such as AND, OR, NOT as neural modules, and conducts propositional logical reasoning through the network for inference. Experiments show that LINN significantly outperforms state-of-the-art recommendation models in Top-K recommendation.
  arXiv  Detail & Related papers  (2020-08-20T14:53:23Z)
• Logical Neural Networks [51.46602187496816]
  We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning) Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a highly intepretable disentangled representation. Inference is omni rather than focused on predefined target variables, and corresponds to logical reasoning.
  arXiv  Detail & Related papers  (2020-06-23T16:55:45Z)
• The Boolean Solution Problem from the Perspective of Predicate Logic -- Extended Version [0.0]
  Schr"oder investigated it as Aufl"osungsproblem (solution problem)<n>We show that it can be modeled on the basis of first-order logic extended by second-order predicate logic.
  arXiv  Detail & Related papers  (2017-06-26T11:30:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.