Logical Activation Functions: Logit-space equivalents of Probabilistic Boolean Operators
Scott C. Lowe, Robert Earle, Jason d'Eon, Thomas Trappenberg, Sageev Oore
Abstract
The choice of activation functions and their motivation is a long-standing issue within the neural network community. Neuronal representations within artificial neural networks are commonly understood as logits, representing the log-odds score of presence of features within the stimulus. We derive logit-space operators equivalent to probabilistic Boolean logic-gates AND, OR, and XNOR for independent probabilities. Such theories are important to formalize more complex dendritic operations in real neurons, and these operations can be used as activation functions within a neural network, introducing probabilistic Boolean-logic as the core operation of the neural network. Since these functions involve taking multiple exponents and logarithms, they are computationally expensive and not well suited to be directly used within neural networks. Consequently, we construct efficient approximations named (the AND operator Approximate for Independent Logits), , and , which utilize only comparison and addition operations, have well-behaved gradients, and can be deployed as activation functions in neural networks. Like MaxOut, and are generalizations of ReLU to two-dimensions. While our primary aim is to formalize dendritic computations within a logit-space probabilistic-Boolean framework, we deploy these new activation functions, both in isolation and in conjunction to demonstrate their effectiveness on a variety of tasks including image classification, transfer learning, abstract reasoning, and compositional zero-shot learning.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext cb005bc2-e5f3-45a5-96fc-c876904b86a5Builds on3
- Task-Driven Modular Networks for Zero-Shot Compositional LearningSenthil Purushwalkam, Maximilian Nickel, Abhinav Gupta, Marc'Aurelio RanzatoICCV 2019 · 222 citations
- Stratified Rule-Aware Network for Abstract Visual ReasoningSheng Hu, Yuqing Ma, Xianglong Liu, Yanlu Wei et al.AAAI 2021 · 126 citations
- Scale-Localized Abstract ReasoningYaniv Benny, Niv Pekar, Lior WolfCVPR 2021
Related papers
- Deep Differentiable Logic Gate NetworksFelix Petersen, Christian Borgelt, Hilde Kuehne, Oliver DeussenNeurIPS 2022 · 117 citations
- The Descriptive Complexity of Graph Neural NetworksMartin GroheLICS 2023 · 7 citations
- Rational Neural Networks have Expressivity AdvantagesMaosen Tang, Alex TownsendICML 2026 · 1 citation
- Bounds on the computational complexity of neurons due to dendritic morphologyAnamika Agrawal, Michael A. BuiceNeurIPS 2025
- Can Neural Networks Learn Implicit Logic from Physical Reasoning?Aaron Traylor, Roman Feiman, Ellie PavlickICLR 2023
