57 citations · 138 across the 10 of their papers we have counts for
10 papers
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors
Sebastian Bruch, Franco Maria Nardini, Amir Ingber +1
Maximum Inner Product Search or top-k retrieval on sparse vectors is well-understood in information retrieval, with a number of mature algorithms that solve it exactly. However, al…
An Analysis of Fusion Functions for Hybrid Retrieval
Sebastian Bruch, Siyu Gai, Amir Ingber
We study hybrid search in text retrieval where lexical and semantic search are fused together with the intuition that the two are complementary in how they model relevance. In part…
SDR: Efficient Neural Re-ranking using Succinct Document Representation
Nachshon Cohen, Amit Portnoy, Besnik Fetahu +1
BERT based ranking models have achieved superior performance on various information retrieval tasks. However, the large number of parameters and complex self-attention operation co…
Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
Albert No, Amir Ingber, Tsachy Weissman
We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similarly to the classical definition of a successively refinable source, we s…
Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes
Fabian Steiner, Steffen Dempfle, Amir Ingber +1
We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asym…
The Minimal Compression Rate for Similarity Identification
Amir Ingber, Tsachy Weissman
Traditionally, data compression deals with the problem of concisely representing a data source, e.g. a sequence of letters, for the purpose of eventual reproduction (either exact o…