331 citations · 418 across the 18 of their papers we have counts for
4 papers · 1 filter
Improved Confidence Bounds for the Linear Logistic Model and Applications to Linear Bandits
Kwang-Sung Jun, Lalit Jain, Blake Mason +1
We propose improved fixed-design confidence bounds for the linear logistic model. Our bounds significantly improve upon the state-of-the-art bound by Li et al. (2017) via recent de…
A New Perspective on Pool-Based Active Classification and False-Discovery Control
Lalit Jain, Kevin Jamieson
In many scientific settings there is a need for adaptive experimental design to guide the process of identifying regions of the search space that contain as many true positives as…
Spectral Methods for Ranking with Scarce Data
Umang Varma, Lalit Jain, Anna C. Gilbert
Given a number of pairwise preferences of items, a common task is to rank all the items. Examples include pairwise movie ratings, New Yorker cartoon caption contests, and many othe…
An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits
Julian Katz-Samuels, Lalit Jain, Zohar Karnin +1
This paper proposes near-optimal algorithms for the pure-exploration linear bandit problem in the fixed confidence and fixed budget settings. Leveraging ideas from the theory of su…