Demo Data from EDBT 2026 / reviewers in the wild / expert
Yulong Xia
dblp:254/9777
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2026
0009-0005-1897-8976ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 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 · 78% Robot manipulation · 14% Generative modeling · 8% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › offline reinforcement learning
behavior regularization |
1.0 | 1 | 2026 | Behavior Regularization with Flow Latent Policy for Offline Reinforcement Learning · AAAI 2026 |
Machine learning › Reinforcement learning
offline reinforcement learning |
1.0 | 1 | 2026 | Behavior Regularization with Flow Latent Policy for Offline Reinforcement Learning · AAAI 2026 |
Machine learning › Reinforcement learning › model-based reinforcement learning
model-based planning |
0.6 | 1 | 2022 | TarGF: Learning Target Gradient Field to Rearrange Objects without Explicit Goal Specification · NeurIPS 2022 |
Robotics › Robot manipulation
object rearrangement |
0.6 | 1 | 2022 | TarGF: Learning Target Gradient Field to Rearrange Objects without Explicit Goal Specification · NeurIPS 2022 |
Machine learning › Reinforcement learning
reward learning |
0.6 | 1 | 2022 | TarGF: Learning Target Gradient Field to Rearrange Objects without Explicit Goal Specification · NeurIPS 2022 |
Machine learning › Generative modeling
normalizing flow |
0.3 | 1 | 2026 | Behavior Regularization with Flow Latent Policy for Offline Reinforcement Learning · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
latent-space KL divergence · 1.0flow-based behavior model · 1.0score matching · 0.6residual policy learning · 0.6imitation learning · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Behavior Regularization with Flow Latent Policy for Offline Reinforcement LearningabstractExpressive generative models have recently shown promise in offline reinforcement learning (RL) by capturing the complex, multimodal structure of dataset behavior. However, directly integrating these models into policy optimization introduces substantial computational and stability challenges due to the intricacies of their sampling processes. We introduce Flow Latent Policy (FLP), an offline RL framework that decouples expressivity from optimization by operating entirely in the latent space of a pre-trained, frozen flow-based behavior model. FLP learns a simple latent Gaussian policy whose samples are transformed through the flow to produce complex, behavior-aligned actions. This design enables closed-form behavior regularization via latent-space KL divergence and allows policy optimization without expensive backpropagation through the generative model. Experiments on the OGBench benchmark demonstrate that FLP achieves competitive or superior performance across diverse tasks, combining the benefits of expressive modeling and tractable optimization. Yulong Xia |
AAAI | 1 |
| 2025 | DualGF: Example-Driven Path Planning via Dual Gradient Fields
Mingdong Wu, Fangwei Zhong, Yulong Xia, Yizhou Wang 0001, Hao Dong 0003 |
ICANN (4) | 3 |
| 2024 | ORA-Trans: Object Region Attention Transformer Based on Key Tokens Selector with Structure Feature Modeling for Fine-Grained Visual Classification
Yulong Xia |
ICPR (24) | 1 |
| 2022 | Ensemble Ranking for Image Retrieval via Deep Hash
Donggen Li, Dawei Dai, Hongyuan Shan, Shunyin Xia, Yulong Xia |
ICANN (4) | 5 |
| 2022 | TarGF: Learning Target Gradient Field to Rearrange Objects without Explicit Goal SpecificationabstractObject Rearrangement is to move objects from an initial state to a goal state. Here, we focus on a more practical setting in object rearrangement, i.e., rearranging objects from shuffled layouts to a normative target distribution without explicit goal specification. However, it remains challenging for AI agents, as it is hard to describe the target distribution (goal specification) for reward engineering or collect expert trajectories as demonstrations. Hence, it is infeasible to directly employ reinforcement learning or imitation learning algorithms to address the task. This paper aims to search for a policy only with a set of examples from a target distribution instead of a handcrafted reward function. We employ the score-matching objective to train a Target Gradient Field (TarGF), indicating a direction on each object to increase the likelihood of the target distribution. For object rearrangement, the TarGF can be used in two ways: 1) For model-based planning, we can cast the target gradient into a reference control and output actions with a distributed path planner; 2) For model-free reinforcement learning, the TarGF is not only used for estimating the likelihood-change as a reward but also provides suggested actions in residual policy learning. Experimental results in ball and room rearrangement demonstrate that our method significantly outperforms the state-of-the-art methods in the quality of the terminal state, the efficiency of the control process, and scalability. Mingdong Wu, Fangwei Zhong, Yulong Xia, Hao Dong 0003 |
NeurIPS | 3 |