activity
20192023
most citedEnforcing fairness in private federated learning via the modified method of differential multipliers

30 citations · 99 across the 7 of their papers we have counts for

collaborators
Showing stat.MLShow all

5 papers · 1 filter

stat.ML2023★ 3 cited

More PAC-Bayes bounds: From bounded losses, to losses with general tail behaviors, to anytime validity

Borja Rodríguez-Gálvez, Ragnar Thobaben, Mikael Skoglund

In this paper, we present new high-probability PAC-Bayes bounds for different types of losses. Firstly, for losses with a bounded range, we recover a strengthened version of Catoni…

stat.ML2023

Thompson Sampling Regret Bounds for Contextual Bandits with sub-Gaussian rewards

Amaury Gouverneur, Borja Rodríguez-Gálvez, Tobias J. Oechtering +1

In this work, we study the performance of the Thompson Sampling algorithm for Contextual Bandit problems based on the framework introduced by Neu et al. and their concept of lifted…

stat.ML2021★ 20 cited

Tighter expected generalization error bounds via Wasserstein distance

Borja Rodríguez-Gálvez, Germán Bassi, Ragnar Thobaben +1

This work presents several expected generalization error bounds based on the Wasserstein distance. More specifically, it introduces full-dataset, single-letter, and random-subset b…

stat.ML2020

A Variational Approach to Privacy and Fairness

Borja Rodríguez-Gálvez, Ragnar Thobaben, Mikael Skoglund

In this article, we propose a new variational approach to learn private and/or fair representations. This approach is based on the Lagrangians of a new formulation of the privacy a…

stat.ML2019★ 22 cited

The Convex Information Bottleneck Lagrangian

Borja Rodríguez-Gálvez, Ragnar Thobaben, Mikael Skoglund

The information bottleneck (IB) problem tackles the issue of obtaining relevant compressed representations of some random variable for the task of predicting . It is def…