Robust Set Reconciliation Via Locality Sensitive Hashing

Abstract

We consider variations of set reconciliation problems where two parties, Alice and Bob, each hold a set of points in a metric space, and the goal is for Bob to conclude with a set of points that is close to Alice's set of points in a well-defined way. This setting has been referred to as robust set reconciliation. More specifically, in one variation we examine the goal is for Bob to end with a set of points that is close to Alice's in earth mover's distance, and in another the goal is for Bob to have a point that is close to each of Alice's. The first problem has been studied before; our results scale better with the dimension of the space. The second problem appears new. Our primary novelty is utilizing Invertible Bloom Lookup Tables in combination with locality sensitive hashing. This combination allows us to cope with the geometric setting in a communication-efficient manner.

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keymitzenmacher2018robust

Related papers

• Locality Sensitive Hashing For Set-queries, Motivated By Group Recommendations (2020)0.00
• On The Adversarial Robustness Of Locality-sensitive Hashing In Hamming Space (2024)2.26
• SLOSH: Set Locality Sensitive Hashing Via Sliced-wasserstein Embeddings (2021)5.24
• Optimal Las Vegas Locality Sensitive Data Structures (2017)6.77
• Subsets And Supermajorities: Optimal Hashing-based Set Similarity Search (2019)5.84
• Fast Locality-sensitive Hashing Frameworks For Approximate Near Neighbor Search (2017)7.81
• Set Similarity Search Beyond Minhash (2016)10.74
• Set-to-set Hashing With Applications In Visual Recognition (2017)0.00