Maximum error modeling for fault-tolerant computation using maximum a posteriori (MAP) hypothesis

Abstract

The application of current generation computing machines in safety-centric applications like implantable biomedical chips and automobile safety has immensely increased the need for reviewing the worst-case error behavior of computing devices for fault-tolerant computation. In this work, we propose an exact probabilistic error model that can compute the maximum error over all possible input space in a circuit-specific manner and can handle various types of structural dependencies in the circuit. We also provide the worst-case input vector, which has the highest probability to generate an erroneous output, for any given logic circuit. We also present a study of circuit-specific error bounds for fault-tolerant computation in heterogeneous circuits using the maximum error computed for each circuit. We model the error estimation problem as a maximum a posteriori (MAP) estimate, over the joint error probability function of the entire circuit, calculated efficiently through an intelligent search of the entire input space using probabilistic traversal of a binary join tree using Shenoy-Shafer algorithm. We demonstrate this model using MCNC and ISCAS benchmark circuits and validate it using an equivalent HSpice model. Both results yield the same worst-case input vectors and the highest % difference of our error model over HSpice is just 1.23%. We observe that the maximum error probabilities are significantly larger than the average error probabilities, and provides a much tighter error bounds for fault-tolerant computation. We also find that the error estimates depend on the specific circuit structure and the maximum error probabilities are sensitive to the individual gate failure probabilities.

A random forest-based analysis of cassava mosaic disease-related factors affecting the on-farm livelihoods of cassava farmers

“…The Random Forest model used in this study was evaluated, for each of the target variables, using ten (10) metrics -coefficient of determination (R 2 ) (Piepho, 2018;Jones, 2019;Hawinkel et al, 2024), the mean squared error (MSE) (Das et al, 2004;Kato & Hotta, 2021;Kim et al, 2021;Jin & Montúfar, 2023), the root mean squared error (RMSE) (Zollanvari & Dougherty, 2013;Busch et al, 2014;Huang et al, 2017;Belliardo & Giovannetti, 2020;Zhu, 2022;Reiter & Werner, 2024), the mean absolute error (MAE) (De Myttenaere et al, 2015aQi et al, 2020a, b;Baumgärtner et al, 2023;Wang et al, 2023;Xie, 2024), the mean absolute percentage error (MAPE) (De Myttenaere et al, 2015b), the maximum error (ME) (Lingasubramanian et al, 2011), the mean pinball loss (MPL) (Sluijterman et al, 2024), the mean gamma deviance (MGD) (Cheema et al, 2023), the mean Poisson deviance (MPD) (Oliveira et al, 2023) and the mean Tweedie deviance (MTD) (Wüthrich & Merz, 2023).…”

A New Bayesian Network Method for Computing Bottom Event's Structural Importance Degree using Jointree

“…1(c)).For a Bayesian network, it has many different Jointrees according to different construction algorithms. In this paper, one kind of Jointree named binary Jointree is adopted by using the construction algorithm stated in the literature [9,10]. Nodes of jointree are called clusters and each cluster contains one or several variables.…”