Demo Data from EDBT 2026 / reviewers in the wild / expert
Jiesheng Wang
dblp:80/1303
· DBLP profile ↗
4ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
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 |
Trustworthy machine learning · 61% Reinforcement learning · 39% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
distributional shift |
0.9 | 1 | 2025 | Dynamic Uncertainty Estimation for Offline Reinforcement Learning · AAAI 2025 |
Machine learning › Reinforcement learning
offline reinforcement learning |
0.9 | 1 | 2025 | Dynamic Uncertainty Estimation for Offline Reinforcement Learning · AAAI 2025 |
Machine learning › Trustworthy machine learning
uncertainty estimation |
0.9 | 1 | 2025 | Dynamic Uncertainty Estimation for Offline Reinforcement Learning · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
dynamic pessimism adjustment · 0.9density-truncated OOD sampling · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Dynamic Uncertainty Estimation for Offline Reinforcement LearningabstractOffline reinforcement learning confronts the distributional shift challenge, a consequence of learning policy from static datasets. Current methods primarily handle this issue by aligning the learned policy with the behavior policy or conservatively estimating Q-values for out-of-distribution (OOD) actions. However, these approaches can lead to overly pessimistic estimation of Q-values of the OOD actions in unfamiliar situations, resulting in a suboptimal policy. To address this, we propose a new method, Dynamic Uncertainty estimation for Offline Reinforcement Learning. This method introduces a base density-truncated OOD data sampling approach to reduce the impact of extrapolation errors on uncertainty estimation. It enables conservative estimation of Q-values for OOD actions while avoiding negative impacts on in-distribution data. We also develop a dynamic uncertainty estimation mechanism to prevent excessive pessimism and enhance the generalization of the Q-function. This mechanism dynamically adjusts the degree of pessimism in the Q-function by minimizing the error between target and estimated values. Our method outperforms existing algorithms, as demonstrated by experimental results based on the D4RL benchmark, and proves its superiority in addressing the distributional shift challenge. Jiesheng Wang, Lin Li 0090, Wei Wei 0018, Yujia Zhang 0013, Xin Yang 0012 |
AAAI | 1 |
| 2016 | Research on Engineering Tuning Methods of PID Controller Parameters and Its Application
Shuxia Li, Jiesheng Wang |
ICIC (3) | 2 |
| 1994 | Three-layer perceptron based classifiers for the partial shape classification problem
Lalit Gupta, Jiesheng Wang, Alain Charles, Paul Kisatsky |
Pattern Recognit. | 2 |
| 1992 | Prototype selection rules for neural network training
Lalit Gupta, Jiesheng Wang, Alain Charles, Paul Kisatsky |
Pattern Recognit. | 2 |