Sanjoy Dasgupta
39 papers · 2007–2024 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+13 more ↓ Show less ↑
π§ Keyword Pioneer π£ Hot Topic Early Bird π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (18) π Conference Polyglot (8)
πΊοΈ
Taxonomy Completionist
(18)
π
Renaissance Researcher
(7)
π§
Keyword Pioneer
π
Keyword Trendsetter Combo
(3)
π¬
Deep Specialist
(12)
π±
Topic Pioneer
π
Keyword Champion
π
Century Club
(39)
π₯
Unstoppable
(5)
ποΈ
Keyword Collector
(86)
π
Trend Setter
β‘
Prolific Year
(5)
β
The Questioner
Conferences
NIPS (14)
ICML (9)
AISTATS (5)
ALT (3)
COLT (3)
JMLR (3)
IJCAI (1)
UAI (1)
Top co-authors
Research topics
Keywords
online learning
(5)
active learning
(5)
convergence rate
(5)
k-means clustering
(4)
sample complexity
(4)
nearest neighbor search
(4)
nearest neighbor classification
(3)
mixture model
(3)
supervised learning
(3)
statistical learning
(3)
generative model
(2)
unsupervised learning
(2)
stochastic gradient descent
(2)
cluster analysis
(2)
dimensionality reduction
(2)
generalization bound
(2)
hierarchical clustering
(2)
k-d tree
(2)
density estimation
(2)
parameter estimation
(2)
Papers
Convergence Behavior of an Adversarial Weak Supervision Method
UAI 2024
New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering
ICML 2024
Online Consistency of the Nearest Neighbor Rule
NIPS 2024
Online k-means Clustering on Arbitrary Data Streams
ALT 2023
Data-Copying in Generative Models: A Formal Framework
ICML 2023
Convergence of online k-means
AISTATS 2022
A Theoretical Perspective on Hyperdimensional Computing (Extended Abstract)
IJCAI 2022
Constants Matter: The Performance Gains of Active Learning
ICML 2022
Framework for Evaluating Faithfulness of Local Explanations
ICML 2022
Algorithmic Learning Theory 2022: Preface
ALT 2022
What relations are reliably embeddable in Euclidean space?
ALT 2020
Robust Learning from Discriminative Feature Feedback
AISTATS 2020
A Three Sample Hypothesis Test for Evaluating Generative Models
AISTATS 2020
Explainable k-Means and k-Medians Clustering
ICML 2020
An adaptive nearest neighbor rule for classification
NIPS 2019
The Relative Complexity of Maximum Likelihood Estimation, MAP Estimation, and Sampling
COLT 2019
Teaching a black-box learner
ICML 2019
Learning from discriminative feature feedback
NIPS 2018
Maximum Likelihood Estimation for Mixtures of Spherical Gaussians is NP-hard
JMLR 2018
Comparison Based Learning from Weak Oracles
AISTATS 2018
Interactive Structure Learning with Structural Query-by-Committee
NIPS 2018
Learning with Feature Feedback: from Theory to Practice
AISTATS 2017
Diameter-Based Active Learning
ICML 2017
Interactive Bayesian Hierarchical Clustering
ICML 2016
An algorithm for L1 nearest neighbor search via monotonic embedding
NIPS 2016
Rates of Convergence for Nearest Neighbor Classification
NIPS 2014
Incremental Clustering: The Case for Extra Clusters
NIPS 2014
Lower Bounds for the Gibbs Sampler over Mixtures of Gaussians
ICML 2014
Optimal rates for k-NN density and mode estimation
NIPS 2014
Randomized partition trees for exact nearest neighbor search
COLT 2013
The Fast Convergence of Incremental PCA
NIPS 2013
Moment-based Uniform Deviation Bounds for $k$-means and Friends
NIPS 2013
Consistency of Nearest Neighbor Classification under Selective Sampling
COLT 2012
Rates of convergence for the cluster tree
NIPS 2010
Analysis of Perceptron-Based Active Learning
JMLR 2009
A general agnostic active learning algorithm
NIPS 2007
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians
JMLR 2007
Learning the structure of manifolds using random projections
NIPS 2007
A learning framework for nearest neighbor search
NIPS 2007