Demo Data from EDBT 2026 / reviewers in the wild / expert
Roman Belaire
dblp:340/3921
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—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 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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › robust reinforcement learning
adversarial reinforcement learning |
0.9 | 1 | 2025 | On Minimizing Adversarial Counterfactual Error in Adversarial Reinforcement Learning · ICLR 2025 |
Machine learning › Reinforcement learning
partially observable reinforcement learning |
0.9 | 1 | 2025 | On Minimizing Adversarial Counterfactual Error in Adversarial Reinforcement Learning · ICLR 2025 |
Machine learning › Reinforcement learning
robust reinforcement learning |
0.9 | 1 | 2025 | On Minimizing Adversarial Counterfactual Error in Adversarial Reinforcement Learning · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
counterfactual reasoning · 0.9adversarial training · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | On Minimizing Adversarial Counterfactual Error in Adversarial Reinforcement LearningabstractDeep Reinforcement Learning (DRL) policies are highly susceptible to adversarial noise in observations, which poses significant risks in safety-critical scenarios. The challenge inherent to adversarial perturbations is that by altering the information observed by the agent, the state becomes only partially observable. Existing approaches address this by either enforcing consistent actions across nearby states or maximizing the worst-case value within adversarially perturbed observations. However, the former suffers from performance degradation when attacks succeed, while the latter tends to be overly conservative, leading to suboptimal performance in benign settings. We hypothesize that these limitations stem from their failing to account for partial observability directly. To this end, we introduce a novel objective called Adversarial Counterfactual Error (ACoE), defined on the beliefs about the true state and balancing value optimization with robustness. To make ACoE scalable in model-free settings, we propose the theoretically-grounded surrogate objective Cumulative-ACoE (C-ACoE). Our empirical evaluations on standard benchmarks (MuJoCo, Atari, and Highway) demonstrate that our method significantly outperforms current state-of-the-art approaches for addressing adversarial RL challenges, offering a promising direction for improving robustness in DRL under adversarial conditions. Our code is available at https://github.com/romanbelaire/acoe-robust-rl. Roman Belaire, Arunesh Sinha, Pradeep Varakantham |
ICLR | 1 |