Papers › Domain Adaptation on Point Clouds via Geometry-Aware Implicits

Domain Adaptation on Point Clouds via Geometry-Aware Implicits

17 Dec 2021CVPR 2022 1arXiv:2112.09343archive 2025-07-28

Yuefan Shen, Yanchao Yang, Mi Yan, He Wang, Youyi Zheng, Leonidas Guibas

As a popular geometric representation, point clouds have attracted much attention in 3D vision, leading to many applications in autonomous driving and robotics. One important yet unsolved issue for learning on point cloud is that point clouds of the same object can have significant geometric variations if generated using different procedures or captured using different sensors. These inconsistencies induce domain gaps such that neural networks trained on one domain may fail to generalize on others. A typical technique to reduce the domain gap is to perform adversarial training so that point clouds in the feature space can align. However, adversarial training is easy to fall into degenerated local minima, resulting in negative adaptation gains. Here we propose a simple yet effective method for unsupervised domain adaptation on point clouds by employing a self-supervised task of learning geometry-aware implicits, which plays two critical roles in one shot. First, the geometric information in the point clouds is preserved through the implicit representations for downstream tasks. More importantly, the domain-specific variations can be effectively learned away in the implicit space. We also propose an adaptive strategy to compute unsigned distance fields for arbitrary point clouds due to the lack of shape models in practice. When combined with a task loss, the proposed outperforms state-of-the-art unsupervised domain adaptation methods that rely on adversarial domain alignment and more complicated self-supervised tasks. Our method is evaluated on both PointDA-10 and GraspNet datasets. The code and trained models will be publicly available.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2112.09343")

Code

Syntology Ran 3 of 9 code samples harvested from 1 repository linked to this paper; 6 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 1 ran · fixture could not drive it; 1 ran with no contract checked.

By repository: community (archive-listed): 9 samples from 1 repository, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Jhonve/jhonve.github.io mentioned on GitHubApache-2.0 report
jhonve/implicitpcda mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 3 ran; 0 honoured the contract we drafted; 6 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
1ran · fixture could not drive it
1ran
6unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from jhonve/implicitpcda. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_scheduler jhonve/implicitpcda/models/networks.py community (archive-listed) ran MIT (permissive) · f28f371ac79d4e8a · report
init_net jhonve/implicitpcda/models/networks.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 01d1ccc6bbadcbdc · report
knn jhonve/implicitpcda/models/networks.py community (archive-listed) ran · fixture could not drive it fingerprinted MIT (permissive) · cdd0141594039dcb · report
convert_model jhonve/implicitpcda/models/sync_batchnorm/batchnorm.py community (archive-listed) unverified MIT (permissive) · fd571474b78c67d9 · report
datapath_PointDAN_synthetic jhonve/implicitpcda/datasets/datautils.py community (archive-listed) unverified MIT (permissive) · 343cae110d7d50b0 · report
js_divergence jhonve/implicitpcda/measurement/calculate_distances.py community (archive-listed) unverified MIT (permissive) · 6cd4ea67bd085b10 · report
mmd_linear jhonve/implicitpcda/measurement/mmd_numpy_scipy.py community (archive-listed) unverified MIT (permissive) · 67b50915ffecdc32 · report
mmd_poly jhonve/implicitpcda/measurement/mmd_numpy_scipy.py community (archive-listed) unverified MIT (permissive) · c2d3ab5d43b0c7dc · report
mmd_rbf jhonve/implicitpcda/measurement/mmd_numpy_scipy.py community (archive-listed) unverified MIT (permissive) · af690a6cc7e92c9f · report

Tasks

Autonomous DrivingDomain AdaptationUnsupervised Domain Adaptation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections