Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ruifeng Chen 0003

dblp:58/10097-3 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0005-9480-9584ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 4 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
4 papers
Reinforcement learning · 64% Generative modeling · 25% Trustworthy machine learning · 8%

Topics — the 11 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
offline reinforcement learning
1.622025
Semantic Temporal Abstraction via Vision-Language Model Guidance for Efficient Reinforcement Learning · ICLR 2025
Offline Transition Modeling via Contrastive Energy Learning · ICML 2024
Machine learning › Reinforcement learning
off-policy evaluation
1.022024
Policy-conditioned Environment Models are More Generalizable · ICML 2024
Offline Transition Modeling via Contrastive Energy Learning · ICML 2024
Machine learning › Reinforcement learning › hierarchical reinforcement learning › skill learning
skill discovery
0.912025
Semantic Temporal Abstraction via Vision-Language Model Guidance for Efficient Reinforcement Learning · ICLR 2025
Machine learning › Reinforcement learning › hierarchical reinforcement learning
temporal abstraction
0.912025
Semantic Temporal Abstraction via Vision-Language Model Guidance for Efficient Reinforcement Learning · ICLR 2025
Machine learning › Generative modeling
diffusion model
0.812024
Energy-Guided Diffusion Sampling for Offline-to-Online Reinforcement Learning · ICML 2024
Machine learning › Generative modeling › diffusion model
diffusion sampling
0.812024
Energy-Guided Diffusion Sampling for Offline-to-Online Reinforcement Learning · ICML 2024
Machine learning › Trustworthy machine learning › robustness
distribution shift
0.812024
Energy-Guided Diffusion Sampling for Offline-to-Online Reinforcement Learning · ICML 2024
Machine learning › Generative modeling
energy-based model
0.812024
Offline Transition Modeling via Contrastive Energy Learning · ICML 2024
Machine learning › Reinforcement learning
model-based reinforcement learning
0.812024
Policy-conditioned Environment Models are More Generalizable · ICML 2024
Machine learning › Reinforcement learning › offline reinforcement learning
offline-to-online reinforcement learning
0.812024
Energy-Guided Diffusion Sampling for Offline-to-Online Reinforcement Learning · ICML 2024
Computer vision › Vision and language › vision-language model
vision-language model guidance
0.312025
Semantic Temporal Abstraction via Vision-Language Model Guidance for Efficient Reinforcement Learning · ICLR 2025

Methods — techniques the papers use, named apart from their topics

vision-language model · 0.9vector quantization · 0.9skill relabeling · 0.9policy representation · 0.8meta-dynamics model · 0.8energy-based modeling · 0.8energy function · 0.8diffusion model · 0.8contrastive energy learning · 0.8
YearPublicationVenuePosition
2025 Semantic Temporal Abstraction via Vision-Language Model Guidance for Efficient Reinforcement Learning
abstract
Extracting temporally extended skills can significantly improve the efficiency of reinforcement learning (RL) by breaking down complex decision-making problems with sparse rewards into simpler subtasks and enabling more effective credit assignment. However, existing abstraction methods either discover skills in an unsupervised manner, which often lacks semantic information and leads to erroneous or scattered skill extraction results, or require substantial human intervention. In this work, we propose to leverage the extensive knowledge in pretrained Vision-Language Models (VLMs) to progressively guide the latent space after vector quantization to be more semantically meaningful through relabeling each skill. This approach, termed **V**ision-l**an**guage model guided **T**emporal **A**bstraction (**VanTA**), facilitates the discovery of more interpretable and task-relevant temporal segmentations from offline data without the need for extensive manual intervention or heuristics. By leveraging the rich information in VLMs, our method can significantly outperform existing offline RL approaches that depend only on limited training data. From a theory perspective, we demonstrate that stronger internal sequential correlations within each sub-task, induced by VanTA, effectively reduces suboptimality in policy learning. We validate the effectiveness of our approach through extensive experiments on diverse environments, including Franka Kitchen, Minigrid, and Crafter. These experiments show that our method surpasses existing approaches in long-horizon offline reinforcement learning scenarios with both proprioceptive and visual observations.
Tian-Shuo Liu, Xu-Hui Liu, Ruifeng Chen 0003, Lixuan Jin, Yang Yu 0001
ICLR3
2024 Policy-conditioned Environment Models are More Generalizable
abstract
In reinforcement learning, it is crucial to have an accurate environment dynamics model to evaluate different policies' value in downstream tasks like offline policy optimization and policy evaluation. However, the learned model is known to be inaccurate in predictions when evaluating target policies different from data-collection policies. In this work, we found that utilizing policy representation for model learning, called policy-conditioned model (PCM) learning, is useful to mitigate the problem, especially when the offline dataset is collected from diversified behavior policies. The reason beyond that is in this case, PCM becomes a meta-dynamics model that is trained to be aware of and focus on the evaluation policies that on-the-fly adjust the model to be suitable to the evaluation policies’ state-action distribution, thus improving the prediction accuracy. Based on that intuition, we propose an easy-to-implement yet effective algorithm of PCM for accurate model learning. We also give a theoretical analysis and experimental evidence to demonstrate the feasibility of reducing value gaps by adapting the dynamics model under different policies. Experiment results show that PCM outperforms the existing SOTA off-policy evaluation methods in the DOPE benchmark by a large margin, and derives significantly better policies in offline policy selection and model predictive control compared with the standard model learning method.
Ruifeng Chen 0003, Xiong-Hui Chen, Siyuan Xiao, Yang Yu 0001
ICML1
2024 Offline Transition Modeling via Contrastive Energy Learning
abstract
Learning a high-quality transition model is of great importance for sequential decision-making tasks, especially in offline settings. Nevertheless, the complex behaviors of transition dynamics in real-world environments pose challenges for the standard forward models because of their inductive bias towards smooth regressors, conflicting with the inherent nature of transitions such as discontinuity or large curvature. In this work, we propose to model the transition probability implicitly through a scalar-value energy function, which enables not only flexible distribution prediction but also capturing complex transition behaviors. The Energy-based Transition Models (ETM) are shown to accurately fit the discontinuous transition functions and better generalize to out-of-distribution transition data. Furthermore, we demonstrate that energy-based transition models improve the evaluation accuracy and significantly outperform other off-policy evaluation methods in DOPE benchmark. Finally, we show that energy-based transition models also benefit reinforcement learning and outperform prior offline RL algorithms in D4RL Gym-Mujoco tasks.
Ruifeng Chen 0003, Chengxing Jia, Zefang Huang, Tian-Shuo Liu, Xu-Hui Liu, Yang Yu 0001
ICML1
2024 Energy-Guided Diffusion Sampling for Offline-to-Online Reinforcement Learning
abstract
Combining offline and online reinforcement learning (RL) techniques is indeed crucial for achieving efficient and safe learning where data acquisition is expensive. Existing methods replay offline data directly in the online phase, resulting in a significant challenge of data distribution shift and subsequently causing inefficiency in online fine-tuning. To address this issue, we introduce an innovative approach, Energy-guided DIffusion Sampling (EDIS), which utilizes a diffusion model to extract prior knowledge from the offline dataset and employs energy functions to distill this knowledge for enhanced data generation in the online phase. The theoretical analysis demonstrates that EDIS exhibits reduced suboptimality compared to solely utilizing online data or directly reusing offline data. EDIS is a plug-in approach and can be combined with existing methods in offline-to-online RL setting. By implementing EDIS to off-the-shelf methods Cal-QL and IQL, we observe a notable 20% average improvement in empirical performance on MuJoCo, AntMaze, and Adroit environments. Code is available at https://github.com/liuxhym/EDIS.
Xu-Hui Liu, Tian-Shuo Liu, Shengyi Jiang, Ruifeng Chen 0003, Yang Yu 0001
ICML4