Shuang Li, Rui Zhang, Chi Liu, Mixue Xie
We lifted 1 functions out of this paper's own repositories and ran 1 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 |
|---|---|---|
| bit-da/duc | — | 1 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| EDL_Loss | Ran | bit-da/duc/core/active/loss.py pointer only (licence: NONE) · get_code("bfcb237fe18fcf21") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Active domain adaptation (DA) aims to maximally boost the model adaptation on a new target domain by actively selecting limited target data to annotate, whereas traditional active learning methods may be less effective since they do not consider the domain shift issue. Despite active DA methods address this by further proposing targetness to measure the representativeness of target domain characteristics, their predictive uncertainty is usually based on the prediction of deterministic models, which can easily be miscalibrated on data with distribution shift. Considering this, we propose a Dirichlet-based Uncertainty Calibration (DUC) approach for active DA, which simultaneously achieves the mitigation of miscalibration and the selection of informative target samples. Specifically, we place a Dirichlet prior on the prediction and interpret the prediction as a distribution on the probability simplex, rather than a point estimate like deterministic models. This manner enables us to consider all possible predictions, mitigating the miscalibration of unilateral prediction. Then a two-round selection strategy based on different uncertainty origins is designed to select target samples that are both representative of target domain and conducive to discriminability. Extensive experiments on cross-domain image classification and semantic segmentation validate the superiority of DUC.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.13824")
get_code_for_paper("2302.13824")
have("2302.13824")
Connect an agent — have() is free.