Demo Data from VLDB 2026 / reviewers in the wild / expert
Xixu Hu
dblp:341/1287
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2026
0000-0002-3899-9791ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
3 papers |
Trustworthy machine learning · 64% Transfer learning and domain adaptation · 18% Learning theory · 12% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Transfer learning and domain adaptation
domain generalization |
1.0 | 1 | 2026 | Exploring Scale Shift in Crowd Localization under the Context of Domain Generalization · Int. J. Comput. Vis. 2026 |
Machine learning › Trustworthy machine learning
robustness |
0.8 | 1 | 2024 | SpecFormer: Guarding Vision Transformer Robustness via Maximum Singular Value Penalization · ECCV (54) 2024 |
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
vision transformer robustness |
0.8 | 1 | 2024 | SpecFormer: Guarding Vision Transformer Robustness via Maximum Singular Value Penalization · ECCV (54) 2024 |
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.7 | 1 | 2023 | Improving Generalization of Adversarial Training via Robust Critical Fine-Tuning · ICCV 2023 |
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training |
0.7 | 1 | 2023 | Improving Generalization of Adversarial Training via Robust Critical Fine-Tuning · ICCV 2023 |
Machine learning › Learning theory
generalization |
0.7 | 1 | 2023 | Improving Generalization of Adversarial Training via Robust Critical Fine-Tuning · ICCV 2023 |
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift |
0.7 | 1 | 2023 | Improving Generalization of Adversarial Training via Robust Critical Fine-Tuning · ICCV 2023 |
Computer vision › Image recognition and object detection › object localization
crowd localization |
0.3 | 1 | 2026 | Exploring Scale Shift in Crowd Localization under the Context of Domain Generalization · Int. J. Comput. Vis. 2026 |
Methods — techniques the papers use, named apart from their topics
maximum singular value penalization · 0.8weight interpolation · 0.7module robust criticality · 0.7fine-tuning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Exploring Scale Shift in Crowd Localization under the Context of Domain Generalization
Wang Lu 0003, Xixu Hu, Jindong Wang 0001 |
Int. J. Comput. Vis. | 5 |
| 2024 | SpecFormer: Guarding Vision Transformer Robustness via Maximum Singular Value Penalization
Xixu Hu, Runkai Zheng, Jindong Wang 0001, Cheuk Hang Leung, Qi Wu 0009, Xing Xie 0001 |
ECCV (54) | 1 |
| 2024 | Deep Into the Domain Shift: Transfer Learning Through Dependence RegularizationabstractClassical domain adaptation methods acquire transferability by regularizing the overall distributional discrepancies between features in the source domain (labeled) and features in the target domain (unlabeled). They often do not differentiate whether the domain differences come from the marginals or the dependence structures. In many business and financial applications, the labeling function usually has different sensitivities to the changes in the marginals versus changes in the dependence structures. Measuring the overall distributional differences will not be discriminative enough in acquiring transferability. Without the needed structural resolution, the learned transfer is less optimal. This article proposes a new domain adaptation approach in which one can measure the differences in the internal dependence structure separately from those in the marginals. By optimizing the relative weights among them, the new regularization strategy greatly relaxes the rigidness of the existing approaches. It allows a learning machine to pay special attention to places where the differences matter the most. Experiments on three real-world datasets show that the improvements are quite notable and robust compared to various benchmark domain adaptation models. Shumin Ma, Zhiri Yuan, Qi Wu 0009, Yiyan Huang, Xixu Hu, Cheuk Hang Leung, Dongdong Wang 0005, Zhixiang Huang |
IEEE Trans. Neural Networks Learn. Syst. | 5 |
| 2023 | Improving Generalization of Adversarial Training via Robust Critical Fine-TuningabstractDeep neural networks are susceptible to adversarial examples, posing a significant security risk in critical applications. Adversarial Training (AT) is a well-established technique to enhance adversarial robustness, but it often comes at the cost of decreased generalization ability. This paper proposes Robustness Critical Fine-Tuning (RiFT), a novel approach to enhance generalization without compromising adversarial robustness. The core idea of RiFT is to exploit the redundant capacity for robustness by fine-tuning the adversarially trained model on its non-robust-critical module. To do so, we introduce module robust criticality (MRC), a measure that evaluates the significance of a given module to model robustness under worst-case weight perturbations. Using this measure, we identify the module with the lowest MRC value as the non-robust-critical module and fine-tune its weights to obtain fine-tuned weights. Subsequently, we linearly interpolate between the adversarially trained weights and fine-tuned weights to derive the optimal fine-tuned model weights. We demonstrate the efficacy of RiFT on ResNet18, ResNet34, and WideResNet34-10 models trained on CIFAR10, CIFAR100, and Tiny-ImageNet datasets. Our experiments show that RiFT can significantly improve both generalization and out-of-distribution robustness by around 1.5% while maintaining or even slightly enhancing adversarial robustness. Code is available at https://github.com/Immortalise/RiFT. Kaijie Zhu, Xixu Hu, Jindong Wang 0001, Xing Xie 0001, Ge Yang 0002 |
ICCV | 2 |