research
∙
07/03/2023
Online nearest neighbor classification
We study an instance of online non-parametric classification in the real...
share
research
∙
03/05/2023
Active learning using region-based sampling
We present a general-purpose active learning scheme for data in metric s...
research
∙
02/25/2023
Data-Copying in Generative Models: A Formal Framework
There has been some recent interest in detecting and addressing memoriza...
research
∙
09/20/2022
Streaming Encoding Algorithms for Scalable Hyperdimensional Computing
Hyperdimensional computing (HDC) is a paradigm for data representation a...
research
∙
02/22/2022
Convergence of online k-means
We prove asymptotic convergence for a general class of k-means algorithm...
research
∙
02/01/2022
Framework for Evaluating Faithfulness of Local Explanations
We study the faithfulness of an explanation system to the underlying pre...
research
∙
07/15/2021
Algorithmic insights on continual learning from fruit flies
Continual learning in computational systems is challenging due to catast...
research
∙
10/14/2020
Theoretical Foundations of Hyperdimensional Computing
Hyperdimensional (HD) computing is a set of neurally inspired methods fo...
research
∙
06/05/2020
Expressivity of expand-and-sparsify representations
A simple sparse coding mechanism appears in the sensory systems of sever...
research
∙
04/12/2020
A Non-Parametric Test to Detect Data-Copying in Generative Models
Detecting overfitting in generative models is an important challenge in ...
research
∙
03/09/2020
Robust Learning from Discriminative Feature Feedback
Recent work introduced the model of learning from discriminative feature...
research
∙
02/28/2020
Explainable k-Means and k-Medians Clustering
Clustering is a popular form of unsupervised learning for geometric data...
research
∙
06/18/2019
Interactive Topic Modeling with Anchor Words
The formalism of anchor words has enabled the development of fast topic ...
research
∙
05/29/2019
An adaptive nearest neighbor rule for classification
We introduce a variant of the k-nearest neighbor classifier in which k i...
research
∙
03/13/2019
What relations are reliably embeddable in Euclidean space?
We consider the problem of embedding a relation, represented as a direct...
research
∙
03/17/2018
Structural query-by-committee
In this work, we describe a framework that unifies many different intera...
research
∙
02/20/2018
Comparison Based Learning from Weak Oracles
There is increasing interest in learning algorithms that involve interac...
research
∙
02/27/2017
Diameter-Based Active Learning
To date, the tightest upper and lower-bounds for the active learning of ...
research
∙
10/16/2015
A cost function for similarity-based hierarchical clustering
The development of algorithms for hierarchical clustering has been hampe...
research
∙
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...
research
∙
06/30/2014
Rates of Convergence for Nearest Neighbor Classification
Nearest neighbor methods are a popular class of nonparametric estimators...
research
∙
01/23/2013
Learning Polytrees
We consider the task of learning the maximum-likelihood polytree from da...
research
∙
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...
research
∙
01/16/2013
Experiments with Random Projection
Recent theoretical work has identified random projection as a promising ...
research
∙
06/27/2012
Agglomerative Bregman Clustering
This manuscript develops the theory of agglomerative clustering with Bre...
research
∙
06/27/2012
A concentration theorem for projections
X in R^D has mean zero and finite second moments. We show that there is ...
research
∙
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...
research
∙
05/09/2008
