VLDB 2026 Research / reviewers in the wild / expert
Xiaosen Hu
dblp:413/6560
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0001-0809-0405ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 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
1 paper |
Reinforcement learning · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
deep reinforcement learning |
0.9 | 1 | 2025 | Optimizing Profit and Delay in Computing Power Network via Deep Deterministic Policy Gradient: A Task Decomposition and Computing Path Optimization Approach · IEEE Trans. Serv. Comput. 2025 |
Machine learning › Reinforcement learning › multi-agent reinforcement learning › multi-agent policy gradient
multi-agent deep deterministic policy gradient |
0.9 | 1 | 2025 | Optimizing Profit and Delay in Computing Power Network via Deep Deterministic Policy Gradient: A Task Decomposition and Computing Path Optimization Approach · IEEE Trans. Serv. Comput. 2025 |
Cloud and datacenter computing
computation offloading |
0.9 | 1 | 2025 | Optimizing Profit and Delay in Computing Power Network via Deep Deterministic Policy Gradient: A Task Decomposition and Computing Path Optimization Approach · IEEE Trans. Serv. Comput. 2025 |
Cloud and datacenter computing
edge and fog computing |
0.9 | 1 | 2025 | Optimizing Profit and Delay in Computing Power Network via Deep Deterministic Policy Gradient: A Task Decomposition and Computing Path Optimization Approach · IEEE Trans. Serv. Comput. 2025 |
Mathematical optimization › continuous optimization
convex optimization |
0.3 | 1 | 2025 | Optimizing Profit and Delay in Computing Power Network via Deep Deterministic Policy Gradient: A Task Decomposition and Computing Path Optimization Approach · IEEE Trans. Serv. Comput. 2025 |
Methods — techniques the papers use, named apart from their topics
task decomposition · 2.6deep deterministic policy gradient · 2.6convex optimization · 2.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Optimizing Profit and Delay in Computing Power Network via Deep Deterministic Policy Gradient: A Task Decomposition and Computing Path Optimization ApproachabstractIn the contemporary landscape of computationally intensive applications, Computing Power Network (CPN) offers a solution to enhance computational efficiency and cost-effectiveness by integrating and sharing computing resources. However, with the surge in task volume within multi-user environments, effectively scheduling these tasks to optimize system profit and delay presents a significant challenge. This paper introduces an optimization approach leveraging Deep Deterministic Policy Gradient (DDPG) to enhance CPN performance through task decomposition and computing path optimization. We initially construct a multi-layer CPN system model encompassing cloud computing, edge computing, and terminal device layers. Subsequently, we integrate a novel mechanism for convex optimization-based task decomposition, enabling intelligent subdivision of tasks into sub-tasks and dynamic allocation to suitable nodes within the network. Furthermore, we devise a Convex Optimization Task Decomposition-based Multi-Agent Deep Deterministic Policy Gradient (CO-MADDPG) algorithm, empowering multiple computing tasks as independent agents to learn and identify optimal offloading paths and computing nodes, thereby minimizing delay and maximizing system profit. A series of simulation experiments validate the effectiveness of the CO-MADDPG algorithm in handling concurrent tasks, demonstrating its capability to reduce task completion times, enhance system revenue, and maintain adaptability and stability across varying task demands. Bo Ma 0009, Xiaosen Hu, Yexin Pan, Chuanhuang Li |
IEEE Trans. Serv. Comput. | 2 |