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

Tianyuan Chen

dblp:24/7790 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
2 papers
Reinforcement learning · 82% Trustworthy machine learning · 18%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
offline reinforcement learning
1.722025
Offline RL with Smooth OOD Generalization in Convex Hull and its Neighborhood · ICLR 2025
ACTIVE: Offline Reinforcement Learning via Adaptive Imitation and In-sample V-Ensemble · ICLR 2025
Machine learning › Trustworthy machine learning
out-of-distribution generalization
0.912025
Offline RL with Smooth OOD Generalization in Convex Hull and its Neighborhood · 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
Machine learning › Reinforcement learning › dynamic programming
bellman operator
0.312025
Offline RL with Smooth OOD Generalization in Convex Hull and its Neighborhood · ICLR 2025

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

v-function ensemble · 0.9smooth bellman operator · 0.9implicit TD backup · 0.9dual gradient descent · 0.9convex hull neighborhood · 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
ICLR1
2025 Offline RL with Smooth OOD Generalization in Convex Hull and its Neighborhood
abstract
Offline Reinforcement Learning (RL) struggles with distributional shifts, leading to the $Q$-value overestimation for out-of-distribution (OOD) actions. Existing methods address this issue by imposing constraints; however, they often become overly conservative when evaluating OOD regions, which constrains the $Q$-function generalization. This over-constraint issue results in poor $Q$-value estimation and hinders policy improvement. In this paper, we introduce a novel approach to achieve better $Q$-value estimation by enhancing $Q$-function generalization in OOD regions within Convex Hull and its Neighborhood (CHN). Under the safety generalization guarantees of the CHN, we propose the Smooth Bellman Operator (SBO), which updates OOD $Q$-values by smoothing them with neighboring in-sample $Q$-values. We theoretically show that SBO approximates true $Q$-values for both in-sample and OOD actions within the CHN. Our practical algorithm, Smooth Q-function OOD Generalization (SQOG), empirically alleviates the over-constraint issue, achieving near-accurate $Q$-value estimation. On the D4RL benchmarks, SQOG outperforms existing state-of-the-art methods in both performance and computational efficiency. Code is available at <https://github.com/yqpqry/SQOG>.
Qingmao Yao, Zhichao Lei, Tianyuan Chen, Ziyue Yuan, Xuefan Chen, Jianxiang Liu, Faguo Wu, Xiao Zhang 0004
ICLR3
2010 Semantic Network Language Generation based on a Semantic Networks Serialization Grammar
Yintang Dai, Shiyong Zhang, Jidong Chen, Tianyuan Chen
World Wide Web4