betaFeedback

WorksComputer Science

3D-BBDA: Backpropagation-Free Black-Box Domain Adaptation for Robust 3D Point Cloud Recognition

Abstract

Robust 3D point-cloud recognition is critical for robotics, mapping, and urban sensing, yet point-cloud classifiers often suffer performance drops under domain shifts caused by sensor changes, environmental variation, and acquisition artifacts. Many existing adaptation methods are difficult to deploy in practice because they require access to source data or the internal parameters of the source model, which may be restricted by privacy, licensing, or security constraints. We present 3D-BBDA, a backpropagation-free black-box domain adaptation framework that adapts a source-trained predictor to unlabeled target data using only black-box outputs. Our method performs pseudo-label guided prototype-based alignment and employs a weighted prediction module to fuse source logits with alignment logits, reducing sensitivity to noisy pseudo-labels. To stabilize prototype memory when pseudo-label coverage is incomplete, we construct a Gaussian-perturbed prototype prior from unlabeled target predictions and use it as a fallback for missing or unreliable class prototypes during alignment. Experiments on four corrupted 3D benchmarks demonstrate consistent improvements over strong baselines. On ModelNet-40C, 3D-BBDA achieves mean errors of 32.08% (PointNet) and 29.62% (GDANet), outperforming Source-only (35.88% / 34.03%) and BFTT3D (33.78% / 32.36%). 3D-BBDA requires only a single forward pass with no gradient updates making it suitable for real-time, privacy-preserving deployment in transferable 3D recognition pipelines. Project page is available at https://visdomlab.github.io/3D_BBDA

Introduction

Robust 3D perception is fundamental to autonomous systems, including mobile robots, autonomous vehicles, unmanned aerial platforms, and urban mapping solutions. These systems rely heavily on point cloud data acquired from LiDAR, depth cameras, and other 3D sensors for object recognition, navigation, and interaction in unstructured environments. In real deployments, perception models often operate under changing environmental conditions, sensor variations, and acquisition artifacts that induce domain shifts, leading to significant performance degradation [19, 21]. Ensuring robustness under such distributional shifts is critical for the safe and reliable deployment of AI-driven robotic systems.

While unsupervised domain adaptation (UDA) attempts to transfer knowledge from labeled source domains to unlabeled target domains [7, 23], most UDA methods require access to source data or source model parameters during adaptation [16]. In practical robotic deployments, this assumption is often unrealistic. Perception models may be proprietary, certified, or frozen after training, and source datasets may be inaccessible due to privacy, storage, or licensing constraints [20]. Moreover, online gradient-based fine-tuning is frequently infeasible on edge robotic platforms due to computational and safety considerations. These limitations motivate black-box and source-free adaptation strategies that rely on inference-time observations.

Black-Box Domain Adaptation (BBDA) addresses this setting by treating the source model as an immutable predictor and adapting only through its outputs [11, 15, 16]. However, existing BBDA research has primarily focused on 2D vision tasks. Extending BBDA to 3D point clouds is non-trivial due to unordered structures, irregular spatial distributions, and varying density patterns. Furthermore, existing approaches often depend on backpropagation or source statistics for alignment, limiting their applicability in strictly constrained deployment scenarios. These highlight a critical research gap, necessitating novel approaches tailored to the unique characteristics of 3D point clouds under black-box constraints. Additionally, these methods typically enforce the use of the same network architecture as the source model, which restricts the flexibility to adopt different architectures for the target model during adaptation [16, 33]. This limitation hinders the ability to tailor target networks to specific tasks or computational constraints. The self-training generates pseudo-labels of the target and adapts the network with re-training, however, learning with pseudo-labels leads to error accumulation which degrades the performance of the model. To handle this issue, some of the existing work leverages back-propagation free approach for getting the adaptive prediction at the time of inference [27, 36]. However, the use of source data for the alignment makes it non-feasible.

The BBDA setting for 3D point cloud data remains largely unexplored within domain adaptation research, illustrated in Figure 1. We study 3D point-cloud adaptation under the joint constraints of source-free, black-box, and backpropagation-free deployment: source training data and source-model internals are unavailable, the frozen source model is accessed only through its predictions, and no gradient-based parameter updates are performed at test time. Unlike conventional domain adaptation approaches that rely on access to both source data and the corresponding model, the black-box paradigm restricts access solely to the pre-trained source model, which is treated as an immutable black box(Table 1).

Overview of the BBDA setting for 3D point cloud data

Figure 1. Overview of the BBDA setting for 3D point cloud data. A pretrained source model acts as a black-box predictor and uses target data for adaptation.

In this work, we address a stricter and practically motivated setting. We propose a novel Backpropagation-free Black-box Domain Adaptation framework for 3D point cloud data (3D-BBDA), that performs adaptation without accessing source data or source model internals and without updating any parameters at test-time. By avoiding parameter updates, the model eliminates the risk of error accumulation that could degrade performance over time. The source model is treated purely as a black-box predictor. The goal is to reduce domain gap between source and target domains.

A prototype-based alignment module is leveraged to align the feature space of the source and target domains. A non-parametric network is used to extract features from the target samples. For each corruption, the features from the target samples are extracted using a non-parametric network, and they are assigned labels based on the pseudo labels obtained from the pre-trained source model through the assumption that the pseudo labels are the ground truth. Based on these pseudo-labels, the prototype for each class is generated by taking the mean features corresponding to each label. Further, these class-wise prototypes are used to align the samples. To avoid losing information from the source domain, a weighted prediction module is used to obtain the final prediction by integrating the source model and the non-parametric network.

To ensure stability under sparse or incomplete pseudo-label assignments, we further construct a Gaussian-perturbed prototype prior that provides fallback class prototypes when target pseudo-label coverage is missing or unreliable. Finally, a weighted prediction module fuses source predictions with alignment-based predictions, balancing source generalization with target-specific correction while avoiding error accumulation. The resulting framework requires no source data, no source-model parameter access, and no gradient updates, making it suitable for privacy-preserving and deployment-constrained 3D recognition. The main contributions are summarized as:

  • We formulate and address backpropagation-free black-box domain adaptation for 3D point cloud recognition, under strict source-free and parameter-free constraints motivated by robotic deployment scenarios.

  • We propose a pseudo-label guided prototype-based alignment module for adapting target features without accessing source data or source model internals.

  • We introduce a Gaussian-perturbed prototype prior that stabilizes prototype memory when pseudo-label coverage is incomplete under severe target shifts.

  • We conduct extensive experiments across multiple corrupted 3D benchmarks, demonstrating consistent robustness gains with negligible inference overhead.

Deep architectures such as PointNet [18], and GDANet [30], as well as recent transformer-based models (DAPointTr [14], and P3Former [29]), achieve strong in-domain performance but can be brittle under distribution shifts (e.g., sensor noise, occlusion, density changes, corruption), motivating adaptation for robust deployment.

Unsupervised domain adaptation (UDA) aligns labeled source and unlabeled target domains, leveraging geometric priors and self-training, e.g., SRDAN [35], graph-based self-distillation [2], and FAST3D [6]. However, UDA typically requires source data and often access to model internals, which may be infeasible under privacy, licensing constraints, or data portability constraints. Source-free domain adaptation (SFDA) relaxes the source-data requirement but commonly still relies on access to source-model components and pseudo-labeling, which can suffer from confirmation bias and error accumulation.

BBDA further restricts the setting by allowing only black-box predictions from the source model while prohibiting source data. Prior BBDA/SFDA approaches study augmentation and self-learning with uncertainty-aware filtering [9, 11] and teacher/prototype mechanisms to mitigate noisy labels and forgetting [5, 8, 12]. Test-time adaptation (TTA) adapts models using unlabeled test data; in 3D, recent work explores reconstruction/augmentation and prototype-based strategies [10, 24, 25, 37]. Closest to our deployment constraints, BFTT3D [27] performs backpropagation-free 3D test-time adaptation via prototype memory for feature alignment, but it uses source data to build the prototype memory. It has conflicts with strict source-free and privacy-constrained deployment.

SettingSource dataModel internalsTarget BP
Source-freeNoAllowedAllowed
Black-boxNoNoAllowed
Backprop.-freeAllowedAllowedNo
3D-BBDANoNoNo
PropertyBFTT3D3D-BBDA
Source data during adaptationRequiredNo
Source-model internalsRequiredNo
Source-model gradientsNoNo
Prototype sourceSource featuresTarget pseudo-labels
Missing-class completionNoGaussian target prior
Source/adaptation fusionNoYes
Black-box source interfaceNoYes

Table 1. Top: distinction between source-free, black-box, and backpropagation-free adaptation constraints. “Allowed” means the setting alone does not prohibit that access. Bottom: key differences between BFTT3D and 3D-BBDA.

In contrast, we address a stricter and practically motivated regime: backpropagation-free black-box adaptation for 3D point clouds, requiring neither source data nor source-model internals (or gradient updates), while improving robustness under corrupted target conditions, and architecture-agnostic adaptation strategies. Unlike BFTT3D, which constructs its adaptation memory using source information, 3D-BBDA replaces source-derived prototypes with pseudo-label-guided target prototypes, completes missing classes using an unlabeled target prior, and fuses the resulting prediction with black-box source output.

Methodology

Problem Statement

We address the Black-box domain adaptation problem in 3D point cloud data for the classification task using source trained model as the pre-trained black-box predictor (FSF_S), i.e., only prediction outputs are accessible, trained with labeled source domain data {xis,yis}i=1ns\{x_i^s,y_i^s\}_{i=1}^{n_s} under the domain DsD_s, where nsn_s represents the number of source samples (Fig. 2). For adaptation, we have unlabeled target domain data {xit}i=1nt\{x_i^t\}_{i=1}^{n_t} under domain DtD_t, where ntn_t represents number of target samples. Here, we make use of a non-parametric network (FnnF_{nn}) following the convention of [27]. The objective of the proposed 3D-BBDA framework is to adapt the source model (FSF_S) to the target domain at the test time and infer target labels {yit}i=1nt\{y_i^t\}_{i=1}^{n_t} using pre-trained source model, a non-parametric network (FnnF_{nn}) and unlabeled target data {xit}i=1nt\{x_i^t\}_{i=1}^{n_t} in the absence of source data or internal parameters, ensuring robust perception across unseen conditions. It is summarized in Algorithm in supplementary material.

Closed-set assumption. We consider the closed-set adaptation setting, where the source and target domains share the same label space, Ys=Yt={1,…,C}\mathcal{Y}_s = \mathcal{Y}_t = \{1,\ldots,C\}. Although target labels are unavailable during adaptation, each target sample is assumed to belong to one of the CC source classes. This assumption enables class-wise prototype construction from black-box pseudo-labels and the subsequent fusion with source-model predictions.

Feature Extraction From Non-parametric Network

For clarity, xitx_i^t denotes the ii-th target point-cloud sample in DtD_t, whereas xt,ix_{t,i} in the following feature extraction equations denotes an individual 3D point within the corresponding target point cloud. A non-parametric network, PointNN [34], is utilized to extract robust features from the target domain. Trigonometric functions first encode its xx, yy, and zz coordinates into channel embeddings of size dd. For each channel s∈{x,y,z}s \in\{x,y,z\}, the channel embeddings:

g(xt,i)(s)={sin⁡(αxt,i(s)/βi),i=2kcos⁡(αxt,i(s)/βi),i=2k+1∈Rd/3(1)g(x_{t,i})^{(s)} = \begin{cases} \sin(\alpha x_{t,i}^{(s)}/\beta^i), & i=2k \\ \cos(\alpha x_{t,i}^{(s)}/\beta^i), & i=2k+1 \end{cases} \in\mathbb{R}^{d/3} \tag*{(1)}

Here, α\alpha and β\beta represent wavelength and scale hyperparameters. These channel-wise embeddings from xx, yy, zz coordinates are concatenated to obtain raw embedding fraw,t,if_{\mathrm{raw},t,i} as:

fraw,t,i=[g(xt,i)(X),g(xt,i)(Y),g(xt,i)(Z)]∈Rd(2)f_{\mathrm{raw},t,i} = [g(x_{t,i})^{(X)}, g(x_{t,i})^{(Y)}, g(x_{t,i})^{(Z)}] \in\mathbb{R}^{d} \tag*{(2)}

Further, Farthest Point Sampling (FPS) is employed to downsample the local center points xcenx_{\mathrm{cen}} from all points in the dataset. Following this, kk-Nearest Neighbors (kk-NN) is used to group NctN_{\mathrm{ct}} neighboring points (xnbx_{\mathrm{nb}}) for each center point xcenx_{\mathrm{cen}}. Using a combination of both center and neighbor information, the expanded center feature f~cen\tilde{f}_{\mathrm{cen}} for xcenx_{\mathrm{cen}} as:

f~cen=Concat⁡(fcen,fnb,j), j∈Ncen(3)\tilde{f}_{\mathrm{cen}} = \operatorname{Concat}(f_{\mathrm{cen}}, f_{\mathrm{nb},j}),\ j \in\mathcal{N}_{\mathrm{cen}} \tag*{(3)}

Here, fcenf_{\mathrm{cen}} is feature of point xcenx_{\mathrm{cen}}, fnbf_{\mathrm{nb}} denotes the feature of point xnbx_{\mathrm{nb}}, and Ncen\mathcal{N}_{\mathrm{cen}} refers to the set of neighboring points for center point xcenx_{\mathrm{cen}}. To show the spatial distribution of neighboring points xnbx_{\mathrm{nb}}, feature f~cen\tilde{f}_{\mathrm{cen}} is further reweighted by its relative position encoding g(Δnb)g(\Delta_{\mathrm{nb}}) to the center point as

f~cen=(f~cen+g(Δnb))⊙g(Δnb)(4)\tilde{f}_{\mathrm{cen}} = \left(\tilde{f}_{\mathrm{cen}} + g(\Delta_{\mathrm{nb}})\right) \odot g(\Delta_{\mathrm{nb}}) \tag*{(4)}

where ⊙\odot represents element-wise multiplication and Δnb\Delta_{\mathrm{nb}} is the relative position of xnbx_{\mathrm{nb}} to its center point xcenx_{\mathrm{cen}}. Finally, the max pooling and average pooling are used to reduce the dimensionality of the information of f~cen\tilde{f}_{\mathrm{cen}} as:

f~cenp=MaxPool⁡(f~cen)+AvgPool⁡(f~cen)(5)\tilde{f}_{\mathrm{cen}}^{p} = \operatorname{MaxPool}(\tilde{f}_{\mathrm{cen}}) + \operatorname{AvgPool}(\tilde{f}_{\mathrm{cen}}) \tag*{(5)}

Finally, a global pooling operation is applied to get the feature ft,i∈Rdf_{t,i} \in\mathbb{R}^{d} for xt,ix_{t,i}. The extracted features are used as a basis for prototype generation in the subsequent phase of our alignment framework.

Prototype-based Alignment Module

For each input point cloud xt,ix_{t,i}, the corresponding pseudo-label y^i\hat{y}_{i} is obtained through FSF_{S}. Simultaneously, through a non-parametric network, target features (ft,i)(f_{t,i}) are extracted. The extracted features are assigned their corresponding pseudo labels. Target-buffer protocol. The minibatch size of 24 is used only for data loading and feature extraction and does not define the prototype-construction set. Target features and their black-box pseudo-labels are accumulated over the unlabeled target buffer, and class prototypes are then constructed from this accumulated buffer. The resulting prototype memory is kept fixed while shared-subspace alignment is performed over target blocks of 128 samples, with WW recomputed for each alignment block. A feature prototype (PiP_i) corresponding to each class ii is generated by taking the mean features of all the assigned samples to that class as:

Pi=1ni∑j=1nifj(6)P_i = \frac{1}{n_i}\sum_{j=1}^{n_i} f_j \tag*{(6)}

where nin_i is the number of samples assigned to class ii and fjf_j represents the feature of jthj^{\mathrm{th}} sample assigned to class ii.

Gaussian-perturbed prototype prior

Under severe domain shift, pseudo-labeling may yield incomplete class coverage, where some classes receive no assigned target samples. In such cases, the corresponding prototype in (6) cannot be computed, which may destabilize the subsequent alignment step. To maintain a class-complete prototype memory, we construct a Gaussian-perturbed prototype prior from unlabeled target predictions and use it to complete missing class prototypes during alignment. Specifically, an unlabeled Gaussian-perturbed target stream is passed through the black-box source predictor FSF_{S} and the frozen non-parametric encoder FnnF_{nn}. The resulting pseudo-labels and features are used to compute a class-aligned prototype prior {Pig}i=1C\{P_i^{g}\}_{i=1}^{C}. For class ii, let SigS_i^{g} denote the set of Gaussian-perturbed target samples assigned to class ii, and let nig=∣Sig∣n_i^{g} = |S_i^{g}|. If a class is missing even in the Gaussian-perturbed stream, we use the global mean of available Gaussian-perturbed prototypes as a conservative fallback:

Pig={1nig∑k∈Sigft,kg,if nig>0,1∣C+g∣∑j∈C+gPjg,if nig=0.(7)P_i^{g} = \begin{cases} \frac{1}{n_i^{g}}\sum_{k\in S_i^{g}} f_{t,k}^{g}, & \text{if } n_i^{g} > 0,\\ \frac{1}{|C_{+}^{g}|}\sum_{j\in C_{+}^{g}} P_j^{g}, & \text{if } n_i^{g} = 0. \end{cases} \tag*{(7)}

where C+g={j∣njg>0}C_{+}^{g} = \{j \mid n_j^{g} > 0\} is the set of classes with available Gaussian-perturbed prototypes. This prior is computed from unlabeled target predictions and does not require source samples, target labels, source-model parameters, or gradient updates.

Prototype completion. For a target stream dd, pseudo-labeling may leave some classes with no assigned samples. Let Si(d)S_i^{(d)} denote the set of target samples in stream dd assigned to class ii, and let ni(d)=∣Si(d)∣n_i^{(d)} = |S_i^{(d)}|. The completed prototype for class ii is computed as

P~i(d)={1ni(d)∑k∈Si(d)ft,k(d),if ni(d)>0,Pig,if ni(d)=0.(8)\tilde{P}_i^{(d)} = \begin{cases} \frac{1}{n_i^{(d)}}\sum_{k\in S_i^{(d)}} f_{t,k}^{(d)}, & \text{if } n_i^{(d)} > 0,\\ P_i^{g}, & \text{if } n_i^{(d)} = 0. \end{cases} \tag*{(8)}

The completed prototype memory {P~i(d)}i=1C\{\tilde{P}_i^{(d)}\}_{i=1}^{C} is then used for shared-subspace alignment. This completion step provides fallback class prototypes for missing pseudo-labeled classes while preserving the backpropagation-free, black-box, and source-free constraints of 3D-BBDA.

Reducing domain shift through shared subspace projection and alignment

Domain shifts occur when target features diverge from the distribution of learned prototypes, rendering direct alignment inadequate. It begins by computing cosine similarity normalized feature vectors from the target domain and prototype memory to guide classification [27]. Consider a target feature vector Gt=[gt,1,gt,2,…,gt,nt]G_t = [g_{t,1}, g_{t,2}, \ldots, g_{t,n_t}] and prototype memory P=[P1,P2,…,Pc]P = [P_1, P_2, \ldots, P_c]. The cosine similarity as:

K=G~t⋅P~∥G~t∥∥P~∥(9)K = \frac{\tilde{G}_t \cdot\tilde{P}}{\|\tilde{G}_t\|\|\tilde{P}\|} \tag*{(9)}

Here, vector G~t\tilde{G}_t represents the normalized feature vector of GtG_t, expressed as G~t=Gt∥Gt∥\tilde{G}_t = \frac{G_t}{\|G_t\|}, where ∥Gt∥\|G_t\| denotes the magnitude of GtG_t. Similarly, P~\tilde{P} represents the normalized prototype memory vector, given by P~=P∥P∥\tilde{P} = \frac{P}{\|P\|}, where ∥P∥\|P\| represents the magnitude of PP. This similarity leads to classification by assigning a weighting to the influence of each prototype. The output logits with pseudo label yiy_i as:

lam=ϕ(Kyi),ϕ(x)=exp⁡(−β(1−x)),(10)l_{am} = \phi(Ky_i), \quad\phi(x) = \exp(-\beta(1-x)), \tag*{(10)}

with β\beta as a scaling hyperparameter. To explicitly reduce the distribution gap between prototypes (f∗f^{*}) and target features (ft∗f_t^{*}), both are projected into a shared subspace using a mapping function ψ(⋅)\psi(\cdot). The disparity between these domains is reduced by calculating the statistical distance between their mean representations:

MethodBackboneunifgausbackgimpulup samprbfrbf-invden-decdens-incshearrotcutdistoclulidarMean ↓
Source-onlyPointNet14.6318.6895.3033.3915.0329.4627.6312.9310.4942.7172.8114.9534.8556.2859.0035.88
TENT [25]PointNet14.7118.3590.3627.0315.3628.2826.6613.8612.3640.6865.6815.7633.8756.5659.8534.62
BN [13]PointNet14.8318.8489.6327.4715.1528.6926.6614.5912.4040.4465.8816.2534.6857.5860.2134.89
SHOT [15]PointNet14.9117.2290.4425.6114.5127.0725.8513.7812.2039.9565.8016.2132.9856.9360.2934.25
LAME [1]PointNet76.6484.6795.9595.4867.8393.3791.7259.9234.8196.4597.5068.5292.5395.9995.9583.16
DSS [28]PointNet14.2018.7194.1333.1214.3329.3127.5513.3110.9241.4266.3115.4534.1056.3159.3335.23
BFTT3D [27]PointNet14.5518.2780.7531.9314.8328.9727.1912.7610.4939.7168.5614.6734.0454.1355.8833.78
PURGE-GATE (PG-SP†) [31]PointNet15.4419.3793.4036.6315.1930.5927.7613.6110.7442.5972.4514.9133.8356.5259.6836.18
DINE-3D‡ [16]PointNet34.9032.1096.0240.6833.0843.2742.4430.0028.1150.3666.4230.3846.2359.0164.9946.53
3D-BBDA (Ours)PointNet15.3616.9593.6325.4914.5824.6723.0812.7010.5837.5059.5613.6028.6851.8453.0232.08
Source-onlyGDANet21.7327.1760.9539.9930.2723.2821.8124.4718.6717.8943.6721.1220.9664.8372.8334.03
BFTT3D [27]GDANet21.0828.0257.7636.4427.0421.9821.4921.5717.2416.7541.8720.1419.4963.3272.0632.36
PURGE-GATE (PG-SP†) [31]GDANet23.1829.7831.8537.8031.4824.3922.6524.3519.7717.9944.2522.0020.7965.3273.5832.61
DINE-3D‡ [16]GDANet39.0138.1363.3043.9443.3344.0442.8838.3834.6733.7055.1934.0642.8372.4374.8946.72
3D-BBDA (Ours)GDANet20.4723.1648.3733.1726.2721.5320.5519.9316.9115.4034.8018.1419.6158.6267.4029.62

Table 1 (PDF p. 5).

MethodBackboneunifgausbackgimpulup samprbfrbf-invden-decdens-incshearrotcutdistoclulidarMean ↓
Source-onlyPointNet52.7858.6889.5864.4150.6951.7449.3143.7541.4957.1260.4244.9751.3993.0695.1460.30
SHOT [15]PointNet57.837.785.066.258.464.164.734.033.663.767.234.659.691.091.660.6
DUA [17]PointNet71.956.786.178.368.870.965.237.134.469.974.036.768.892.490.866.8
TENT [25]PointNet59.838.583.864.359.264.362.934.633.664.164.933.060.491.289.960.3
BFTT3D [27]PointNet53.3057.9989.4165.6250.8751.3948.4442.3641.1556.6059.7243.7551.0492.8895.1459.98
PURGE-GATE (PG-SP†) [31]PointNet52.6759.5586.4064.2051.4652.6750.0944.2342.5156.9761.6245.0951.2993.1295.0160.46
DINE-3D‡ [16]PointNet65.1763.3490.3067.5360.8160.5558.2958.5255.5261.7370.2257.8864.3195.8795.9668.13
3D-BBDA (Ours)PointNet52.2657.4787.8563.5450.3552.4347.9242.3639.7656.4259.3843.9250.8792.8894.7959.48
Source-onlyGDANet71.1840.8083.1671.5375.0068.7568.5843.4035.5966.8471.7038.1970.8392.7194.1066.16
BFTT3D [27]GDANet72.5741.1583.1671.7074.4869.2769.1042.1934.3867.3671.1837.1571.1892.8894.1066.12
PURGE-GATE (PG-SP†) [31]GDANet71.0840.2879.3570.0575.0469.1968.6743.7235.8066.7871.4337.5270.7492.4393.6365.71
DINE-3D‡ [16]GDANet75.9052.1581.3075.9674.6473.9577.4555.5451.4678.4380.3251.7578.0888.1888.9372.27
3D-BBDA (Ours)GDANet71.3539.5882.2970.6675.3569.4468.0642.3634.2065.9771.7037.8569.7992.1993.7565.64

Table 2. Performance under ModelNet-40C corruptions with PointNet and GDANet (Trained from Scratch).

MethodBackboneunifgausbackgimpulup samprbfrbf-invden-decdens-incshearrotcutdistoclulidarMean ↓
Source-onlyPointNet52.7858.6889.5864.4150.6951.7449.3143.7541.4957.1260.4244.9751.3993.0695.1460.30
SHOT [15]PointNet57.837.785.066.258.464.164.734.033.663.767.234.659.691.091.660.6
DUA [17]PointNet71.956.786.178.368.870.965.237.134.469.974.036.768.892.490.866.8
TENT [25]PointNet59.838.583.864.359.264.362.934.633.664.164.933.060.491.289.960.3
BFTT3D [27]PointNet53.3057.9989.4165.6250.8751.3948.4442.3641.1556.6059.7243.7551.0492.8895.1459.98

Table 3. Performance under ScanObjectNN-C corruptions with PointNet and GDANet (Trained from Scratch).

Dist⁡(P,Gt)=∥1np∑i=1npfi∗−1nt∑i=1ntft∗∥22(11)\operatorname{Dist}(P,G_t)=\left\lVert\frac{1}{n_p}\sum_{i=1}^{n_p}f_i^*-\frac{1}{n_t}\sum_{i=1}^{n_t}f_{t}^{*}\right\rVert_2^2 \tag*{(11)}

where npn_p and ntn_t represent the number of prototype features and target features, respectively. Now, we introduce a kernel similarity matrix KK and a scaling matrix LL, which encodes similarities between prototypes and test data points as Ki,j=⟨ψ(xi),ψ(xj)⟩K_{i,j}=\langle\psi(x_i),\psi(x_j)\rangle. The value of Li,jL_{i,j} is defined as:

Li,j={1nt2if xi,xj∈Gt,1np2if xi,xj∈P,−1npntotherwise.(12)L_{i,j}= \begin{cases} \frac{1}{n_t^2} & \text{if } x_i,x_j\in G_t,\\ \frac{1}{n_p^2} & \text{if } x_i,x_j\in P,\\ -\frac{1}{n_p n_t} & \text{otherwise.} \end{cases} \tag*{(12)}

where xix_i and xjx_j are points being compared. The equation assigns values to Li,jL_{i,j} based on whether both points belong to the target domain (GtG_t), the prototype (PP), or are from different domains. To further refine the alignment, the transformation matrix WW is optimized by minimizing the trace regularization objective:

min⁡Wtr⁡(WTKLKW)+μtr⁡(WTW),(13)\min_W \operatorname{tr}(W^{T}KLKW)+\mu\operatorname{tr}(W^{T}W), \tag*{(13)}

where μ\mu controls the complexity of W∈R(np+nt)×mW\in\mathbb{R}^{(n_p+n_t)\times m}, and the centering matrix is H=I−1np+nt11T∈R(np+nt)×(np+nt)H=I-\frac{1}{n_p+n_t}\mathbf{1}\mathbf{1}^{T}\in\mathbb{R}^{(n_p+n_t)\times(n_p+n_t)}. The optimal solution of WW is obtained from the mm largest eigenvectors of (KLK+μI)−1KHK(KLK+\mu I)^{-1}KHK. The resulting transformation projects the target-derived prototypes (f∗f^*) and target features (ft∗f_t^*) in Eq. (11) into the shared latent subspace through WTK∈Rm×(np+nt)W^{T}K\in\mathbb{R}^{m\times(n_p+n_t)}, thereby reducing domain divergence. By aligning global statistics and local similarities, the model improves robustness under domain shift.

Weighted Prediction Module

In order to make our framework robust against the limited number of target samples, using alone the prediction from the alignment module might not work well as it deals with target features only. And we do not want to lose the information of the source model as it will be helpful in cases, where our target sample is close in distribution to the source domain. Additionally, using only the output from the source model might not work well due to the internal covariate shift arising because of the domain gap in source and target distribution. Thus, in order to incorporate the prediction from both, the source model and the alignment module, we adopt a weighted prediction module as:

lfinal=λ⋅ls+(1−λ)⋅lam(14)l_{\mathrm{final}}=\lambda\cdot l_s+(1-\lambda)\cdot l_{\mathrm{am}} \tag*{(14)}

Here, lsl_s is the logits obtained from the pre-trained source model, laml_{\mathrm{am}} is the logits obtained from the alignment module, lfinall_{\mathrm{final}} is the final logit which will be used for prediction, and λ\lambda is the weight assigned to the prediction from the source model. We use a predefined λ\lambda because we wanted to intentionally assign less weight to the source model’s predictions to reduce the impact of noisy labels on the final prediction. We treat λ\lambda as a fixed hyperparameter controlling the contribution of the source prediction. The originally reported benchmark-specific values were selected through one-time offline validation sweeps analogous to Table 6 and were subsequently kept fixed for all samples and corruption types within each benchmark. This validation uses labels only for offline hyperparameter selection and is not part of the adaptation pipeline; no target labels are accessed during pseudo-label generation, prototype construction, alignment, or inference. To assess whether 3D-BBDA depends on benchmark-specific selection, we additionally fix a single global λ=0.1\lambda=0.1 and transfer it unchanged across datasets. This setting still improves Source-only by +3.67, +1.06, and +2.76 percentage points on ModelNet40-C, ScanObjectNN-C, and ShapeNet-C, respectively (see Table 7). Table 11 shows that this strategy makes our framework less sensitive to noisy predictions.

DatasetSource-only ↓3D-BBDA ↓Gain ↑
ModelNet40-C35.8632.19+3.67
ScanObjectNN-C60.5559.49+1.06
ShapeNet-C35.8733.11+2.76
Average44.0941.59+2.49

Table 7. Performance with a single global fusion weight λ=0.1\lambda= 0.1 transferred unchanged across datasets using PointNet.

Noiseunifgausbackgimpulupsamprbfrbf-invden-decdens-incshearrotcutdistoclulidarMean ↓
5%15.3616.8793.8326.1014.6224.3123.4112.6210.2937.2163.3613.7329.2152.7852.7432.43
20%15.2417.0894.2827.3714.4625.2924.3512.3810.2138.6464.5813.3630.0252.2954.0032.90
50%14.9117.3694.9329.4514.0526.2324.3512.0510.7440.8567.6913.0331.6253.2756.2933.79
80%14.3417.6995.1031.9914.2228.1526.1012.5410.2942.6572.0213.8533.4655.1158.7035.08
100%14.8717.9795.0234.6015.0730.5127.9813.4810.9144.8573.8615.6936.5657.2759.5636.55

Table 11. Quality of the pseudo-labels over proposed 3D-BBDA.

MethodBackboneunifgausbackgimpulupsamprbfrbf-invden-decdens-incshearrotcutdistMean ↓
Source-onlyPointNet35.8722.9618.1048.4529.1143.6442.9120.0217.2749.2066.4621.9650.2935.86
BFTT3D [27]PointNet34.7623.8017.7843.6428.4440.5439.5619.4117.2044.4057.6121.1345.9033.40
PURGE-GATE (PG-SP†) [31]PointNet37.1924.3318.4650.3829.8244.3243.6120.5117.5349.6466.9222.3250.3836.57
DINE-3D‡ [16]PointNet59.7559.7357.6765.2259.7662.2063.2958.3957.6562.9564.7057.3663.0960.90
3D-BBDA (Ours)PointNet33.2923.2718.0843.1228.1437.0536.2319.5317.8443.1761.4620.9143.3832.74
Source-onlyGDANet29.3526.1413.6137.8215.5724.1724.0921.2916.3021.6833.1522.3223.1723.74
BFTT3D [27]GDANet44.8647.3828.1247.4328.0944.3843.8832.7728.9940.9856.7633.1744.7140.12
PURGE-GATE (PG-SP†) [31]GDANet30.6727.2314.1336.2515.7925.0225.1021.9317.3021.9334.1923.1324.2424.38
DINE-3D‡ [16]GDANet55.1155.4854.9953.0355.2756.2354.4353.6354.5455.0254.9252.6256.3754.74
3D-BBDA (Ours)GDANet27.4524.9013.8235.0915.8123.7023.3720.5416.2520.7631.0621.6522.7222.85

Table 3 (PDF p. 6).

Methodunifgausbackgimpulupsamprbfrbf-invden-decdens-incshearrotcutdistMean ↓
Source-only89.4557.2085.8589.8188.7989.7689.7131.4831.2889.5189.7631.5890.0273.40
BFTT3D [27]89.4557.2085.8089.8188.7989.7689.6131.4331.1789.5189.6631.4889.6673.33
PURGE-GATE (PG-SP†) [31]89.1157.2185.8489.4788.5589.3789.5231.3431.2489.3189.2631.6089.6773.19
DINE-3D‡ [16]91.2158.3390.0587.0391.7989.9386.0651.9351.2686.7485.6251.0190.7377.82
3D-BBDA (Ours)88.2255.9285.9188.1788.2288.2288.1230.6630.9288.8488.8431.3888.0172.42

Table 4. Performance under ShapeNet-C corruptions with PointNet and GDANet (Trained from Scratch).

Methodunifgausbackgimpulupsamprbfrbf-invden-decdens-incshearrotcutdistMean ↓
Source-only89.4557.2085.8589.8188.7989.7689.7131.4831.2889.5189.7631.5890.0273.40
BFTT3D [27]89.4557.2085.8089.8188.7989.7689.6131.4331.1789.5189.6631.4889.6673.33
PURGE-GATE (PG-SP†) [31]89.1157.2185.8489.4788.5589.3789.5231.3431.2489.3189.2631.6089.6773.19
DINE-3D‡ [16]91.2158.3390.0587.0391.7989.9386.0651.9351.2686.7485.6251.0190.7377.82
3D-BBDA (Ours)88.2255.9285.9188.1788.2288.2288.1230.6630.9288.8488.8431.3888.0172.42

Table 5. Performance under SydneyUrban-C corruptions with PointNet backbone (Trained from Scratch).

λ\lambda00.10.20.50.8
Mean Error (%) ↓54.4532.0832.7434.8535.57

Table 6. Sensitivity to fusion weight λ\lambda on ModelNet40-C with PointNet.

Experimental Setup

Datasets

ScanObjectNN-C [26]: 15 different corruptions are utilized to build this dataset from 581 samples (object-only test set) to evaluate robustness. ModelNet-40C [22]: It is a robust benchmark comprising 15 corruption types applied to the original 2468 test set samples, introducing real-world noise to evaluate our model on real-world challenges. ShapeNet-C [3]: It is a large-scale point cloud dataset with 51,127 shapes across 55 categories, with 13 types of corruptions to the test set similar to ModelNet-40-C [22]. SydneyUrban-C: Sydney Urban Objects Dataset [4] contains 631 urban road objects scanned with a Velodyne HDL-64E LIDAR, collected in Sydney, Australia. For experiments, we applied 13 types of corruptions to the test set, similar to ModelNet-40C [22], for 14 classes. It provides labeled real object instances and the LiDAR viewpoint.

Implementation Details

We use PyTorch library on NVIDIA A100 GPU (80GB). PointNet and GDANet are used as a backbone for source models. The batch size is 24, with 1024 points per sample and corruption severity 5. Target features and black-box pseudo-labels are accumulated across batches to construct the prototype memory; shared-subspace alignment is then performed in 128-sample blocks, with WW recomputed for each block. There are no gradient updates, just a single pass. For ModelNet-40C and ScanObjectNN-C datasets, λ\lambda value is 0.1 and 0.2, respectively. For ShapeNet-C and SydneyUrban-C, λ\lambda values are 0.05 for PointNet and 0.3 for the GDANet model. For evaluation metrics, we use average classification errors (%), a decrease in error represents improved performance. Backbones are trained from scratch (independently trained) for the source model on the corresponding clean training sets to validate robustness of 3D-BBDA. We utilize pre-trained PointNet backbone only for the ModelNet40 dataset. We use same hyperparameters as the baseline [27]. The point-NN model is used for a non-parametric network. While our evaluation focuses on established corruption benchmarks, these perturbations emulate common sensing and environmental effects encountered in robotics (e.g., noise, occlusion, density, and motion-induced distortions).

Native PURGE-GATE PG-SF operates on Transformer-specific CLS/Q/K representations and is therefore not directly applicable to PointNet/GDANet. We implement a controlled PG-SP port by applying purging to the earliest 64-D point-wise representation using source-derived embedding statistics with † as shown in Table 2-5.

DINE-3D‡ denotes a controlled feature-space port of DINE [16], originally proposed for 2D black-box domain adaptation. We use same frozen PointNN target features as 3D-BBDA while retaining DINE’s source-probability distillation, EMA memory, information-maximization, MixUp, and target fine-tuning objectives. Unlike 3D-BBDA, DINE-3D requires target-side backpropagation.

Results & Discussion

ModelNet-40C

Table 2 reports corruption robustness on ModelNet-40C. With PointNet, 3D-BBDA achieves lowest mean error (32.08%), improving over Source-only (35.88%) and BFTT3D (33.78%). Gains are particularly pronounced under challenging geometric and sensing shifts, including rotation (59.56 vs. 68.56), distortion (28.68 vs. 34.04), and impulse (25.49 vs. 31.93). With GDANet, 3D-BBDA further reduces mean error to 29.62%, outperforming Source-only (34.03%) and BFTT3D (32.36%). The strongest improvement occur under difficult corruptions such as occlusion (58.62 vs. 63.32) and lidar (67.40 vs. 72.06), showing that 3D-BBDA is effective across backbones. ScanObjectNN-C Table 3 summarizes results on ScanObjectNN-C, which exhibits stronger real-scan characteristics and larger shifts. Despite the increased difficulty, 3D-BBDA achieves the best mean error from 60.30% to 59.48% on PointNet and from 66.16% to 65.64% on GDANet. Improvements are consistent across many corruptions (e.g., uniform: −1.04% on PointNet and −1.22% on GDANet vs. BFTT3D), indicating stable adaptation even when pseudo-label noise is higher. We note that several UDA/SFDA baselines in Table 3 allow source access and/or gradient-based updates, which are outside our strict black-box, source-free, and backpropagation-free setting, prioritizing privacy-preserving adaptation and architectural flexibility. ShapeNet-C Table 4 shows that 3D-BBDA generalizes to the larger-scale ShapeNet-C benchmark. With PointNet trained from scratch, 3D-BBDA reduces mean error from 35.86% (Source-only) to 32.74% and improves over BFTT3D (33.40%), with notable gains under RBF/RBF-inv, shear, and distance shifts. With GDANet, 3D-BBDA achieves the lowest mean error (22.85%) compared to Source-only (23.74%), while BFTT3D degrades substantially (40.12%), suggesting that source-dependent prototype construction can be brittle when transferring across datasets and backbones. These results indicate that 3D-BBDA delivers more stable, backbone-robust adaptation under strict source-free constraints, while remaining competitive across a wide range of realistic corruption patterns.

SydneyUrban-C Table 5 evaluates robustness on SydneyUrban-C, a real-world LiDAR object dataset corrupted using the same protocol as ModelNet-40C [22]. Although absolute errors are high due to the stronger domain gap, 3D-BBDA consistently improves robustness over both Source-only and BFTT3D, reducing the mean error from 73.40% to 72.42%. These results provide evidence that the proposed black-box, backpropagation-free adaptation remains beneficial when moving from synthetic benchmarks to real LiDAR point clouds.

Qualitative comparison under various corruptions Figure 3 presents qualitative comparisons of point cloud classification performance under various corruption types, including background, cutout, distortion rbf, and Gaussian noise. While the baseline approaches (Source Only and BFTT3D) frequently misclassify corrupted samples, our proposed 3D-BBDA consistently preserves the correct semantic labels. These results highlight that 3D-BBDA effectively handles distributional shifts and maintains classification reliability.

Qualitative comparison of point-cloud classifications under common corruptions

Figure 3. Qualitative comparison under common corruptions on ModelNet-40C. 3D-BBDA better preserves correct predictions than Source-only and BFTT3D [27].

Ablation Analysis

Analysis of Module Contributions Through λ\lambda Table 8 analyzes the contribution of each component by varying λ\lambda (Eq. (14)). Case 1 (λ=1\lambda= 1): Using only the source model predictions yields a mean error of 35.86%, corresponding to the source-only baseline. Case 2 (λ=0\lambda= 0): Relying solely on the alignment module increases the mean error to 54.45%, indicating that alignment without the source prior is unstable under severe corruption. Case 3 (0<λ<10 < \lambda< 1): Combining both components reduces the mean error to 32.08%, outperforming either module individually. These results validate that the source model provides stable predictions when the target distribution is close to the source, while the alignment module captures domain-specific shifts. Their weighted fusion effectively balances generalization and adaptation, thereby improving robustness to corruption.

Casesettingλ\lambdaunifgausbackgimpulupsamprbfrbf-invden-decdens-incshearrotcutdistoclulidarMean ↓\downarrow
Case 1Source (lsl_s)114.6318.6895.3033.3915.0329.4627.6312.9310.4942.7172.8114.9534.8556.2859.0035.88
Case 2alignment module (laml_{am})046.0843.3892.4847.7946.5749.7150.2044.2042.7755.1572.7543.8755.2362.6663.9354.45
Case 3Combination of lsl_s and laml_{am}0.115.3616.9593.6325.4914.5824.6723.0812.7010.5837.5059.5613.6028.6851.8453.0232.08
0.214.2216.5094.7726.5913.6824.7522.7912.2110.2938.3263.7313.2830.6053.5955.7632.74
0.514.3817.6595.0631.3714.4627.7426.4312.5810.6240.7370.8714.6733.0554.9858.1734.85
0.814.5818.3495.1032.9714.8728.8027.2512.7510.5442.1672.3014.8334.6455.8858.6235.57

Table 8. Ablation on different λ\lambda values used in the weighted prediction module on the ModelNet-40C dataset with PointNet backbone.

Validating the Prototype-based Alignment Module

To evaluate the robustness of the prototype-based alignment module, we construct four disjoint subsets (aa, bb, cc, and dd), each containing 25% of the target samples, as shown in Table 9. Prototypes are generated from one subset while alignment is performed on another, enforcing generalization across unseen target samples. Across different prototype–alignment combinations, the proposed module consistently achieves lower error than the source-only baseline, demonstrating that the alignment mechanism effectively transfers information beyond the samples used for prototype construction.

Disjoint SetsAlignment setPrototype setMethodunifgausbackgimpulupsamprbfrbf-invden-decdens-incshearrotcutdistoclulidarMean ↓\downarrow
a,b,c,dab,c,dSource-only14.8719.2895.5132.8414.9529.4928.9213.2410.5443.3072.6314.3833.5058.1759.4036.07
ab,c,d3D-BBDA (Ours)15.9318.2293.8725.0015.6924.6728.1912.5011.5236.7672.3012.9129.5854.0054.6633.72
a,b,c,da,bc,dSource-only13.6420.5195.5132.0314.8729.0024.3514.3010.7043.2273.4515.3634.7255.5658.9935.75
a,bc,d3D-BBDA (Ours)15.2818.5594.2826.8815.2025.2521.2414.3010.5439.0576.0614.6230.4752.3755.0733.94
a,b,c,dc,da,bSource-only13.8318.6795.5032.0012.6731.1731.6712.339.8344.1771.3314.8334.1756.1760.6735.93
c,da,b3D-BBDA (Ours)16.0017.3390.3326.0014.5028.8324.8313.009.1756.0078.3314.8328.8353.3354.8335.08

Table 9. Ablation on the use of disjoint sets for prototype creation and alignment sets on ModelNet-40C dataset using PointNet for validation of our method. Here, aa, bb, cc, and dd are disjoint sets, each representing 25% of the target samples.

Effect of the Gaussian-perturbed prototype prior Figure 4 illustrates the effect of the Gaussian-perturbed prototype prior under sparse pseudo-label settings. By constructing a class-aligned prior from unlabeled Gaussian-perturbed target predictions and using it to complete missing class prototypes, the resulting prototype memory becomes more stable for shared-subspace alignment. As a result, 3D-BBDA with the Gaussian-perturbed prototype prior achieves lower error across most corruption types, with smaller gains under background corruption.

Error across ModelNet-40C corruptions with and without the Gaussian-perturbed prior

Figure 4. Error across ModelNet-40C corruptions with and without the Gaussian-perturbed prior.

Calibration Analysis

We evaluate prediction reliability using Expected Calibration Error (ECE), which measures the alignment between predicted confidence and empirical accuracy. Table 10 shows that 3D-BBDA consistently yields lower ECE values than BFTT3D across corruptions, indicating improved confidence calibration under domain shifts. Better calibration enhances reliability in safety-critical applications such as robotics and autonomous systems.

Methodunifgausbackgimpulupsamprbfrbf-invden-decdens-incshearrotcutdistoclulidarMean ↓
BFTT3D [27]0.5840.5390.0830.5240.6330.5290.5410.6280.6420.4920.2970.5940.5210.5720.7420.528
3D-BBDA (Ours)0.4420.4210.1420.4480.4860.4090.4250.5750.5840.3110.0490.5720.4070.3700.3780.401

Table 10. Comparison of ECE between BFTT3D and 3D-BBDA on ModelNet-40C.

Sensitivity to noisy pseudo-labels and scalability on real-world

Table 11 analyzes robustness to noisy pseudo-labels. Although performance degrades as noise increases, the reduction is gradual rather than catastrophic. Even under substantial noise levels, the method maintains stable performance, suggesting resilience to imperfect pseudo-labels that may arise from real-world sensing variability.

Computational overhead

Table 12 reports the per-sample inference time, where 3D-BBDA requires 7.12 ms/sample compared with 6.03 ms/sample for standard inference, corresponding to a 1.09 ms prediction-stage overhead. Table 13 further separates the additional buffer/block-level adaptation costs from per-sample prediction. Prototype construction is performed once for the accumulated target buffer, while shared-subspace alignment is recomputed for each 128-sample target block. Each target sample requires one forward pass through the frozen source model, with no backward pass or parameter update.

Inferenceunifgausbackgimpulupsamprbfrbf-invden-decdens-incshearrotcutdistoclulidarMean
Standard3.305.376.016.256.326.286.296.286.336.376.346.336.346.336.356.03
Adapted8.797.957.717.297.167.026.926.896.876.796.746.716.686.676.617.12

Table 12. Standard vs. adapted inference time (ms) across ModelNet40-C corruptions.

OperationFrequencyTime
Prototype constructionper target buffer198.29 ms
Gaussian prior/completionper target condition350.65 ms
Shared-subspace alignmentper 128-sample target block669.26 ms
Standard inferenceper sample6.03 ms
Prediction-stage inferenceper sample7.12 ms

Table 13. Runtime decomposition of 3D-BBDA on ModelNet40-C with PointNet. Buffer/block-level adaptation costs are reported.

Effect of Shared-Subspace Alignment

We ablate the shared-subspace transformation WW by comparing prototype-based prediction with and without WW as given in Table 14. On ModelNet40-C/PointNet, incorporating WW reduces the mean error from 33.47% to 32.08%, an improvement of 1.39%. This confirms that shared-subspace alignment provides additional benefit beyond prototype-based prediction alone.

VariantError ↓
With WW32.08
Without WW33.47

Table 14. Effect of WW (mean error, %).

Conclusion

We proposed 3D-BBDA, a backpropagation-free black-box domain adaptation framework for 3D point cloud classification that requires neither source data nor source model internals. The method combines pseudo-label guided prototype alignment with a Gaussian-perturbed prototype prior completion strategy to stabilize adaptation under sparse pseudo-labels, and a weighted prediction module to balance source priors with target-specific correction. Experiments on multiple corrupted 3D benchmarks demonstrate consistent robustness gains with minimal overhead, enabling real-time and privacy-preserving deployment. We validate robustness and real-time feasibility via standard corruption benchmarks and inference overhead measurements.

Acknowledgments

This work was supported by Indian Space Research Organisation under Grant No. RespondAI, P.No.ISRO/RES/3/1147/26-27. Shivangi Rai gratefully acknowledges the financial support provided through the Visvesvaraya PhD Fellowship by the Ministry of Electronics and Information Technology (MeitY), Government of India.

Detailed Comparison with BFTT3D

BFTT3D is the closest prior method to 3D-BBDA because both avoid test-time backpropagation and employ non-parametric target representations together with prototype-based shared-subspace alignment. The primary methodological distinction is therefore not the introduction of a completely new subspace-alignment objective, but the re-formulation of this pipeline under a stricter source-free, logits-only black-box interface. Table 4 summarizes the component-wise relationship.

The distinction in Table 4 also clarifies which parts of the pipeline are retained rather than newly derived. 3D-BBDA does not claim the shared-subspace alignment objective itself as a new contribution. Instead, the method changes the information available to this alignment: source-derived memory is removed and replaced by pseudo-label-guided target prototypes, missing classes are completed from an unlabeled Gaussian-perturbed target prior, and the resulting alignment prediction is fused with the black-box source prediction. These changes are what enable the alignment framework to operate under the joint source-free, black-box, and backpropagation-free constraints.

Algorithm

Algorithm 1 summarizes the complete 3D-BBDA inference procedure. The method first constructs a fixed target-derived prototype memory from accumulated features and pseudo-labels, then performs block-wise shared-subspace alignment and weighted prediction fusion.

When Does 3D-BBDA Provide Larger Gains?

The main experiments show that the magnitude of adaptation gain varies substantially across datasets and corruption types. To better understand this behavior, we analyze three properties of the black-box pseudo-label stream: source confidence, predictive entropy, and pseudo-label class coverage. Table 1 summarizes these dataset-level diagnostics together with the corresponding adaptation gains.

For target sample xitx_i^t, let ps(y∣xit)p_s(y \mid x_i^t) denote the softmax probability obtained from the black-box source logits. We compute the mean source confidence as

Conf=1nt∑i=1ntmax⁡cps(c∣xit),\mathrm{Conf} = \frac{1}{n_t}\sum_{i=1}^{n_t}\max_c p_s(c \mid x_i^t),

and normalized predictive entropy as

Ent=−1ntlog⁡C∑i=1nt∑c=1Cps(c∣xit)log⁡ps(c∣xit).\mathrm{Ent} = -\frac{1}{n_t \log C}\sum_{i=1}^{n_t}\sum_{c=1}^{C}p_s(c \mid x_i^t)\log p_s(c \mid x_i^t).

Pseudo-label class coverage is defined as the fraction of the CC classes receiving at least one pseudo-labeled target sample before Gaussian-prior completion.

To obtain a finer-grained view, we pool the 43 corruption conditions from ModelNet40-C, ScanObjectNN-C, and ShapeNet-C and measure the Pearson correlation between the available pseudo-label diagnostics and the adaptation gain. The resulting correlations are reported in Table 2.

The strongest relationship is observed for source-prediction uncertainty. Lower source confidence is associated with larger adaptation gains (r=−0.515r = -0.515), while higher predictive entropy is associated with larger gains (r=0.471r = 0.471). This is consistent with 3D-BBDA being most

DatasetConfidenceEntropyCoverage (%)Gain (%) ↑
ModelNet40-C0.5330.55996.173.68
ScanObjectNN-C0.7030.31599.110.70
ShapeNet-C0.9130.05798.322.16

Table 1 (PDF p. 11). Dataset-level diagnostic statistics for the controlled PointNet analysis. Gain is the reduction in classification error relative to Source-only. These statistics are used only to understand the behavior of the adaptation mechanism and do not replace the primary benchmark results.

Diagnosticrr with gainpp
Source confidence−0.515-0.5150.0004
Predictive entropy+0.471+0.4710.0014
Class coverage−0.288-0.2880.0608
Missing classes+0.315+0.3150.0394
DatasetCorruptionGain (%) ↑\uparrow
ModelNet40-CRotation+10.86
Impulse+8.06
Distortion+6.12
LiDAR+5.88
Density-inc.+0.04
ShapeNet-CRBF-inv+4.53
RBF+4.09
Distortion+3.87
Shear+3.78
Density-inc.≈0\approx0

Table 2 (PDF p. 11). Correlation between black-box pseudo-label diagnostics and the adaptation gain across 43 corruption conditions. These results are diagnostic rather than causal.

caption: Examples of large and near-zero adaptation gains. Gains are reported as the reduction in error relative to the corresponding Source-only prediction.

:::

useful when the source prediction is degraded enough that the target-derived prototype branch can provide a complementary correction.

Representative examples of large and near-zero adaptation gains are reported in Table 3.

Importantly, this trend should not be interpreted as “lower confidence always implies better adaptation.” The target pseudo-labels must remain sufficiently informative to construct meaningful class prototypes. If the black-box predictor becomes confidently wrong or collapses its predictions onto only a subset of classes, the target-derived prototype memory can also become biased.

SydneyUrban-C provides a useful complementary failure mode. The black-box source predictor has high mean confidence (0.940) and low predictive entropy (0.063), but its pseudo-label stream covers only approximately 68.1% of the 14-class label space, corresponding to about 4.46 missing classes on average before completion. Thus, high confidence does not necessarily imply a high-quality pseudo-label distribution: the predictor can be confidently concentrated on an incomplete subset of classes.

The Gaussian prior prevents such missing classes from leaving the prototype memory undefined, but it cannot fully recover the class-discriminative information that is absent from the original pseudo-label assignments. This helps explain why the improvement on SydneyUrban-C is positive but comparatively modest.

Overall, these diagnostics suggest that 3D-BBDA benefits most from an intermediate regime: source predictions are sufficiently degraded for target-side correction to be useful, but remain sufficiently informative to form meaningful pseudo-label groups. Very confident class collapse and extremely noisy pseudo-label streams both restrict the amount of useful corrective information available to the prototype branch. We emphasize that this analysis establishes empirical associations rather than a causal prediction rule for adaptation gain.

Details of Controlled Recent Baseline Ports

Recent adaptation methods differ substantially in the information they assume available at test time. We therefore distinguish native implementations from controlled ports and explicitly document the access assumptions used for each comparison. Table 5 summarizes the information-access and architecture assumptions of these recent baselines.

Controlled PURGE-GATE yazdanpanah2025purge Port

Native PURGE-GATE PG-SF is designed for Transformer point-cloud architectures and relies on CLS and attention Q/K representations. These quantities are not available in PointNet or GDANet and, more importantly, would not be accessible through the logits-only black-box interface assumed by 3D-BBDA.

For the PointNet/GDANet comparison, we therefore construct a controlled PG-SP{sup}†` port. Purging is applied to the earliest 64-dimensional point-wise representation available in each backbone, and source-derived embedding statistics are used according to the PG-SP formulation. No target-side backpropagation is performed.

Controlled 2D3D DINE liang2022dine Port

DINE was originally proposed for domain adaptation from black-box 2D predictors. To evaluate whether a direct transfer of a 2D BBDA objective is sufficient for the 3D corruption setting, we construct DINE-3D{sup}‡` as a controlled feature-space port.

For comparability, DINE-3D uses the same frozen PointNN target representation used by 3D-BBDA. We retain the principal optimization components of DINE, including source-probability distillation, EMA-based prediction memory, information-maximization objectives, MixUp, and target-side fine-tuning. Consequently, unlike 3D-BBDA, DINE-3D requires backpropagation through the target-side adaptation model. As shown in Table 6, the direct DINE port does not transfer favorably to these 3D corruption benchmarks. For example, on ModelNet40-C/PointNet its mean error is 46.53%, compared with 35.88% for Source-only and 32.08% for 3D-BBDA. A similar degradation is observed across the remaining dataset/backbone combinations.

We emphasize that this experiment should not be interpreted as showing that the original DINE method is intrinsically unsuitable for 3D data. DINE-3D{sup}‡` is a controlled feature-space port designed to answer a narrower question raised by the reviewers: whether directly transferring an established 2D black-box adaptation objective to the same 3D target representation is sufficient. Under this controlled transfer, the answer is negative.

AspectBFTT3D3D-BBDA (Ours)
Problem settingBackpropagation-free 3D test-time adaptation.Source-free, logits-only black-box, and backpropagation-free 3D adaptation.
Core intuitionConstruct a prototype memory and align target representations with this memory without gradient-based parameter updates.Retain prototype-based alignment while replacing source-dependent adaptation memory with a memory constructed entirely from unlabeled target data and black-box predictions.
Source data during adaptationRequired for constructing the source-derived adaptation memory.Not required.
Source-model interfaceUses source-derived feature/prototype information.Frozen source model is accessed only through its final predictions/logits.
Test-time backpropagationNo.No.
Target representationNon-parametric target representation.Frozen PointNN representation independent of the source-model architecture.
Prototype sourceSource-derived feature memory.Unlabeled target features grouped according to black-box pseudo-labels.
Prototype constructionPrototype/memory information originates from the source domain.For each pseudo-class, accumulated target features assigned to that class are averaged to construct the class prototype.
Missing-class prototypesNo explicit target-only completion mechanism.Missing pseudo-label classes are completed using the Gaussian-perturbed target prototype prior.
Shared-subspace alignmentAligns source-derived prototype memory with target features.Retains the shared-subspace alignment principle, but replaces source-derived memory with completed target-derived prototypes. WW is estimated from target-derived prototypes and target features.
Role of source samples in alignmentSource information enters through the source-derived adaptation memory.No source samples or source features participate in the alignment; the alignment depends only on npn_p target-derived prototypes and target features.
Prediction from alignmentPrototype/alignment similarity provides the adapted prediction.Prototype similarities provide alignment logits ℓam\ell_{am} after target-only prototype completion and shared-subspace projection.
Use of source predictionNo explicit weighted source/alignment logit fusion.Black-box source logits are retained and fused with alignment logits: ℓfinal=λℓs+(1−λ)ℓam\ell_{\mathrm{final}} = \lambda\ell_s + (1-\lambda)\ell_{am}.
Robustness to incomplete pseudo-label coverageRelies on the source-derived prototype memory.Gaussian completion explicitly maintains a class-complete prototype memory when target pseudo-label assignments are incomplete.
Adaptation memorySource-derived memory whose size depends on the stored source representations.One completed target-derived prototype per class; memory therefore grows linearly with CC.
Memory entries (C=55C = 55)8,907.55 (161.9 ×\times fewer).
Alignment-system size (C=55C = 55)9,035.183.
Architecture/interface dependenceRequires the source-derived information needed to construct its prototype memory.Source architecture is opaque to the adaptation mechanism; only its final predictions are consumed.
Contribution boundaryBackpropagation-free prototype-based 3D test-time adaptation.Retains the prototype/shared-subspace alignment principle but reformulates it for strict source-free black-box deployment through target-only prototype construction, Gaussian missing-class completion, and source/alignment prediction fusion.

Table 4 (PDF p. 13). Detailed methodological comparison between BFTT3D and 3D-BBDA. 3D-BBDA retains the prototype-based shared-subspace alignment principle but removes source-derived adaptation memory. The memory and alignment-system sizes correspond to ShapeNet-C with C=55C = 55 and PointNet.

MethodSource dataSource internalsTarget BPArchitecture-specificEvaluation type
3D-BBDANoNo (logits only)NoNoNative
PURGE-GATE PG-SFNoCLS/Q/KNoTransformerNative method
PURGE-GATE PG-SP†Source-derived statisticsPoint featuresNoControlled portPointNet/GDANet
DINE-3D‡NoSource probabilities onlyYesNoControlled 2D→3D port
LN-TTANoLN/token representationsNoTransformerPointTransformer only

Table 5 (PDF p. 14). Information-access assumptions of the recent baselines. † denotes our controlled PointNet/GDANet port of PURGE-GATE PG-SP. ‡ denotes our controlled feature-space baselines port of the 2D black-box adaptation method DINE.

DatasetBackbonePG-SP†DINE-3D‡3D-BBDA
ModelNet40-CPointNet36.1846.5332.08
GDANet32.6146.7229.62
ScanObjectNN-CPointNet60.4668.2959.48
GDANet65.7172.2765.64
ShapeNet-CPointNet36.5760.9032.74
GDANet24.3854.7422.85
SydneyUrban-CPointNet73.1977.8272.42

Table 6 (PDF p. 14). Mean corruption error (%, ↓) for the controlled PURGE-GATE and DINE ports.

Comparison with LN-TTA [32]

LN-TTA is a recent backpropagation-free test-time adaptation method designed for Transformer-based point-cloud architectures. Its adaptation mechanism relies on LayerNorm-related representations and Transformer-specific tokens, including the CLS token. In contrast, the PointNet and GDANet backbones used in our main experiments are BatchNorm-based architectures and do not provide these Transformer-specific representations.

Consequently, LN-TTA cannot be applied unchanged under our PointNet/GDANet evaluation protocol. A numerical comparison would require either replacing the source backbone with a Transformer or modifying LN-TTA to operate on representations for which its original adaptation mechanism was not defined. Such a comparison would therefore conflate the adaptation method with a change in backbone or constitute a non-equivalent reimplementation.

We therefore do not include LN-TTA in the main quantitative tables. Instead, we explicitly report this architectural incompatibility. This distinction also highlights the difference in deployment assumptions: LN-TTA requires access to specific internal LayerNorm/token representations, whereas 3D-BBDA treats the frozen source model as a black box and accesses only its final prediction outputs.

Algorithm 1 3D-BBDA inference procedure.

Input: Source-trained black-box predictor FSF_S, unlabeled target-domain data {xi}i=1nt\{x_i\}_{i=1}^{n_t}, non-parametric network FnnF_{nn}.

Output: Predicted target labels {yi}i=1nt\{y_i\}_{i=1}^{n_t}.

  1. Extract target features {ft,i}i=1nt\{f_{t,i}\}_{i=1}^{n_t} using FnnF_{nn} (Eqs. (1)–(5)).

  2. Query FSF_S once for each target sample to obtain source logits ls,il_{s,i} and pseudo-labels y^i\hat{y}_i.

  3. Accumulate target features and pseudo-labels and construct class prototypes {Pi}\{P_i\} using Eq. (6).

  4. Complete missing class prototypes using the Gaussian-perturbed prototype prior (Eqs. (7)–(8)).

  5. Partition the target samples into alignment blocks of 128 samples.

  6. for each target alignment block do

  7. &nbsp;&nbsp;&nbsp;&nbsp;Compute the shared-subspace transformation WW using the fixed prototype memory and current target block (Eqs. (11)–(13)).

  8. &nbsp;&nbsp;&nbsp;&nbsp;Compute prototype similarities and alignment logits laml_{am} (Eqs. (9)–(10)).

  9. &nbsp;&nbsp;&nbsp;&nbsp;Fuse source and alignment logits using Eq. (14):

lfinal=λls+(1−λ)lam.l_{\mathrm{final}} = \lambda l_s + (1-\lambda)l_{am}.
  1. end for

  2. Return predicted target labels {yi}i=1nt\{y_i\}_{i=1}^{n_t} from lfinall_{\mathrm{final}}.

References

  1. [1]Malik Boudiaf, Romain Mueller, Ismail Ben Ayed, and Luca Bertinetto. Parameter-free online test-time adaptation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 8344–8353, 2022. 5arxiv.org/abs/2201.05718
  2. [2]Adriano Cardace, Riccardo Spiezia, Pierluigi Zama Ramirez, Samuele Salti, and Luigi Di Stefano. Self-distillation for unsupervised 3d domain adaptation. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, pages 4166–4177, 2023. 2, 3arxiv.org/abs/2210.08226
  3. [3]Hamidreza Dastmalchi, Aijun An, Ali Cheraghian, Shafin Rahman, and Sameera Ramasinghe. Test-time adaptation of 3d point clouds via denoising diffusion models. In 2025 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV), pages 1566–1576. IEEE, 2025. 6arxiv.org/abs/2411.14495
  4. [4]Mark De Deuge, Alastair Quadros, Calvin Hung, and Bertrand Douillard. Unsupervised feature learning for classification of outdoor 3d scans. In Australasian Conference on Robotics and Automation (ACRA), 2013. Accessed: 2026-03-02. 6
  5. [5]Jianshe Duan, Yachao Zhang, and Yanyun Qu. Source-free domain adaptation for point cloud semantic segmentation. In 2024 IEEE International Conference on Multimedia and Expo (ICME), pages 1–6. IEEE, 2024. 3DOI
  6. [6]Christian Fruhwith-Reisinger, Michael Opitz, Horst Possegger, and Horst Bischof. Fast3d: Flow-aware self-training for 3d object detectors. arXiv preprint arXiv:2110.09355, 2021. 2
  7. [7]Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, François Laviolette, Mario March, and Victor Lempitsky. Domain-adversarial training of neural networks. Journal of machine learning research, 17(59):1–35, 2016. 1arxiv.org/abs/1505.07818
  8. [8]Deepti Hegde and Vishal M Patel. Attentive prototypes for source-free unsupervised domain adaptive 3d object detection. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, pages 3066–3076, 2024. 3
  9. [9]Deepti Hegde, Vetal Kilic, Vishwanath Sindagi, A Brinton Cooper, Mark Foster, and Vishal M Patel. Source-free unsupervised domain adaptation for 3d object detection in adverse weather. In 2023 IEEE International Conference on Robotics and Automation (ICRA), pages 6973–6980. IEEE, 2023. 3
  10. [10]Jincen Jiang, Qianyu Zhou, Yuhang Li, Xinkui Zhao, Meili Wang, Lizhuang Ma, Jian Chang, Jian Jun Zhang, and Xuequan Lu. Pcotta: Continual test-time adaptation for multi-task point cloud understanding. arXiv preprint arXiv:2411.00632, 2024. 3
  11. [11]Jingjing Li, Zhiqi Yu, Zhekai Du, Lei Zhu, and Heng Tao Shen. A comprehensive survey on source-free domain adaptation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2024. 1, 3DOI
  12. [12]Qing Li, Chuan Yan, Qi Hao, Xiaojiang Peng, and Li Liu. Graph attentive dual ensemble learning for unsupervised domain adaptation on point clouds. Pattern Recognition, page 110690, 2024. 3
  13. [13]Yanghao Li, Naiyan Wang, Jianping Shi, Jiaying Liu, and Xiaodi Hou. Revisiting batch normalization for practical domain adaptation. arXiv preprint arXiv:1603.04779, 2016. 5arxiv.org/abs/1603.04779
  14. [14]Yinghui Li, Qianyu Zhou, Jingyu Gong, Ye Zhu, Richard Dazeley, Xinkui Zhao, and Xuequan Lu. Dopoint: Domain adaptive point transformer for point cloud completion. arXiv preprint arXiv:2412.19062, 2024. 2
  15. [15]Jian Liang, Dapeng Hu, and Jiashi Feng. Do we really need to access the source data? source hypothesis transfer for unsupervised domain adaptation. In International conference on machine learning, pages 6028–6039. PMLR, 2020. 1, 5arxiv.org/abs/2002.08546
  16. [16]Jian Liang, Dapeng Hu, Jiashi Feng, and Ran He. Dine: Domain adaptation from single and multiple black-box predictors. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 8003–8013, 2022. 1, 2, 5, 6
  17. [17]M Jehanzeb Mirza, Jakub Micorek, Horst Possegger, and Horst Bischof. The norm must go on: Dynamic unsupervised domain adaptation by normalization. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 14765–14775, 2022. 5arxiv.org/abs/2112.00463
  18. [18]Charles R Qi, Hao Su, Kaichun Mo, and Leonidas J Guibas. Pointnet: Deep learning on point sets for 3d classification and segmentation. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 652–660, 2017. 2
  19. [19]Can Qin, Haoxuan You, Lichen Wang, C-C Jay Kuo, and Yun Fu. Pointdan: A multi-scale 3d domain adaptation network for point cloud representation. Advances in Neural Information Processing Systems, 32, 2019. 1
  20. [20]Shivangi Rai, Rini Smita Thakur, Kunal Jangid, and Vinod K Kurmi. Label calibration in source free domain adaptation. In 2025 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV), pages 6446–6455. IEEE, 2025. 1arxiv.org/abs/2501.07072
  21. [21]Yu Ren, Yang Cong, Jiahua Dong, and Gan Sun. Unisda: Universal 3d domain adaptation for object recognition. IEEE Transactions on Circuits and Systems for Video Technology, 33(1):379–392, 2022. 1
  22. [22]Jiachen Sun, Qingzhao Zhang, Bhavya Kailkhura, Zhidong Yu, Chaowei Xiao, and Z Morley Mao. Benchmarking robustness of 3d point cloud recognition against common corruptions. arXiv preprint arXiv:2201.12296, 2022. 6, 7
  23. [23]Eric Tzeng, Judy Hoffman, Kate Saenko, and Trevor Darrell. Adversarial discriminative domain adaptation. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 7167–7176, 2017. 1
  24. [24]Tuan-Anh Vu, Srinijay Sarkar, Zhiyuan Zhang, Binh-Son Hua, and Sai-Kit Yeung. Test-time augmentation for 3d point cloud classification and segmentation. In 2024 International Conference on 3D Vision (3DV), pages 1543–1553. IEEE, 2024. 3
  25. [25]Dequan Wang, Evan Shelhamer, Shaoteng Liu, Bruno Olshausen, and Trevor Darrell. Tent: Fully test-time adaptation by entropy minimization. arXiv preprint arXiv:2006.10726, 2020. 3, 5arxiv.org/abs/2006.10726
  26. [26]Jie Wang, Lihe Ding, Tingfa Xu, Shaocong Dong, Xinli Xu, Long Bai, and Jianan Li. Sample-adaptive augmentation for point cloud recognition against real-world corruptions. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 14330–14339, 2023. 6arxiv.org/abs/2309.10431
  27. [27]Yanshuo Wang, Ali Cheraghian, Zeeshan Hayder, Jie Hong, Sameera Ramasinghe, Shafin Rahman, David Ahmedt-Aristizabal, Xuesong Li, Lars Petersson, and Mehrtash Harandi. Backpropagation-free network for 3d test-time adaptation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 23231–23241, 2024. 2, 3, 4, 5, 6, 7, 8arxiv.org/abs/2403.18442
  28. [28]Yanshuo Wang, Jie Hong, Ali Cheraghian, Shafin Rahman, David Ahmedt-Aristizabal, Lars Petersson, and Mehrtash Harandi. Continual test-time domain adaptation via dynamic sample selection. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, pages 1701–1710, 2024. 5
  29. [29]Zeqi Xiao, Wei Zhang, Tai Wang, Chen Change Loy, Dahua Lin, and Jiangmiao Pang. Position-guided point cloud panoptic segmentation transformer. International Journal of Computer Vision, pages 1–16, 2024. 2arxiv.org/abs/2303.13509
  30. [30]Mutian Xu, Junhao Zhang, Zhipeng Zhou, Mingye Xu, Xiaojuan Qi, and Yu Qiao. Learning geometry-disentangled representation for complementary understanding of 3d object cloud. In Proceedings of the AAAI conference on artificial intelligence, pages 3056–3064, 2021. 2
  31. [31]Moslem Yazdanpanah, Ali Bahri, Mehrdad Noori, Sahar Dastani, Gustavo Adolfo Vargas Hakim, David Osowiechi, Ismail Ben Ayed, and Christian Desrosiers. Purge-gate: Backpropagation-free test-time adaptation for point clouds classification via token purging. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 27640–27649, 2025. 5, 6, 2arxiv.org/abs/2509.09785
  32. [32]Moslem Yazdanpanah, Ali Bahri, Mehrdad Noori, Sahar Dastani, Samuel Barbeau, David Osowiechi, Gustavo Adolfo Vargas Hakim, Ismail Ben Ayed, and Christian Desrosiers. Revisiting layer normalization for point cloud test time adaptation. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, pages 537–546, 2026. 4DOI
  33. [33]Jingyi Zhang, Jiaxing Huang, Xueying Jiang, and Shijian Lu. Black-box unsupervised domain adaptation with bi-directional atkinson-shiffrin memory. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 11771–11782, 2023. 2arxiv.org/abs/2308.13236
  34. [34]Renrui Zhang, Liuhui Wang, Ziyu Guo, Yali Wang, Peng Gao, Hongsheng Li, and Jianbo Shi. Parameter is not all you need: Starting from non-parametric networks for 3d point cloud analysis. arXiv preprint arXiv:2303.08134, 2023. 3arxiv.org/abs/2303.08134
  35. [35]Weichen Zhang, Wen Li, and Dong Xu. Srdan: Scale-aware and range-aware domain adaptation network for cross-dataset 3d object detection. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 6769–6779, 2021. 2DOI
  36. [36]Youjia Zhang, Younggeun Kim, Young-Geun Choi, Hongyeob Kim, Huiling Liu, and Sungeun Hong. Backpropagation-free test-time adaptation via probabilistic gaussian alignment. arXiv preprint arXiv:2508.15568, 2025. 2arxiv.org/abs/2508.15568
  37. [37]Tianpei Zou, Sanqing Qu, Zhijun Li, Alois Knoll, Lianghua He, Guang Chen, and Changjun Jiang. Hgl: Hierarchical geometry learning for test-time adaptation in 3d point cloud segmentation. In European Conference on Computer Vision, pages 19–36. Springer, 2025. 3arxiv.org/abs/2407.12387

Paper details

vlnc:W_gmrndcbs
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents