1 citations · 1 across the 6 of their papers we have counts for
4 papers · 1 filter
An Experimental Design Approach for Regret Minimization in Logistic Bandits
Blake Mason, Kwang-Sung Jun, Lalit Jain
In this work we consider the problem of regret minimization for logistic bandits. The main challenge of logistic bandits is reducing the dependence on a potentially large problem d…
Nearly Optimal Algorithms for Level Set Estimation
Blake Mason, Romain Camilleri, Subhojyoti Mukherjee +3
The level set estimation problem seeks to find all points in a domain where the value of an unknown function exceeds a threshold .…
Nearest Neighbor Search Under Uncertainty
Blake Mason, Ardhendu Tripathy, Robert Nowak
Nearest Neighbor Search (NNS) is a central task in knowledge representation, learning, and reasoning. There is vast literature on efficient algorithms for constructing data structu…
Learning Nearest Neighbor Graphs from Noisy Distance Samples
Blake Mason, Ardhendu Tripathy, Robert Nowak
We consider the problem of learning the nearest neighbor graph of a dataset of n items. The metric is unknown, but we can query an oracle to obtain a noisy estimate of the distance…