Demo Data from EDBT 2026 / reviewers in the wild / expert
Niko A. Grupen
dblp:279/6600
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 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
2 papers |
Reinforcement learning · 22% Trustworthy machine learning · 22% Motion planning and robot control · 19% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › multi-agent reinforcement learning
cooperative multi-agent reinforcement learning |
0.6 | 1 | 2022 | Cooperative Multi-Agent Fairness and Equivariant Policies · AAAI 2022 |
Machine learning › Trustworthy machine learning
fairness |
0.6 | 1 | 2022 | Cooperative Multi-Agent Fairness and Equivariant Policies · AAAI 2022 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.5 | 1 | 2021 | Unsupervised Feature Learning for Manipulation with Contrastive Domain Randomization · ICRA 2021 |
Machine learning › Generative modeling
image manipulation |
0.5 | 1 | 2021 | Unsupervised Feature Learning for Manipulation with Contrastive Domain Randomization · ICRA 2021 |
Robotics › Motion planning and robot control
robot learning |
0.5 | 1 | 2021 | Unsupervised Feature Learning for Manipulation with Contrastive Domain Randomization · ICRA 2021 |
Methods — techniques the papers use, named apart from their topics
regularization · 0.6policy optimization · 0.6equivariant policies · 0.6simulation-to-real transfer · 0.5domain randomization · 0.5contrastive estimation · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Cooperative Multi-Agent Fairness and Equivariant PoliciesabstractWe study fairness through the lens of cooperative multi-agent learning. Our work is motivated by empirical evidence that naive maximization of team reward yields unfair outcomes for individual team members. To address fairness in multi-agent contexts, we introduce team fairness, a group-based fairness measure for multi-agent learning. We then prove that it is possible to enforce team fairness during policy optimization by transforming the team's joint policy into an equivariant map. We refer to our multi-agent learning strategy as Fairness through Equivariance (Fair-E) and demonstrate its effectiveness empirically. We then introduce Fairness through Equivariance Regularization (Fair-ER) as a soft-constraint version of Fair-E and show that it reaches higher levels of utility than Fair-E and fairer outcomes than non-equivariant policies. Finally, we present novel findings regarding the fairness-utility trade-off in multi-agent settings; showing that the magnitude of the trade-off is dependent on agent skill. Niko A. Grupen, Bart Selman, Daniel D. Lee |
AAAI | 1 |
| 2021 | Unsupervised Feature Learning for Manipulation with Contrastive Domain RandomizationabstractRobotic tasks such as manipulation with visual inputs require image features that capture the physical properties of the scene, e.g., the position and configuration of objects. Recently, it has been suggested to learn such features in an unsupervised manner from simulated, self-supervised, robot interaction; the idea being that high-level physical properties are well captured by modern physical simulators, and their representation from visual inputs may transfer well to the real world. In particular, learning methods based on noise contrastive estimation have shown promising results. To robustify the simulation-to-real transfer, domain randomization (DR) was suggested for learning features that are invariant to irrelevant visual properties such as textures or lighting. In this work, however, we show that a naive application of DR to unsupervised learning based on contrastive estimation does not promote invariance, as the loss function maximizes mutual information between the features and both the relevant and irrelevant visual properties. We propose a simple modification of the contrastive loss to fix this, exploiting the fact that we can control the simulated randomization of visual properties. Our approach learns physical features that are significantly more robust to visual domain variation, as we demonstrate using both rigid and non-rigid objects. Carmel Rabinovitz, Niko A. Grupen, Aviv Tamar |
ICRA | 2 |