Pith. sign in

REVIEW 4 major objections 4 minor 106 references

Domain Adaptation via Feature Refinement

T0 review · 4 major / 4 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 Domain Adaptation via Feature Refinement shows that a simple, label-free three-step recipe—batch-normalization statistics adaptation, feature distillation, and hypothesis transfer—lets classifiers stay accurate under synthetic image corrupt

desk verdict A clearly written abstract for a modest three-component combination, but the full text is unreadable mojibake and the central superiority claim is entirely unverified. read the letter →

arxiv 2508.16124 v1 pith:NIDFDHYR submitted 2025-08-22 cs.CV cs.LG

Savvas Karatsiolis , Andreas Kamilaris This is my paper
classification cs.CVcs.LG
keywords domainadaptationunsupervisedbatchnormalizationfeaturedistillationhypothesistransfercorruptionrobustnessCIFAR-10-Cdistributionshift
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 claims that a simple, label-free recipe can make image classifiers markedly more robust to synthetic corruption. The recipe combines three existing ideas: re-estimating batch-normalization statistics on unlabeled target data, distilling features from a model trained on clean source data, and transferring the classifier's decision head. On four corruption benchmarks, the authors report that this combination outperforms prior domain-adaptation methods. They also report evidence of better feature alignment, higher mutual information between domains, and lower sensitivity to input perturbations. If the claim holds, it means a practical defense against common image corruptions needs no target labels, no new architecture, and no complex objective.

What carries the argument

The method rests on three complementary mechanisms. Batch normalization statistics adaptation replaces the source batch-norm running means and variances with estimates computed from unlabeled target data, which aligns the per-channel statistics of the feature distribution. Feature distillation uses a loss that makes the target-adapted feature extractor reproduce the source-trained model's features, preserving the source's discriminative structure without labels. Hypothesis transfer reuses and adapts the source classifier's decision head on the aligned features, keeping the label mapping intact. The paper's argument is that these three components work together: statistics alignment handles lo

What would settle it

Evaluate DAFR2 on a natural, non-synthetic domain shift—for instance, training on CIFAR-10 and testing on STL-10, or on a medical imaging dataset scanned with a different device—against the same baselines. If the robustness advantage over prior methods disappears or reverses, the claim that the method produces a domain-invariant feature space that generalizes across similar domains is falsified.

Watch

Extended reading notes

Core claim

The central claim is that unsupervised domain adaptation under distribution shift can be reduced to a three-part operation performed on a source-trained network: recompute batch-normalization running statistics from unlabeled target data, train the feature extractor to imitate the source model's features (feature distillation), and then transfer the classifier's decision head (hypothesis transfer). The paper asserts that this combined procedure, DAFR2, yields a domain-invariant feature space that outperforms prior methods in robustness to corruption on CIFAR-10-C, CIFAR-100-C, MNIST-C, and PatchCamelyon-C, and that analyses show improved feature alignment, increased mutual information betwee

Load-bearing premise

The evidence for the central claim comes entirely from synthetic corruption benchmarks with unlabeled target data available and the label space shared with the source; if the gains do not transfer to other kinds of distribution shift, the headline claim of domain-invariant robustness is overstated.

Editorial extensions

If this is right

  • A classifier can be made robust to unseen image corruptions using only the unlabeled corrupted images themselves, which matters in deployment scenarios where target labels are unavailable.
  • The three components can be combined additively, so practitioners could adopt the recipe without redesigning their architectures or losing the benefits of a strong source-trained model.
  • The reported improvements in feature alignment, mutual information, and perturbation sensitivity offer measurable diagnostics of adaptation quality that do not require target labels.
  • Because the method is simple, it can be layered on top of any existing source-trained network and may combine with other adaptation or robustness techniques.
  • The benchmark results, if correct, establish a strong label-free baseline for corruption robustness on CIFAR and medical-image classification tasks.

Reading between the lines

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

  • The benchmark evidence covers synthetic corruptions; whether the same gains appear under natural domain shifts (style transfer, new sensors, label shift) is an open test the paper does not run.
  • A testable extension: ablate each of the three components one at a time. The paper's 'synergistic' claim predicts that removing any one degrades robustness more than removing any single component in isolation would suggest.
  • If the mutual-information and perturbation-sensitivity analyses are right, they provide a cheap validation signal for domain adaptation in settings where accuracy labels are unavailable at test time.
  • The method assumes the unlabeled target data shares the label space with the source; when the target contains novel classes, the hypothesis-transfer step could actively harm performance, a boundary the paper does not address.
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 / 4 minor

Summary. The paper proposes DAFR2, a label-free unsupervised domain adaptation method that combines batch normalization statistics adaptation, feature distillation from a source-trained model, and hypothesis transfer. The abstract claims state-of-the-art robustness to corruption on CIFAR-10-C, CIFAR-100-C, MNIST-C, and PatchCamelyon-C, as well as improved feature alignment, increased mutual information, and reduced sensitivity to input perturbations. The submitted full text is almost entirely unreadable mojibake; the only clear sentence after the abstract is an embedded arXiv identifier for a different paper (2508.16122v3 [cs.CL]). Consequently, the empirical and theoretical support for the claimed superiority cannot be inspected. The manuscript as received is not reviewable.

Significance. If the claims are correct, the method would be a useful simple baseline: combining three straightforward, pre-existing components (BN adaptation, distillation, hypothesis transfer) with no target labels is an attractive recipe, and the claimed gains across four corruption benchmarks would be of interest to the robustness and UDA communities. The abstract's claim is falsifiable and specific, which is a strength. However, the manuscript provides no readable derivations, experiments, ablations, code, or proofs in the received version. Thus the significance cannot be assessed beyond the abstract; the contribution is currently unverified. No machine-checked proofs or reproducible code are visible in the submission.

major comments (4)
  1. [Full text (abstract vs. body)] The abstract's central claim that 'the proposed algorithm outperforms prior methods in robustness to corruption' is an empirical superiority claim. In the received version, after the abstract the full text is unreadable mojibake: no readable comparison table, per-corruption accuracy, error bars, or ablations can be located. The only intact sentence is the embedded arXiv identifier 'arXiv:2508.16122v3 [cs.CL] 21 Oct 2025', which conflicts with the manuscript header (arXiv:2508.16124, cs.CV). The claim is therefore unsupported by any inspectable evidence in this submission.
  2. [Abstract; theoretical analysis claims] The abstract asserts 'improved feature alignment, increased mutual information between the domains and reduced sensitivity to input perturbations' via 'theoretical and empirical analyses'. No readable theorem statement, proof, or equation appears in the body; the unreadable text may contain such results but no formal statement can be inspected. The authors should provide a precise theorem with assumptions, a full proof or proof artifact, and the experimental protocol under which the quantities were measured.
  3. [Full text near end (Limitations heading)] A section that appears to be 'Limitations' occurs near the end of the unreadable body, after the final data tables. Its content is illegible. If it asserts limitations of the method or of the evaluation (e.g., restriction to synthetic corruptions, assumption of shared label space), those assertions are part of the manuscript and must be respected. The authors should make these limitations explicit and address them in a readable revision.
  4. [Experimental setup] No hyperparameters (combination weights for the three objectives, BN momentum, distillation temperature), number of seeds, model architectures, source training details, or prior-baseline definitions are readable. Without these, the comparison-fairness and 'simple/parameter-light' claims cannot be checked. Provide a complete methods and experimental setup section in the resubmission.
minor comments (4)
  1. [Abstract] Report concrete numbers (e.g., mean corruption accuracy/error) and name the prior methods compared, rather than only a qualitative claim of outperformance.
  2. [Full text, header] Correct the conflicting embedded arXiv ID 'arXiv:2508.16122v3 [cs.CL] 21 Oct 2025'; it may indicate a wrong source file. Ensure the submission is the cs.CV paper.
  3. [Methods] Define all notation and loss terms in equations; the current text gives no readable formalization of the three components.
  4. [Results] Add standard deviations/error bars and statistical tests for the claimed improvements; the fragments of numeric tables are not interpretable without headers.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity identifiable; abstract contains no self-referential derivation and full text is unreadable.

full rationale

The only readable portion of the manuscript is the abstract, which describes DAFR2 as a combination of three standard components: batch-normalization statistics adaptation, feature distillation, and hypothesis transfer. The abstract's empirical claim ('outperforms prior methods in robustness to corruption') is an external benchmark claim, not a quantity derived from the method's own definition. The theoretical-sounding claims ('increased mutual information', 'reduced sensitivity to input perturbations') are stated without equations in the readable text, so there is no exhibited reduction from output to input. The full text is mojibake and cannot supply the specific equation-level evidence needed to establish circularity. The embedded conflicting arXiv ID is a verifiability or document-integrity concern, not a circularity pattern. No self-citation, uniqueness theorem, fitted-input-as-prediction, or ansatz-smuggling is visible in the readable abstract. Under the rule that circularity must be demonstrated by quotation and specific reduction, no circular step is identifiable.

Assumptions & free parameters 2 free parameters · 3 assumptions · 0 invented entities

All entries are inferred from the abstract alone because the body is unreadable. The method inherits the usual unsupervised domain adaptation premises: unlabeled target inputs available, shared label space, a source checkpoint with batch normalization layers, and the choice of synthetic corruption suites as the evidence base. The abstract reports no free parameters; the loss weights and adaptation hyperparameters any such framework requires are unstated. No invented entities (new forces, mediators, state variables) are introduced.

free parameters (2)
  • Combination weights for the BN-stat, distillation, and hypothesis-transfer objectives
    The abstract describes three jointly used components but reports no loss coefficients; such weights are typically hand-tuned on validation data and are invisible at the abstract level.
  • BN-statistics adaptation momentum and distillation temperature (presumed)
    Standard hyperparameters for the named components; none are reported in the abstract, so their values, and any tuning on the target domain, cannot be audited.
assumptions (3)
  • domain assumption Unlabeled target-domain data is available at adaptation time and shares the label space with the source domain
    The abstract says DAFR2 works 'without requiring target labels', which presupposes access to target inputs and a common label set; the standard UDA premise under which BN-stat adaptation is possible.
  • domain assumption Synthetic corruption suites (CIFAR-10-C, CIFAR-100-C, MNIST-C, PatchCamelyon-C) are a sufficient testbed for the claimed generalization
    All claimed superiority is measured on these corruption benchmarks (abstract, experiments sentence), yet the claim is framed generally ('generalize across similar domains'); transferability to other shift types is assumed, not shown.
  • domain assumption The source model contains batch normalization layers whose statistics can be adapted
    BN-stat adaptation is one of the three core components; the abstract never discusses how the method behaves for BN-free architectures.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Domain Adaptation via Feature Refinement." pith.science (2026). https://pith.science/paper/NIDFDHYR

@misc{pith2026250816124,
  author       = {Pith},
  title        = {Pith review of: Domain Adaptation via Feature Refinement},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NIDFDHYR}},
  note         = {Machine review of arXiv:2508.16124}
}
read the original abstract

We propose Domain Adaptation via Feature Refinement (DAFR2), a simple yet effective framework for unsupervised domain adaptation under distribution shift. The proposed method synergistically combines three key components: adaptation of Batch Normalization statistics using unlabeled target data, feature distillation from a source-trained model and hypothesis transfer. By aligning feature distributions at the statistical and representational levels, DAFR2 produces robust and domain-invariant feature spaces that generalize across similar domains without requiring target labels, complex architectures or sophisticated training objectives. Extensive experiments on benchmark datasets, including CIFAR10-C, CIFAR100-C, MNIST-C and PatchCamelyon-C, demonstrate that the proposed algorithm outperforms prior methods in robustness to corruption. Theoretical and empirical analyses further reveal that our method achieves improved feature alignment, increased mutual information between the domains and reduced sensitivity to input perturbations.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

106 extracted references · 73 canonical work pages

  1. [1]

    Yao, Xing Fan, and Chenlei Guo

    Gustavo Aguilar, Yuan Ling, Yu Zhang, Benjamin Z. Yao, Xing Fan, and Chenlei Guo. Knowledge distillation from internal representations. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in A...

    2020

  2. [2]

    Aithal, Dhruva Kashyap, and Natarajan Subramanyam

    Sumukh K. Aithal, Dhruva Kashyap, and Natarajan Subramanyam. Robustness to augmentations as a generalization metric. CoRR , abs/2101.06459, 2021

    arXiv 2021

  3. [3]

    Arsenii Ashukha, Alexander Lyzhov, Dmitry Molchanov, and Dmitry P. Vetrov. Pitfalls of in-domain uncertainty estimation and ensembling in deep learning. In 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020 . OpenReview.net, 2020

    2020

  4. [4]

    Improving model generalization by agreement of learned representations from data augmentation

    Rowel Atienza. Improving model generalization by agreement of learned representations from data augmentation. In 2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) , pages 3927--3936, 2022

    2022

  5. [5]

    Balanya, Juan Maronas, and Daniel Ramos

    Sergio A. Balanya, Juan Maronas, and Daniel Ramos. Adaptive temperature scaling for robust calibration of deep neural networks. 36(14):8073–8095, February 2024

    2024

  6. [6]

    Mt3: Meta test-time training for self-supervised test-time adaption

    Alexander Bartler, Andre Buhler, Felix Wiewel, Mario Dobler, and Bin Yang. Mt3: Meta test-time training for self-supervised test-time adaption. In Gustau Camps-Valls, Francisco J. R. Ruiz, and Isabel Valera, editors, Proceedings of The 25th International Conference on Artificial Intelligence and Statistics , volume 151 of Proceedings of Machine Learning R...

    2022

  7. [7]

    Devon Hjelm, and Aaron C

    Ishmael Belghazi, Sai Rajeswar, Aristide Baratin, R. Devon Hjelm, and Aaron C. Courville. Mine: Mutual information neural estimation. CoRR , abs/1801.04062, 2018

    arXiv 2018

  8. [8]

    Unsupervised pixel-level domain adaptation with generative adversarial networks

    Konstantinos Bousmalis, Nathan Silberman, David Dohan, Dumitru Erhan, and Dilip Krishnan. Unsupervised pixel-level domain adaptation with generative adversarial networks. In 2017 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 21-26, 2017 , pages 95--104. IEEE Computer Society, 2017

    2017

Show all 106 references
  1. [9]

    Domain separation networks

    Konstantinos Bousmalis, George Trigeorgis, Nathan Silberman, Dilip Krishnan, and Dumitru Erhan. Domain separation networks. In Daniel D. Lee, Masashi Sugiyama, Ulrike von Luxburg, Isabelle Guyon, and Roman Garnett, editors, Advances in Neural Information Processing Systems 29:...

    2016

  2. [10]

    Exploring simple siamese representation learning

    Xinlei Chen and Kaiming He. Exploring simple siamese representation learning. In IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2021, virtual, June 19-25, 2021 , pages 15750--15758. Computer Vision Foundation / IEEE , 2021

    2021

  3. [11]

    On robustness and transferability of convolutional neural networks

    Josip Djolonga, Jessica Yung, Michael Tschannen, Rob Romijnders, Lucas Beyer, Alexander Kolesnikov, Joan Puigcerver, Matthias Minderer, Alexander Nicholas D'Amour, Dan Moldovan, Sylvain Gelly, Neil Houlsby, Xiaohua Zhai, and Mario Lučić. On robustness and transferability of co...

    2021

  4. [12]

    Marsden, and Bin Yang

    Mario Dobler, Robert A. Marsden, and Bin Yang. Robust mean teacher for continual and gradual test-time adaptation. In IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023, Vancouver, BC, Canada, June 17-24, 2023 , pages 7704--7714. IEEE , 2023

    2023

  5. [13]

    M. D. Donsker and S. R. S. Varadhan. Asymptotic evaluation of certain markov process expectations for large time, i. Communications on Pure and Applied Mathematics , 28(1):1--47, 1975

    1975

  6. [14]

    Cian Eastwood, Ian Mason, Christopher K. I. Williams, and Bernhard Scholkopf. Source-free adaptation to measurement shift via bottom-up feature restoration. In The Tenth International Conference on Learning Representations, ICLR 2022, Virtual Event, April 25-29, 2022 . OpenRev...

    2022

  7. [15]

    Tackling dimensional collapse toward comprehensive universal domain adaptation

    Hung-Chieh Fang, Po-Yi Lu, and Hsuan-Tien Lin. Tackling dimensional collapse toward comprehensive universal domain adaptation. In Forty-second International Conference on Machine Learning , 2025

    2025

  8. [16]

    Sharpness-aware minimization for efficiently improving generalization

    Pierre Foret, Ariel Kleiner, Hossein Mobahi, and Behnam Neyshabur. Sharpness-aware minimization for efficiently improving generalization. In 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3-7, 2021 . OpenReview.net, 2021

    2021

  9. [17]

    Dropout as a bayesian approximation: Representing model uncertainty in deep learning

    Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In Maria Florina Balcan and Kilian Q. Weinberger, editors, Proceedings of The 33rd International Conference on Machine Learning , volume 48 of Proceedings of ...

    2016

  10. [18]

    Lempitsky

    Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, Francois Laviolette, Mario Marchand, and Victor S. Lempitsky. Domain-adversarial training of neural networks. J. Mach. Learn. Res. , 17:59:1--59:35, 2016

    2016

  11. [19]

    Gatys, Alexander S

    Leon A. Gatys, Alexander S. Ecker, and Matthias Bethge. Image style transfer using convolutional neural networks. In 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27-30, 2016 , pages 2414--2423. IEEE Computer Society, 2016

    2016

  12. [20]

    Borgwardt, Malte J

    Arthur Gretton, Karsten M. Borgwardt, Malte J. Rasch, Bernhard Scholkopf, and Alexander Smola. A kernel two-sample test. Journal of Machine Learning Research , 13(25):723--773, 2012

    2012

  13. [21]

    Richemond, Elena Buchatskaya, Carl Doersch, Bernardo Avila Pires, Zhaohan Guo, Mohammad Gheshlaghi Azar, Bilal Piot, Koray Kavukcuoglu, Remi Munos, and Michal Valko

    Jean - Bastien Grill, Florian Strub, Florent Altche, Corentin Tallec, Pierre H. Richemond, Elena Buchatskaya, Carl Doersch, Bernardo Avila Pires, Zhaohan Guo, Mohammad Gheshlaghi Azar, Bilal Piot, Koray Kavukcuoglu, Remi Munos, and Michal Valko. Bootstrap your own latent - A n...

    2020

  14. [22]

    Weinberger

    Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q. Weinberger. On calibration of modern neural networks. In Proceedings of the 34th International Conference on Machine Learning - Volume 70 , ICML'17, page 1321–1330. JMLR.org, 2017

    2017

  15. [23]

    Deep residual learning for image recognition

    Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27-30, 2016 , pages 770--778. IEEE Computer Society, 2016

    2016

  16. [24]

    Dietterich

    Dan Hendrycks and Thomas G. Dietterich. Benchmarking neural network robustness to common corruptions and perturbations. In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019 . OpenReview.net, 2019

    2019

  17. [25]

    Augmix: A simple method to improve robustness and uncertainty under data shift

    Dan Hendrycks, Norman Mu, Ekin Dogus Cubuk, Barret Zoph, Justin Gilmer, and Balaji Lakshminarayanan. Augmix: A simple method to improve robustness and uncertainty under data shift. In International Conference on Learning Representations , 2020

    2020

  18. [26]

    Natural adversarial examples

    Dan Hendrycks, Kevin Zhao, Steven Basart, Jacob Steinhardt, and Dawn Song. Natural adversarial examples. CoRR , abs/1907.07174, 2019

    1907 arXiv

  19. [27]

    Gans trained by a two time-scale update rule converge to a local nash equilibrium

    Martin Heusel, Hubert Ramsauer, Thomas Unterthiner, Bernhard Nessler, and Sepp Hochreiter. Gans trained by a two time-scale update rule converge to a local nash equilibrium. In Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V. N. Vishwanathan...

    2017

  20. [28]

    Hinton, Oriol Vinyals, and Jeffrey Dean

    Geoffrey E. Hinton, Oriol Vinyals, and Jeffrey Dean. Distilling the knowledge in a neural network. CoRR , abs/1503.02531, 2015

    2015 arXiv

  21. [29]

    Hrda: Context-aware high-resolution domain-adaptive semantic segmentation

    Lukas Hoyer, Dengxin Dai, and Luc Van Gool. Hrda: Context-aware high-resolution domain-adaptive semantic segmentation. In Computer Vision – ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part XXX , page 372–391, Berlin, Heidelberg, 202...

    2022

  22. [30]

    Belongie

    Xun Huang and Serge J. Belongie. Arbitrary style transfer in real-time with adaptive instance normalization. In IEEE International Conference on Computer Vision, ICCV 2017, Venice, Italy, October 22-29, 2017 , pages 1510--1519. IEEE Computer Society, 2017

    2017

  23. [31]

    Like what you like: Knowledge distill via neuron selectivity transfer

    Zehao Huang and Naiyan Wang. Like what you like: Knowledge distill via neuron selectivity transfer. CoRR , abs/1707.01219, 2017

    2017 arXiv

  24. [32]

    Batch normalization: Accelerating deep network training by reducing internal covariate shift

    Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. In Francis Bach and David Blei, editors, Proceedings of the 32nd International Conference on Machine Learning , volume 37 of Proceedings of Machine...

    2015

  25. [33]

    Sangiovanni - Vincentelli

    Baihong Jin, Yingshui Tan, Yuxin Chen, and Alberto L. Sangiovanni - Vincentelli. Augmenting monte carlo dropout classification models with unsupervised learning tasks for detecting and diagnosing out-of-distribution faults. CoRR , abs/1909.04202, 2019

    1909 arXiv

  26. [34]

    Hauptmann

    Guoliang Kang, Lu Jiang, Yi Yang, and Alexander G. Hauptmann. Contrastive adaptation network for unsupervised domain adaptation. In IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2019, Long Beach, CA, USA, June 16-20, 2019 , pages 4893--4902. Computer Vision ...

    2019

  27. [35]

    Effects of varying resolution on performance of cnn based image classification an experimental study

    Suresh Kannojia and Gaurav Jaiswal. Effects of varying resolution on performance of cnn based image classification an experimental study. International Journal of Computer Sciences and Engineering , 6:451--456, 09 2018

    2018

  28. [36]

    Kingma and Jimmy Ba

    Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In Yoshua Bengio and Yann LeCun, editors, 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings , 2015

    2015

  29. [37]

    On the effectiveness of adversarial training against common corruptions

    Klim Kireev, Maksym Andriushchenko, and Nicolas Flammarion. On the effectiveness of adversarial training against common corruptions. In The 38th Conference on Uncertainty in Artificial Intelligence , 2022

    2022

  30. [38]

    Improving model calibration with accuracy versus uncertainty optimization

    Ranganath Krishnan and Omesh Tickoo. Improving model calibration with accuracy versus uncertainty optimization. In Proceedings of the 34th International Conference on Neural Information Processing Systems , NIPS '20, Red Hook, NY, USA, 2020. Curran Associates Inc

    2020

  31. [39]

    Ats: Adaptive temperature scaling for enhancing out-of-distribution detection methods

    Gerhard Krumpl, Henning Avenhaus, Horst Possegger, and Horst Bischof. Ats: Adaptive temperature scaling for enhancing out-of-distribution detection methods. In 2024 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) , pages 3852--3861, 2024

    2024

  32. [40]

    Simple and scalable predictive uncertainty estimation using deep ensembles

    Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell. Simple and scalable predictive uncertainty estimation using deep ensembles. In Proceedings of the 31st International Conference on Neural Information Processing Systems , NIPS'17, page 6405–6416, Red Hook, NY, U...

    2017

  33. [41]

    Morariu, Handong Zhao, Varun Manjunatha, Nikolaos Barmpalios, and Yun Fu

    Kai Li, Curtis Wigington, Chris Tensmeyer, Vlad I. Morariu, Handong Zhao, Varun Manjunatha, Nikolaos Barmpalios, and Yun Fu. Improving cross-domain detection with self-supervised learning. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CV...

    2023

  34. [42]

    Partial domain adaptation without domain alignment

    Weikai Li and Songcan Chen. Partial domain adaptation without domain alignment. IEEE Transactions on Pattern Analysis and Machine Intelligence , 45(7):8787--8797, 2023

    2023

  35. [43]

    Partial domain adaptation without domain alignment

    Weikai Li and Songcan Chen. Partial domain adaptation without domain alignment. IEEE Transactions on Pattern Analysis and Machine Intelligence , 45(7):8787–8797, July 2023

    2023

  36. [44]

    Revisiting batch normalization for practical domain adaptation

    Yanghao Li, Naiyan Wang, Jianping Shi, Jiaying Liu, and Xiaodi Hou. Revisiting batch normalization for practical domain adaptation. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Workshop Track Proceedings . OpenRevie...

    2017

  37. [45]

    A comprehensive survey on test-time adaptation under distribution shifts

    Jian Liang, Ran He, and Tieniu Tan. A comprehensive survey on test-time adaptation under distribution shifts. International Journal on Computer Vision , 133(1):31–64, July 2024

    2024

  38. [46]

    A comprehensive survey on test-time adaptation under distribution shifts

    Jian Liang, Ran He, and Tieniu Tan. A comprehensive survey on test-time adaptation under distribution shifts. Int. J. Comput. Vis. , 133(1):31--64, 2025

    2025

  39. [47]

    Do we really need to access the source data? S ource hypothesis transfer for unsupervised domain adaptation

    Jian Liang, Dapeng Hu, and Jiashi Feng. Do we really need to access the source data? S ource hypothesis transfer for unsupervised domain adaptation. In Hal Daumé III and Aarti Singh, editors, Proceedings of the 37th International Conference on Machine Learning , volume 119 of ...

    2020

  40. [48]

    Source data-absent unsupervised domain adaptation through hypothesis transfer and labeling transfer

    Jian Liang, Dapeng Hu, Yunbo Wang, Ran He, and Jiashi Feng. Source data-absent unsupervised domain adaptation through hypothesis transfer and labeling transfer. IEEE Transactions on Pattern Analysis and Machine Intelligence , 44(11):8602--8617, 2022

    2022

  41. [49]

    Guiding pseudo-labels with uncertainty estimation for source-free unsupervised domain adaptation

    Mattia Litrico, Alessio Del Bue, and Pietro Morerio. Guiding pseudo-labels with uncertainty estimation for source-free unsupervised domain adaptation. In 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , pages 7640--7650, Los Alamitos, CA, USA, Jun 2...

    2023

  42. [50]

    Mingsheng Long, Zhangjie Cao, Jianmin Wang, and Michael I. Jordan. Conditional adversarial domain adaptation. In Samy Bengio, Hanna M. Wallach, Hugo Larochelle, Kristen Grauman, Nicolo Cesa-Bianchi, and Roman Garnett, editors, Advances in Neural Information Processing Systems ...

    2018

  43. [51]

    Mingsheng Long, Han Zhu, Jianmin Wang, and Michael I. Jordan. Deep transfer learning with joint adaptation networks. In Doina Precup and Yee Whye Teh, editors, Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August ...

    2017

  44. [52]

    SGDR: stochastic gradient descent with warm restarts

    Ilya Loshchilov and Frank Hutter. SGDR: stochastic gradient descent with warm restarts. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings . OpenReview.net, 2017

    2017

  45. [53]

    Decoupled weight decay regularization

    Ilya Loshchilov and Frank Hutter. Decoupled weight decay regularization. In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019 . OpenReview.net, 2019

    2019

  46. [54]

    Taking a closer look at domain shift: Category-level adversaries for semantics consistent domain adaptation

    Yawei Luo, Liang Zheng, Tao Guan, Junqing Yu, and Yi Yang. Taking a closer look at domain shift: Category-level adversaries for semantics consistent domain adaptation. In Proceedings - 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2019 , Proceedings...

    2019

  47. [55]

    Context-guided entropy minimization for semi-supervised domain adaptation

    Ning Ma, Jiajun Bu, Lixian Lu, Jun Wen, Sheng Zhou, Zhen Zhang, Jingjun Gu, Haifeng Li, and Xifeng Yan. Context-guided entropy minimization for semi-supervised domain adaptation. Neural Networks , 154:270--282, 2022

    2022

  48. [56]

    Accuracy on the line: on the strong correlation between out-of-distribution and in-distribution generalization

    John P Miller, Rohan Taori, Aditi Raghunathan, Shiori Sagawa, Pang Wei Koh, Vaishaal Shankar, Percy Liang, Yair Carmon, and Ludwig Schmidt. Accuracy on the line: on the strong correlation between out-of-distribution and in-distribution generalization. In Marina Meila and Tong ...

    2021

  49. [57]

    Jehanzeb Mirza, Jakub Micorek, Horst Possegger, and Horst Bischof

    M. Jehanzeb Mirza, Jakub Micorek, Horst Possegger, and Horst Bischof. The Norm Must Go On: Dynamic Unsupervised Domain Adaptation by Normalization . In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , pages 14745--14755, Los Alamitos, CA, USA, Jun 2...

    2022

  50. [58]

    Generative pseudo-label refinement for unsupervised domain adaptation

    Pietro Morerio, Riccardo Volpi, Ruggero Ragonesi, and Vittorio Murino. Generative pseudo-label refinement for unsupervised domain adaptation. In 2020 IEEE Winter Conference on Applications of Computer Vision (WACV) , pages 3119--3128, 2020

    2020

  51. [59]

    MNIST-C: A robustness benchmark for computer vision

    Norman Mu and Justin Gilmer. MNIST-C: A robustness benchmark for computer vision. CoRR , abs/1906.02337, 2019

    1906 arXiv

  52. [60]

    Kernel mean embedding of distributions: A review and beyond

    Krikamol Muandet, Kenji Fukumizu, Bharath Sriperumbudur, and Bernhard Scholkopf. Kernel mean embedding of distributions: A review and beyond. Foundations and Trends in Machine Learning , 10(1–2):1–141, Jun 2017

    2017

  53. [61]

    Fixbi: Bridging domain spaces for unsupervised domain adaptation

    Jaemin Na, Heechul Jung, Hyung Jin Chang, and Wonjun Hwang. Fixbi: Bridging domain spaces for unsupervised domain adaptation. In IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2021, virtual, June 19-25, 2021 , pages 1094--1103. Computer Vision Foundation / IE...

    2021

  54. [62]

    Sculley, Alexander D'Amour, Balaji Lakshminarayanan, and Jasper Snoek

    Zachary Nado, Shreyas Padhy, D. Sculley, Alexander D'Amour, Balaji Lakshminarayanan, and Jasper Snoek. Evaluating prediction-time batch normalization for robustness under covariate shift. CoRR , abs/2006.10963, 2020

    2006 arXiv

  55. [63]

    Vaishnavh Nagarajan, Aditya Krishna Menon, Srinadh Bhojanapalli, Hossein Mobahi, and Sanjiv Kumar. On student-teacher deviations in distillation: does it pay to disobey? In Proceedings of the 37th International Conference on Neural Information Processing Systems , NIPS '23, Re...

    2023

  56. [64]

    Batch-instance normalization for adaptively style-invariant neural networks

    Hyeonseob Nam and Hyo-Eun Kim. Batch-instance normalization for adaptively style-invariant neural networks. NIPS'18, page 2563–2572, Red Hook, NY, USA, 2018. Curran Associates Inc

    2018

  57. [65]

    Nesterov

    Yurii E. Nesterov. Introductory Lectures on Convex Optimization - A Basic Course , volume 87 of Applied Optimization . Springer, 2004

    2004

  58. [66]

    Raychaudhuri, Samet Oymak, and Amit K

    Fahim Faisal Niloy, Sk Miraj Ahmed, Dripta S. Raychaudhuri, Samet Oymak, and Amit K. Roy-Chowdhury. Effective restoration of source knowledge in continual test time adaptation. In 2024 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) , pages 2080--2089, Los...

    2024

  59. [67]

    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 Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato, editors, International Co...

    2022

  60. [68]

    Towards stable test-time adaptation in dynamic wild world

    Shuaicheng Niu, Jiaxiang Wu, Yifan Zhang, Zhiquan Wen, Yaofo Chen, Peilin Zhao, and Mingkui Tan. Towards stable test-time adaptation in dynamic wild world. In International Conference on Learning Representations , 2023

    2023

  61. [69]

    Tttflow: Unsupervised test-time training with normalizing flow

    David Osowiechi, Gustavo Adolfo Vargas Hakim, Mehrdad Noori, Milad Cheraghalikhani, Ismail Ben Ayed, and Christian Desrosiers. Tttflow: Unsupervised test-time training with normalizing flow. In IEEE/CVF Winter Conference on Applications of Computer Vision, WACV 2023, Waikoloa,...

    2023

  62. [70]

    Sculley, Sebastian Nowozin, Joshua V

    Yaniv Ovadia, Emily Fertig, Jie Ren, Zachary Nado, D. Sculley, Sebastian Nowozin, Joshua V. Dillon, Balaji Lakshminarayanan, and Jasper Snoek. Can you trust your model's uncertainty? evaluating predictive uncertainty under dataset shift . Curran Associates Inc., Red Hook, NY, ...

    2019

  63. [71]

    Multi-adversarial domain adaptation

    Zhongyi Pei, Zhangjie Cao, Mingsheng Long, and Jianmin Wang. Multi-adversarial domain adaptation. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposiu...

    2018

  64. [72]

    Cordeiro

    Emeson Pereira, Gustavo Carneiro, and Filipe R. Cordeiro. A study on the impact of data augmentation for training convolutional neural networks in the presence of noisy labels. In 2022 35th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI) , volume 1, pages 25--30, 2022

    2022

  65. [73]

    Fitnets: Hints for thin deep nets

    Adriana Romero, Nicolas Ballas, Samira Ebrahimi Kahou, Antoine Chassang, Carlo Gatta, and Yoshua Bengio. Fitnets: Hints for thin deep nets. In Yoshua Bengio and Yann LeCun, editors, 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-...

    2015

  66. [74]

    Zimmermann, Julian Bitterwolf, Oliver Bringmann, Matthias Bethge, and Wieland Brendel

    Evgenia Rusak, Lukas Schott, Roland S. Zimmermann, Julian Bitterwolf, Oliver Bringmann, Matthias Bethge, and Wieland Brendel. A simple way to make neural networks robust against diverse image corruptions. In Computer Vision – ECCV 2020: 16th European Conference, Glasgow, UK, A...

    2020

  67. [75]

    Zimmermann, Julian Bitterwolf, Oliver Bringmann, Matthias Bethge, and Wieland Brendel

    Evgenia Rusak, Lukas Schott, Roland S. Zimmermann, Julian Bitterwolf, Oliver Bringmann, Matthias Bethge, and Wieland Brendel. A simple way to make neural networks robust against diverse image corruptions. In Andrea Vedaldi, Horst Bischof, Thomas Brox, and Jan-Michael Frahm, ed...

    2020

  68. [76]

    Asymmetric tri-training for unsupervised domain adaptation

    Kuniaki Saito, Yoshitaka Ushiku, and Tatsuya Harada. Asymmetric tri-training for unsupervised domain adaptation. In Doina Precup and Yee Whye Teh, editors, Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017...

    2017

  69. [77]

    Maximum classifier discrepancy for unsupervised domain adaptation

    Kuniaki Saito, Kohei Watanabe, Yoshitaka Ushiku, and Tatsuya Harada. Maximum classifier discrepancy for unsupervised domain adaptation. In 2018 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2018, Salt Lake City, UT, USA, June 18-22, 2018 , pages 3723--3732. ...

    2018

  70. [78]

    Improving robustness against common corruptions by covariate shift adaptation

    Steffen Schneider, Evgenia Rusak, Luisa Eck, Oliver Bringmann, Wieland Brendel, and Matthias Bethge. Improving robustness against common corruptions by covariate shift adaptation. In Proceedings of the 34th International Conference on Neural Information Processing Systems , NI...

    2020

  71. [79]

    Learning from simulated and unsupervised images through adversarial training

    Ashish Shrivastava, Tomas Pfister, Oncel Tuzel, Joshua Susskind, Wenda Wang, and Russell Webb. Learning from simulated and unsupervised images through adversarial training. In 2017 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 2...

    2017

  72. [80]

    Transferable curriculum for weakly-supervised domain adaptation

    Yang Shu, Zhangjie Cao, Mingsheng Long, and Jianmin Wang. Transferable curriculum for weakly-supervised domain adaptation. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conferen...

    2019

  73. [81]

    Active adversarial domain adaptation

    Jong-Chyi Su, Yi-Hsuan Tsai, Kihyuk Sohn, Buyu Liu, Subhransu Maji, and Manmohan Chandraker. Active adversarial domain adaptation. In 2020 IEEE Winter Conference on Applications of Computer Vision (WACV) , pages 728--737, 2020

    2020

  74. [82]

    Deep coral: Correlation alignment for deep domain adaptation

    Baochen Sun and Kate Saenko. Deep coral: Correlation alignment for deep domain adaptation. In Gang Hua and Herve Jegou, editors, Computer Vision - ECCV 2016 Workshops - Amsterdam, The Netherlands, October 8-10 and 15-16, 2016, Proceedings, Part III , volume 9915 of Lecture Not...

    2016

  75. [83]

    Efros, and Moritz Hardt

    Yu Sun, Xiaolong Wang, Zhuang Liu, John Miller, Alexei A. Efros, and Moritz Hardt. Test-time training with self-supervision for generalization under distribution shifts. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtua...

    2020

  76. [84]

    Discriminative adversarial domain adaptation

    Hui Tang and Kui Jia. Discriminative adversarial domain adaptation. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational A...

    2020

  77. [85]

    Measuring robustness to natural distribution shifts in image classification

    Rohan Taori, Achal Dave, Vaishaal Shankar, Nicholas Carlini, Benjamin Recht, and Ludwig Schmidt. Measuring robustness to natural distribution shifts in image classification. In Proceedings of the 34th International Conference on Neural Information Processing Systems , NIPS '20...

    2020

  78. [86]

    Contrastive representation distillation

    Yonglong Tian, Dilip Krishnan, and Phillip Isola. Contrastive representation distillation. In International Conference on Learning Representations , 2020

    2020

  79. [87]

    Deep learning and the information bottleneck principle

    Naftali Tishby and Noga Zaslavsky. Deep learning and the information bottleneck principle. In 2015 IEEE Information Theory Workshop, ITW 2015, Jerusalem, Israel, April 26 - May 1, 2015 , pages 1--5. IEEE , 2015

    2015

  80. [88]

    ADVENT: adversarial entropy minimization for domain adaptation in semantic segmentation

    Tuan - Hung Vu, Himalaya Jain, Maxime Bucher, Matthieu Cord, and Patrick Perez. ADVENT: adversarial entropy minimization for domain adaptation in semantic segmentation. In IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2019, Long Beach, CA, USA, June 16-20, 2...

    2019

  81. [89]

    Olshausen, and Trevor Darrell

    Dequan Wang, Evan Shelhamer, Shaoteng Liu, Bruno A. Olshausen, and Trevor Darrell. Tent: Fully test-time adaptation by entropy minimization. In 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3-7, 2021 . OpenReview.net, 2021

    2021

  82. [90]

    Continual test-time domain adaptation

    Qin Wang, Olga Fink, Luc Van Gool, and Dengxin Dai. Continual test-time domain adaptation. In IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2022, New Orleans, LA, USA, June 18-24, 2022 , pages 7191--7201. IEEE , 2022

    2022

  83. [91]

    Cross-domain contrastive learning for unsupervised domain adaptation

    Rui Wang, Zuxuan Wu, Zejia Weng, Jingjing Chen, Guo - Jun Qi, and Yu - Gang Jiang. Cross-domain contrastive learning for unsupervised domain adaptation. CoRR , abs/2106.05528, 2021

    2021 arXiv

  84. [92]

    Revisiting unsupervised domain adaptation models: a smoothness perspective

    Xiaodong Wang, Junbao Zhuo, Mengru Zhang, Shuhui Wang, and Yuejian Fang. Revisiting unsupervised domain adaptation models: a smoothness perspective. In Proceedings of the Asian Conference on Computer Vision (ACCV) , pages 1504--1521, December 2022

    2022

  85. [93]

    Girshick, Piotr Dollar, Zhuowen Tu, and Kaiming He

    Saining Xie, Ross B. Girshick, Piotr Dollar, Zhuowen Tu, and Kaiming He. Aggregated residual transformations for deep neural networks. In 2017 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 21-26, 2017 , pages 5987--5995. IEEE Co...

    2017

  86. [94]

    Larger norm more transferable: An adaptive feature norm approach for unsupervised domain adaptation

    Ruijia Xu, Guanbin Li, Jihan Yang, and Liang Lin. Larger norm more transferable: An adaptive feature norm approach for unsupervised domain adaptation. In 2019 IEEE/CVF International Conference on Computer Vision, ICCV 2019, Seoul, Korea (South), October 27 - November 2, 2019 ,...

    2019

  87. [95]

    Generalized out-of-distribution detection: A survey

    Jingkang Yang, Kaiyang Zhou, Yixuan Li, and Ziwei Liu. Generalized out-of-distribution detection: A survey. Int. J. Comput. Vision , 132(12):5635–5662, June 2024

    2024

  88. [96]

    Doubly robust calibration of prediction sets under covariate shift

    Yachong Yang, Arun Kumar Kuchibhotla, and Eric Tchetgen Tchetgen. Doubly robust calibration of prediction sets under covariate shift. Journal of the Royal Statistical Society. Series B, Statistical methodology , 86-4:943--965, 2022

    2022

  89. [97]

    A gift from knowledge distillation: Fast optimization, network minimization and transfer learning

    Junho Yim, Donggyu Joo, Ji - Hoon Bae, and Junmo Kim. A gift from knowledge distillation: Fast optimization, network minimization and transfer learning. In 2017 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 21-26, 2017 , pages 7...

    2017

  90. [98]

    Robust test-time adaptation in dynamic scenarios

    Longhui Yuan, Binhui Xie, and Shuang Li. Robust test-time adaptation in dynamic scenarios. In IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023, Vancouver, BC, Canada, June 17-24, 2023 , pages 15922--15932. IEEE , 2023

    2023

  91. [99]

    TEA: test-time energy adaptation

    Yige Yuan, Bingbing Xu, Liang Hou, Fei Sun, Huawei Shen, and Xueqi Cheng. TEA: test-time energy adaptation. In IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2024, Seattle, WA, USA, June 16-22, 2024 , pages 23901--23911. IEEE , 2024

    2024

  92. [100]

    Wide residual networks

    Sergey Zagoruyko and Nikos Komodakis. Wide residual networks. In Richard C. Wilson, Edwin R. Hancock, and William A. P. Smith, editors, Proceedings of the British Machine Vision Conference 2016, BMVC 2016, York, UK, September 19-22, 2016 . BMVA Press, 2016

    2016

  93. [101]

    Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer

    Sergey Zagoruyko and Nikos Komodakis. Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Tr...

    2017

  94. [102]

    Memo: test time robustness via adaptation and augmentation

    Marvin Zhang, Sergey Levine, and Chelsea Finn. Memo: test time robustness via adaptation and augmentation. In Proceedings of the 36th International Conference on Neural Information Processing Systems , NIPS '22, Red Hook, NY, USA, 2022. Curran Associates Inc

    2022

  95. [103]

    Yuchen Zhang, Tianle Liu, Mingsheng Long, and Michael I. Jordan. Bridging theory and algorithm for domain adaptation. In Kamalika Chaudhuri and Ruslan Salakhutdinov, editors, Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long ...

    2019

  96. [104]

    Benchmarking the robustness of deep neural networks to common corruptions in digital pathology

    Yunlong Zhang, Yuxuan Sun, Honglin Li, Sunyi Zheng, Chenglu Zhu, and Lin Yang. Benchmarking the robustness of deep neural networks to common corruptions in digital pathology. In Linwei Wang, Qi Dou, P. Thomas Fletcher, Stefanie Speidel, and Shuo Li, editors, Medical Image Comp...

    2022

  97. [105]

    Channel distillation: Channel-wise attention for knowledge distillation

    Zaida Zhou, Chaoran Zhuge, Xinwei Guan, and Wen Liu. Channel distillation: Channel-wise attention for knowledge distillation. CoRR , abs/2006.01683, 2020

    2006 arXiv

  98. [106]

    Jun - Yan Zhu, Taesung Park, Phillip Isola, and Alexei A. Efros. Unpaired image-to-image translation using cycle-consistent adversarial networks. In IEEE International Conference on Computer Vision, ICCV 2017, Venice, Italy, October 22-29, 2017 , pages 2242--2251. IEEE Compute...

    2017

Pith tools

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