paper-with-me

홈 › Papers

Monte Carlo Action Programming

2017-02-25 · Lenz Belzner

This paper proposes Monte Carlo Action Programming, a programming language framework for autonomous systems that act in large probabilistic state spaces with high branching factors. It comprises formal syntax and semantics of a nondeterministic action programming language. The language is interpreted stochastically via Monte Carlo Tree Search. Effectiveness of the approach is shown empirically.

📄 PDF Abstract BibTeX arXiv:1702.08441

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

ParaMonte: A high-performance serial/parallel Monte Carlo simulation library for C, C++, Fortran

2020-09-29 · Amir Shahmoradi, Fatemeh Bagheri

ParaMonte (standing for Parallel Monte Carlo) is a serial and MPI/Coarray-parallelized library of Monte Carlo routines for sampling mathematical objective functions of arbitrary-dimensions, in particular, the posterior d…

Automatic Differentiable Monte Carlo: Theory and Application

2019-11-20 · Shi-Xin Zhang, Zhou-Quan Wan, Hong Yao

Differentiable programming has emerged as a key programming paradigm empowering rapid developments of deep learning while its applications to important computational methods such as Monte Carlo remain largely unexplored.…

Data-driven Sequential Monte Carlo in Probabilistic Programming

2015-12-14 · Yura N. Perov, Tuan Anh Le, Frank Wood

Most of Markov Chain Monte Carlo (MCMC) and sequential Monte Carlo (SMC) algorithms in existing probabilistic programming systems suboptimally use only model priors as proposal distributions. In this work, we describe an…

Probabilistic Programming

A Compilation Target for Probabilistic Programming Languages

2014-03-03 · Brooks Paige, Frank Wood

Forward inference techniques such as sequential Monte Carlo and particle Markov chain Monte Carlo for probabilistic programming can be implemented in any programming language by creative use of standardized operating sys…

Probabilistic Programming

Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms

2021-02-23 · Kirill Antonov, Maxim Buzdalov, Arina Buzdalova, Carola Doerr

With the goal to provide absolute lower bounds for the best possible running times that can be achieved by $(1+\lambda)$-type search heuristics on common benchmark problems, we recently suggested a dynamic programming ap…

Evolutionary Algorithms