5 papers
Regret minimization in Linear Bandits with offline data via extended D-optimal exploration
Sushant Vijayan, Arun Suggala, Karthikeyan Shanmugam +1
We consider the problem of online regret minimization in linear bandits with access to prior observations (offline data) from the underlying bandit model. There are numerous applic…
Towards minimax optimal algorithms for Active Simple Hypothesis Testing
Sushant Vijayan
We study the Active Simple Hypothesis Testing (ASHT) problem, a simpler variant of the Fixed Budget Best Arm Identification problem. In this work, we provide novel game theoretic f…
Online Bidding under RoS Constraints without Knowing the Value
Sushant Vijayan, Zhe Feng, Swati Padmanabhan +3
We consider the problem of bidding in online advertising, where an advertiser aims to maximize value while adhering to budget and Return-on-Spend (RoS) constraints. Unlike prior wo…
Best arm identification in rare events
Anirban Bhattacharjee, Sushant Vijayan, Sandeep K Juneja
We consider the best arm identification problem in the stochastic multi-armed bandit framework where each arm has a tiny probability of realizing large rewards while with overwhelm…
Differential Games in the spread of Covid-19
Sushant Vijayan
Given the ongoing Covid-19 pandemic, it is of interest to understand how the infections spread as the combined result of measures taken by central planners (governments) and indivi…