Nunzio Letizia, Nicola Novello, Andrea Tonello
We lifted 3 functions out of this paper's own repositories and ran 3 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| tonellolab/fdime | reimplementation | 3 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| my_binary_crossentropy | Ran | tonellolab/fdime/utils.py code served (permissive licence) · get_code("882deab86cfbf51c") |
| reciprocal_loss | Ran | tonellolab/fdime/utils.py code served (permissive licence) · get_code("fcd197676a50e176") |
| wasserstein_loss | Ran | tonellolab/fdime/utils.py code served (permissive licence) · get_code("86c58e3bd0cfc9a1") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Estimating mutual information accurately is pivotal across diverse applications, from machine learning to communications and biology, enabling us to gain insights into the inner mechanisms of complex systems. Yet, dealing with high-dimensional data presents a formidable challenge, due to its size and the presence of intricate relationships. Recently proposed neural methods employing variational lower bounds on the mutual information have gained prominence. However, these approaches suffer from either high bias or high variance, as the sample size and the structure of the loss function directly influence the training process. In this paper, we propose a novel class of discriminative mutual information estimators based on the variational representation of the f -divergence. We investigate the impact of the permutation function used to obtain the marginal training samples and present a novel architectural solution based on derangements. The proposed estimator is flexible since it exhibits an excellent bias/variance trade-off. The comparison with state-of-the-art neural estimators, through extensive experimentation within established reference scenarios, shows that our approach offers higher accuracy and lower complexity.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2305.20025")
get_code_for_paper("2305.20025")
have("2305.20025")
Connect an agent — have() is free.