Metropolis-Hastings algorithm in joint-attention naming game: experimental semiotics study [PDF]
Frontiers in Artificial Intelligence, 2023 We explore the emergence of symbols during interactions between individuals through an experimental semiotic study. Previous studies have investigated how humans organize symbol systems through communication using artificially designed subjective ...
Ryota Okumura +3 more
doaj +6 more sources
Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm [PDF]
Quantum, 2020 We present a detailed circuit implementation of Szegedy's quantization of the Metropolis-Hastings walk. This quantum walk is usually defined with respect to an oracle.
Jessica Lemieux +4 more
doaj +4 more sources
Hastings-Metropolis algorithm on Markov chains for small-probability estimation*** [PDF]
ESAIM: Proceedings and Surveys, 2015 Shielding studies in neutron transport, with Monte Carlo codes, yield challenging problems of small-probability estimation. The particularity of these studies is that the small probability to estimate is formulated in terms of the ...
Bachoc Francois +2 more
doaj +8 more sources
A multiple-try Metropolis-Hastings algorithm with tailored proposals [PDF]
Computational statistics (Zeitschrift), 2018 We present a new multiple-try Metropolis-Hastings algorithm designed to be especially beneficial when a tailored proposal distribution is available. The algorithm is based on a given acyclic graph $G$, where one of the nodes in $G$, $k$ say, contains the
Luo, Xin, Tjelmeland, Håkon
core +4 more sources
Cybergeo, 2001 Environmental scientists often face situations where: (i) stimulus-response relationships are non-linear; (ii) data is rare or imprecise; (iii) facts are uncertain and stimulus-responses relationships are questionable.In this paper, we focus on the first
Franck Torre +2 more
doaj +2 more sources
Finite adaptation and multistep moves in the metropolis-hastings algorithm for variable selection in genome-wide association analysis. [PDF]
PLoS One, 2012 High-dimensional datasets with large amounts of redundant information are nowadays available for hypothesis-free exploration of scientific questions. A particular case is genome-wide association analysis, where variations in the genome are searched for ...
Peltola T, Marttinen P, Vehtari A.
europepmc +2 more sources
Fully Adaptive Gaussian Mixture Metropolis-Hastings Algorithm [PDF]
IEEE International Conference on Acoustics, Speech, and Signal Processing, 2013 Markov Chain Monte Carlo methods are widely used in signal processing and communications for statistical inference and stochastic optimization. In this work, we introduce an efficient adaptive Metropolis-Hastings algorithm to draw samples from generic ...
Luengo, David, Martino, Luca
core +4 more sources
A Bootstrap Metropolis-Hastings Algorithm for Bayesian Analysis of Big Data. [PDF]
Technometrics, 2016 Liang F, Kim J, Song Q.
europepmc +2 more sources
Adaptive Mixture of Student-t Distributions as a Flexible Candidate Distribution for Efficient Simulation: The R Package AdMit [PDF]
Journal of Statistical Software, 2008 This paper presents the R package AdMit which provides flexible functions to approximate a certain target distribution and to efficiently generate a sample of random draws from it, given only a kernel of the target density function.
David Ardia +2 more
doaj +1 more source
Reliable uncertainty estimates in deep learning with efficient Metropolis-Hastings algorithms. [PDF]
Nat CommunSchmal M, Mäder P.
europepmc +4 more sources