NIPS Proceedingsβ

Sanjoy Dasgupta

14 Papers

  • An algorithm for L1 nearest neighbor search via monotonic embedding (2016)
  • Incremental Clustering: The Case for Extra Clusters (2014)
  • Optimal rates for k-NN density and mode estimation (2014)
  • Rates of Convergence for Nearest Neighbor Classification (2014)
  • Moment-based Uniform Deviation Bounds for $k$-means and Friends (2013)
  • The Fast Convergence of Incremental PCA (2013)
  • Rates of convergence for the cluster tree (2010)
  • A general agnostic active learning algorithm (2007)
  • A learning framework for nearest neighbor search (2007)
  • Learning the structure of manifolds using random projections (2007)
  • Coarse sample complexity bounds for active learning (2005)
  • Analysis of a greedy active learning strategy (2004)
  • An Iterative Improvement Procedure for Hierarchical Clustering (2003)
  • PAC Generalization Bounds for Co-training (2001)