We lifted 7 functions out of this paper's own repositories and ran 6 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 |
|---|---|---|
| nguyenngocbaocmt02/gentle | canonical | 6 of 7 |
| Function | Status | Where it lives |
|---|---|---|
| build_mlp | Ran | nguyenngocbaocmt02/gentle/models/mlp.py pointer only (licence: NONE) · get_code("2703985e5aca297d") |
| esophageal_cancer_sim | Ran | nguyenngocbaocmt02/gentle/datasets/data_generation.py pointer only (licence: NONE) · get_code("6219cec3ebd311b6") |
| preprocess_dataset | Ran | nguyenngocbaocmt02/gentle/utils.py pointer only (licence: NONE) · get_code("e83b17c5d6107e8c") |
| prim | Ran | nguyenngocbaocmt02/gentle/utils.py pointer only (licence: NONE) · get_code("dff06e4cfe94e5b7") |
| scenario_one | Ran | nguyenngocbaocmt02/gentle/datasets/data_generation.py pointer only (licence: NONE) · get_code("a1533bd5b245fa2e") |
| scenario_two | Ran | nguyenngocbaocmt02/gentle/datasets/data_generation.py pointer only (licence: NONE) · get_code("24889ebd201b7512") |
| compute_gradient_penalty | Not yet run | nguyenngocbaocmt02/gentle/train_wgan_gp.py pointer only (licence: NONE) · get_code("56d80682979d3e38") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Learning conditional distributions is challenging because the desired outcome is not a single distribution but multiple distributions that correspond to multiple instances of the covariates. We introduce a novel neural entropic optimal transport method designed to effectively learn generative models of conditional distributions, particularly in scenarios characterized by limited sample sizes. Our method relies on the minimax training of two neural networks: a generative network parametrizing the inverse cumulative distribution functions of the conditional distributions and another network parametrizing the conditional Kantorovich potential. To prevent overfitting, we regularize the objective function by penalizing the Lipschitz constant of the network output. Our experiments on real-world datasets show the effectiveness of our algorithm compared to state-of-the-art conditional distribution learning techniques. Our implementation can be found at https://github.com/nguyenngocbaocmt02/GENTLE.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.02317")
get_code_for_paper("2406.02317")
have("2406.02317")
Connect an agent — have() is free.