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.

Danying Mo

dblp:357/3952 · 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 · 91% Knowledge representation and reasoning · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
constrained reinforcement learning
0.812024
An Offline Adaptation Framework for Constrained Multi-Objective Reinforcement Learning · NeurIPS 2024
Machine learning › Reinforcement learning
multi-objective reinforcement learning
0.812024
An Offline Adaptation Framework for Constrained Multi-Objective Reinforcement Learning · NeurIPS 2024
Machine learning › Reinforcement learning
safe reinforcement learning
0.812024
An Offline Adaptation Framework for Constrained Multi-Objective Reinforcement Learning · NeurIPS 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning › nonmonotonic reasoning › preference handling › preference reasoning
preference inference
0.212024
An Offline Adaptation Framework for Constrained Multi-Objective Reinforcement Learning · NeurIPS 2024

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

offline reinforcement learning · 0.8multi-objective reinforcement learning · 0.8
YearPublicationVenuePosition
2024 An Offline Adaptation Framework for Constrained Multi-Objective Reinforcement Learning
abstract
In recent years, significant progress has been made in multi-objective reinforcement learning (RL) research, which aims to balance multiple objectives by incorporating preferences for each objective. In most existing studies, specific preferences must be provided during deployment to indicate the desired policies explicitly. However, designing these preferences depends heavily on human prior knowledge, which is typically obtained through extensive observation of high-performing demonstrations with expected behaviors. In this work, we propose a simple yet effective offline adaptation framework for multi-objective RL problems without assuming handcrafted target preferences, but only given several demonstrations to implicitly indicate the preferences of expected policies. Additionally, we demonstrate that our framework can naturally be extended to meet constraints on safety-critical objectives by utilizing safe demonstrations, even when the safety thresholds are unknown. Empirical results on offline multi-objective and safe tasks demonstrate the capability of our framework to infer policies that align with real preferences while meeting the constraints implied by the provided demonstrations.
Zongkai Liu, Danying Mo, Chao Yu 0004
NeurIPS3