Pith. sign in

REVIEW 1 cited by

OTAdapt: Optimal Transport-based Approach For Unsupervised Domain Adaptation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.10738 v1 pith:M2S7I6RQ submitted 2022-05-22 cs.CV

classification cs.CV
keywords domainsrecognitionapproachdatasetsdomainproblemssourcetarget
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Unsupervised domain adaptation is one of the challenging problems in computer vision. This paper presents a novel approach to unsupervised domain adaptations based on the optimal transport-based distance. Our approach allows aligning target and source domains without the requirement of meaningful metrics across domains. In addition, the proposal can associate the correct mapping between source and target domains and guarantee a constraint of topology between source and target domains. The proposed method is evaluated on different datasets in various problems, i.e. (i) digit recognition on MNIST, MNIST-M, USPS datasets, (ii) Object recognition on Amazon, Webcam, DSLR, and VisDA datasets, (iii) Insect Recognition on the IP102 dataset. The experimental results show that our proposed method consistently improves performance accuracy. Also, our framework could be incorporated with any other CNN frameworks within an end-to-end deep network design for recognition problems to improve their performance.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Expressive Score-Based Priors for Distribution Matching with Geometry-Preserving Regularization

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A likelihood-based distribution matching method uses a score-based prior trained by denoising score matching and a Gromov-Wasserstein semantic-space regularizer, improving fairness, domain adaptation, and domain translation.

Pith tools