Keywords
Monte Carlo methodComputer scienceMathematical optimizationMarkov chain Monte CarloSample (material)Sampling (signal processing)Hybrid Monte CarloMarkov decision processMarkov processAlgorithmArtificial intelligenceMathematicsBayesian probabilityStatistics
Affiliated Institutions
Related Publications
CODA: convergence diagnosis and output analysis for MCMC
[1st paragraph] At first sight, Bayesian inference with Markov Chain Monte Carlo (MCMC) appears to be straightforward. The user defines a full probability model, perhaps using o...
Smooth Skyride through a Rough Skyline: Bayesian Coalescent-Based Inference of Population Dynamics
Kingman's coalescent process opens the door for estimation of population genetics model parameters from molecular sequences. One paramount parameter of interest is the effective...
Quantifying the Sim-To-Real Gap in UAV Disturbance Rejection
Due to the safety risks and training sample inefficiency, it is often preferred to develop controllers in simulation. However, minor differences between the simulation and the r...
Model Averaging and Bayes Factor Calculation of Relaxed Molecular Clocks in Bayesian Phylogenetics
We describe a procedure for model averaging of relaxed molecular clock models in Bayesian phylogenetics. Our approach allows us to model the distribution of rates of substitutio...
Latent Class Model Diagnosis
Summary. In many areas of medical research, such as psychiatry and gerontology, latent class variables are used to classify individuals into disease categories, often with the i...
Publication Info
- Year
- 2006
- Type
- book-chapter
- Pages
- 282-293
- Citations
- 2790
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2790
OpenAlex
Cite This
Levente Kocsis,
Csaba Szepesvári
(2006).
Bandit Based Monte-Carlo Planning.
Lecture notes in computer science
, 282-293.
https://doi.org/10.1007/11871842_29
Identifiers
- DOI
- 10.1007/11871842_29