Demo Data from EDBT 2026 / reviewers in the wild / expert
Ruixuan Miao
dblp:343/6982
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0005-4284-1355ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 2 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 |
Planning, search and constraint satisfaction · 33% Knowledge representation and reasoning · 33% Reinforcement learning · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › reward design
reward shaping |
1.0 | 1 | 2026 | T4NMTD: Transition-Centric Reinforcement Learning for Non-Markovian Task Decomposition · AAAI 2026 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › hierarchical problem solving
task decomposition |
1.0 | 1 | 2026 | T4NMTD: Transition-Centric Reinforcement Learning for Non-Markovian Task Decomposition · AAAI 2026 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic in computer science › logical foundations › non-classical logics
temporal logic |
1.0 | 1 | 2026 | T4NMTD: Transition-Centric Reinforcement Learning for Non-Markovian Task Decomposition · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
temporal logic · 1.0policy intervention · 1.0parallel training · 1.0automata · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | T4NMTD: Transition-Centric Reinforcement Learning for Non-Markovian Task DecompositionabstractNon-Markovian Tasks (NMTs) are distinguished by their dependence on long-term memory and state-dependent dynamics, setting them apart from the traditional Markovian models typically employed in Reinforcement Learning (RL). NMTs not only suffer from reward sparseness but also rely on historical information, making their resolution considerably more challenging. In this paper, we propose a novel RL framework T4NMTD (Transition-centric framework for NMT Decomposition), designed specifically for learning NMTs which are specified by temporal logic. The core of T4NMTD is a task decomposition mechanism along with a parallel training approach for NMTs. An NMT is first decomposed as basic units based on the transitions of the automata which are derived from temporal logic formulae. The units are then modularized into sub-tasks according to their semantic similarity under logical interpretation. The training strategy of T4NMTD adopts a dual-level structure: the high-level learns to shape the boundaries and coordinate arrangement of the sub-tasks from a global perspective, while the low-level learns those sub-tasks in parallel. In addition, we invent a dynamic policy intervention scheme to mitigate the policy myopic issue during parallel training. A comprehensive evaluation is conducted on benchmark problems with respect to various metrics. The experimental results demonstrate that T4NMTD effectively addresses NMTs, achieving significant performance improvements compared with related studies. Ruixuan Miao, Xu Lu 0003, Cong Tian 0001, Bin Yu 0008 |
AAAI | 1 |
| 2024 | Using experience classification for training non-Markovian tasks
Ruixuan Miao, Xu Lu 0003, Cong Tian 0001, Bin Yu 0008, Jin Cui 0003 |
Expert Syst. Appl. | 1 |