Demo Data from EDBT 2026 / reviewers in the wild / expert
Rohan Mitta
dblp:365/4490
· DBLP profile ↗
1ranked-venue papers
1as 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 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 · 67% Probabilistic and Bayesian 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 › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference |
0.8 | 1 | 2024 | Safeguarded Progress in Reinforcement Learning: Safe Bayesian Exploration for Control Policy Synthesis · AAAI 2024 |
Machine learning › Reinforcement learning › safe reinforcement learning
safe exploration |
0.8 | 1 | 2024 | Safeguarded Progress in Reinforcement Learning: Safe Bayesian Exploration for Control Policy Synthesis · AAAI 2024 |
Machine learning › Reinforcement learning
safe reinforcement learning |
0.8 | 1 | 2024 | Safeguarded Progress in Reinforcement Learning: Safe Bayesian Exploration for Control Policy Synthesis · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
markov decision process · 0.8dirichlet-categorical model · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Safeguarded Progress in Reinforcement Learning: Safe Bayesian Exploration for Control Policy SynthesisabstractThis paper addresses the problem of maintaining safety during training in Reinforcement Learning (RL), such that the safety constraint violations are bounded at any point during learning. As enforcing safety during training might severely limit the agent’s exploration, we propose here a new architecture that handles the trade-off between efficient progress and safety during exploration. As the exploration progresses, we update via Bayesian inference Dirichlet-Categorical models of the transition probabilities of the Markov decision process that describes the environment dynamics. We then propose a way to approximate moments of belief about the risk associated to the action selection policy. We demonstrate that this approach can be easily interleaved with RL and we present experimental results to showcase the performance of the overall architecture. Rohan Mitta, Hosein Hasanbeig, Jun Wang 0135, Daniel Kroening, Yiannis Kantaros, Alessandro Abate |
AAAI | 1 |