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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chao Chen 0028

dblp:66/3019-28 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0000-4765-2397ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 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
3 papers
Reinforcement learning · 72% Knowledge representation and reasoning · 23% Learning paradigms · 5%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › deep reinforcement learning
visual reinforcement learning
0.812024
Focus-Then-Decide: Segmentation-Assisted Reinforcement Learning · AAAI 2024
Machine learning › Reinforcement learning
deep reinforcement learning
0.712023
Internal Logical Induction for Pixel-Symbolic Reinforcement Learning · KDD 2023
Machine learning › Reinforcement learning › deep reinforcement learning › visual reinforcement learning
pixel-based reinforcement learning
0.712023
Internal Logical Induction for Pixel-Symbolic Reinforcement Learning · KDD 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
rule learning
0.712023
Internal Logical Induction for Pixel-Symbolic Reinforcement Learning · KDD 2023
Data mining
anomaly detection
0.712023
Deep Anomaly Detection and Search via Reinforcement Learning (Student Abstract) · AAAI 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic-based reasoning
propositional logic
0.212023
Internal Logical Induction for Pixel-Symbolic Reinforcement Learning · KDD 2023
Machine learning › Learning paradigms
semi-supervised learning
0.212023
Deep Anomaly Detection and Search via Reinforcement Learning (Student Abstract) · AAAI 2023

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

reinforcement learning · 1.3self-supervised learning · 0.8foundational segmentation model · 0.8attention mechanism · 0.8rule learning · 0.7reward shaping · 0.7deep reinforcement learning · 0.7
YearPublicationVenuePosition
2025 Focus-Then-Reuse: Fast Adaptation in Visual Perturbation Environments
abstract
Visual reinforcement learning has shown promise in various real-world applications. However, deploying policies in complex real-world environments with visual perturbations remains a significant challenge. We notice that humans tend to filter information at the object level prior to decision-making, facilitating efficient skill transfer across different contexts. Inspired by this, we introduce Focus-Then-Reuse (FTR), a method utilizing a novel object selection mechanism to focus on task-relevant objects, and directly reuse the simulation-trained policy on them. The training of the object selection mechanism integrates prior knowledge from a vision-language model and feedback from the environment. Experimental results on challenging tasks based on DeepMind Control Suite and Franka Emika Robotics demonstrate that FTR enables rapid adaptation in visual perturbation environments and achieves state-of-the-art performance. The source code is available at https://github.com/LAMDA-RL/FTR.
Chao Chen 0028, Jiacheng Xu 0003, Zongzhang Zhang, Yang Yu 0001
NeurIPS2
2024 Focus-Then-Decide: Segmentation-Assisted Reinforcement Learning
abstract
Visual Reinforcement Learning (RL) is a promising approach to achieve human-like intelligence. However, it currently faces challenges in learning efficiently within noisy environments. In contrast, humans can quickly identify task-relevant objects in distraction-filled surroundings by applying previously acquired common knowledge. Recently, foundational models in natural language processing and computer vision have achieved remarkable successes, and the common knowledge within these models can significantly benefit downstream task training. Inspired by these achievements, we aim to incorporate common knowledge from foundational models into visual RL. We propose a novel Focus-Then-Decide (FTD) framework, allowing the agent to make decisions based solely on task-relevant objects. To achieve this, we introduce an attention mechanism to select task-relevant objects from the object set returned by a foundational segmentation model, and only use the task-relevant objects for the subsequent training of the decision module. Additionally, we specifically employed two generic self-supervised objectives to facilitate the rapid learning of this attention mechanism. Experimental results on challenging tasks based on DeepMind Control Suite and Franka Emika Robotics demonstrate that our method can quickly and accurately pinpoint objects of interest in noisy environments. Consequently, it achieves a significant performance improvement over current state-of-the-art algorithms. Project Page: https://www.lamda.nju.edu.cn/chenc/FTD.html Code: https://github.com/LAMDA-RL/FTD
Chao Chen 0028, Jiacheng Xu 0003, Weijian Liao, Zongzhang Zhang, Yang Yu 0001
AAAI1
2023 Deep Anomaly Detection and Search via Reinforcement Learning (Student Abstract)
abstract
Semi-supervised anomaly detection is a data mining task which aims at learning features from partially-labeled datasets. We propose Deep Anomaly Detection and Search (DADS) with reinforcement learning. During the training process, the agent searches for possible anomalies in unlabeled dataset to enhance performance. Empirically, we compare DADS with several methods in the settings of leveraging known anomalies to detect both other known and unknown anomalies. Results show that DADS achieves good performance.
Chao Chen 0028, Feng Mao, Zongzhang Zhang, Yang Yu 0001
AAAI1
2023 Internal Logical Induction for Pixel-Symbolic Reinforcement Learning
abstract
Reinforcement Learning (RL) has experienced rapid advancements in recent years. The widely studied RL algorithms mainly focus on a single input form, such as pixel-based image input or symbolic vector input. These two forms have different characteristics and, in many scenarios, will appear together, while few RL algorithms have studied the problems with mixed input types. Specifically, in the scenario where both pixel and symbolic inputs are available, symbolic input usually offers abstract features with specific semantics, which is more conducive to the agent's focus. Conversely, pixel input provides more comprehensive information, enabling the agent to make well-informed decisions. Tailoring the processing approach based on the properties of these two input types can contribute to solving the problem more effectively. To tackle the above issue, we propose an Internal Logical Induction (ILI) framework that integrates deep RL and rule learning into one system. ILI utilizes the deep RL algorithm to process the pixel input and the rule learning algorithm to induce propositional logic knowledge from symbolic input. To efficiently combine these two mechanisms, we further adopt a reward shaping technique by treating valuable knowledge as intrinsic rewards for the RL procedure. Experimental results demonstrate that the ILI framework outperforms baseline approaches in RL problems with pixel-symbolic input, and its inductive knowledge exhibits transferability advantages when pixel input semantics change.
Jiacheng Xu 0003, Chao Chen 0028, Fuxiang Zhang, Lei Yuan 0005, Zongzhang Zhang, Yang Yu 0001
KDD2