
Algorithmic insights on continual learning from fruit flies
Continual learning in computational systems is challenging due to catast...
read it

Theoretical Foundations of Hyperdimensional Computing
Hyperdimensional (HD) computing is a set of neurally inspired methods fo...
read it

Expressivity of expandandsparsify representations
A simple sparse coding mechanism appears in the sensory systems of sever...
read it

A NonParametric Test to Detect DataCopying in Generative Models
Detecting overfitting in generative models is an important challenge in ...
read it

Robust Learning from Discriminative Feature Feedback
Recent work introduced the model of learning from discriminative feature...
read it

Explainable kMeans and kMedians Clustering
Clustering is a popular form of unsupervised learning for geometric data...
read it

Interactive Topic Modeling with Anchor Words
The formalism of anchor words has enabled the development of fast topic ...
read it

An adaptive nearest neighbor rule for classification
We introduce a variant of the knearest neighbor classifier in which k i...
read it

What relations are reliably embeddable in Euclidean space?
We consider the problem of embedding a relation, represented as a direct...
read it

Structural querybycommittee
In this work, we describe a framework that unifies many different intera...
read it

Comparison Based Learning from Weak Oracles
There is increasing interest in learning algorithms that involve interac...
read it

DiameterBased Active Learning
To date, the tightest upper and lowerbounds for the active learning of ...
read it

A cost function for similaritybased hierarchical clustering
The development of algorithms for hierarchical clustering has been hampe...
read it

The Fast Convergence of Incremental PCA
We consider a situation in which we see samples in R^d drawn i.i.d. from...
read it

Rates of Convergence for Nearest Neighbor Classification
Nearest neighbor methods are a popular class of nonparametric estimators...
read it

Learning Polytrees
We consider the task of learning the maximumlikelihood polytree from da...
read it

A Tworound Variant of EM for Gaussian Mixtures
Given a set of possible models (e.g., Bayesian network structures) and a...
read it

Experiments with Random Projection
Recent theoretical work has identified random projection as a promising ...
read it

Agglomerative Bregman Clustering
This manuscript develops the theory of agglomerative clustering with Bre...
read it

A concentration theorem for projections
X in R^D has mean zero and finite second moments. We show that there is ...
read it

Which Spatial Partition Trees are Adaptive to Intrinsic Dimension?
Recent theory work has found that a special type of spatial partition tr...
read it

Random projection trees for vector quantization
A simple and computationally efficient scheme for treestructured vector...
read it
Sanjoy Dasgupta
is this you? claim profile
Professor of Computer Science at University of California, San Diego