Demo Data from EDBT 2026 / reviewers in the wild / expert
Tri Wahyu Guntara
dblp:266/0681
· 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 · 56% Kernel, tree and ensemble methods · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Kernel, tree and ensemble methods › kernel methods › kernel learning
kernel metric learning |
0.8 | 1 | 2024 | Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL Policies · ICLR 2024 |
Machine learning › Reinforcement learning
off-policy evaluation |
0.8 | 1 | 2024 | Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL Policies · ICLR 2024 |
Machine learning › Reinforcement learning
policy evaluation |
0.2 | 1 | 2024 | Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL Policies · ICLR 2024 |
Methods — techniques the papers use, named apart from their topics
temporal difference learning · 0.8kernel methods · 0.8importance sampling · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL PoliciesabstractWe consider off-policy evaluation (OPE) of deterministic target policies for reinforcement learning (RL) in environments with continuous action spaces. While it is common to use importance sampling for OPE, it suffers from high variance when the behavior policy deviates significantly from the target policy. In order to address this issue, some recent works on OPE proposed in-sample learning with importance resampling. Yet, these approaches are not applicable to deterministic target policies for continuous action spaces. To address this limitation, we propose to relax the deterministic target policy using a kernel and learn the kernel metrics that minimize the overall mean squared error of the estimated temporal difference update vector of an action value function, where the action value function is used for policy evaluation. We derive the bias and variance of the estimation error due to this relaxation and provide analytic solutions for the optimal kernel metric. In empirical studies using various test domains, we show that the OPE with in-sample learning using the kernel with optimized metric achieves significantly improved accuracy than other baselines. Haanvid Lee, Tri Wahyu Guntara, Jongmin Lee 0004, Yung-Kyun Noh, Kee-Eung Kim |
ICLR | 2 |