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

Chengkang Yao

dblp:384/4120 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 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
1 paper
Reinforcement learning · 82% Robot manipulation · 18%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
imitation learning
0.812024
Iterative Regularized Policy Optimization with Imperfect Demonstrations · ICML 2024
Machine learning › Reinforcement learning › imitation learning
imperfect demonstrations
0.812024
Iterative Regularized Policy Optimization with Imperfect Demonstrations · ICML 2024
Robotics › Robot manipulation
learning from demonstration
0.812024
Iterative Regularized Policy Optimization with Imperfect Demonstrations · ICML 2024
Machine learning › Reinforcement learning
policy optimization
0.812024
Iterative Regularized Policy Optimization with Imperfect Demonstrations · ICML 2024
Machine learning › Reinforcement learning › policy optimization
regularized policy optimization
0.812024
Iterative Regularized Policy Optimization with Imperfect Demonstrations · ICML 2024
Machine learning › Reinforcement learning
offline reinforcement learning
0.212024
Iterative Regularized Policy Optimization with Imperfect Demonstrations · ICML 2024
Machine learning › Reinforcement learning › offline reinforcement learning
offline-to-online reinforcement learning
0.212024
Iterative Regularized Policy Optimization with Imperfect Demonstrations · ICML 2024

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

kullback-leibler regularization · 0.8demonstration boosting · 0.8
YearPublicationVenuePosition
2024 Iterative Regularized Policy Optimization with Imperfect Demonstrations
abstract
Imitation learning heavily relies on the quality of provided demonstrations. In scenarios where demonstrations are imperfect and rare, a prevalent approach for refining policies is through online fine-tuning with reinforcement learning, in which a Kullback–Leibler (KL) regularization is often employed to stabilize the learning process. However, our investigation reveals that on the one hand, imperfect demonstrations can bias the online learning process, the KL regularization will further constrain the improvement of online policy exploration. To address the above issues, we propose Iterative Regularized Policy Optimization (IRPO), a framework that involves iterative offline imitation learning and online reinforcement exploration. Specifically, the policy learned online is used to serve as the demonstrator for successive learning iterations, with a demonstration boosting to consistently enhance the quality of demonstrations. Experimental validations conducted across widely used benchmarks and a novel fixed-wing UAV control task consistently demonstrate the effectiveness of IRPO in improving both the demonstration quality and the policy performance. Our code is available at https://github.com/GongXudong/IRPO.
Xudong Gong, Kele Xu, Yuanzhao Zhai, Chengkang Yao, Bo Ding 0001, Huaimin Wang 0001
ICML5