In the supplementary material, we first introduce the pseudo algorithm of DA W . Then we clarify the Then, we provide a more detailed explanation of Figures 1, 2, 4, and 5, which are slightly abbreviated due to the limited space of the main paper. In the naive pseudo-labeling method, all pseudo labels are enrolled into training, i.e., E 1 + E 2, which is guaranteed by theoretical functional analysis in the next section. Inequality 45 holds true at all times. In this section, we provide more qualitative results between ours and other competitors.

We next explain the rationality of the resampling-by-compatibility presented in Sect. We first i) prove Eq. For Assumption (9), L( π, u, v) is strongly convex as proved in [5]. Eq. (A-19), we have E The codes are in pytorch [7]. The learning rate is 1e-5.