Monte-Carlo variance reduction techniques
In a world where processing power comes in growing abundance, Monte-Carlo methods thrive thanks to their intuitive simplicity and ease of implementation. Over the years, improved versions of the standard Monte-Carlo have emerged reducing the error around the estimate for a given sample size. In this article, we will review the most popular methods and compare their individual efficiency through solving a toy game using Python.
- Formula for sorting betting opportunities
- Functional Programming exercises in Scala 3: Functions on Lists
- Kelly criterion for multiple mutually exclusive outcomes: A numerical approach
- Rust integration within the Elixir Phoenix framework
- Bet sizing using risk-of-ruin indicator
- Factory type pattern using Enums in Rust
- Sieve of Eratosthenes: Benchmarking Rust, Nim, Go against C
- Sudoku solver in idiomatic Rust
- Use statistical bootstrapping to validate an algorithmic trading strategy
- Numerically solve Kelly criterion for multiple simultaneous bets
- Export Rust functions to Java using JNI (WebAssembly comparison)
- Creating a JavaFX GUI for Rust WebAssembly using Asmble and Kotlin
- Mutability in Rust for functions and closures
- Interfacing Elm with Rust WebAssembly
- Fast development of 2D games and visualisation apps in Rust with Piston
- Reinforcement Learning with Torch in Rust: Solving Kuhn Poker
- How to use Torch in Rust with tch-rs
- Why are some downplaying the role of good fortune in Business and Speculation?
- Cryptocurrencies in the global economy
- Define your programming toolbox
- Passive investing is a game of chicken
