EDBT 2026 Demo / reviewers in the wild / expert
Guangyuan Liu 0003
dblp:65/3383-3
· DBLP profile ↗
7ranked-venue papers
2as first author
7since 2021 · last 2026
0000-0002-8211-1403ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Artificial intelligence and machine learning · 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
3 papers |
Network management and operations · 52% Edge and fog computing · 48% | |
| Artificial intelligence
4 papers |
Generative modeling · 44% Kernel, tree and ensemble methods · 34% Reinforcement learning · 12% | |
| Network and information security
1 paper |
Network security · 100% |
Topics — the 9 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Edge and fog computing
edge intelligence |
1.0 | 1 | 2026 | LAMeTA: Intent-Aware Agentic Network Optimization via a Large AI Model-Empowered Two-Stage Approach · IEEE J. Sel. Areas Commun. 2026 |
Network management and operations
intent-based networking |
1.0 | 1 | 2026 | LAMeTA: Intent-Aware Agentic Network Optimization via a Large AI Model-Empowered Two-Stage Approach · IEEE J. Sel. Areas Commun. 2026 |
Network security › network security architecture
zero trust architecture |
1.0 | 1 | 2026 | Hierarchical Micro-Segmentations for Zero-Trust Services via Large Language Model-Enhanced Graph Diffusion · IEEE Trans. Netw. 2026 |
Machine learning › Kernel, tree and ensemble methods
gradient boosting |
0.9 | 1 | 2025 | Supervised Score-Based Modeling by Gradient Boosting · AAAI 2025 |
Machine learning › Generative modeling › diffusion model
score-based generative model |
0.9 | 1 | 2025 | Supervised Score-Based Modeling by Gradient Boosting · AAAI 2025 |
Edge and fog computing
mobile edge computing |
0.9 | 1 | 2025 | Contract-Inspired Contest Theory for Controllable Image Generation in Mobile Edge Metaverse · IEEE Trans. Mob. Comput. 2025 |
Machine learning › Reinforcement learning
deep reinforcement learning |
0.3 | 1 | 2026 | LAMeTA: Intent-Aware Agentic Network Optimization via a Large AI Model-Empowered Two-Stage Approach · IEEE J. Sel. Areas Commun. 2026 |
Machine learning › Graph learning
graph diffusion |
0.3 | 1 | 2026 | Hierarchical Micro-Segmentations for Zero-Trust Services via Large Language Model-Enhanced Graph Diffusion · IEEE Trans. Netw. 2026 |
Machine learning › Generative modeling
diffusion model |
0.3 | 1 | 2025 | Contract-Inspired Contest Theory for Controllable Image Generation in Mobile Edge Metaverse · IEEE Trans. Mob. Comput. 2025 |
Methods — techniques the papers use, named apart from their topics
large language model · 3.0graph diffusion · 3.0gradient ascent · 3.0symbiotic reinforcement learning · 2.0large AI model · 2.0knowledge distillation · 2.0contest theory · 1.7score matching · 0.9gradient boosting · 0.9generative diffusion model · 0.9denoising · 0.9deep reinforcement learning · 0.9contract theory · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | LAMeTA: Intent-Aware Agentic Network Optimization via a Large AI Model-Empowered Two-Stage ApproachabstractNowadays, Generative AI (GenAI) reshapes numerous domains by enabling machines to create content across modalities. As GenAI evolves into autonomous agents capable of reasoning, collaboration, and interaction, they are increasingly deployed on network infrastructures to serve humans automatically. This emerging paradigm, known as the agentic network, presents new optimization challenges due to the demand to incorporate subjective intents of human users expressed in natural language. Traditional generic Deep Reinforcement Learning (DRL) struggles to capture intent semantics and adjust policies dynamically, thus leading to suboptimality. In this paper, we present LAMeTA, a Large AI Model (LAM)-empowered Two-stage Approach for intent-aware agentic network optimization. First, we propose Intent-oriented Knowledge Distillation (IoKD), which efficiently distills intent-understanding capabilities from resource-intensive LAMs to lightweight edge LAMs (E-LAMs) to serve end users. Second, we develop Symbiotic Reinforcement Learning (SRL), integrating E-LAMs with a policy-based DRL framework. In SRL, E-LAMs translate natural language user intents into structured preference vectors that guide both state representation and reward design. The DRL, in turn, optimizes the generative service function chain composition and E-LAM selection based on real-time network conditions, thus optimizing the subjective Quality-of-Experience (QoE). Extensive experiments conducted in an agentic network with 81 agents demonstrate that IoKD reduces mean squared error in intent prediction by up to 22.5%, while SRL outperforms conventional generic DRL by up to 23.5% in maximizing intent-aware QoE. Yinqiu Liu, Guangyuan Liu 0003, Jiacheng Wang 0001, Ruichen Zhang 0001, Dusit Niyato, Geng Sun 0001, Zehui Xiong, Zhu Han 0001 |
IEEE J. Sel. Areas Commun. | 2 |
| 2026 | Hierarchical Micro-Segmentations for Zero-Trust Services via Large Language Model-Enhanced Graph DiffusionabstractIn the rapidly evolving Next-Generation Networking (NGN) era, the adoption of zero-trust architectures has become increasingly crucial to protect security. However, provisioning zero-trust services in NGNs poses significant challenges, primarily due to the environmental complexity and dynamics. Motivated by these challenges, this paper explores efficient zero-trust service provisioning using hierarchical micro-segmentations. Specifically, we model zero-trust networks via hierarchical graphs, thereby jointly considering the resource- and trust-level features to optimize service efficiency. We organize such zero-trust networks through micro-segmentations, which support granular zero-trust policies efficiently. To generate the optimal micro-segmentation, we present the Large Language Model-Enhanced Graph Diffusion (LEGD) algorithm, which leverages the diffusion process to realize a high-quality generation paradigm. Additionally, we utilize gradient ascent and Large Language Models (LLM) to enable LEGD to optimize the generation policy and understand complicated graphical features. Moreover, realizing the unique trustworthiness updates and service upgrades in zero-trust NGN, we further present LEGD-Adaptive Maintenance (LEGD-AM), providing an adaptive way to perform task-oriented fine-tuning on LEGD. Extensive experiments demonstrate that the proposed LEGD achieves 90% higher efficiency in provisioning services compared with other baselines. Moreover, the LEGD-AM can reduce the service outage time by over 50%. Yinqiu Liu, Guangyuan Liu 0003, Hongyang Du 0001, Dusit Niyato, Jiawen Kang 0001, Zehui Xiong, Dong In Kim 0001, Xuemin Shen |
IEEE Trans. Netw. | 2 |
| 2025 | Supervised Score-Based Modeling by Gradient BoostingabstractScore-based generative models can effectively learn the distribution of data by estimating the gradient of the distribution. Due to the multi-step denoising characteristic, researchers have recently considered combining score-based generative models with the gradient boosting algorithm, a multi-step supervised learning algorithm, to solve supervised learning tasks. However, existing generative model algorithms are often limited by the stochastic nature of the models and the long inference time, impacting prediction performances. Therefore, we propose a Supervised Score-based Model (SSM), which can be viewed as a gradient boosting algorithm combining score matching. We provide a theoretical analysis of learning and sampling for SSM to balance inference time and prediction accuracy. Via the ablation experiment in selected examples, we demonstrate the outstanding performances of the proposed techniques. Additionally, we compare our model with other probabilistic models, including Natural Gradient Boosting (NGboost), Classification and Regression Diffusion Models (CARD), Diffusion Boosted Trees (DBT), and non-probabilistic gradient boosting models. The experimental results show that our model outperforms existing models in both accuracy and inference time. Changyuan Zhao, Hongyang Du 0001, Guangyuan Liu 0003, Dusit Niyato |
AAAI | 3 |
| 2025 | Contract-Inspired Contest Theory for Controllable Image Generation in Mobile Edge MetaverseabstractThe rapid advancement of immersive technologies has propelled the development of the Metaverse, where the convergence of virtual and physical realities necessitates the generation of high-quality, photorealistic images to enhance user experience. However, generating these images, especially through Generative Diffusion Models (GDMs), in mobile edge computing environments presents significant challenges due to the limited computing resources of edge devices and the dynamic nature of wireless networks. This paper proposes a novel framework that integrates contract-inspired contest theory, Deep Reinforcement Learning (DRL), and GDMs to optimize image generation in these resource-constrained environments. The framework addresses the critical challenges of resource allocation and semantic data transmission quality by incentivizing edge devices to efficiently transmit high-quality semantic data, which is essential for creating realistic and immersive images. The use of contest and contract theory ensures that edge devices are motivated to allocate resources effectively, while DRL dynamically adjusts to network conditions, optimizing the overall image generation process. Experimental results demonstrate that the proposed approach not only improves the quality of generated images but also achieves superior convergence speed and stability compared to traditional methods. This makes the framework particularly effective for optimizing complex resource allocation tasks in mobile edge Metaverse applications, offering enhanced performance and efficiency in creating immersive virtual environments. Guangyuan Liu 0003, Hongyang Du 0001, Jiacheng Wang 0001, Dusit Niyato, Dong In Kim 0001 |
IEEE Trans. Mob. Comput. | 1 |
| 2024 | Generative Al-aided Joint Training-free Secure Semantic Communications via Multi-modal PromptsabstractSemantic communication (SemCom) holds promise for reducing network resource consumption while achieving the communications goal. However, the computational overheads in jointly training semantic encoders and decoders—and the subsequent deployment in network devices—are overlooked. Recent advances in Generative artificial intelligence (GAI) offer a potential solution. The robust learning abilities of GAI models indicate that semantic decoders can reconstruct source messages using a limited amount of semantic information, e.g., prompts, without joint training with the semantic encoder. A notable challenge, however, is the instability introduced by GAI’s diverse generation ability. This instability, evident in outputs like text-generated images, limits the direct application of GAI in scenarios demanding accurate message recovery, such as face image transmission. To solve the above problems, this paper proposes a GAI-aided SemCom system with multi-model prompts for accurate content decoding. Moreover, in response to security concerns, we introduce the application of covert communications aided by a friendly jammer. The system jointly optimizes the diffusion step, jamming, and transmitting power with the aid of the generative diffusion models, enabling successful and secure transmission of the source messages. Hongyang Du 0001, Guangyuan Liu 0003, Dusit Niyato, Jiayi Zhang 0001, Jiawen Kang 0001, Zehui Xiong, Bo Ai 0001, Dong In Kim 0001 |
ICASSP | 2 |
| 2024 | Mixture of Experts for Intelligent Networks: A Large Language Model-enabled ApproachabstractOptimizing various wireless user tasks poses a significant challenge for networking systems because of the expanding range of user requirements. Despite advancements in Deep Reinforcement Learning (DRL), the need for customized optimization tasks for individual users complicates developing and applying numerous DRL models, leading to substantial computation resource and energy consumption and can lead to inconsistent outcomes. To address this issue, we propose a novel approach utilizing a Mixture of Experts (MoE) framework, augmented with Large Language Models (LLMs), to analyze user objectives and constraints effectively, select specialized DRL experts, and weigh each decision from the participating experts. Specifically, we develop a gate network to oversee the expert models, allowing a collective of experts to tackle a wide array of new tasks. Furthermore, we innovatively substitute the traditional gate network with an LLM, leveraging its advanced reasoning capabilities to manage expert model selection for joint decisions. Our proposed method reduces the need to train new DRL models for each unique optimization problem, decreasing energy consumption and AI model implementation costs. The LLMenabled MoE approach is validated through a general maze navigation task and a specific network service provider utility maximization task, demonstrating its effectiveness and practical applicability in optimizing complex networking systems. Hongyang Du 0001, Guangyuan Liu 0003, Yijing Lin, Dusit Niyato, Jiawen Kang 0001, Zehui Xiong, Dong In Kim 0001 |
IWCMC | 2 |
| 2023 | Vision-based Semantic Communications for Metaverse Services: A Contest Theoretic ApproachabstractThe popularity of Metaverse as an entertainment, social, and work platform has led to a great need for seamless avatar integration in the virtual world. In Metaverse, avatars must be updated and rendered to reflect users' behaviour. Achieving real-time synchronization between the virtual bilocation and the user is complex, placing high demands on the Metaverse Service Provider (MSP)'s rendering resource allocation scheme. To tackle this issue, we propose a semantic communication framework that leverages contest theory to model the interactions between users and MSPs and determine optimal resource allocation for each user. To reduce the consumption of network resources in wireless transmission, we use the semantic communication technique to reduce the amount of data to be transmitted. Under our simulation settings, the encoded semantic data only contains 51 bytes of skeleton coordinates instead of the image size of 8.243 megabytes. Moreover, we implement Deep Q-Network to optimize reward settings for maximum performance and efficient resource allocation. With the optimal reward setting, users are incentivized to select their respective suitable uploading frequency, reducing down-sampling loss due to rendering resource constraints by 66.076% compared with the traditional average distribution method. The framework provides a novel solution to resource allocation for avatar association in VR environments, ensuring a smooth and immersive experience for all users. Guangyuan Liu 0003, Hongyang Du 0001, Dusit Niyato, Jiawen Kang 0001, Zehui Xiong, Boon-Hee Soong |
GLOBECOM | 1 |