We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Missing data is a crucial issue when applying machine learning algorithms to real-world datasets. Starting from the simple assumption that two batches extracted randomly from the same dataset should share the same distribution, we leverage optimal transport distances to quantify that criterion and turn it into a loss function to impute missing data values. We propose practical methods to minimize these losses using end-to-end learning, that can exploit or not parametric assumptions on the underlying distributions of values. We evaluate our methods on datasets from the UCI repository, in MCAR, MAR and MNAR settings. These experiments show that OT-based methods match or out-perform state-of-the-art imputation methods, even for high percentages of missing values.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.03860")
get_code_for_paper("2002.03860")
have("2002.03860")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.03860.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.03860)
Connect an agent — have() is free.