Goto

Collaborating Authors

 Genoa










Statistical and Computational Trade-Offs in Kernel K-Means

Daniele Calandriello, Lorenzo Rosasco

Neural Information Processing Systems

More precisely, we study a Nyström approach to kernel k-means. Weanalyze thestatistical properties oftheproposed method andshow that it achieves the same accuracy of exact kernel k-means with only a fraction of computations.


GroupMeritocraticFairnessinLinearContextual Bandits

Neural Information Processing Systems

We study the linear contextual bandit problem where an agent has to select one candidate from a pool and each candidate belongs to a sensitive group. In this setting,candidates' rewardsmaynotbedirectly comparable between groups,for example when the agent is an employer hiring candidates from different ethnic groups and some groups have a lower reward due to discriminatory bias and/or socialinjustice.