Sampling Function
Jump to navigation
Jump to search
A Sampling Function is a function that maps a unit interval to probability domains.
- See: Sample Space, Random Sample.
References
2005
- (Park et al., 2005) ⇒ Sungwoo Park, Frank Pfenning, and Sebastian Thrun. (2005). “A Probabilistic Language based Upon Sampling Functions.” In: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ISBN:1-58113-830-X doi:10.1145/1047659.1040320
- QUOTE: ...
2003
- (Park, 2003) ⇒ Sungwoo Park. (2003). “A Calculus for Probabilistic Languages.” In: Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation. ISBN:1-58113-649-8 doi:10.1145/640136.604180
- QUOTE: ... In our calculus, every expression denotes a probability distribution yet evaluates to a regular value. The most notable feature of our calculus is that it is founded upon sampling functions, which map the unit interval to probability domains.