Showing 2025Show all
3 papers · 1 filter
cs.LG2025
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…
cs.LG2025
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…
cs.LG2025
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…