Optimal Boolean Locality-Sensitive Hashing

12/04/2018
by   Tobias Christiani, et al.
0

For 0 ≤β < α < 1 the distribution H over Boolean functions h {-1, 1}^d →{-1, 1} that minimizes the expression ρ_α, β = (1/_h ∼H (x, y) α-corr.[h(x) = h(y)])/(1/_h ∼H (x, y) β-corr.[h(x) = h(y)]) assigns nonzero probability only to members of the set of dictator functions h(x) = ± x_i.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2018

Self-Predicting Boolean Functions

A Boolean function g is said to be an optimal predictor for another Bool...
research
05/17/2023

Generalized Polymorphisms

We determine all m-ary Boolean functions f_0,…,f_m and n-ary Boolean fun...
research
05/09/2022

Worst-case Analysis for Interactive Evaluation of Boolean Provenance

In recent work, we have introduced a framework for fine-grained consent ...
research
01/29/2019

Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity

This paper considers the problem of approximating a Boolean function f u...
research
07/25/2018

Robust Set Reconciliation via Locality Sensitive Hashing

We consider variations of set reconciliation problems where two parties,...
research
01/10/2018

Distribution of the absolute indicator of random Boolean functions

The absolute indicator is one of the measures used to determine the resi...
research
03/11/2019

conLSH: Context based Locality Sensitive Hashing for Mapping of noisy SMRT Reads

Single Molecule Real-Time (SMRT) sequencing is a recent advancement of N...

Please sign up or login with your details

Forgot password? Click here to reset