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

Lianghui Liu

dblp:429/7115 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
—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 2021Graphics, computer vision, multimedia, augmented reality and games · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › meta-reinforcement learning
offline meta-reinforcement learning
1.012026
Meta-Normalizing Flow for Data-Limited Offline Meta-Reinforcement Learning (Student Abstract) · AAAI 2026
Machine learning › Reinforcement learning
offline reinforcement learning
1.012026
Meta-Normalizing Flow for Data-Limited Offline Meta-Reinforcement Learning (Student Abstract) · AAAI 2026
Machine learning › Reinforcement learning › function approximation › representation learning for reinforcement learning
task representation learning
1.012026
Meta-Normalizing Flow for Data-Limited Offline Meta-Reinforcement Learning (Student Abstract) · AAAI 2026

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

normalizing flow · 1.0meta-learning · 1.0
YearPublicationVenuePosition
2026 Meta-Normalizing Flow for Data-Limited Offline Meta-Reinforcement Learning (Student Abstract)
abstract
Offline Meta-Reinforcement Learning (OMRL) leverages pre-collected data to adapt to new tasks. Context-based methods learn task representations from contexts. However, the context is influenced by both the task and the behavior policy. The mismatch between the behavior policy and the testing policy causes a context distribution shift problem, which results in poor task representations and degraded performance. This problem is exacerbated in settings with data limitations. To address this, we propose a novel approach called Meta-Normalizing Flow (Meta-NF). First, it employs a highly expressive and sample-efficient normalizing flow policy. Second, it incorporates a metric for testing-time task representation selection to effectively mitigate the context shift problem. Empirical results demonstrate that Meta-NF outperforms existing OMRL methods, with both components contributing to its strong performance.
Lianghui Liu, Zongzhang Zhang
AAAI1