Demo Data from EDBT 2026 / reviewers in the wild / expert
Tenglong Liu
dblp:378/5296
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0005-7882-6114ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Systems, architecture and hardware · 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 · 59% Efficient and distributed learning · 22% Trustworthy machine learning · 19% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.9 | 1 | 2025 | Skill Expansion and Composition in Parameter Space · ICLR 2025 |
Machine learning › Reinforcement learning › hierarchical reinforcement learning
skill composition |
0.9 | 1 | 2025 | Skill Expansion and Composition in Parameter Space · ICLR 2025 |
Machine learning › Reinforcement learning
offline reinforcement learning |
0.8 | 1 | 2024 | Adaptive Advantage-Guided Policy Regularization for Offline Reinforcement Learning · ICML 2024 |
Machine learning › Reinforcement learning › regularization for reinforcement learning
policy regularization |
0.8 | 1 | 2024 | Adaptive Advantage-Guided Policy Regularization for Offline Reinforcement Learning · ICML 2024 |
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift |
0.8 | 1 | 2024 | Adaptive Advantage-Guided Policy Regularization for Offline Reinforcement Learning · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
skill library · 0.9low-rank adaptation · 0.9context-aware modulation · 0.9variational autoencoder · 0.8advantage-guided regularization · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Skill Expansion and Composition in Parameter SpaceabstractHumans excel at reusing prior knowledge to address new challenges and developing skills while solving problems. This paradigm becomes increasingly popular in the development of autonomous agents, as it develops systems that can self-evolve in response to new challenges like human beings. However, previous methods suffer from limited training efficiency when expanding new skills and fail to fully leverage prior knowledge to facilitate new task learning. We propose Parametric Skill Expansion and Composition (PSEC), a new framework designed to iteratively evolve the agents' capabilities and efficiently address new challenges by maintaining a manageable skill library. This library can progressively integrate skill primitives as plug-and-play Low-Rank Adaptation (LoRA) modules in parameter-efficient finetuning, facilitating efficient and flexible skill expansion. This structure also enables the direct skill compositions in parameter space by merging LoRA modules that encode different skills, leveraging shared information across skills to effectively program new skills. Based on this, we propose a context-aware modular to dynamically activate different skills to collaboratively handle new tasks. Empowering diverse applications including multi-objective composition, dynamics shift, and continual policy shift, the results on D4RL, DSRL benchmarks, and the DeepMind Control Suite show that PSEC exhibits superior capacity to leverage prior knowledge to efficiently tackle new challenges, as well as expand its skill libraries to evolve the capabilities. Project website: https://ltlhuuu.github.io/PSEC/. Tenglong Liu, Yinan Zheng, Yixing Lan, Xin Xu 0001, Xianyuan Zhan |
ICLR | 1 |
| 2025 | Diffusion Policies with Value-Conditional Optimization for Offline Reinforcement LearningabstractIn offline reinforcement learning, value overestimation caused by out-of-distribution (OOD) actions significantly limits policy performance. Recently, diffusion models have been leveraged for their strong distribution-matching capabilities, enforcing conservatism through behavior policy constraints. However, existing methods often apply indiscriminate regularization to redundant actions in low-quality datasets, resulting in excessive conservatism and an imbalance between the expressiveness and efficiency of diffusion modeling. To address these issues, we propose DIffusion policies with Value-conditional Optimization (DIVO), a novel approach that leverages diffusion models to generate high-quality, broadly covered in-distribution state-action samples while facilitating efficient policy improvement. Specifically, DIVO introduces a binary-weighted mechanism that utilizes the advantage values of actions in the offline dataset to guide diffusion model training. This enables a more precise alignment with the dataset’s distribution while selectively expanding the boundaries of high-advantage actions. During policy improvement, DIVO dynamically filters high-return-potential actions from the diffusion model, effectively guiding the learned policy toward better performance. This approach achieves a critical balance between conservatism and explorability in offline RL. We evaluate DIVO on the D4RL benchmark and compare it against state-of-the-art baselines. Empirical results demonstrate that DIVO achieves superior performance, delivering significant improvements in average returns across locomotion tasks and outperforming existing methods in the challenging AntMaze domain, where sparse rewards pose a major difficulty. Yunchang Ma, Tenglong Liu, Yixing Lan, Changxin Zhang, Xin Xu 0001 |
IROS | 2 |
| 2025 | Learning Predictive Control with Online Modeling for Agile Maneuvering of Autonomous VehiclesabstractThe agile maneuvering control of autonomous vehicles (AVs) requires the tracking of reference trajectories characterized by high acceleration, sharp curvature, considerable disturbances, and significant time-varying, all while ensuring stability and accuracy. The inherent uncertainty and time-varying nature of both the vehicle model and its environment pose significant challenges to achieving high-performance tracking during agile maneuvers. Developing a control algorithm that enables solving the optimal policy for nonlinear systems with uncertainties is critical. In this paper, we propose a learning-based predictive control approach, namely, an adaptive model predictive control (AMPC) with Actor-Critic Learning (ACL) for generating closed-loop MPC policies for agile maneuvering of AVs. The proposed approach leverages neural networks to model the dynamics uncertainties online. The control policy and model are updated simultaneously to realize performance op-timization under time-varying uncertainties. Simulation results demonstrate that our proposed algorithm outperforms other leading ACL methods, as well as MPC and Linear Quadratic Regulator (LQR). Furthermore, field test experiment results validate its effectiveness on the HongQi-EHS3 electric vehicle, showing superior control performance compared to MPC both on paved roads and curved off-roads with excellent stability performance. Zengyi Zhang, Tenglong Liu, Yixing Lan, Xin Xu 0001 |
IROS | 4 |
| 2024 | Adaptive Advantage-Guided Policy Regularization for Offline Reinforcement LearningabstractIn offline reinforcement learning, the challenge of out-of-distribution (OOD) is pronounced. To address this, existing methods often constrain the learned policy through policy regularization. However, these methods often suffer from the issue of unnecessary conservativeness, hampering policy improvement. This occurs due to the indiscriminate use of all actions from the behavior policy that generates the offline dataset as constraints. The problem becomes particularly noticeable when the quality of the dataset is suboptimal. Thus, we propose Adaptive Advantage-guided Policy Regularization (A2PR), obtaining high-advantage actions from an augmented behavior policy combined with VAE to guide the learned policy. A2PR can select high-advantage actions that differ from those present in the dataset, while still effectively maintaining conservatism from OOD actions. This is achieved by harnessing the VAE capacity to generate samples matching the distribution of the data points. We theoretically prove that the improvement of the behavior policy is guaranteed. Besides, it effectively mitigates value overestimation with a bounded performance gap. Empirically, we conduct a series of experiments on the D4RL benchmark, where A2PR demonstrates state-of-the-art performance. Furthermore, experimental results on additional suboptimal mixed datasets reveal that A2PR exhibits superior performance. Code is available at https://github.com/ltlhuuu/A2PR. Tenglong Liu, Yang Li 0116, Yixing Lan, Hao Gao 0014, Wei Pan 0004, Xin Xu 0001 |
ICML | 1 |