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

Kaiqiang Ke

dblp:415/0815 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › offline reinforcement learning
conservative value estimation
0.912025
Conservative Offline Goal-Conditioned Implicit V-Learning · ICML 2025
Machine learning › Reinforcement learning
goal-conditioned reinforcement learning
0.912025
Conservative Offline Goal-Conditioned Implicit V-Learning · ICML 2025
Machine learning › Reinforcement learning › off-policy reinforcement learning › experience replay
hindsight experience replay
0.912025
Conservative Offline Goal-Conditioned Implicit V-Learning · ICML 2025
Machine learning › Reinforcement learning
offline reinforcement learning
0.912025
Conservative Offline Goal-Conditioned Implicit V-Learning · ICML 2025
Machine learning › Reinforcement learning
value function estimation
0.912025
Conservative Offline Goal-Conditioned Implicit V-Learning · ICML 2025

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

quasimetric framework · 0.9conservative penalty · 0.9
YearPublicationVenuePosition
2025 Conservative Offline Goal-Conditioned Implicit V-Learning
abstract
Offline goal-conditioned reinforcement learning (GCRL) learns a goal-conditioned value function to train policies for diverse goals with pre-collected datasets. Hindsight experience replay addresses the issue of sparse rewards by treating intermediate states as goals but fails to complete goal-stitching tasks where achieving goals requires stitching different trajectories. While cross-trajectory sampling is a potential solution that associates states and goals belonging to different trajectories, we demonstrate that this direct method degrades performance in goal-conditioned tasks due to the overestimation of values on unconnected pairs. To this end, we propose Conservative Goal-Conditioned Implicit Value Learning (CGCIVL), a novel algorithm that introduces a penalty term to penalize value estimation for unconnected state-goal pairs and leverages the quasimetric framework to accurately estimate values for connected pairs. Evaluations on OGBench, a benchmark for offline GCRL, demonstrate that CGCIVL consistently surpasses state-of-the-art methods across diverse tasks.
Kaiqiang Ke, Zongkai Liu, Shenghong He, Chao Yu 0004
ICML1