Demo Data from EDBT 2026 / reviewers in the wild / expert
Chen-Tao Lee
dblp:362/0652
· DBLP profile ↗
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 · 67% Trustworthy machine 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 › Trustworthy machine learning › interpretability
explainable reinforcement learning |
0.8 | 1 | 2024 | Hierarchical Programmatic Option Framework · NeurIPS 2024 |
Machine learning › Reinforcement learning
hierarchical reinforcement learning |
0.8 | 1 | 2024 | Hierarchical Programmatic Option Framework · NeurIPS 2024 |
Machine learning › Reinforcement learning › policy learning › policy parameterization
programmatic policy |
0.8 | 1 | 2024 | Hierarchical Programmatic Option Framework · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
program synthesis · 0.8option framework · 0.8hierarchical policy learning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Hierarchical Programmatic Option FrameworkabstractDeep reinforcement learning aims to learn deep neural network policies to solve large-scale decision-making problems. However, approximating policies using deep neural networks makes it difficult to interpret the learned decision-making process. To address this issue, prior works (Trivedi et al., 2021; Liu et al., 2023; Carvalho et al., 2024) proposed to use human-readable programs as policies to increase the interpretability of the decision-making pipeline. Nevertheless, programmatic policies generated by these methods struggle to effectively solve long and repetitive RL tasks and cannot generalize to even longer horizons during testing. To solve these problems, we propose the Hierarchical Programmatic Option framework (HIPO), which aims to solve long and repetitive RL problems with human-readable programs as options (low-level policies). Specifically, we propose a method that retrieves a set of effective, diverse, and compatible programs as options. Then, we learn a high-level policy to effectively reuse these programmatic options to solve reoccurring subtasks. Our proposed framework outperforms programmatic RL and deep RL baselines on various tasks. Ablation studies justify the effectiveness of our proposed search algorithm for retrieving a set of programmatic options. Chen-Tao Lee, Chih-Han Yang, Guan-Ting Liu, Shao-Hua Sun |
NeurIPS | 2 |