Sanjoy Dasgupta | DeepAI

AI Chat

Featured Co-authors

Lin Chen
100 publications
Amin Karbasi
77 publications
Kamalika Chaudhuri
74 publications
Daniel Hsu
72 publications
Shay Moran
56 publications
Matus Telgarsky
32 publications
Sivan Sabato
24 publications
Yoav Freund
24 publications
Samory Kpotufe
22 publications
Yang Shen
21 publications
Tajana Rosing
21 publications

∙ 07/03/2023

Online nearest neighbor classification

We study an instance of online non-parametric classification in the real...

0 Sanjoy Dasgupta, et al. ∙

∙ 03/05/2023

Active learning using region-based sampling

We present a general-purpose active learning scheme for data in metric s...

0 Sanjoy Dasgupta, et al. ∙

∙ 02/25/2023

Data-Copying in Generative Models: A Formal Framework

There has been some recent interest in detecting and addressing memoriza...

0 Robi Bhattacharjee, et al. ∙

∙ 09/20/2022

Streaming Encoding Algorithms for Scalable Hyperdimensional Computing

Hyperdimensional computing (HDC) is a paradigm for data representation a...

0 Anthony Thomas, et al. ∙

∙ 02/22/2022

Convergence of online k-means

We prove asymptotic convergence for a general class of k-means algorithm...

0 Sanjoy Dasgupta, et al. ∙

∙ 02/01/2022

Framework for Evaluating Faithfulness of Local Explanations

We study the faithfulness of an explanation system to the underlying pre...

5 Sanjoy Dasgupta, et al. ∙

∙ 07/15/2021

Algorithmic insights on continual learning from fruit flies

Continual learning in computational systems is challenging due to catast...

0 Yang Shen, et al. ∙

∙ 10/14/2020

Theoretical Foundations of Hyperdimensional Computing

Hyperdimensional (HD) computing is a set of neurally inspired methods fo...

0 Anthony Thomas, et al. ∙

∙ 06/05/2020

Expressivity of expand-and-sparsify representations

A simple sparse coding mechanism appears in the sensory systems of sever...

0 Sanjoy Dasgupta, et al. ∙

∙ 04/12/2020

A Non-Parametric Test to Detect Data-Copying in Generative Models

Detecting overfitting in generative models is an important challenge in ...

6 Casey Meehan, et al. ∙

∙ 03/09/2020

Robust Learning from Discriminative Feature Feedback

Recent work introduced the model of learning from discriminative feature...

0 Sanjoy Dasgupta, et al. ∙

∙ 02/28/2020

Explainable k-Means and k-Medians Clustering

Clustering is a popular form of unsupervised learning for geometric data...

27 Sanjoy Dasgupta, et al. ∙

∙ 06/18/2019

Interactive Topic Modeling with Anchor Words

The formalism of anchor words has enabled the development of fast topic ...

0 Sanjoy Dasgupta, et al. ∙

∙ 05/29/2019

An adaptive nearest neighbor rule for classification

We introduce a variant of the k-nearest neighbor classifier in which k i...

6 Akshay Balsubramani, et al. ∙

∙ 03/13/2019

What relations are reliably embeddable in Euclidean space?

We consider the problem of embedding a relation, represented as a direct...

0 Robi Bhattacharjee, et al. ∙

∙ 03/17/2018

Structural query-by-committee

In this work, we describe a framework that unifies many different intera...

0 Christopher Tosh, et al. ∙

∙ 02/20/2018

Comparison Based Learning from Weak Oracles

There is increasing interest in learning algorithms that involve interac...

0 Ehsan Kazemi, et al. ∙

∙ 02/27/2017

Diameter-Based Active Learning

To date, the tightest upper and lower-bounds for the active learning of ...

0 Christopher Tosh, et al. ∙

∙ 10/16/2015

A cost function for similarity-based hierarchical clustering

The development of algorithms for hierarchical clustering has been hampe...

0 Sanjoy Dasgupta, et al. ∙

∙ 01/15/2015

The Fast Convergence of Incremental PCA

We consider a situation in which we see samples in R^d drawn i.i.d. from...

0 Akshay Balsubramani, et al. ∙

∙ 06/30/2014

Rates of Convergence for Nearest Neighbor Classification

Nearest neighbor methods are a popular class of nonparametric estimators...

0 Kamalika Chaudhuri, et al. ∙

∙ 01/23/2013

Learning Polytrees

We consider the task of learning the maximum-likelihood polytree from da...

0 Sanjoy Dasgupta, et al. ∙

∙ 01/16/2013

A Two-round Variant of EM for Gaussian Mixtures

Given a set of possible models (e.g., Bayesian network structures) and a...

0 Sanjoy Dasgupta, et al. ∙

∙ 01/16/2013

Experiments with Random Projection

Recent theoretical work has identified random projection as a promising ...

0 Sanjoy Dasgupta, et al. ∙

∙ 06/27/2012

Agglomerative Bregman Clustering

This manuscript develops the theory of agglomerative clustering with Bre...

0 Matus Telgarsky, et al. ∙

∙ 06/27/2012

A concentration theorem for projections

X in R^D has mean zero and finite second moments. We show that there is ...

0 Sanjoy Dasgupta, et al. ∙

∙ 05/09/2012

Which Spatial Partition Trees are Adaptive to Intrinsic Dimension?

Recent theory work has found that a special type of spatial partition tr...

0 Nakul Verma, et al. ∙

∙ 05/09/2008

Random projection trees for vector quantization

A simple and computationally efficient scheme for tree-structured vector...

0 Sanjoy Dasgupta, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world