research
∙
05/25/2023
Combinatorial Bandits for Maximum Value Reward Function under Max Value-Index Feedback
We consider a combinatorial multi-armed bandit problem for maximum value...
share
research
∙
01/22/2023
Doubly Adversarial Federated Bandits
We study a new non-stochastic federated multi-armed bandit problem with ...
research
∙
11/30/2022
On Regret-optimal Cooperative Nonstochastic Multi-armed Bandits
We consider the nonstochastic multi-agent multi-armed bandit problem wit...
research
∙
01/31/2022
Rotting infinitely many-armed bandits
We consider the infinitely many-armed bandit problem with rotting reward...
research
∙
12/13/2021
Scheduling Servers with Stochastic Bilinear Rewards
In this paper we study a multi-class, multi-server queueing system with ...
research
∙
07/31/2021
Pure Exploration and Regret Minimization in Matching Bandits
Finding an optimal matching in a weighted graph is a standard combinator...
research
∙
05/28/2021
Learning to Schedule
This paper proposes a learning and scheduling algorithm to minimize the ...
research
∙
12/30/2020
Test Score Algorithms for Budgeted Stochastic Utility Maximization
Motivated by recent developments in designing algorithms based on indivi...
research
∙
01/01/2019
Convergence Rates of Gradient Descent and MM Algorithms for Generalized Bradley-Terry Models
We show tight convergence rate bounds for gradient descent and MM algori...
research
∙
05/25/2018
KONG: Kernels for ordered-neighborhood graphs
We present novel graph kernels for graphs with node and edge labels that...
research
∙
03/02/2017
Adaptive Matching for Expert Systems with Uncertain Task Types
Online two-sided matching markets such as Q&A forums (e.g. StackOverflow...
research
∙
06/20/2014
