Pith. sign in

REVIEW 4 major objections 3 minor 1 cited by

Learning by Teaching: Engaging Students as Instructors of Large Language Models in Computer Science Education

T0 review · 4 major / 3 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper proposes ETA, a test-time adaptation method that minimizes a learned energy score to align depth predictions with the source distribution.

desk verdict The abstract promises an education study that isn't in the paper; the full text is a competent depth-completion TTA paper, and only the latter deserves a look. read the letter →

arxiv 2508.05979 v1 pith:GHJVDDNB submitted 2025-08-08 cs.CY cs.AIcs.HC

Xinming Yang , Haasil Pujara , Jun Li This is my paper
classification cs.CYcs.AIcs.HC
keywords depthcompletiontest-timeadaptationenergy-basedmodeldomainshiftadversarialperturbationssparseautonomousdrivingdenseregression
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper presents ETA, a method for adapting pretrained depth completion models to new environments at test time, without ground truth or multiple passes over target data. The central claim is that a patch-based energy model, trained on source data plus adversarially perturbed examples, can score how source-like each region of a predicted depth map is; minimizing that energy while updating only a small adaptation layer brings test-time predictions back in line with the training distribution. Across three indoor and three outdoor datasets, ETA consistently lowers MAE and RMSE relative to prior test-time adaptation baselines. The abstract of this submission describes a separate study in which students teach LLMs; the full text is the depth-completion work described here.

What carries the argument

The central object is the energy-based model $E_\phi$: a convolutional network that outputs a patch-wise energy map $e$ for a predicted dense depth map, conditioned on the sparse depth map. Energy is linked to prediction error through the target $y = 1 - \exp(-\Delta/\tau)$, where $\Delta$ is patch MSE; low energy corresponds to source-like, high energy to out-of-distribution. Out-of-distribution training examples are synthesized with FGSM adversarial perturbations of the RGB image and sparse depth. Test-time adaptation updates only the inserted adaptation layer $m_\psi$ (and BatchNorm statistics) to minimize $L_{\mathrm{adapt}} = w_e \ell_{\mathrm{energy}} + w_z \ell_{\mathrm{sparse}} + w_s

What would settle it

Take a pretrained depth completion model and a target shift that is not adversarial in character — for example, adding defocus blur to RGB inputs or changing the LiDAR beam pattern — then run ETA and check whether the energy-minimized predictions reduce error relative to the unadapted model. If the energy model assigns low energy to severely wrong predictions on such shifts, the adversarial-proxy premise fails.

Watch

Extended reading notes

Core claim

The paper claims that depth completion models, when transferred to a target domain with covariate shift, can be adapted on the fly by treating the source distribution as an energy landscape. An energy model $E_\phi$ maps a predicted depth map, conditioned on the sparse depth input, to a low-resolution map of per-patch energy, where low energy means 'likely under the source distribution'. The energy model is trained by assigning high target energy to predictions from adversarially perturbed inputs (FGSM), whose errors stand in for out-of-distribution shifts. At test time, only a lightweight adaptation layer and BatchNorm statistics are updated to minimize a weighted combination of energy, spa

Load-bearing premise

Adversarial perturbations of source inputs are a faithful stand-in for the out-of-distribution data a depth model will meet at deployment, so an energy model trained on those perturbations will learn a useful notion of 'source-like' predictions.

Editorial extensions

If this is right

  • Depth completion models can be specialized to a new environment in a single forward-backward pass per batch, without retraining or target ground truth.
  • Region-level energy localizes corrections, so adaptation can fix specific areas of the depth map instead of applying uniform global updates.
  • A single energy model generalizes across multiple target domains because adversarial perturbations cover a broad range of out-of-distribution variations.
  • The same energy-minimization principle extends to other dense regression tasks such as optical flow, surface normal prediction, and medical image segmentation.
  • Because only a small adaptation layer is updated, the risk of catastrophic forgetting during test-time optimization is reduced.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The abstract and full text describe different papers; any claim about the education study (statistically significant improvements in student performance) is not supported by the content of this submission.
  • The weakest conceptual link — flagged by the paper's own Limitations section — is the premise that FGSM perturbations produce out-of-distribution examples representative of real deployment shifts; if real shifts are non-adversarial, the energy model may encode the source model's failure modes rather than the target environment.
  • A testable extension: evaluate ETA on non-adversarial corruptions (defocus blur, sensor noise, LiDAR density changes) and check whether energy maps still predict per-patch error; this would tell whether the adversarial proxy is load-bearing.
  • Since the energy model is trained conditioned on a specific depth network's parameters, a practical follow-up would be to train an architecture-agnostic energy model to enable cross-model deployment.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 3 minor

Summary. The submitted manuscript pairs a cs.CY title/abstract describing a CS education study ('Learning by Teaching: Engaging Students as Instructors of Large Language Models') with a full text that is a computer-vision paper titled 'ETA: Energy-based Test-time Adaptation for Depth Completion' by a different author group. The abstract claims that the proposed Socrates active-learning method 'led to statistically significant improvements in student performance compared to historical cohorts,' but the body contains no course description, no Socrates system, no cohort comparison, and no statistical test. The full-text paper instead proposes an energy-based test-time adaptation method for depth completion: it trains an energy model on source predictions and FGSM-perturbed versions of them (Eqs. 5–7) and then updates a lightweight adaptation module at test time by minimizing an energy-based loss (Eqs. 8–11). The body reports consistent MAE/RMSE improvements over baselines across three indoor and three outdoor datasets and four depth-completion architectures (Tables 1–4).

Significance. If the abstract's education claim were substantiated, it would be a practically valuable contribution to CS education. However, that study is entirely absent from the submitted manuscript, so its significance cannot be assessed. The ETA method, if correct, is a plausible and potentially useful contribution to test-time adaptation for depth completion: the benchmark coverage is broad, the comparisons include relevant baselines, and the region-based energy formulation is an interesting idea. The paper does not, however, ship code, and the central training objective as written (Eq. 7) is mathematically inconsistent with the stated goal. Because the stated central claim of the submission is missing and a load-bearing equation in the body is erroneous, the manuscript in its current form is not publishable.

major comments (4)
  1. [Abstract vs. Full Text] The abstract promises a statistically significant improvement in student performance from the Socrates active-learning method. The full text is a depth-completion test-time adaptation paper by different authors; there is no course, no Socrates system, no historical cohort, and no statistical test anywhere in the manuscript. The headline education claim is therefore completely unsupported. This is not a presentation issue that revision can fix within the current manuscript's scope; the described study is absent.
  2. [Eq. (7), Section 3.1] The energy-model training loss is written as Lenergy = -1/|Ωp| Σ y(x) log(y(x)/e(x)). This is the negative KL divergence between the target energy y and the predicted energy e. Minimizing it maximizes KL(y||e), driving the predicted energy away from the target, which is the opposite of the stated objective. The standard cross-entropy objective would be -Σ y(x) log e(x). As written, the central training objective contradicts the method's purpose and the results in Tables 1–4 cannot be attributed to the described loss.
  3. [Section 4.2 and Abstract] The abstract reports an average improvement over the previous state of the art of 6.94% outdoors and 10.23% indoors. Section 4.2 reports average improvements over ProxyTTA of 5.36% (MAE) and 1.97% (RMSE) outdoors and 10.13% (MAE) and 10.33% (RMSE) indoors. The indoor number matches the mean of the two metric improvements, but the outdoor 6.94% does not match the mean (3.67%) of the reported MAE/RMSE figures. The paper must state exactly which comparison, which averaging, and which metric combination produces the abstract's numbers.
  4. [Tables 1–4] The main results are reported as single-run MAE/RMSE values with no error bars, no number of seeds, and no significance tests. For a benchmark paper this is often acceptable, but the paper uses strong language such as 'consistently' and 'state of the art.' If the abstract's 'statistically significant' language is meant to apply to the education study, it belongs to a study that is not present; if it is meant to apply to the ETA results, variance estimates or paired comparisons are needed to support it.
minor comments (3)
  1. [Throughout] Typos: 'intractible' (Sec. 3.1), 'frquency' (Supp. A), and awkward phrasing such as 'we again improve by and 58.2% and 27.13% over TEA' (Sec. 4.2).
  2. [Section 3.1] The statement that the energy model trained on one depth-completion model is not applicable to other models is important. Since Tables 1–4 report results for four architectures, please clarify whether each architecture requires its own energy model and whether this is factored into the comparison with baselines.
  3. [Figure 4] The caption text '8 ×38' appears to contain a typographical spacing error; the intended region sizes should be stated precisely.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation in the visible full text; the abstract's education claim is a different, unsupported paper, which is a verifiability issue rather than circularity.

full rationale

The full text is a self-contained test-time adaptation paper for depth completion (ETA). Its derivation chain is not circular: the energy model E_phi is trained on source patches with targets y = 1 - exp(-MSE/tau) computed using ground truth (Eqs. 3-7), and its test-time use (Eqs. 8-11) is evaluated on held-out target datasets (Tables 1-4). No fitted parameter is relabeled as a prediction; the held-out evaluation breaks any fitting loop. The FGSM-synthesized out-of-distribution samples are a stated modeling assumption, explicitly flagged in the Limitations section: 'This design may be less effective if the real target domain features extreme conditions, sensor anomalies, or semantic shifts not captured by the perturbations.' That is an acknowledged caveat, not a definitional equivalence. Self-citations such as [52] and [105] supply components and baselines, but they are not used as uniqueness arguments or to force the result. The principal problem is not circularity: the abstract claims a statistically significant education outcome from an undergraduate course, but the full text is a different paper with no course, no Socrates system, and no student data, so the headline claim cannot be verified from the manuscript. That is a verifiability/integrity failure, not a circular-reasoning failure.

Assumptions & free parameters 5 free parameters · 6 assumptions · 0 invented entities

The ledger applies to the full text (ETA), the only substantive content available. The abstract's education claim adds an unverifiable premise: that historical cohorts are a valid control for the Socrates intervention. For ETA, no free parameters are fitted to the target test sets; the listed constants are chosen on source or in-distribution data, and reported gains are on held-out datasets. No new physical entities are introduced; the energy model is a standard trained module.

free parameters (5)
  • Energy temperature tau = not reported in provided text
    Eq. 4 maps per-patch MSE to the target energy label; the scaling of the label depends on tau, chosen by hand.
  • Perturbation radii epsilon_I, epsilon_z = not reported in provided text
    Eqs. 5-6 control the magnitude of synthesized OOD examples used to train the energy model; the text defers to a supplementary hyperparameter table that is not fully present.
  • Adaptation loss weights w_e, w_z, w_s = not reported in provided text
    Eq. 11 sets the relative weighting of energy, sparse-depth consistency, and smoothness during test-time optimization.
  • Energy map patch size = ablated from 1x1 to 8x38 (Fig. 4)
    Region size sets the localization granularity of updates and is chosen empirically; the paper shows sensitivity to it.
  • Adaptation iterations = 1 to 3 (Fig. 5)
    Number of optimization steps per test example; performance varies with iteration count, and the chosen default is scenario-dependent.
assumptions (6)
  • domain assumption Adversarial perturbations of source data simulate out-of-distribution target data.
    Section 3.1 'Generating out-of-distribution samples': the energy model is trained only on source data plus FGSM-perturbed source data. The authors flag in Limitations that extreme real targets may not be captured.
  • domain assumption Depth predictions and sparse depth, rather than RGB, are the right space for energy scoring because they exhibit smaller covariate shift.
    Section 1, inherited from ProxyTTA [52]; the conditioning of energy on z (Eq. 2) rests on this premise.
  • domain assumption 3D scenes are locally smooth with discontinuities weighted by image gradients.
    Eq. 10: the smoothness loss is imposed without validation on target data.
  • domain assumption Sparse depth measurements at test time are accurate and can anchor predictions.
    Eq. 9: dense predictions are penalized against the provided sparse depth at valid pixels.
  • domain assumption Updating only a lightweight adaptation layer plus BatchNorm statistics is sufficient to bridge the shift.
    Section 3.2, following [52]; ETA inherits this design without re-deriving it.
  • standard math The EBM partition function can be bypassed by posing energy learning as discriminative cross-entropy.
    Section 3.1, Eq. 1 vs Eq. 7; standard practice in energy-based model training.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Learning by Teaching: Engaging Students as Instructors of Large Language Models in Computer Science Education." pith.science (2026). https://pith.science/paper/GHJVDDNB

@misc{pith2026250805979,
  author       = {Pith},
  title        = {Pith review of: Learning by Teaching: Engaging Students as Instructors of Large Language Models in Computer Science Education},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GHJVDDNB}},
  note         = {Machine review of arXiv:2508.05979}
}
read the original abstract

While Large Language Models (LLMs) are often used as virtual tutors in computer science (CS) education, this approach can foster passive learning and over-reliance. This paper presents a novel pedagogical paradigm that inverts this model: students act as instructors who must teach an LLM to solve problems. To facilitate this, we developed strategies for designing questions with engineered knowledge gaps that only a student can bridge, and we introduce Socrates, a system for deploying this method with minimal overhead. We evaluated our approach in an undergraduate course and found that this active-learning method led to statistically significant improvements in student performance compared to historical cohorts. Our work demonstrates a practical, cost-effective framework for using LLMs to deepen student engagement and mastery.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Indirect and Direct AI Scaffolding for Computational Problem Posing: A Pilot Experience Report

    cs.HC 2026-07 conditional novelty 5.0 of 10

    Direct LLM worked-example scaffolding improved computational problem quality more than Indirect guiding questions in a 20-student pilot; Indirect better supported reflection, motivating a questions-then-examples sequence.

Reference graph

Works this paper leans on

106 extracted references · 73 canonical work pages · cited by 1 Pith paper

  1. [1]

    Stereoscopic universal perturba- tions across different architectures and datasets

    Zachary Berger, Parth Agrawal, Tian Yu Liu, Stefano Soatto, and Alex Wong. Stereoscopic universal perturba- tions across different architectures and datasets. In Pro- ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 15180–15190, 2022. 4, 15

    2022

  2. [2]

    nuscenes: A mul- timodal dataset for autonomous driving

    Holger Caesar, Varun Bankiti, Alex H Lang, Sourabh V ora, Venice Erin Liong, Qiang Xu, Anush Krishnan, Yu Pan, Giancarlo Baldan, and Oscar Beijbom. nuscenes: A mul- timodal dataset for autonomous driving. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 11621–11631, 2020. 14

    2020

  3. [3]

    3d reprojection-driven robot navigation improves depth sens- ing

    Marvin Chanc ´an, Alex Wong, and Ian Abraham. 3d reprojection-driven robot navigation improves depth sens- ing. In 2025 International Conference on Advanced Robotics and Mechatronics (ICARM). IEEE, 2025. 2

    2025

  4. [4]

    Contrastive test-time adaptation

    Dian Chen, Dequan Wang, Trevor Darrell, and Sayna Ebrahimi. Contrastive test-time adaptation. InCVPR, pages 295–305, 2022. 3

    2022

  5. [5]

    Uncle: Bench- marking unsupervised continual learning for depth comple- tion

    Xien Chen, Suchisrit Gangopadhyay, Michael Chu, Patrick Rim, Hyoungseob Park, and Alex Wong. Uncle: Bench- marking unsupervised continual learning for depth comple- tion. arXiv preprint arXiv:2410.18074, 2024. 2

    arXiv 2024

  6. [6]

    Cspn++: Learning context and resource aware con- volutional spatial propagation networks for depth comple- tion

    Xinjing Cheng, Peng Wang, Chenye Guan, and Ruigang Yang. Cspn++: Learning context and resource aware con- volutional spatial propagation networks for depth comple- tion. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 10615–10622, 2020. 2

    2020

  7. [7]

    Unsupervised domain adap- tation via regularized conditional alignment

    Safa Cicek and Stefano Soatto. Unsupervised domain adap- tation via regularized conditional alignment. In Proceed- ings of the IEEE/CVF international conference on com- puter vision, pages 1416–1425, 2019. 2

    2019

  8. [8]

    Scannet: Richly-annotated 3d reconstructions of indoor scenes

    Angela Dai, Angel X Chang, Manolis Savva, Maciej Hal- ber, Thomas Funkhouser, and Matthias Nießner. Scannet: Richly-annotated 3d reconstructions of indoor scenes. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 5828–5839, 2017. 5, 14

    2017

Show all 106 references
  1. [9]

    Boosting adversarial at- tacks with momentum

    Yinpeng Dong, Fangzhou Liao, Tianyu Pang, Hang Su, Jun Zhu, Xiaolin Hu, and Jianguo Li. Boosting adversarial at- tacks with momentum. In Proceedings of the IEEE con- ference on computer vision and pattern recognition , pages 9185–9193, 2018. 15

    2018

  2. [10]

    Implicit generation and mod- eling with energy-based models

    Yilun Du and Igor Mordatch. Implicit generation and mod- eling with energy-based models. In NIPS, 2019. 3

    2019

  3. [11]

    Depth map prediction from a single image using a multi-scale deep network

    David Eigen, Christian Puhrsch, and Rob Fergus. Depth map prediction from a single image using a multi-scale deep network. Advances in neural information processing systems, 27, 2014. 2

    2014

  4. [12]

    Uncertainty-aware cnns for depth completion: Uncertainty from beginning to end

    Abdelrahman Eldesokey, Michael Felsberg, Karl Holmquist, and Michael Persson. Uncertainty-aware cnns for depth completion: Uncertainty from beginning to end. In Proceedings of the IEEE/CVF Conference on Com- puter Vision and Pattern Recognition, pages 12014–12023,

  5. [13]

    All-day depth completion

    Vadim Ezhov, Hyoungseob Park, Zhaoyang Zhang, Rishi Upadhyay, Howard Zhang, Chethan Chinder Chandrappa, Achuta Kadambi, Yunhao Ba, Julie Dorsey, and Alex Wong. All-day depth completion. In 2024 IEEE/RSJ In- ternational Conference on Intelligent Robots and Systems (IROS). IEEE, 2024. 2

    2024

  6. [14]

    A brief review of domain adaptation.Ad- vances in data science and information engineering: pro- ceedings from ICDATA 2020 and IKE 2020 , pages 877– 894, 2021

    Abolfazl Farahani, Sahar V oghoei, Khaled Rasheed, and Hamid R Arabnia. A brief review of domain adaptation.Ad- vances in data science and information engineering: pro- ceedings from ICDATA 2020 and IKE 2020 , pages 877– 894, 2021. 1, 2

    2020

  7. [15]

    Geo- supervised visual depth prediction

    Xiaohan Fei, Alex Wong, and Stefano Soatto. Geo- supervised visual depth prediction. IEEE Robotics and Au- tomation Letters, 4(2):1661–1668, 2019. 2, 5, 14

    2019

  8. [16]

    Virtual worlds as proxy for multi-object tracking anal- ysis

    Adrien Gaidon, Qiao Wang, Yohann Cabon, and Eleonora Vig. Virtual worlds as proxy for multi-object tracking anal- ysis. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 4340–4349, 2016. 5, 14

    2016

  9. [17]

    Ex- tending foundational monocular depth estimators to fish- eye cameras with calibration tokens

    Suchisrit Gangopadhyay, Jung-Hee Kim, Xien Chen, Patrick Rim, Hyoungseob Park, and Alex Wong. Ex- tending foundational monocular depth estimators to fish- eye cameras with calibration tokens. In Proceedings of the IEEE/CVF International Conference on Computer Vision ,

  10. [18]

    Unsupervised do- main adaptation by backpropagation

    Yaroslav Ganin and Victor Lempitsky. Unsupervised do- main adaptation by backpropagation. In ICML, pages 1180–1189. PMLR, 2015. 2

    2015

  11. [19]

    Vision meets robotics: The kitti dataset

    Andreas Geiger, Philip Lenz, Christoph Stiller, and Raquel Urtasun. Vision meets robotics: The kitti dataset. The In- ternational Journal of Robotics Research, 32:1231 – 1237,

  12. [20]

    Digging into self-supervised monocular depth estimation

    Cl ´ement Godard, Oisin Mac Aodha, Michael Firman, and Gabriel J Brostow. Digging into self-supervised monocular depth estimation. In Proceedings of the IEEE/CVF inter- national conference on computer vision, pages 3828–3838,

  13. [21]

    Explaining and harnessing adversarial examples

    Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572, 2014. 4, 15

    2014 arXiv

  14. [22]

    Gustafsson, Martin Danelljan, Goutam Bhat, and Thomas B

    Fredrik K. Gustafsson, Martin Danelljan, Goutam Bhat, and Thomas B. Sch¨on. Energy-based models for deep prob- abilistic regression. In ECCV, 2020. 3

    2020

  15. [23]

    Harris and M

    Christopher G. Harris and M. J. Stephens. A combined cor- ner and edge detector. In Alvey Vision Conference, 1988. 14

    1988

  16. [24]

    Universal adversarial perturbations against semantic image segmentation

    Jan Hendrik Metzen, Mummadi Chaithanya Kumar, Thomas Brox, and V olker Fischer. Universal adversarial perturbations against semantic image segmentation. InPro- ceedings of the IEEE International Conference on Com- puter Vision, pages 2755–2764, 2017. 15

    2017

  17. [25]

    Penet: Towards precise and efficient image guided depth completion

    Mu Hu, Shuling Wang, Bin Li, Shiyu Ning, Li Fan, and Xiaojin Gong. Penet: Towards precise and efficient image guided depth completion. In 2021 IEEE International Con- ference on Robotics and Automation (ICRA), pages 13656– 13662. IEEE, 2021. 2

    2021

  18. [26]

    Adver- sarial examples are not bugs, they are features

    Andrew Ilyas, Shibani Santurkar, Dimitris Tsipras, Logan Engstrom, Brandon Tran, and Aleksander Madry. Adver- sarial examples are not bugs, they are features. InAdvances in Neural Information Processing Systems, pages 125–136,

  19. [27]

    Sparse and dense data with cnns: Depth completion and semantic segmenta- tion

    Maximilian Jaritz, Raoul De Charette, Emilie Wirbel, Xavier Perrotton, and Fawzi Nashashibi. Sparse and dense data with cnns: Depth completion and semantic segmenta- tion. In 2018 International Conference on 3D Vision (3DV), pages 52–60. IEEE, 2018. 2

    2018

  20. [28]

    Costdcnet: Cost volume based depth completion for a single rgb-d image

    Jaewon Kam, Jungeon Kim, Soongjin Kim, Jaesik Park, and Seungyong Lee. Costdcnet: Cost volume based depth completion for a single rgb-d image. In European Confer- ence on Computer Vision, pages 257–274. Springer, 2022. 2, 5, 6, 7, 15

    2022

  21. [29]

    Re- purposing diffusion-based image generators for monocular depth estimation

    Bingxin Ke, Anton Obukhov, Shengyu Huang, Nando Met- zger, Rodrigo Caye Daudt, and Konrad Schindler. Re- purposing diffusion-based image generators for monocular depth estimation. In CVPR, 2024. 3

    2024

  22. [30]

    Domain adap- tation without source data

    Youngeun Kim, Donghyeon Cho, Kyeongtak Han, Priyadarshini Panda, and Sungeun Hong. Domain adap- tation without source data. IEEE Transactions on Artificial Intelligence, 2(6):508–518, 2021. 2

    2021

  23. [31]

    Sub-token vit embedding via stochastic res- onance transformers

    Dong Lao, Yangchao Wu, Tian Yu Liu, Alex Wong, and Stefano Soatto. Sub-token vit embedding via stochastic res- onance transformers. In International Conference on Ma- chine Learning. PMLR, 2024. 2

    2024

  24. [32]

    On the vi- ability of monocular depth pre-training for semantic seg- mentation

    Dong Lao, Fengyu Yang, Daniel Wang, Hyoungseob Park, Samuel Lu, Alex Wong, and Stefano Soatto. On the vi- ability of monocular depth pre-training for semantic seg- mentation. In European Conference on Computer Vision . Springer, 2024. 2

    2024

  25. [33]

    A multi-scale guided cascade hourglass network for depth completion

    Ang Li, Zejian Yuan, Yonggen Ling, Wanchao Chi, Chong Zhang, et al. A multi-scale guided cascade hourglass network for depth completion. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, pages 32–40, 2020. 2, 5, 6, 7

    2020

  26. [34]

    A comprehensive survey on source-free domain adaptation

    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 Ma- chine Intelligence, 46(8):5743–5762, 2024. 1, 2

    2024

  27. [35]

    Model adaptation: Unsupervised domain adapta- tion without source data

    Rui Li, Qianfen Jiao, Wenming Cao, Hau-San Wong, and Si Wu. Model adaptation: Unsupervised domain adapta- tion without source data. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2020. 2

    2020

  28. [36]

    A comprehensive sur- vey on test-time adaptation under distribution shifts

    Jian Liang, Ran He, and Tieniu Tan. A comprehensive sur- vey on test-time adaptation under distribution shifts. IJCV, 133:31–64, 2024. 2

    2024

  29. [37]

    Statistical physics, course of theoretical physics

    EM Lifshitz and Lev Davidovich Landau. Statistical physics, course of theoretical physics. In Part 2: Theory of the Condensed State . Butterworth-Heinemann Pergamon, London, 1980. 3

    1980

  30. [38]

    Dynamic spatial propagation network for depth completion

    Yuankai Lin, Tao Cheng, Qi Zhong, Wending Zhou, and Hua Yang. Dynamic spatial propagation network for depth completion. In Proceedings of the AAAI Conference on Ar- tificial Intelligence, pages 1638–1646, 2022. 2

    2022

  31. [39]

    Monitored distillation for positive congruent depth completion

    Tian Yu Liu, Parth Agrawal, Allison Chen, Byung-Woo Hong, and Alex Wong. Monitored distillation for positive congruent depth completion. In Computer Vision–ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part II, pages 35–53. Springer,

    2022

  32. [40]

    TTT++: When Does Self-Supervised Test-Time Training Fail or Thrive? In Advances in Neural Information Pro- cessing Systems , pages 21808–21820

    Yuejiang Liu, Parth Kothari, Bastien van Delft, Bap- tiste Bellot-Gurlet, Taylor Mordan, and Alexandre Alahi. TTT++: When Does Self-Supervised Test-Time Training Fail or Thrive? In Advances in Neural Information Pro- cessing Systems , pages 21808–21820. Curran Associates, Inc....

    2021

  33. [41]

    Project to adapt: Domain adaptation for depth completion from noisy and sparse sensor data

    Adrian Lopez-Rodriguez, Benjamin Busam, and Krystian Mikolajczyk. Project to adapt: Domain adaptation for depth completion from noisy and sparse sensor data. In Proceed- ings of the Asian Conference on Computer Vision, 2020. 2

    2020

  34. [42]

    Self-supervised sparse-to-dense: Self- supervised depth completion from lidar and monocular camera

    Fangchang Ma, Guilherme Venturelli Cavalheiro, and Ser- tac Karaman. Self-supervised sparse-to-dense: Self- supervised depth completion from lidar and monocular camera. In 2019 International Conference on Robotics and Automation (ICRA), pages 3288–3295. IEEE, 2019. 2

    2019

  35. [43]

    Towards deep learn- ing models resistant to adversarial attacks

    Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. Towards deep learn- ing models resistant to adversarial attacks. arXiv preprint arXiv:1706.06083, 2017. 15

    2017 arXiv

  36. [44]

    Scenenet rgb-d: 5m photorealistic images of synthetic indoor trajectories with ground truth

    John McCormac, Ankur Handa, Stefan Leutenegger, and Andrew J Davison. Scenenet rgb-d: 5m photorealistic images of synthetic indoor trajectories with ground truth. arXiv preprint arXiv:1612.05079, 2016. 5, 14

    2016 arXiv

  37. [45]

    Deepfool: a simple and accurate method to fool deep neural networks

    Seyed-Mohsen Moosavi-Dezfooli, Alhussein Fawzi, and Pascal Frossard. Deepfool: a simple and accurate method to fool deep neural networks. In Proceedings of the IEEE con- ference on computer vision and pattern recognition , pages 2574–2582, 2016. 15

    2016

  38. [46]

    Generalizable data-free objective for crafting uni- versal adversarial perturbations

    Konda Reddy Mopuri, Aditya Ganeshan, and R Venkatesh Babu. Generalizable data-free objective for crafting uni- versal adversarial perturbations. IEEE transactions on pat- tern analysis and machine intelligence, 41(10):2452–2465,

  39. [47]

    Cross-domain transferability of adversarial perturbations

    Muhammad Muzammal Naseer, Salman H Khan, Muham- mad Haris Khan, Fahad Shahbaz Khan, and Fatih Porikli. Cross-domain transferability of adversarial perturbations. In Advances in Neural Information Processing Systems , pages 12905–12915, 2019. 15

    2019

  40. [48]

    Indoor segmentation and support inference from rgbd images

    Pushmeet Kohli Nathan Silberman, Derek Hoiem and Rob Fergus. Indoor segmentation and support inference from rgbd images. In ECCV, 2012. 5, 14

    2012

  41. [49]

    Jiquan Ngiam, Zhenghao Chen, Pang Wei Koh, and An- drew Y . Ng. Learning deep energy models. InICML, 2011. 3

    2011

  42. [50]

    Deep neural networks are easily fooled: High confidence predictions for unrecognizable images

    Anh Nguyen, Jason Yosinski, and Jeff Clune. Deep neural networks are easily fooled: High confidence predictions for unrecognizable images. In Proceedings of the IEEE con- ference on computer vision and pattern recognition , pages 427–436, 2015. 15

    2015

  43. [51]

    Efficient Test-Time Model Adaptation without Forgetting

    Shuaicheng Niu, Jiaxiang Wu, Yifan Zhang, Yaofo Chen, Shijian Zheng, Peilin Zhao, and Mingkui Tan. Efficient Test-Time Model Adaptation without Forgetting. In Pro- ceedings of the 39th International Conference on Machine Learning, pages 16888–16905. PMLR, 2022. ISSN: 2640-

    2022

  44. [52]

    Test- time adaptation for depth completion

    Hyoungseob Park, Anjali Gupta, and Alex Wong. Test- time adaptation for depth completion. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 20519–20529, 2024. 2, 3, 5, 6, 14

    2024

  45. [53]

    Non-local spatial propagation network for depth completion

    Jinsun Park, Kyungdon Joo, Zhe Hu, Chi-Kuei Liu, and In So Kweon. Non-local spatial propagation network for depth completion. In Computer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XIII 16, pages 120–136. Springer, 2020. 2, 5, 6

    2020

  46. [54]

    Lower bounds on the robustness to adversarial per- turbations

    Jonathan Peck, Joris Roels, Bart Goossens, and Yvan Saeys. Lower bounds on the robustness to adversarial per- turbations. In Advances in Neural Information Processing Systems, pages 804–813, 2017. 15

    2017

  47. [55]

    Moment matching for multi-source domain adaptation

    Xingchao Peng, Qinxun Bai, Xide Xia, Zijun Huang, Kate Saenko, and Bo Wang. Moment matching for multi-source domain adaptation. In ICCV, pages 1406–1415, 2019. 2

    2019

  48. [56]

    Deepli- dar: Deep surface normal guided depth prediction for out- door scene from sparse lidar data and single color image

    Jiaxiong Qiu, Zhaopeng Cui, Yinda Zhang, Xingdi Zhang, Shuaicheng Liu, Bing Zeng, and Marc Pollefeys. Deepli- dar: Deep surface normal guided depth prediction for out- door scene from sparse lidar data and single color image. In Proceedings of the IEEE/CVF Conference on Comput...

    2019

  49. [57]

    Depth comple- tion via deep basis fitting

    Chao Qu, Ty Nguyen, and Camillo Taylor. Depth comple- tion via deep basis fitting. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pages 71–80, 2020. 2

    2020

  50. [58]

    Bayesian deep basis fitting for depth completion with uncertainty

    Chao Qu, Wenxin Liu, and Camillo J Taylor. Bayesian deep basis fitting for depth completion with uncertainty. In Proceedings of the IEEE/CVF international conference on computer vision, pages 16147–16157, 2021. 2

    2021

  51. [59]

    Attacking optical flow

    Anurag Ranjan, Joel Janai, Andreas Geiger, and Michael J Black. Attacking optical flow. In Proceedings of the IEEE International Conference on Computer Vision, pages 2404– 2413, 2019. 15

    2019

  52. [60]

    Guide- former: Transformers for image guided depth completion

    Kyeongha Rho, Jinsung Ha, and Youngjung Kim. Guide- former: Transformers for image guided depth completion. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 6250–6259, 2022. 2

    2022

  53. [61]

    Radar-guided polynomial fitting for metric depth estimation

    Patrick Rim, Hyoungseob Park, Vadim Ezhov, Jeffrey Moon, and Alex Wong. Radar-guided polynomial fitting for metric depth estimation. arXiv preprint arXiv:2503.17182,

    arXiv

  54. [62]

    Protodepth: Unsupervised con- tinual depth completion with prototypes

    Patrick Rim, Hyoungseob Park, Ziyao Zeng, Younjoon Chung, and Alex Wong. Protodepth: Unsupervised con- tinual depth completion with prototypes. In Proceedings of the Computer Vision and Pattern Recognition Conference , pages 6304–6316, 2025. 2

    2025

  55. [63]

    High-resolution image synthesis with latent diffusion models

    Robin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser, and Bj ¨orn Ommer. High-resolution image synthesis with latent diffusion models. In CVPR, 2022. 3

    2022

  56. [64]

    Learning depth from single monocular images

    Ashutosh Saxena, Sung Chung, and Andrew Ng. Learning depth from single monocular images. Advances in neural information processing systems, 18, 2005. 2

    2005

  57. [65]

    Improving robustness against common corruptions by covariate shift adaptation, 2020

    Steffen Schneider, Evgenia Rusak, Luisa Eck, Oliver Bring- mann, Wieland Brendel, and Matthias Bethge. Improving robustness against common corruptions by covariate shift adaptation, 2020. arXiv:2006.16971. 3

    2020 arXiv

  58. [66]

    What causes optical flow networks to be vulnerable to physi- cal adversarial attacks

    Simon Schrodi, Tonmoy Saikia, and Thomas Brox. What causes optical flow networks to be vulnerable to physi- cal adversarial attacks. arXiv preprint arXiv:2103.16255 ,

    arXiv

  59. [67]

    Mm-tta: multi-modal test-time adaptation for 3d semantic segmentation

    Inkyu Shin, Yi-Hsuan Tsai, Bingbing Zhuang, Samuel Schulter, Buyu Liu, Sparsh Garg, In So Kweon, and Kuk- Jin Yoon. Mm-tta: multi-modal test-time adaptation for 3d semantic segmentation. In CVPR, pages 16928–16937,

  60. [68]

    Dfusenet: Deep fusion of rgb and sparse depth information for image guided dense depth completion

    Shreyas S Shivakumar, Ty Nguyen, Ian D Miller, Steven W Chen, Vijay Kumar, and Camillo J Taylor. Dfusenet: Deep fusion of rgb and sparse depth information for image guided dense depth completion. In 2019 IEEE Intelligent Trans- portation Systems Conference (ITSC), pages 13–20. IEEE,

    2019

  61. [69]

    Depth estimation from camera image and mmwave radar point cloud

    Akash Deep Singh, Yunhao Ba, Ankur Sarker, Howard Zhang, Achuta Kadambi, Stefano Soatto, Mani Srivastava, and Alex Wong. Depth estimation from camera image and mmwave radar point cloud. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages...

    2023

  62. [70]

    Sliced score matching: A scalable approach to density and score estimation

    Yang Song, Sahaj Garg, Jiaxin Shi, and Stefano Ermon. Sliced score matching: A scalable approach to density and score estimation. In Conference on Uncertainty in Artificial Intelligence, 2019. 3

    2019

  63. [71]

    Scalability in perception for autonomous driving: Waymo open dataset

    Pei Sun, Henrik Kretzschmar, Xerxes Dotiwalla, Aure- lien Chouard, Vijaysai Patnaik, Paul Tsui, James Guo, Yin Zhou, Yuning Chai, Benjamin Caine, et al. Scalability in perception for autonomous driving: Waymo open dataset. In Proceedings of the IEEE/CVF conference on computer ...

    2020

  64. [72]

    Test-Time Training with Self- Supervision for Generalization under Distribution Shifts

    Yu Sun, Xiaolong Wang, Zhuang Liu, John Miller, Alexei Efros, and Moritz Hardt. Test-Time Training with Self- Supervision for Generalization under Distribution Shifts. In Proceedings of the 37th International Conference on Ma- chine Learning , pages 9229–9248. PMLR, 2020. ISSN...

    2020

  65. [73]

    Intriguing properties of neural networks

    Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013. 15

    2013 arXiv

  66. [74]

    Bilateral propagation network for depth completion

    Jie Tang, Fei-Peng Tian, Boshi An, Jian Li, and Ping Tan. Bilateral propagation network for depth completion. In CVPR, 2024. 2, 5, 6, 7

    2024

  67. [75]

    Sparsity in- variant cnns

    Jonas Uhrig, Nick Schneider, Lukas Schneider, Uwe Franke, Thomas Brox, and Andreas Geiger. Sparsity in- variant cnns. In 2017 international conference on 3D Vision (3DV), pages 11–20. IEEE, 2017. 2, 14

    2017

  68. [76]

    Enhancing diffusion models with 3d perspec- tive geometry constraints

    Rishi Upadhyay, Howard Zhang, Yunhao Ba, Ethan Yang, Blake Gella, Sicheng Jiang, Alex Wong, and Achuta Kadambi. Enhancing diffusion models with 3d perspec- tive geometry constraints. ACM Transactions on Graphics (TOG), 42(6):1–15, 2023. 2

    2023

  69. [77]

    Pixel recurrent neural networks

    A ¨aron Van den Oord, Nal Kalchbrenner, and Koray Kavukcuoglu. Pixel recurrent neural networks. In ICML,

  70. [78]

    Sparse and noisy lidar completion with rgb guidance and uncertainty

    Wouter Van Gansbeke, Davy Neven, Bert De Brabandere, and Luc Van Gool. Sparse and noisy lidar completion with rgb guidance and uncertainty. In 2019 16th international conference on machine vision applications (MVA) , pages 1–6. IEEE, 2019. 2

    2019

  71. [79]

    A connection between score matching and denoising autoencoders

    Pascal Vincent. A connection between score matching and denoising autoencoders. Neural Computation, 23(7):1661– 1674, 2011. 3

    2011

  72. [80]

    Tent: Fully test-time adapta- tion by entropy minimization

    Dequan Wang, Evan Shelhamer, Shaoteng Liu, Bruno Ol- shausen, and Trevor Darrell. Tent: Fully test-time adapta- tion by entropy minimization. In ICLR, 2021. 3, 5, 6

    2021

  73. [81]

    Continual test-time domain adaptation

    Qin Wang, Olga Fink, Luc Van Gool, and Dengxin Dai. Continual test-time domain adaptation. In CVPR, 2022. 3, 5, 6

    2022

  74. [82]

    A survey of unsupervised deep domain adaptation

    Garrett Wilson and Diane J Cook. A survey of unsupervised deep domain adaptation. ACM Transactions on Intelligent Systems and Technology (TIST), 11(5):1–46, 2020. 1, 2

    2020

  75. [83]

    Bilateral cyclic constraint and adaptive regularization for unsupervised monocular depth prediction

    Alex Wong and Stefano Soatto. Bilateral cyclic constraint and adaptive regularization for unsupervised monocular depth prediction. In Proceedings of the IEEE/CVF Confer- ence on Computer Vision and Pattern Recognition , pages 5644–5653, 2019. 2

    2019

  76. [84]

    Unsupervised depth com- pletion with calibrated backprojection layers

    Alex Wong and Stefano Soatto. Unsupervised depth com- pletion with calibrated backprojection layers. In Proceed- ings of the IEEE/CVF International Conference on Com- puter Vision, pages 12747–12756, 2021. 2

    2021

  77. [85]

    Targeted ad- versarial perturbations for monocular depth prediction

    Alex Wong, Safa Cicek, and Stefano Soatto. Targeted ad- versarial perturbations for monocular depth prediction. Ad- vances in neural information processing systems, 33:8486– 8497, 2020. 15

    2020

  78. [86]

    Unsupervised depth completion from visual iner- tial odometry

    Alex Wong, Xiaohan Fei, Stephanie Tsuei, and Stefano Soatto. Unsupervised depth completion from visual iner- tial odometry. IEEE Robotics and Automation Letters , 5 (2):1899–1906, 2020. 2, 5, 14

    1906

  79. [87]

    Learning topology from synthetic data for unsupervised depth com- pletion

    Alex Wong, Safa Cicek, and Stefano Soatto. Learning topology from synthetic data for unsupervised depth com- pletion. IEEE Robotics and Automation Letters, 6(2):1495– 1502, 2021

    2021

  80. [88]

    An adaptive framework for learning unsupervised depth completion

    Alex Wong, Xiaohan Fei, Byung-Woo Hong, and Stefano Soatto. An adaptive framework for learning unsupervised depth completion. IEEE Robotics and Automation Letters, 6(2):3120–3127, 2021. 2

    2021

  81. [89]

    Stere- opagnosia: Fooling stereo networks with adversarial pertur- bations

    Alex Wong, Mukund Mundhra, and Stefano Soatto. Stere- opagnosia: Fooling stereo networks with adversarial pertur- bations. In Proceedings of the AAAI Conference on Artifi- cial Intelligence, pages 2879–2888, 2021. 4, 15

    2021

  82. [90]

    Augundo: Scaling up augmentations for monocular depth completion and estima- tion

    Yangchao Wu, Tian Yu Liu, Hyoungseob Park, Stefano Soatto, Dong Lao, and Alex Wong. Augundo: Scaling up augmentations for monocular depth completion and estima- tion. In European Conference on Computer Vision, pages 274–293. Springer, 2024. 2

    2024

  83. [91]

    Quadric representations for lidar odometry, mapping and localization

    Chao Xia, Chenfeng Xu, Patrick Rim, Mingyu Ding, Nan- ning Zheng, Kurt Keutzer, Masayoshi Tomizuka, and Wei Zhan. Quadric representations for lidar odometry, mapping and localization. IEEE Robotics and Automation Letters, 8 (8):5023–5030, 2023. 2

    2023

  84. [92]

    Adversarial examples for se- mantic segmentation and object detection

    Cihang Xie, Jianyu Wang, Zhishuai Zhang, Yuyin Zhou, Lingxi Xie, and Alan Yuille. Adversarial examples for se- mantic segmentation and object detection. In Proceedings of the IEEE International Conference on Computer Vision, pages 1369–1378, 2017. 15

    2017

  85. [93]

    Improving transfer- ability of adversarial examples with input diversity

    Cihang Xie, Zhishuai Zhang, Yuyin Zhou, Song Bai, Jianyu Wang, Zhou Ren, and Alan L Yuille. Improving transfer- ability of adversarial examples with input diversity. InPro- ceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 2730–2739, 2019. 15

    2019

  86. [94]

    Sparsefusion: Fusing multi- modal sparse representations for multi-sensor 3d object detection

    Yichen Xie, Chenfeng Xu, Marie-Julie Rakotosaona, Patrick Rim, Federico Tombari, Kurt Keutzer, Masayoshi Tomizuka, and Wei Zhan. Sparsefusion: Fusing multi- modal sparse representations for multi-sensor 3d object detection. In Proceedings of the IEEE/CVF Interna- tional Confer...

    2023

  87. [95]

    Depth completion from sparse lidar data with depth-normal constraints

    Yan Xu, Xinge Zhu, Jianping Shi, Guofeng Zhang, Hujun Bao, and Hongsheng Li. Depth completion from sparse lidar data with depth-normal constraints. In ICCV, 2019. 2

    2019

  88. [96]

    Desnet: Decomposed scale-consistent network for unsupervised depth completion

    Zhiqiang Yan, Kun Wang, Xiang Li, Zhenyu Zhang, Jun Li, and Jian Yang. Desnet: Decomposed scale-consistent network for unsupervised depth completion. In Proceed- ings of the AAAI conference on artificial intelligence, pages 3109–3117, 2023. 2

    2023

  89. [97]

    Dense depth posterior (ddp) from single image and sparse range

    Yanchao Yang, Alex Wong, and Stefano Soatto. Dense depth posterior (ddp) from single image and sparse range. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 3353–3362, 2019. 2

    2019

  90. [98]

    Rapid network adaptation: Learning to adapt neural networks using test-time feedback

    Teresa Yeo, O ˘guzhan Fatih Kar, Zahra Sodagar, and Amir Zamir. Rapid network adaptation: Learning to adapt neural networks using test-time feedback. In ICCV, 2023. 3

    2023

  91. [99]

    Completionformer: Depth completion with convolutions and vision transform- ers

    Zhang Youmin, Guo Xianda, Poggi Matteo, Zhu Zheng, Huang Guan, and Mattoccia Stefano. Completionformer: Depth completion with convolutions and vision transform- ers. arXiv preprint arXiv:2304.13030, 2023. 2

    2023 arXiv

  92. [100]

    Tea: Test-time energy adaptation

    Yige Yuan, Bingbing Xu, Liang Hou, Fei Sun, Huawei Shen, and Xueqi Cheng. Tea: Test-time energy adaptation. In CVPR, 2024. 3, 5, 6

    2024

  93. [101]

    Priordiffusion: Leverage language prior in diffusion models for monocular depth estimation

    Ziyao Zeng, Jingcheng Ni, Daniel Wang, Patrick Rim, Younjoon Chung, Fengyu Yang, Byung-Woo Hong, and Alex Wong. Priordiffusion: Leverage language prior in diffusion models for monocular depth estimation. arXiv preprint arXiv:2411.16750, 2024. 2

    2024

  94. [102]

    Wordepth: Variational language prior for monocular depth estimation

    Ziyao Zeng, Daniel Wang, Fengyu Yang, Hyoungseob Park, Stefano Soatto, Dong Lao, and Alex Wong. Wordepth: Variational language prior for monocular depth estimation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 9708– 9719, 2024

    2024

  95. [103]

    Rsa: Resolving scale am- biguities in monocular depth estimators through language descriptions

    Ziyao Zeng, Yangchao Wu, Hyoungseob Park, Daniel Wang, Fengyu Yang, Stefano Soatto, Dong Lao, Byung- Woo Hong, and Alex Wong. Rsa: Resolving scale am- biguities in monocular depth estimators through language descriptions. Advances in neural information processing systems, 37, 2024. 2

    2024

  96. [104]

    MEMO: Test Time Robustness via Adaptation and Augmentation

    Marvin Zhang, Sergey Levine, and Chelsea Finn. MEMO: Test Time Robustness via Adaptation and Augmentation. Advances in Neural Information Processing Systems , 35: 38629–38642, 2022. 3

    2022

  97. [105]

    Pak, Anne-Marie Rickmann, Lawrence H

    Xiaoran Zhang, Byung-Woo Hong, Hyoungseob Park, Daniel H. Pak, Anne-Marie Rickmann, Lawrence H. Staib, James S. Duncan, and Alex Wong. Progressive test time energy adaptation for medical image segmentation. In Proceedings of the IEEE/CVF International Conference on Computer Vi...

    2025

  98. [106]

    source” data with and the simulated “target

    Yinda Zhang and Thomas Funkhouser. Deep depth com- pletion of a single rgb-d image. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages 175–185, 2018. 2 ETA: Energy-based Test-time Adaptation for Depth Completion SUPPLEMENTARY MA TERIAL A. ...

    2018

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.