Demo Data from EDBT 2026 / reviewers in the wild / expert
Mingyu Guan
dblp:320/8484
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Hardware accelerators and domain-specific architectures · 64% High-performance computing · 36% | |
| Artificial intelligence
2 papers |
Efficient and distributed learning · 53% Graph learning · 47% | |
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph neural network
heterogeneous graph neural network |
0.9 | 1 | 2025 | Heterogeneous Graph Neural Network on Semantic Tree · AAAI 2025 |
High-performance computing
performance optimization |
0.9 | 1 | 2025 | Principles and Methodologies for Serial Performance Optimization · OSDI 2025 |
Machine learning › Efficient and distributed learning › adaptive computation
input-adaptive computation |
0.8 | 1 | 2024 | Improving DNN Inference Throughput Using Practical, Per-Input Compute Adaptation · SOSP 2024 |
Hardware accelerators and domain-specific architectures › machine learning accelerator › DNN inference
early-exit inference |
0.8 | 1 | 2024 | Improving DNN Inference Throughput Using Practical, Per-Input Compute Adaptation · SOSP 2024 |
Hardware accelerators and domain-specific architectures
machine learning accelerator |
0.8 | 1 | 2024 | Improving DNN Inference Throughput Using Practical, Per-Input Compute Adaptation · SOSP 2024 |
Compilers and program optimization
compiler optimization |
0.3 | 1 | 2025 | Principles and Methodologies for Serial Performance Optimization · OSDI 2025 |
Machine learning › Efficient and distributed learning
model compression |
0.2 | 1 | 2024 | Improving DNN Inference Throughput Using Practical, Per-Input Compute Adaptation · SOSP 2024 |
Methods — techniques the papers use, named apart from their topics
early exit · 1.5block replication · 1.5subtree attention · 0.9metapath encoding · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | An efficient image encryption algorithm utilizing coordinate mapping and the phenomenon of water wave diffusion
Kexin Ning, Mingyu Guan, Zheng Wang 0043 |
Neural Comput. Appl. | 2 |
| 2025 | Heterogeneous Graph Neural Network on Semantic TreeabstractThe recent past has seen an increasing interest in Heterogeneous Graph Neural Networks (HGNNs), since many real-world graphs are heterogeneous in nature, from citation graphs to email graphs. However, existing methods ignore a tree hierarchy among metapaths, naturally constituted by different node types and relation types. In this paper, we present HetTree, a novel HGNN that models both the graph structure and heterogeneous aspects in a scalable and effective manner. Specifically, HetTree builds a semantic tree data structure to capture the hierarchy among metapaths. To effectively encode the semantic tree, HetTree uses a novel subtree attention mechanism to emphasize metapaths that are more helpful in encoding parent-child relationships. Moreover, HetTree proposes carefully matching pre-computed features and labels correspondingly, constituting a complete metapath representation. Our evaluation of HetTree on a variety of real-world datasets demonstrates that it outperforms all existing baselines on open benchmarks and efficiently scales to large real-world graphs with millions of nodes and edges. Mingyu Guan, Jack W. Stokes, Qinlong Luo, Fuchen Liu, Purvanshi Mehta, Elnaz Nouri, Taesoo Kim |
AAAI | 1 |
| 2025 | Principles and Methodologies for Serial Performance Optimization
Mingyu Guan, Taesoo Kim |
OSDI | 2 |
| 2024 | Improving DNN Inference Throughput Using Practical, Per-Input Compute AdaptationabstractMachine learning inference platforms continue to face high request rates and strict latency constraints. Existing solutions largely focus on compressing models to substantially lower compute costs (and time) with mild accuracy degradations. This paper explores an alternate (but complementary) technique that trades off accuracy and resource costs on a perinput granularity: early exit models, which selectively allow certain inputs to exit a model from an intermediate layer. Though intuitive, early exits face fundamental deployment challenges, largely owing to the effects that exiting inputs have on batch size (and resource utilization) throughout model execution. We present E3, the first system that makes early exit models practical for realistic inference deployments. Our key insight is to split and replicate blocks of layers in models in a manner that maintains a constant batch size throughout execution, all the while accounting for resource requirements and communication overheads. Evaluations with NLP and vision models show that E3 can deliver up to 1.74× improvement in goodput (for a fixed cost) or 1.78× reduction in cost (for a fixed goodput). Additionally, E3's goodput wins generalize to autoregressive LLMs (2.8--3.8×) and compressed models (1.67×). Anand Padmanabha Iyer, Mingyu Guan, Yinwei Dai, Rui Pan 0003, Swapnil Gandhi, Ravi Netravali |
SOSP | 2 |