Demo Data from SIGIR 2026 / reviewers in the wild / expert
Siyu Zhan
dblp:19/7634
· DBLP profile ↗
6ranked-venue papers
0as first author
5since 2021 · last 2026
0000-0003-0861-5491ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 since 2021Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, 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.
| Computer networks
1 paper |
Edge and fog computing · 100% | |
| Computer graphics and multimedia
1 paper |
Multimedia analysis and retrieval · 100% | |
| Artificial intelligence
1 paper |
Reinforcement learning · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Multimedia analysis and retrieval
multimodal emotion recognition |
1.0 | 1 | 2026 | TiCAL: Typicality-Based Consistency-Aware Learning for Multimodal Emotion Recognition · AAAI 2026 |
Multimedia analysis and retrieval
multimodal fusion |
1.0 | 1 | 2026 | TiCAL: Typicality-Based Consistency-Aware Learning for Multimodal Emotion Recognition · AAAI 2026 |
Edge and fog computing › mobile edge computing
computation offloading |
0.8 | 1 | 2024 | Computation Offloading in Resource-Constrained Multi-Access Edge Computing · IEEE Trans. Mob. Comput. 2024 |
Edge and fog computing
mobile edge computing |
0.8 | 1 | 2024 | Computation Offloading in Resource-Constrained Multi-Access Edge Computing · IEEE Trans. Mob. Comput. 2024 |
Edge and fog computing
multi-agent coordination |
0.8 | 1 | 2024 | Computation Offloading in Resource-Constrained Multi-Access Edge Computing · IEEE Trans. Mob. Comput. 2024 |
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
0.2 | 1 | 2024 | Computation Offloading in Resource-Constrained Multi-Access Edge Computing · IEEE Trans. Mob. Comput. 2024 |
Methods — techniques the papers use, named apart from their topics
virtual energy queue · 1.5topk message broadcasting · 1.5scheduled multi-agent deep reinforcement learning · 1.5typicality estimation · 1.0pseudo-labeling · 1.0hyperbolic embedding · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | TiCAL: Typicality-Based Consistency-Aware Learning for Multimodal Emotion RecognitionabstractMultimodal Emotion Recognition (MER) aims to accurately identify human emotional states by integrating heterogeneous modalities such as visual, auditory, and textual data. Existing approaches predominantly rely on unified emotion labels to supervise model training, often overlooking a critical challenge: inter-modal emotion conflicts, wherein different modalities within the same sample may express divergent emotional tendencies. In this work, we address this overlooked issue by proposing a novel framework, Typicality-based Consistent-aware Multimodal Emotion Recognition (TiCAL), inspired by the stage-wise nature of human emotion perception. TiCAL dynamically assesses the consistency of each training sample by leveraging pseudo unimodal emotion labels alongside a typicality estimation. To further enhance emotion representation, we embed features in a hyperbolic space, enabling the capture of fine-grained distinctions among emotional categories. By incorporating consistency estimates into the learning process, our method improves model performance, particularly on samples exhibiting high modality inconsistency. Extensive experiments on benchmark datasets, e.g, MOSEI and MER2023, validate the effectiveness of TiCAL in mitigating inter-modal emotional conflicts and enhancing overall recognition accuracy, e.g., with about 2.6% improvements over the state-of-the-art DMD. Siyu Zhan, Cencen Liu, Guiduo Duan, Xiurui Xie, Yuan-Fang Li, Tao He 0007 |
AAAI | 2 |
| 2026 | Multimodal learning with missing modalities: Can progressive diffusion achieve distribution-consistent learning from incomplete multimodal data?
Ruiting Dai, Aoqiang Jian, Ruoxuan Zhang, Yuang Jia, Lisi Mo, Siyu Zhan, Tao He 0007 |
Knowl. Based Syst. | 6 |
| 2024 | Computation Offloading in Resource-Constrained Multi-Access Edge ComputingabstractRecently, computation offloading methods have greatly improved the Quality of Experience (QoE) in Multi-access Edge Computing (MEC) by offloading tasks to the edge servers. Since well-coordinated actions of Terminal Devices (TDs) are critical to improving the performance of the entire individual system, many practical MEC-based applications, i.e., firefighting robots and unmanned aerial vehicles, require great teamwork among TDs. However, real-world scenarios are usually bound by resource conditions. For instance, network connectivity may weaken or experience interruptions during emergency situations. In cases where the communication medium is utilized by multiple TDs, achieving effective coordination poses a significant challenge. In this paper, we propose a computation offloading scheme based on Scheduled Multi-agent Deep Reinforcement Learning (SMDRL) to make the most efficient decision in a resource-constrained scenario. First, we design a virtual energy queue based on the MEC system and maximize the QoE (related to service delay and energy consumption) in a real-time manner. Subsequently, we propose a scheduled multi-agent deep reinforcement learning algorithm to support each TD in learning how to encode messages, select actions, and schedule itself based on the received messages. Furthermore, a TopK mechanism is introduced. This mechanism chooses the most crucial TDs to broadcast their messages, and then the computation offloading problem in a communication-constrained MEC environment can be solved in a low-communication manner. Also, we prove that even under limited communication conditions, our proposed methods can still lead to the close-to-optimal performance. The final performance analysis shows that the developed scheme has significant advantages over other representative schemes. Kexin Li 0003, Xingwei Wang 0001, Qiang He 0002, Jielei Wang, Jie Li 0008, Siyu Zhan, Guoming Lu, Schahram Dustdar |
IEEE Trans. Mob. Comput. | 6 |
| 2022 | SOAR: A Learned Join Order Selector with Graph Attention MechanismabstractOptimal join order selection often leads to optimal query execution plans while traversing the solution space is almost impossible which expands rapidly with the increase of join complexity. In the past research, considerable attention has been paid to heuristic rules for pruning. However, that may not work well facing complex SQL queries. Recent use of the reinforcement learning avoids traversing the solution space, but inaccurate long-term rewards may be obtained because of the inconsistent influence of various parts in the join tree. In this paper, SOAR is proposed, a novel learned optimizer that selects join orders through reinforcement learning with graph attention network. SOAR captures the tree structure by inputting the join tree in which each node carries database features into graph neural network and learns the inconsistent influence of join tree on long-term reward with graph attention mechanism in the process of reinforcement learning. The preliminary results demonstrate that SOAR can match or outperform the optimizer in PostgreSQL. Weiqing Zhou, Siyu Zhan, Bo Dai 0006 |
IJCNN | 2 |
| 2021 | CELA: An Accurate Learned Cardinality Estimator with Strong Generalization Ability and Dimensional Adaptability
Weiqing Zhou, Siyu Zhan, Bo Dai 0006 |
WISE (1) | 2 |
| 2019 | Iteration on single vector for extracting two extremal eigenpairs of symmetric matrices
Ying Tang 0002, Siyu Zhan, Yinrun Li |
Neurocomputing | 3 |