Demo Data from EDBT 2026 / reviewers in the wild / expert
Yaochen Liu
dblp:253/2668
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 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 2021Systems, architecture and hardware · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 33% GPUs and heterogeneous computing · 33% Distributed systems · 33% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
data transmission |
1.0 | 1 | 2026 | Efficient Data Passing for Serverless Inference Workflows: A GPU-Centric Approach · EuroSys 2026 |
GPUs and heterogeneous computing
GPU communication |
1.0 | 1 | 2026 | Efficient Data Passing for Serverless Inference Workflows: A GPU-Centric Approach · EuroSys 2026 |
Cloud and datacenter computing
serverless computing |
1.0 | 1 | 2026 | Efficient Data Passing for Serverless Inference Workflows: A GPU-Centric Approach · EuroSys 2026 |
Machine learning › Efficient and distributed learning
inference serving |
0.3 | 1 | 2026 | Efficient Data Passing for Serverless Inference Workflows: A GPU-Centric Approach · EuroSys 2026 |
Methods — techniques the papers use, named apart from their topics
NVSHMEM · 2.0NCCL · 2.0GPU-centric data passing · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Efficient Data Passing for Serverless Inference Workflows: A GPU-Centric ApproachabstractServerless computing offers a compelling paradigm for deploying machine learning inference workflows composed of heterogeneous CPU and GPU functions. However, existing data-passing solutions in serverless systems primarily rely on host memory for data exchange (host-centric), leading to substantial data movement and salient I/O overhead. Moreover, modern GPU communication libraries (e.g., NCCL, NVSHMEM, UCX) are ill-suited to serverless environments, suffering from redundant data copies, underutilized transfer bandwidth, and inefficient temporary GPU storage. Hao Wu 0032, Yaochen Liu, Minchen Yu, Qizhen Weng 0001, Junxiao Deng, Hao Fan 0006, Song Wu 0001, Wei Wang 0030, Hai Jin 0001 |
EuroSys | 2 |
| 2024 | A Quantum Probability Driven Framework for Joint Multi-Modal Sarcasm, Sentiment and Emotion AnalysisabstractSarcasm, sentiment, and emotion are three typical kinds of spontaneous affective responses of humans to external events and they are tightly intertwined with each other. Such events may be expressed in multiple modalities (e.g., linguistic, visual and acoustic), e.g., multi-modal conversations. Joint analysis of humans’ multi-modal sarcasm, sentiment, and emotion is an important yet challenging topic, as it is a complex cognitive process involving both cross-modality interaction and cross-affection correlation. From the probability theory perspective, cross-affection correlation also means that the judgments on sarcasm, sentiment, and emotion are incompatible. However, this exposed phenomenon cannot be sufficiently modelled by classical probability theory due to its assumption of compatibility. Neither do the existing approaches take it into consideration. In view of the recent success of quantum probability (QP) in modeling human cognition, particularly contextual incompatible decision making, we take the first step towards introducing QP into joint multi-modal sarcasm, sentiment, and emotion analysis. Specifically, we propose aQUantum probabIlity driven multi-modal sarcasm, sEntiment and emoTion analysis framework, termed QUIET. Extensive experiments on two datasets and the results show that the effectiveness and advantages of QUIET in comparison with a wide range of the state-of-the-art baselines. We also show the great potential of QP in multi-affect analysis. Yaochen Liu, Yazhou Zhang 0001, Dawei Song 0001 |
IEEE Trans. Affect. Comput. | 1 |
| 2021 | CFN: A Complex-Valued Fuzzy Network for Sarcasm Detection in ConversationsabstractSarcasm detection in conversation, a theoretically and practically challenging artificial intelligence task, aims to discover elusively ironic, contemptuous, and metaphoric information implied in daily conversations. Most of the recent approaches in sarcasm detection have neglected the intrinsic vagueness and uncertainty of human language in emotional expression and understanding. To address this gap, we propose a complex-valued fuzzy network by leveraging the mathematical formalisms of quantum theory and fuzzy logic. In particular, the target utterance to be recognized is considered as a quantum superposition of a set of separate words. The contextual interaction between adjacent utterances is described as the interaction between a quantum system and its surrounding environment, constructing the quantum composite system, where the weight of interaction is determined by a fuzzy membership function. In order to model both the vagueness and uncertainty, the aforementioned superposition and composite systems are mathematically encapsulated in a density matrix. Finally, a quantum fuzzy measurement is performed on the density matrix of each utterance to yield the probabilistic outcomes of sarcasm recognition. Extensive experiments are conducted on the MUStARD and the 2020 sarcasm detection Reddit track datasets, and the results show that our model outperforms a wide range of strong baselines. Yazhou Zhang 0001, Yaochen Liu, Qiuchi Li, Prayag Tiwari, Benyou Wang, Hari Mohan Pandey, Peng Zhang 0002, Dawei Song 0001 |
IEEE Trans. Fuzzy Syst. | 2 |