EDBT 2026 Demo / reviewers in the wild / expert
Yunhao Sha
dblp:384/9406
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0005-9147-9604ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 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.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › document retrieval › domain-specific retrieval
code search |
0.9 | 1 | 2025 | MGS3: A Multi-Granularity Self-Supervised Code Search Framework · KDD (1) 2025 |
Program analysis
code representation learning |
0.9 | 1 | 2025 | MGS3: A Multi-Granularity Self-Supervised Code Search Framework · KDD (1) 2025 |
Methods — techniques the papers use, named apart from their topics
hierarchical representation · 1.7contrastive learning · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | MGS3: A Multi-Granularity Self-Supervised Code Search FrameworkabstractIn the pursuit of enhancing software reusability and developer productivity, code search has emerged as a key area, aimed at retrieving code snippets relevant to functionalities based on natural language queries. Despite significant progress in self-supervised code pre-training utilizing the vast amount of code data in repositories, existing methods have primarily focused on leveraging contrastive learning to align natural language with function-level code snippets. These studies have overlooked the abundance of fine-grained (such as block-level and statement-level) code snippets prevalent within the function-level code snippets, which results in suboptimal performance across all levels of granularity. To address this problem, we first construct a multi-granularity code search dataset called MGCodeSearchNet, which contains 536K+ pairs of natural language and code snippets. Subsequently, we introduce a novel Multi-Granularity Self-Supervised contrastive learning code Search framework (MGS3). First, MGS3 features a Hierarchical Multi-Granularity Representation module (HMGR), which leverages syntactic structural relationships for hierarchical representation and aggregates fine-grained information into coarser-grained representations. Then, during the contrastive learning phase, we endeavor to construct positive samples of the same granularity for fine-grained code, and introduce in-function negative samples for fine-grained code. Finally, we conduct extensive experiments on code search benchmarks across various granularities, demonstrating that the framework exhibits outstanding performance in code search tasks of multiple granularities. These experiments also showcase its model-agnostic nature and compatibility with existing pre-trained code representation models. Rui Li 0093, Junfeng Kang, Qi Liu 0003, Liyang He, Zheng Zhang 0048, Yunhao Sha, Linbo Zhu, Zhenya Huang |
KDD (1) | 6 |
| 2024 | Towards Few-Shot Self-explaining Graph Neural Networks
Jingyu Peng, Qi Liu 0003, Linan Yue, Zaixi Zhang, Kai Zhang 0038, Yunhao Sha |
ECML/PKDD (6) | 6 |