Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- California Institute of TechnologyUS2.6k papers
- Massachusetts Institute of TechnologyUS2.2k papers
- Centre National de la Recherche ScientifiqueFR2.2k papers
- University of California, Santa BarbaraUS2.1k papers
- The Ohio State UniversityUS2k papers
- University of California, Los AngelesUS2k papers
- Princeton UniversityUS1.9k papers
- University of Wisconsin–MadisonUS1.9k papers
- Johns Hopkins UniversityUS1.8k papers
- University of Colorado BoulderUS1.8k papers
- University of California, RiversideUS1.7k papers
- Purdue University West LafayetteUS1.7k papers
7 papers · 2 filters
Learning Non-deterministic Representations with Energy-based Ensembles
Maruan Al-Shedivat, Emre Neftci, Gert Cauwenberghs
The goal of a generative model is to capture the distribution underlying the data, typically through latent variables. After training, these variables are often used as a new repre…
Example Selection For Dictionary Learning
Tomoki Tsuchida, Garrison W. Cottrell
In unsupervised learning, an unbiased uniform sampling strategy is typically used, in order that the learned features faithfully encode the statistical structure of the training da…
The Large Margin Mechanism for Differentially Private Maximization
Kamalika Chaudhuri, Daniel Hsu, Shuang Song
A basic problem in the design of privacy-preserving algorithms is the private maximization problem: the goal is to pick an item from a universe that (approximately) maximizes a dat…
Beyond Disagreement-based Agnostic Active Learning
Chicheng Zhang, Kamalika Chaudhuri
We study agnostic active learning, where the goal is to learn a classifier in a pre-specified hypothesis class interactively with as few label queries as possible, while making no…
Rates of Convergence for Nearest Neighbor Classification
Kamalika Chaudhuri, Sanjoy Dasgupta
Nearest neighbor methods are a popular class of nonparametric estimators with several desirable properties, such as adaptivity to different distance scales in different regions of…
Incremental Clustering: The Case for Extra Clusters
Margareta Ackerman, Sanjoy Dasgupta
The explosion in the amount of data available for analysis often necessitates a transition from batch to incremental clustering methods, which process one element at a time and typ…
Near-optimal-sample estimators for spherical Gaussian mixtures
Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky +1
Statistical and machine-learning algorithms are frequently applied to high-dimensional data. In many of these applications data is scarce, and often much more costly than computati…