Guilherme Dinis Junior
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Guilherme Dinis Junior has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Jaakko Hollmén
Stockholm University
3 shared publications - Panagiotis Papapetrou
Department of Computer and Systems Sciences, Stockholm University, Stockholm, Sweden
2 shared publications - Sindri Magnússon
Stockholm University
2 shared publications - Alejandro Kuratomi
Department of Computer and Systems Sciences, Stockholm University, Stockholm, Sweden
1 shared publication - Antonina Danylenko
Spotify, Sweden
1 shared publication - Buket Baran
Spotify, Sweden
1 shared publication
Latest Publications
- Open Access
- 18 August 2025
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 67 (11) , 10863-10901
Subgroup fairness based on shared counterfactuals
CounterFair is a group counterfactual search algorithm that detects and minimizes biases among sensitive groups and identifies relevant subgroups inside these sensitive groups based on shared counterfactual instances. We investigate the latter capability, analyzing the found subgroups from the perspective of fairness based on counterfactual reasoning, in order to evaluate whether they present different biases with respect to each other and to the sensitive feature groups they belong to. We perform these measurements on the subgroups extracted by CounterFair over six binary classification datasets, providing figures and their respective analysis on the presence of bias.
- 18 August 2025
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 67 (11) , 10863-10901
Open AccessSubgroup fairness based on shared counterfactuals
CounterFair is a group counterfactual search algorithm that detects and minimizes biases among sensitive groups and identifies relevant subgroups inside these sensitive groups based on shared counterfactual instances. We investigate the latter capability, analyzing the found subgroups from the perspective of fairness based on counterfactual reasoning, in order to evaluate whether they present different biases with respect to each other and to the sensitive feature groups they belong to. We perform these measurements on the subgroups extracted by CounterFair over six binary classification datasets, providing figures and their respective analysis on the presence of bias.
- 22 August 2024
- Published by Springer Nature
- p. 389-406
Policy Control with Delayed, Aggregate, and Anonymous Feedback
- 22 August 2024
- Published by Springer Nature
- p. 389-406
Policy Control with Delayed, Aggregate, and Anonymous Feedback
- Open Access
- 14 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 70-73
Accelerating Creator Audience Building through Centralized Exploration
On Spotify, multiple recommender systems enable personalized user experiences across a wide range of product features. These systems are owned by different teams and serve different goals, but all of these systems need to explore and learn about new content as it appears on the platform. In this work, we describe ongoing efforts at Spotify to develop an efficient solution to this problem, by centralizing content exploration and providing signals to existing, decentralized recommendation systems (a.k.a. exploitation systems). We take a creator-centric perspective, and argue that this approach can dramatically reduce the time it takes for new content to reach its full potential.
- 14 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 70-73
Open AccessAccelerating Creator Audience Building through Centralized Exploration
On Spotify, multiple recommender systems enable personalized user experiences across a wide range of product features. These systems are owned by different teams and serve different goals, but all of these systems need to explore and learn about new content as it appears on the platform. In this work, we describe ongoing efforts at Spotify to develop an efficient solution to this problem, by centralizing content exploration and providing signals to existing, decentralized recommendation systems (a.k.a. exploitation systems). We take a creator-centric perspective, and argue that this approach can dramatically reduce the time it takes for new content to reach its full potential.
- 1 April 2023
- Published by Springer Nature
- p. 314-326
Explaining Black Box Reinforcement Learning Agents Through Counterfactual Policies
- 1 April 2023
- Published by Springer Nature
- p. 314-326
Explaining Black Box Reinforcement Learning Agents Through Counterfactual Policies
- 6 November 2022
- Published by Springer Nature
- p. 114-123
Policy Evaluation with Delayed, Aggregated Anonymous Feedback
- 6 November 2022
- Published by Springer Nature
- p. 114-123
Policy Evaluation with Delayed, Aggregated Anonymous Feedback