Luis Oala, Saul Calderon-Ramirez
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.
A common heuristic in semi-supervised deep learning (SSDL) is to select unlabelled data based on a notion of semantic similarity to the labelled data. For example, labelled images of numbers should be paired with unlabelled images of numbers instead of, say, unlabelled images of cars. We refer to this practice as semantic data set matching. In this work, we demonstrate the limits of semantic data set matching. We show that it can sometimes even degrade the performance for a state of the art SSDL algorithm. We present and make available a comprehensive simulation sandbox, called non-IID-SSDL, for stress testing an SSDL algorithm under different degrees of distribution mismatch between the labelled and unlabelled data sets. In addition, we demonstrate that simple density based dissimilarity measures in the feature space of a generic classifier offer a promising and more reliable quantitative matching criterion to select unlabelled data before SSDL training.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2104.10223")
get_code_for_paper("2104.10223")
have("2104.10223")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2104.10223.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2104.10223)
Connect an agent — have() is free.