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

Ziqing Mai

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

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

Artificial intelligence and machine learning · 2 · 2 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
2 papers
Reinforcement learning · 100%

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.422024
Bayesian Design Principles for Offline-to-Online Reinforcement Learning · ICML 2024
Unsupervised Behavior Extraction via Random Intent Priors · NeurIPS 2023
Machine learning › Reinforcement learning
bayesian reinforcement learning
0.812024
Bayesian Design Principles for Offline-to-Online Reinforcement Learning · ICML 2024
Machine learning › Reinforcement learning › offline reinforcement learning
offline-to-online reinforcement learning
0.812024
Bayesian Design Principles for Offline-to-Online Reinforcement Learning · ICML 2024
Machine learning › Reinforcement learning
reward design
0.712023
Unsupervised Behavior Extraction via Random Intent Priors · NeurIPS 2023
Machine learning › Reinforcement learning
exploration
0.212024
Bayesian Design Principles for Offline-to-Online Reinforcement Learning · ICML 2024
Machine learning › Reinforcement learning › exploration
optimistic exploration
0.212024
Bayesian Design Principles for Offline-to-Online Reinforcement Learning · ICML 2024

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

pessimism · 0.8bayesian design principles · 0.8random neural network · 0.7diversified reward · 0.7
YearPublicationVenuePosition
2024 Bayesian Design Principles for Offline-to-Online Reinforcement Learning
abstract
Offline reinforcement learning (RL) is crucial for real-world applications where exploration can be costly or unsafe. However, offline learned policies are often suboptimal, and further online fine-tuning is required. In this paper, we tackle the fundamental dilemma of offline-to-online fine-tuning: if the agent remains pessimistic, it may fail to learn a better policy, while if it becomes optimistic directly, performance may suffer from a sudden drop. We show that Bayesian design principles are crucial in solving such a dilemma. Instead of adopting optimistic or pessimistic policies, the agent should act in a way that matches its belief in optimal policies. Such a probability-matching agent can avoid a sudden performance drop while still being guaranteed to find the optimal policy. Based on our theoretical findings, we introduce a novel algorithm that outperforms existing methods on various benchmarks, demonstrating the efficacy of our approach. Overall, the proposed approach provides a new perspective on offline-to-online RL that has the potential to enable more effective learning from offline data.
Hao Hu 0006, Yiqin Yang, Jianing Ye, Chengjie Wu, Ziqing Mai, Yujing Hu, Tangjie Lv, Changjie Fan, Qianchuan Zhao, Chongjie Zhang
ICML5
2023 Unsupervised Behavior Extraction via Random Intent Priors
abstract
Reward-free data is abundant and contains rich prior knowledge of human behaviors, but it is not well exploited by offline reinforcement learning (RL) algorithms. In this paper, we propose UBER, an unsupervised approach to extract useful behaviors from offline reward-free datasets via diversified rewards. UBER assigns different pseudo-rewards sampled from a given prior distribution to different agents to extract a diverse set of behaviors, and reuse them as candidate policies to facilitate the learning of new tasks. Perhaps surprisingly, we show that rewards generated from random neural networks are sufficient to extract diverse and useful behaviors, some even close to expert ones. We provide both empirical and theoretical evidences to justify the use of random priors for the reward function. Experiments on multiple benchmarks showcase UBER's ability to learn effective and diverse behavior sets that enhance sample efficiency for online RL, outperforming existing baselines. By reducing reliance on human supervision, UBER broadens the applicability of RL to real-world scenarios with abundant reward-free data.
Hao Hu 0006, Yiqin Yang, Jianing Ye, Ziqing Mai, Chongjie Zhang
NeurIPS4