908 citations · 918 across the 17 of their papers we have counts for
6 papers · 1 filter
Rotting Infinitely Many-armed Bandits
Jung-hun Kim, Milan Vojnovic, Se-Young Yun
We consider the infinitely many-armed bandit problem with rotting rewards, where the mean reward of an arm decreases at each pull of the arm according to an arbitrary trend with ma…
Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
Jung-hun Kim, Milan Vojnovic
We consider the problem of scheduling in multi-class, parallel-server queuing systems with uncertain rewards from job-server assignments. In this scenario, jobs incur holding costs…
Scheduling Jobs with Stochastic Holding Costs
Dabeen Lee, Milan Vojnovic
We study a single-server scheduling problem for the objective of minimizing the expected cumulative holding cost incurred by jobs, where parameters defining stochastic job holding…
KONG: Kernels for ordered-neighborhood graphs
Moez Draief, Konstantin Kutzkov, Kevin Scaman +1
We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are…
QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding
Dan Alistarh, Demjan Grubic, Jerry Li +2
Parallel implementations of stochastic gradient descent (SGD) have received significant research attention, thanks to excellent scalability properties of this algorithm, and to its…
Spectral Ranking using Seriation
Fajwel Fogel, Alexandre d'Aspremont, Milan Vojnovic
We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compa…