Cargando…
Signal Perceptron: On the Identifiability of Boolean Function Spaces and Beyond
In a seminal book, Minsky and Papert define the perceptron as a limited implementation of what they called “parallel machines.” They showed that some binary Boolean functions including XOR are not definable in a single layer perceptron due to its limited capacity to learn only linearly separable fun...
Autores principales: | Mendez Lucero, Miguel-Angel, Karampatsis, Rafael-Michael, Bojorquez Gallardo, Enrique, Belle, Vaishak |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Frontiers Media S.A.
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9203047/ https://www.ncbi.nlm.nih.gov/pubmed/35719687 http://dx.doi.org/10.3389/frai.2022.770254 |
Ejemplares similares
-
Closed-Form Results for Prior Constraints in Sum-Product Networks
por: Papantonis, Ioannis, et al.
Publicado: (2021) -
Intention Recognition With ProbLog
por: Smith, Gary B., et al.
Publicado: (2022) -
A hybrid method for heartbeat classification via convolutional neural networks, multilayer perceptrons and focal loss
por: Wang, Tao, et al.
Publicado: (2020) -
Boolean logic algebra driven similarity measure for text based applications
por: Abdalla, Hassan I., et al.
Publicado: (2021) -
Logic + probabilistic programming + causal laws
por: Belle, Vaishak
Publicado: (2023)