5 citations · 17 across the 18 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Online Learning and Bandits with Queried Hints
Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im +2
We consider the classic online learning and stochastic multi-armed bandit (MAB) problems, when at each step, the online policy can probe and find out which of a small number ()…
cs.LG2022★ 1 cited
Affinity-Aware Graph Networks
Ameya Velingker, Ali Kemal Sinop, Ira Ktena +2
Graph Neural Networks (GNNs) have emerged as a powerful technique for learning on relational data. Owing to the relatively limited number of message passing steps they perform -- a…