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

Ronglong Cai

dblp:404/8966 · DBLP profile ↗
← Back
1ranked-venue papers
0as 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 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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
offline reinforcement learning
0.912025
ACTIVE: Offline Reinforcement Learning via Adaptive Imitation and In-sample V-Ensemble · ICLR 2025
Machine learning › Reinforcement learning
value function estimation
0.912025
ACTIVE: Offline Reinforcement Learning via Adaptive Imitation and In-sample V-Ensemble · ICLR 2025
Machine learning › Reinforcement learning › value-based reinforcement learning
value overestimation
0.912025
ACTIVE: Offline Reinforcement Learning via Adaptive Imitation and In-sample V-Ensemble · ICLR 2025
Machine learning › Reinforcement learning
actor-critic methods
0.312025
ACTIVE: Offline Reinforcement Learning via Adaptive Imitation and In-sample V-Ensemble · ICLR 2025

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

v-function ensemble · 0.9implicit TD backup · 0.9dual gradient descent · 0.9
YearPublicationVenuePosition
2025 ACTIVE: Offline Reinforcement Learning via Adaptive Imitation and In-sample V-Ensemble
abstract
Offline reinforcement learning (RL) aims to learn from static datasets and thus faces the challenge of value estimation errors for out-of-distribution actions. The in-sample learning scheme addresses this issue by performing implicit TD backups that does not query the values of unseen actions. However, pre-existing in-sample value learning and policy extraction methods suffer from over-regularization, limiting their performance on suboptimal or compositional datasets. In this paper, we analyze key factors in in-sample learning that might potentially hinder the use of a milder constraint. We propose Actor-Critic with Temperature adjustment and In-sample Value Ensemble (ACTIVE), a novel in-sample offline RL algorithm that leverages an ensemble of $V$-functions for critic training and adaptively adjusts the constraint level using dual gradient descent. We theoretically show that the $V$-ensemble suppresses the accumulation of initial value errors, thereby mitigating overestimation. Our experiments on the D4RL benchmarks demonstrate that ACTIVE alleviates overfitting of value functions and outperforms existing in-sample methods in terms of learning stability and policy optimality.
Tianyuan Chen, Ronglong Cai, Faguo Wu
ICLR2