Papers › Using Monte Carlo Tree Search to Calculate Mutual Information in High Dimensions
Using Monte Carlo Tree Search to Calculate Mutual Information in High Dimensions
Nick Carrara, Jesse Ernst
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Mutual information is an important measure of the dependence among variables. It has become widely used in statistics, machine learning, biology, etc. However, the standard techniques for estimating it often perform poorly in higher dimensions or with noisy variables. Here we significantly improve one of the standard methods for calculating mutual information by combining it with a modified Monte Carlo Tree Search. We present results which show that our method gives accurate results where the standard methods fail. We also describe the software implementation of our method and give details on the publicly-available code.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections