EDBT 2026 Demo / reviewers in the wild / expert
Yue Wang 0092
dblp:33/4822-92
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
0009-0003-2207-5804ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 |
Efficient and distributed learning · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% | |
| Computer networks
1 paper |
Edge and fog computing · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
Wearable and physiological sensing · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Energy-efficient computing · 100% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
resource-efficient learning |
1.0 | 1 | 2026 | Resource Efficient Sleep Staging via Multi-Level Masking and Prompt Learning · AAAI 2026 |
Medical and health informatics › biomedical signal processing › physiological signal analysis › sleep analysis
sleep staging |
1.0 | 1 | 2026 | Resource Efficient Sleep Staging via Multi-Level Masking and Prompt Learning · AAAI 2026 |
Machine learning › Efficient and distributed learning
model compression |
0.8 | 1 | 2024 | Reliable or Green? Continual Individualized Inference Provisioning in Fabric Metaverse via Multi-Exit Acceleration · IEEE Trans. Mob. Comput. 2024 |
Energy-efficient computing › energy-aware scheduling
green energy-aware scheduling |
0.2 | 1 | 2024 | Reliable or Green? Continual Individualized Inference Provisioning in Fabric Metaverse via Multi-Exit Acceleration · IEEE Trans. Mob. Comput. 2024 |
Methods — techniques the papers use, named apart from their topics
prompt learning · 3.0masking · 3.0hierarchical prompt aggregation · 3.0markov decision process · 2.3learning-based scheduling · 2.3integer linear programming · 2.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Resource Efficient Sleep Staging via Multi-Level Masking and Prompt LearningabstractAutomatic sleep staging plays a vital role in assessing sleep quality and diagnosing sleep disorders. Most existing methods rely heavily on long and continuous EEG recordings, which poses significant challenges for data acquisition in resource-constrained systems, such as wearable or home-based monitoring systems. In this paper, we propose the task of resource-efficient sleep staging, which aims to reduce the amount of signal collected per sleep epoch while maintaining reliable classification performance. To solve this task, we adopt the masking and prompt learning strategy and propose a novel framework called Mask-Aware Sleep Staging (MASS). Specifically, we design a multi-level masking strategy to promote effective feature modeling under partial and irregular observations. To mitigate the loss of contextual information introduced by masking, we further propose a hierarchical prompt learning mechanism that aggregates unmasked data into a global prompt, serving as a semantic anchor for guiding both patch-level and epoch-level feature modeling. MASS is evalutaed on four datasets, demonstrating state-of-the-art performance, especially when the amount of data is very limited. This result highlights its potential for efficient and scalable deployment in real-world low-resource sleep monitoring environments. Lejun Ai, Haodong Yi, Jixuan Xie, Yue Wang 0092, Jia Liu 0009, Min Chen 0003, Rui Wang 0077 |
AAAI | 5 |
| 2026 | HateMediator: Fine-Tuning Large Language Models for Counter-Hate Speech via Multiturn MediationsabstractThe proliferation of hate speech on social media presents an escalating threat to both public discourse and individual mental well-being. Traditional strategies that prioritize detection and removal often neglect to engage directly with hate speakers or address the underlying causes of their hostility. This article proposesHateMediator, a dialogue-based intervention framework that fine-tunes large language models (LLMs) to generate persuasive, context-aware counter-hate speech. The framework emphasizes two core aspects: the generation of effective counter-hate responses and their evaluation through multiturn dialogues. Our fine-tuning approach integrates tutorial-based learning with critical token guidance, enabling LLMs to recognize and reproduce strategic rhetorical patterns observed in expert interventions. To support training and evaluation, we introduce theMedHatedataset, grounded in social science theory, comprising complete dialogue records from 85 real-world hate incidents (including 255 dialogues), expert-crafted counter-responses, and feedback from the original hate speakers. Experimental results show thatHateMediatorconsistently outperforms baseline LLMs across multiple evaluation dimensions. This study advances both the technical frontier of hate speech intervention and the ethical deployment of LLMs in addressing complex social issues. Xiaokun Wu 0004, Lejun Ai, Limeng Lu, Jixuan Xie, Yue Wang 0092, Jiaxin Luo, Delu Zeng, Min Chen 0003, Giancarlo Fortino |
IEEE Trans. Comput. Soc. Syst. | 6 |
| 2024 | Reliable or Green? Continual Individualized Inference Provisioning in Fabric Metaverse via Multi-Exit AccelerationabstractFabric metaverse employs intelligence fibers embedded with flexible sensors to unknowingly gather and transmit massive hypermodal data around humans to a deep neural network-based metaverse inference service (DMS) for continual and real-time analysis. Each DMS has one primary branch and multiple side branches that allow early termination of service with differential accuracy and energy consumption. However, the continual provisioning of compute-intensive DMS with varying requirements for service model, accuracy, delay, and reliability poses a challenge for edge servers characterized by restricted computing resources and intermittent green energy. In this paper, we focus on a continual individualized DMS provisioning problem in the fabric metaverse consisting of a side branch insertion subproblem and a server activation and service deployment subproblem, and formulate them as Integer linear Programming and Markov Decision Process, respectively. Then, we propose a green continual inference (GCI) system, where a pruner with provable approximation ratios trims superfluous branches of every model to the given number$K$to minimize total overflow accuracy between accuracy demands and reserved branches assigned to users. Based on this exit result, each DMS is further divided into several blocks with dependencies to exploit constrained resources of computing and energy in a fine-grained manner. Finally, a learning-based scheduler is merged into GCI to maximize request throughput while minimizing the activation number of edge servers on different demand scenarios, by adaptively activating suitable servers and deploying required blocks and their corresponding backups on selected servers. Theoretical analyses, simulations, and experiments demonstrate that the GCI is promising compared with baseline algorithms. Min Chen 0003, Weifa Liang, Dusit Niyato, Yue Wang 0092, Victor C. M. Leung, Yixue Hao, Long Hu, Yin Zhang 0002 |
IEEE Trans. Mob. Comput. | 5 |