Demo Data from EDBT 2026 / reviewers in the wild / expert
Pengyi Ye
dblp:276/4998
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 since 2021Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
2 papers |
Representation and self-supervised learning · 32% Transfer learning and domain adaptation · 25% Image recognition and object detection · 19% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation |
1.4 | 2 | 2025 | Ordinal Unsupervised Domain Adaptation With Recursively Conditional Gaussian Imposed Variational Disentanglement · IEEE Trans. Pattern Anal. Mach. Intell. 2025 Recursively Conditional Gaussian for Ordinal Unsupervised Domain Adaptation · ICCV 2021 |
Computer vision › Image recognition and object detection
ordinal classification |
1.0 | 2 | 2025 | Ordinal Unsupervised Domain Adaptation With Recursively Conditional Gaussian Imposed Variational Disentanglement · IEEE Trans. Pattern Anal. Mach. Intell. 2025 Recursively Conditional Gaussian for Ordinal Unsupervised Domain Adaptation · ICCV 2021 |
Machine learning › Representation and self-supervised learning › representation learning › disentangled representation learning
disentanglement |
0.9 | 1 | 2025 | Ordinal Unsupervised Domain Adaptation With Recursively Conditional Gaussian Imposed Variational Disentanglement · IEEE Trans. Pattern Anal. Mach. Intell. 2025 |
Machine learning › Representation and self-supervised learning › representation learning › disentangled representation learning
variational disentanglement |
0.9 | 1 | 2025 | Ordinal Unsupervised Domain Adaptation With Recursively Conditional Gaussian Imposed Variational Disentanglement · IEEE Trans. Pattern Anal. Mach. Intell. 2025 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › bayesian network
conditional gaussian network |
0.5 | 1 | 2021 | Recursively Conditional Gaussian for Ordinal Unsupervised Domain Adaptation · ICCV 2021 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process |
0.5 | 1 | 2021 | Recursively Conditional Gaussian for Ordinal Unsupervised Domain Adaptation · ICCV 2021 |
Computer vision › Face, body and person analysis
facial age estimation |
0.3 | 1 | 2025 | Ordinal Unsupervised Domain Adaptation With Recursively Conditional Gaussian Imposed Variational Disentanglement · IEEE Trans. Pattern Anal. Mach. Intell. 2025 |
Medical and health informatics
clinical diagnosis |
0.3 | 1 | 2025 | Ordinal Unsupervised Domain Adaptation With Recursively Conditional Gaussian Imposed Variational Disentanglement · IEEE Trans. Pattern Anal. Mach. Intell. 2025 |
Methods — techniques the papers use, named apart from their topics
self-training · 2.2variational disentanglement · 1.7recursively conditional gaussian · 1.7three-sigma rule · 0.5recursive conditional gaussian · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Ordinal Unsupervised Domain Adaptation With Recursively Conditional Gaussian Imposed Variational DisentanglementabstractThere has been a growing interest in unsupervised domain adaptation (UDA) to alleviate the data scalability issue, while the existing works usually focus on classifying independently discrete labels. However, in many tasks (e.g., medical diagnosis), the labels are discrete and successively distributed. The UDA for ordinal classification requires inducing non-trivial ordinal distribution prior to the latent space. Target for this, the partially ordered set (poset) is defined for constraining the latent vector. Instead of the typically i.i.d. Gaussian latent prior, in this work, a recursively conditional Gaussian (RCG) set is proposed for ordered constraint modeling, which admits a tractable joint distribution prior. Furthermore, we are able to control the density of content vectors that violate the poset constraint by a simple "three-sigma rule." We explicitly disentangle the cross-domain images into a shared ordinal prior induced ordinal content space and two separate source/target ordinal-unrelated spaces, and the self-training is worked on the shared space exclusively for ordinal-aware domain alignment. Extensive experiments on UDA medical diagnoses and facial age estimation demonstrate its effectiveness. Xiaofeng Liu 0001, Site Li, Yubin Ge, Pengyi Ye, Jane You, Jun Lu 0002 |
IEEE Trans. Pattern Anal. Mach. Intell. | 4 |
| 2021 | Recursively Conditional Gaussian for Ordinal Unsupervised Domain AdaptationabstractThe unsupervised domain adaptation (UDA) has been widely adopted to alleviate the data scalability issue, while the existing works usually focus on classifying independently discrete labels. However, in many tasks (e.g., medical diagnosis), the labels are discrete and successively distributed. The UDA for ordinal classification requires inducing non-trivial ordinal distribution prior to the latent space. Target for this, the partially ordered set (poset) is defined for constraining the latent vector Instead of the typically i.i.d. Gaussian latent prior, in this work, a recursively conditional Gaussian (RCG) set is adapted for ordered constraint modeling, which admits a tractable joint distribution prior Furthermore, we are able to control the density of content vector that violates the poset constraints by a simple "three-sigma rule". We explicitly disentangle the cross-domain images into a shared ordinal prior induced ordinal content space and two separate source/target ordinal-unrelated spaces, and the self-training is worked on the shared space exclusively for ordinal-aware domain alignment. Extensive experiments on UDA medical diagnoses and facial age estimation demonstrate its effectiveness. Xiaofeng Liu 0001, Site Li, Yubin Ge, Pengyi Ye, Jane You, Jun Lu 0002 |
ICCV | 4 |
| 2020 | SWE2: SubWord Enriched and Significant Word Emphasized Framework for Hate Speech DetectionabstractHate speech detection on online social networks has become one of the emerging hot topics in recent years. With the broad spread and fast propagation speed across online social networks, hate speech makes significant impacts on society by increasing prejudice and hurting people. Therefore, there are aroused attention and concern from both industry and academia. In this paper, we address the hate speech problem and propose a novel hate speech detection framework called SWE2, which only relies on the content of messages and automatically identifies hate speech. In particular, our framework exploits both word-level semantic information and sub-word knowledge. It is intuitively persuasive and also practically performs well under a situation with/without character-level adversarial attack. Experimental results show that our proposed model achieves 0.975 accuracy and 0.953 macro F1, outperforming 7 state-of-the-art baselines under no adversarial attack. Our model robustly and significantly performed well under extreme adversarial attack (manipulation of 50% messages), achieving 0.967 accuracy and 0.934 macro F1. Guanyi Mou, Pengyi Ye, Kyumin Lee |
CIKM | 2 |