Approximate Probabilistic Neural Networks with Gated Threshold Logic

2018-08-02 · Olga Krestinskaya, Alex Pappachen James

Probabilistic Neural Network (PNN) is a feed-forward artificial neural network developed for solving classification problems. This paper proposes a hardware implementation of an approximated PNN (APNN) algorithm in which the conventional exponential function of the PNN is replaced with gated threshold logic. The weights of the PNN are approximated using a memristive crossbar architecture. In particular, the proposed algorithm performs normalization of the training weights, and quantization into 16 levels which significantly reduces the complexity of the circuit.

📄 PDF Abstract BibTeX arXiv:1808.00733

Code (0)

등록된 구현이 없습니다.

Tasks

General Classification Quantization

Anytime Exact Belief Propagation

2017-07-27 · Gabriel Azevedo Ferreira, Quentin Bertrand, Charles Maussion, Rodrigo de Salvo Braz

Statistical Relational Models and, more recently, Probabilistic Programming, have been making strides towards an integration of logic and probabilistic reasoning. A natural expectation for this project is that a probabil…

Probabilistic Programming

Predicting Movie Genres Based on Plot Summaries

2018-01-15 · Quan Hoang

This project explores several Machine Learning methods to predict movie genres based on plot summaries. Naive Bayes, Word2Vec+XGBoost and Recurrent Neural Networks are used for text classification, while K-binary transfo…

BIG-bench Machine Learning Classification General Classification text-classification+1

WARP Logic Neural Networks

2026-02-03 · Lino Gerlach, Thore Gerlach, Liv Våge, Elliott Kauffman 외 arxiv

Fast and efficient AI inference is increasingly important, and recent models that directly learn low-level logic operations have achieved state-of-the-art performance. However, existing logic neural networks incur high t…

Data-Driven Verification under Signal Temporal Logic Constraints

2020-05-08 · Ali Salamati, Sadegh Soudjani, Majid Zamani

We consider systems under uncertainty whose dynamics are partially unknown. Our aim is to study satisfaction of temporal logic properties by trajectories of such systems. We express these properties as signal temporal lo…

Bayesian Inference

Lazy Explanation-Based Approximation for Probabilistic Logic Programming

2015-07-10 · Joris Renkens, Angelika Kimmig, Luc De Raedt

We introduce a lazy approach to the explanation-based approximation of probabilistic logic programs. It uses only the most significant part of the program when searching for explanations. The result is a fast and anytime…