Resolution vs. cutting plane solution of inference problems: Some computational experience

1988 ◽  
Vol 7 (1) ◽  
pp. 1-7 ◽  
Author(s):  
J.N. Hooker
2005 ◽  
Vol 105 (2-3) ◽  
pp. 451-469 ◽  
Author(s):  
Ilse Fischer ◽  
Gerald Gruber ◽  
Franz Rendl ◽  
Renata Sotirov

AIAA Journal ◽  
2000 ◽  
Vol 38 ◽  
pp. 335-341 ◽  
Author(s):  
Zhen-Qiang Cheng ◽  
R. C. Batra
Keyword(s):  

2015 ◽  
Author(s):  
Alejandro Corvalan ◽  
Emerson Melo ◽  
Robert P Sherman ◽  
Matthew Shum

Entropy ◽  
2021 ◽  
Vol 23 (3) ◽  
pp. 312
Author(s):  
Ilze A. Auzina ◽  
Jakub M. Tomczak

Many real-life processes are black-box problems, i.e., the internal workings are inaccessible or a closed-form mathematical expression of the likelihood function cannot be defined. For continuous random variables, likelihood-free inference problems can be solved via Approximate Bayesian Computation (ABC). However, an optimal alternative for discrete random variables is yet to be formulated. Here, we aim to fill this research gap. We propose an adjusted population-based MCMC ABC method by re-defining the standard ABC parameters to discrete ones and by introducing a novel Markov kernel that is inspired by differential evolution. We first assess the proposed Markov kernel on a likelihood-based inference problem, namely discovering the underlying diseases based on a QMR-DTnetwork and, subsequently, the entire method on three likelihood-free inference problems: (i) the QMR-DT network with the unknown likelihood function, (ii) the learning binary neural network, and (iii) neural architecture search. The obtained results indicate the high potential of the proposed framework and the superiority of the new Markov kernel.


Sign in / Sign up

Export Citation Format

Share Document