Demo Data from EDBT 2026 / reviewers in the wild / expert
Bram Grooten
dblp:317/1215
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 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
2 papers |
Motion planning and robot control · 32% Efficient and distributed learning · 32% Reinforcement learning · 16% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › multi-task reinforcement learning
contextual reinforcement learning |
1.0 | 1 | 2026 | Out-of-Distribution Generalization with a SPARC: Racing 100 Unseen Vehicles with a Single Policy · AAAI 2026 |
Machine learning › Trustworthy machine learning
out-of-distribution generalization |
1.0 | 1 | 2026 | Out-of-Distribution Generalization with a SPARC: Racing 100 Unseen Vehicles with a Single Policy · AAAI 2026 |
Robotics › Motion planning and robot control
robot control |
1.0 | 1 | 2026 | Out-of-Distribution Generalization with a SPARC: Racing 100 Unseen Vehicles with a Single Policy · AAAI 2026 |
Robotics › Motion planning and robot control › robot control
robust control |
1.0 | 1 | 2026 | Out-of-Distribution Generalization with a SPARC: Racing 100 Unseen Vehicles with a Single Policy · AAAI 2026 |
Machine learning › Efficient and distributed learning › model compression › sparse training
dynamic sparse training |
0.7 | 1 | 2023 | Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training · NeurIPS 2023 |
Machine learning › Efficient and distributed learning
model compression |
0.7 | 1 | 2023 | Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training · NeurIPS 2023 |
Machine learning › Efficient and distributed learning › model compression › pruning
pruning criterion |
0.7 | 1 | 2023 | Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
single-phase adaptation · 1.0context encoder · 1.0magnitude-based pruning · 0.7empirical analysis · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Out-of-Distribution Generalization with a SPARC: Racing 100 Unseen Vehicles with a Single PolicyabstractGeneralization to unseen environments is a significant challenge in the field of robotics and control. In this work, we focus on contextual reinforcement learning, where agents act within environments with varying contexts, such as self-driving cars or quadrupedal robots that need to operate in different terrains or weather conditions than they were trained for. We tackle the critical task of generalizing to out-of-distribution (OOD) settings, without access to explicit context information at test time. Recent work has addressed this problem by training a context encoder and a history adaptation module in separate stages. While promising, this two-phase approach is cumbersome to implement and train. We simplify the methodology and introduce SPARC: single-phase adaptation for robust control. We test SPARC on varying contexts within the high-fidelity racing simulator Gran Turismo 7 and wind-perturbed MuJoCo environments, and find that it achieves reliable and robust OOD generalization. Bram Grooten, Patrick MacAlpine, Kaushik Subramanian, Peter Stone 0001, Peter R. Wurman |
AAAI | 1 |
| 2025 | Boosting Robustness in Preference-Based Reinforcement Learning with Dynamic Sparsity
Calarina Muslimani, Bram Grooten, Deepak Ranganatha Sastry Mamillapalli, Mykola Pechenizkiy, Decebal Constantin Mocanu, Matthew E. Taylor |
AAMAS | 2 |
| 2023 | Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse TrainingabstractDynamic Sparse Training (DST) is a rapidly evolving area of research that seeks to optimize the sparse initialization of a neural network by adapting its topology during training. It has been shown that under specific conditions, DST is able to outperform dense models. The key components of this framework are the pruning and growing criteria, which are repeatedly applied during the training process to adjust the network’s sparse connectivity. While the growing criterion's impact on DST performance is relatively well studied, the influence of the pruning criterion remains overlooked. To address this issue, we design and perform an extensive empirical analysis of various pruning criteria to better understand their impact on the dynamics of DST solutions. Surprisingly, we find that most of the studied methods yield similar results. The differences become more significant in the low-density regime, where the best performance is predominantly given by the simplest technique: magnitude-based pruning. Aleksandra Nowak 0001, Bram Grooten, Decebal Constantin Mocanu, Jacek Tabor |
NeurIPS | 2 |