Search Results for author:
Found 4 papers, 1 papers with code
Poly-View Contrastive Learning
Contrastive learning typically matches pairs of related views among a number of unrelated negative views.
Optimal Regret Bounds for Collaborative Learning in Bandits
We consider regret minimization in a general collaborative multi-agent multi-armed bandit model, in which each agent faces a finite set of arms and may communicate with other agents through a central controller.
Chained Generalisation Bounds
This work discusses how to derive upper bounds for the expected generalisation error of supervised learning algorithms by means of the chaining technique.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
