Karl-Heinz Zimmermann
Published 2018-12-23Version 1
Machine learning provides algorithms that can learn from data and make inferences or predictions on data. Stochastic acceptors or probabilistic automata are stochastic automata without output that can model components in machine learning scenarios. In this paper, we provide dynamic programming algorithms for the computation of input marginals and the acceptance probabilities in stochastic acceptors. Furthermore, we specify an algorithm for the parameter estimation of the conditional probabilities using the expectation-maximization technique and a more efficient implementation related to the Baum-Welch algorithm.
Tight Compression: Compressing CNN Through Fine-Grained Pruning and Weight Permutation for Efficient Implementation
Accelerating Generalized Linear Models by Trading off Computation for Uncertainty
On the computation of counterfactual explanations -- A survey
![QR code for arXiv:1812.09687 [cs.LG]](http://oss.arxitics.com/images/favicon.svg)