20 citations · 78 across the 12 of their papers we have counts for
5 papers · 1 filter
Near Instance Optimal Model Selection for Pure Exploration Linear Bandits
Yinglun Zhu, Julian Katz-Samuels, Robert Nowak
We introduce the model selection problem in pure exploration linear bandits, where the learner needs to adapt to the instance-dependent complexity measure of the smallest hypothesi…
The True Sample Complexity of Identifying Good Arms
Julian Katz-Samuels, Kevin Jamieson
We consider two multi-armed bandit problems with arms: (i) given an , identify an arm with mean that is within of the largest mean and (ii) given a threshold an…
Decontamination of Mutual Contamination Models
Julian Katz-Samuels, Gilles Blanchard, Clayton Scott
Many machine learning problems can be characterized by mutual contamination models. In these problems, one observes several random samples from different convex combinations of a s…
Nonparametric Preference Completion
Julian Katz-Samuels, Clayton Scott
We consider the task of collaborative preference completion: given a pool of items, a pool of users and a partially observed item-user rating matrix, the goal is to recover the \em…
A Mutual Contamination Analysis of Mixed Membership and Partial Label Models
Julian Katz-Samuels, Clayton Scott
Many machine learning problems can be characterized by mutual contamination models. In these problems, one observes several random samples from different convex combinations of a s…