Demo Data from VLDB 2026 / reviewers in the wild / expert
Yuheng Pan
dblp:219/2154
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 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 · 61% Planning, search and constraint satisfaction · 30% Motion planning and robot control · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
hierarchical reinforcement learning |
0.9 | 1 | 2025 | Progress Reward Model for Reinforcement Learning via Large Language Models · NeurIPS 2025 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › task planning
LLM-based task planning |
0.9 | 1 | 2025 | Progress Reward Model for Reinforcement Learning via Large Language Models · NeurIPS 2025 |
Machine learning › Reinforcement learning › reward design
reward shaping |
0.9 | 1 | 2025 | Progress Reward Model for Reinforcement Learning via Large Language Models · NeurIPS 2025 |
Robotics › Motion planning and robot control
robot control |
0.3 | 1 | 2025 | Progress Reward Model for Reinforcement Learning via Large Language Models · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
potential-based reward shaping · 0.9large language model · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Progress Reward Model for Reinforcement Learning via Large Language ModelsabstractTraditional reinforcement learning (RL) algorithms face significant limitations in handling long-term tasks with sparse rewards.
Recent advancements have leveraged large language models (LLMs) to enhance RL by utilizing their world knowledge for task planning and reward generation.
However, planning-based approaches often depend on pre-defined skill libraries and fail to optimize low-level control policies, while reward-based methods require extensive human feedback or exhaustive searching due to the complexity of tasks.
In this paper, we propose the Progress Reward Model for RL (PRM4RL), a novel framework that integrates task planning and dense reward to enhance RL.
For high-level planning, a complex task is decomposed into a series of simple manageable subtasks, with a subtask-oriented, fine-grained progress function designed to monitor task execution progress.
For low-level reward generation, inspired by potential-based reward shaping, we use the progress function to construct a Progress Reward Model (PRM), providing theoretically grounded optimality and convergence guarantees, thereby enabling effective policy optimization.
Experimental results on robotics control tasks demonstrate that our approach outperforms both LLM-based planning and reward methods, achieving state-of-the-art performance. Xiuhui Zhang, Ning Gao 0004, Xingyu Jiang 0003, Yuheng Pan, Mohan Zhang, Yue Deng 0001 |
NeurIPS | 5 |
| 2025 | Segmentation of Kidney Tumors in CT Images Based on the RAScU-Net NetworkabstractABSTRACT Renal CT images contain complex spatial volumetric information, and deep learning models have difficulty learning consistent features from images with different voxel spacing, resulting in suboptimal segmentation performance for kidney tumors. We have introduced a modified deep learning model called RAScU‐Net to address these challenges. The RAScU‐Net adopts a coarse‐to‐fine segmentation strategy and a novel voxel spacing unification method to segment renal regions while preserving CT image data. The residual asymmetric self‐calibration (RASc) and residual self‐calibration (ResSc) modules are designed to capture feature information from CT images with different voxel spacings, thereby establishing long‐range dependencies. Finally, the innovative Channel Attention Gate (CAG) module generates attention maps from multiple perspectives, facilitating the integration of high‐ and low‐level features. The experimental results demonstrate that the RAScU‐Net significantly surpasses existing kidney tumor segmentation networks, achieving Dice scores of 0.882 and 0.877 for tumor segmentation of KiTS19 and KiTS21, respectively. Yuheng Pan, Weijia Lu, Jia Cong |
Concurr. Comput. Pract. Exp. | 1 |