41 citations · 104 across the 15 of their papers we have counts for
7 papers · 1 filter
Similarity search in the blink of an eye with compressed indices
Cecilia Aguerrebere, Ishwar Bhati, Mark Hildebrand +2
Nowadays, data is represented by vectors. Retrieving those vectors, among millions and billions, that are similar to a given query is a ubiquitous problem, known as similarity sear…
Toward a Geometrical Understanding of Self-supervised Contrastive Learning
Romain Cosentino, Anirvan Sengupta, Salman Avestimehr +4
Self-supervised learning (SSL) is currently one of the premier techniques to create data representations that are actionable for transfer learning in the absence of human annotatio…
Procrustean Orthogonal Sparse Hashing
Mariano Tepper, Dipanjan Sengupta, Ted Willke
Hashing is one of the most popular methods for similarity search because of its speed and efficiency. Dense binary hashing is prevalent in the literature. Recently, insect olfactio…
Do place cells dream of conditional probabilities? Learning Neural Nyström representations
Mariano Tepper
We posit that hippocampal place cells encode information about future locations under a transition distribution observed as an agent explores a given (physical or conceptual) space…
Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling
Mariano Tepper, Anirvan M. Sengupta, Dmitri Chklovskii
In solving hard computational problems, semidefinite program (SDP) relaxations often play an important role because they come with a guarantee of optimality. Here, we focus on a po…
Compressed Nonnegative Matrix Factorization is Fast and Accurate
Mariano Tepper, Guillermo Sapiro
Nonnegative matrix factorization (NMF) has an established reputation as a useful data analysis technique in numerous applications. However, its usage in practical situations is und…