Picture for Mariano Tepper

Mariano Tepper

Toward Optimal Search and Retrieval for RAG

Add code
Nov 11, 2024
Viaarxiv icon

Locally-Adaptive Quantization for Streaming Vector Search

Add code
Feb 03, 2024
Viaarxiv icon

LeanVec: Search your vectors faster by making them fit

Add code
Dec 26, 2023
Viaarxiv icon

CoLiDE: Concomitant Linear DAG Estimation

Add code
Oct 04, 2023
Viaarxiv icon

Similarity search in the blink of an eye with compressed indices

Add code
Apr 07, 2023
Viaarxiv icon

Toward a Geometrical Understanding of Self-supervised Contrastive Learning

Add code
May 13, 2022
Figure 1 for Toward a Geometrical Understanding of Self-supervised Contrastive Learning
Figure 2 for Toward a Geometrical Understanding of Self-supervised Contrastive Learning
Figure 3 for Toward a Geometrical Understanding of Self-supervised Contrastive Learning
Figure 4 for Toward a Geometrical Understanding of Self-supervised Contrastive Learning
Viaarxiv icon

Procrustean Orthogonal Sparse Hashing

Add code
Jun 08, 2020
Figure 1 for Procrustean Orthogonal Sparse Hashing
Figure 2 for Procrustean Orthogonal Sparse Hashing
Figure 3 for Procrustean Orthogonal Sparse Hashing
Figure 4 for Procrustean Orthogonal Sparse Hashing
Viaarxiv icon

Do place cells dream of conditional probabilities? Learning Neural Nyström representations

Add code
Jun 05, 2019
Figure 1 for Do place cells dream of conditional probabilities? Learning Neural Nyström representations
Figure 2 for Do place cells dream of conditional probabilities? Learning Neural Nyström representations
Figure 3 for Do place cells dream of conditional probabilities? Learning Neural Nyström representations
Figure 4 for Do place cells dream of conditional probabilities? Learning Neural Nyström representations
Viaarxiv icon

Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling

Add code
Sep 05, 2018
Figure 1 for Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling
Figure 2 for Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling
Figure 3 for Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling
Figure 4 for Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling
Viaarxiv icon

Nonnegative Matrix Underapproximation for Robust Multiple Model Fitting

Add code
Apr 10, 2017
Figure 1 for Nonnegative Matrix Underapproximation for Robust Multiple Model Fitting
Figure 2 for Nonnegative Matrix Underapproximation for Robust Multiple Model Fitting
Figure 3 for Nonnegative Matrix Underapproximation for Robust Multiple Model Fitting
Figure 4 for Nonnegative Matrix Underapproximation for Robust Multiple Model Fitting
Viaarxiv icon