2 citations · 2 across the 10 of their papers we have counts for
4 papers · 1 filter
Online Consistency of the Nearest Neighbor Rule
Sanjoy Dasgupta, Geelon So
In the realizable online setting, a learner is tasked with making predictions for a stream of instances, where the correct answer is revealed after each prediction. A learning rule…
Metric Learning from Limited Pairwise Preference Comparisons
Zhi Wang, Geelon So, Ramya Korlakai Vinayak
We study metric learning from preference comparisons under the ideal point model, in which a user prefers an item over another if it is closer to their latent ideal item. These ite…
Online nearest neighbor classification
Sanjoy Dasgupta, Geelon So
We study an instance of online non-parametric classification in the realizable setting. In particular, we consider the classical 1-nearest neighbor algorithm, and show that it achi…
Convergence of online -means
Sanjoy Dasgupta, Gaurav Mahajan, Geelon So
We prove asymptotic convergence for a general class of -means algorithms performed over streaming data from a distribution: the centers asymptotically converge to the set of sta…