EDBT 2026 Demo / reviewers in the wild / expert
Daolong An
dblp:371/6068
· DBLP profile ↗
5ranked-venue papers
1as first author
5since 2021 · last 2026
0009-0005-0020-1990ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
2 papers |
Reinforcement learning · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › offline reinforcement learning
offline-to-online reinforcement learning |
1.0 | 1 | 2026 | State Proficiency-Based Adaptive Fine-Tuning for Offline-to-Online Reinforcement Learning · AAAI 2026 |
Machine learning › Reinforcement learning
policy optimization |
1.0 | 1 | 2026 | State Proficiency-Based Adaptive Fine-Tuning for Offline-to-Online Reinforcement Learning · AAAI 2026 |
Machine learning › Reinforcement learning
actor-critic methods |
0.8 | 1 | 2024 | Double Buffers CEM-TD3: More Efficient Evolution and Richer Exploration · AAAI 2024 |
Machine learning › Reinforcement learning › population-based learning › evolutionary learning › population-based reinforcement learning
evolutionary reinforcement learning |
0.8 | 1 | 2024 | Double Buffers CEM-TD3: More Efficient Evolution and Richer Exploration · AAAI 2024 |
Machine learning › Reinforcement learning
off-policy reinforcement learning |
0.8 | 1 | 2024 | Double Buffers CEM-TD3: More Efficient Evolution and Richer Exploration · AAAI 2024 |
Machine learning › Reinforcement learning
policy search |
0.8 | 1 | 2024 | Double Buffers CEM-TD3: More Efficient Evolution and Richer Exploration · AAAI 2024 |
Machine learning › Reinforcement learning
continuous control |
0.2 | 1 | 2024 | Double Buffers CEM-TD3: More Efficient Evolution and Richer Exploration · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
sample prioritization · 1.0adaptive fine-tuning · 1.0twin delayed deep deterministic policy gradient · 0.8experience replay · 0.8cross-entropy method · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | State Proficiency-Based Adaptive Fine-Tuning for Offline-to-Online Reinforcement LearningabstractIn offline-to-online (O2O) reinforcement learning, achieving efficient performance improvement while maintaining training stability remains a critical challenge for effective fine-tuning. Existing O2O methods usually focus on the balance between policy improvement and policy constraint during online fine-tuning. However, they often overlook sample differences, leading to suboptimal performance. To address this challenge, we identify that the effectiveness of policy learning exhibits significant variation across states. Therefore, we propose the notion of state proficiency to capture the degree of effective learning in a given state. We propose State Proficiency-Based Adaptive Fine-Tuning (SPA), a straightforward yet effective method that establishes proficiency-based sample priorities in policy optimization to facilitate effective fine-tuning. Specifically, SPA focuses on low proficiency samples during policy improvement to enhance sample efficiency, while emphasizing high proficiency samples during policy constraint to ensure stable training. Extensive empirical results demonstrate that SPA achieves significant improvements over existing methods, attaining state-of-the-art performance on the D4RL benchmark. Xiaodan Zhang 0006, Daolong An, Shuai Lü 0001 |
AAAI | 5 |
| 2026 | Focus on primary: Differential diverse data augmentation for generalization in visual reinforcement learning
Junhong Wu, Daolong An, Shuai Lü 0001 |
Expert Syst. Appl. | 4 |
| 2026 | Result constraint behavior cloning for offline reinforcement learning
Daolong An, Shuai Lü 0001, Wenbo Zhou 0003 |
Neural Networks | 1 |
| 2025 | Episodic Memory-Double Actor-Critic Twin Delayed Deep Deterministic Policy Gradient
Man Shu, Shuai Lü 0001, Xiaoyu Gong, Daolong An |
Neural Networks | 4 |
| 2024 | Double Buffers CEM-TD3: More Efficient Evolution and Richer ExplorationabstractCEM-TD3 is a combination scheme using the simple cross-entropy method (CEM) and Twin Delayed Deep Deterministic policy gradient (TD3), and it achieves a satisfactory trade-off between performance and sample efficiency. However, we find that CEM-TD3 cannot fully address the low efficiency of policy search caused by CEM, and the policy gradient learning introduced by TD3 will weaken the diversity of individuals in the population. In this paper, we propose Double Buffers CEM-TD3 (DBCEM-TD3) that optimizes both CEM and TD3. For CEM, DBCEM-TD3 maintains an actor buffer to store the population required for evolution. In each iteration, it only needs to generate a small number of actors to replace the poor actors in the policy buffer to achieve more efficient evolution. The fitness of individuals in the actor buffer decreases exponentially with time, which can avoid premature convergence of the mean actor. For TD3, DBCEM-TD3 maintains a critic buffer with the same number of critics as the number of actors generated in each iteration, and each critic is trained independently by sampling from the shared replay buffer. In each iteration, each newly generated actor uses different critics to guide learning. This ensures more diverse behaviors among the learned actors, enabling richer experiences to be collected during the evaluation phase. We conduct experimental evaluations on five continuous control tasks provided by OpenAI Gym. DBCEM-TD3 outperforms CEM-TD3, TD3, and other classic off-policy reinforcement learning algorithms in terms of performance and sample efficiency. Shuai Lü 0001, Junhong Wu, Daolong An |
AAAI | 5 |