20 citations · 38 across the 9 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2025
Asymptotically-Optimal Gaussian Bandits with Side Observations
Alexia Atsidakou, Orestis Papadigenopoulos, Constantine Caramanis +2
We study the problem of Gaussian bandits with general side information, as first introduced by Wu, Szepesvari, and Gyorgy. In this setting, the play of an arm reveals information a…
cs.LG2023★ 9 cited
InfoNCE Loss Provably Learns Cluster-Preserving Representations
Advait Parulekar, Liam Collins, Karthikeyan Shanmugam +2
The goal of contrasting learning is to learn a representation that preserves underlying clusters by keeping samples with similar content, e.g. the ``dogness'' of a dog, close to ea…