Demo Data from VLDB 2026 / reviewers in the wild / expert
Nikolaus Vertovec
dblp:288/2408
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 · 68% Trustworthy machine learning · 16% Motion planning and robot control · 16% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
safe reinforcement learning |
0.9 | 1 | 2025 | SPoRt - Safe Policy Ratio: Certified Training and Deployment of Task Policies in Model-Free RL · IJCAI 2025 |
Machine learning › Reinforcement learning
model-free reinforcement learning |
0.3 | 1 | 2025 | SPoRt - Safe Policy Ratio: Certified Training and Deployment of Task Policies in Model-Free RL · IJCAI 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.3 | 1 | 2025 | SPoRt - Safe Policy Ratio: Certified Training and Deployment of Task Policies in Model-Free RL · IJCAI 2025 |
Robotics › Motion planning and robot control
safety guarantees |
0.3 | 1 | 2025 | SPoRt - Safe Policy Ratio: Certified Training and Deployment of Task Policies in Model-Free RL · IJCAI 2025 |
Methods — techniques the papers use, named apart from their topics
scenario theory · 0.9projected PPO · 0.9maximum policy ratio · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SPoRt - Safe Policy Ratio: Certified Training and Deployment of Task Policies in Model-Free RLabstractTo apply reinforcement learning to safety-critical applications, we ought to provide safety guarantees during both policy training and deployment. In this work we present novel theoretical results that provide a bound on the probability of violating a safety property for a new task-specific policy in a model-free, episodic setup: the bound, based on a 'maximum policy ratio' that is computed with respect to a 'safe' base policy, can also be more generally applied to temporally-extended properties (beyond safety) and to robust control problems. We thus present SPoRt, which also provides a data-driven approach for obtaining such a bound for the base policy, based on scenario theory, and which includes Projected PPO, a new projection-based approach for training the task-specific policy while maintaining a user-specified bound on property violation. Hence, SPoRt enables the user to trade off safety guarantees in exchange for task-specific performance. Accordingly, we present experimental results demonstrating this trade-off, as well as a comparison of the theoretical bound to posterior bounds based on empirical violation rates. Jacques Cloete, Nikolaus Vertovec, Alessandro Abate |
IJCAI | 2 |