An improved upper bound for the most informative boolean function conjecture.
Or OrdentlichOfer ShayevitzOmri WeinsteinPublished in: ISIT (2016)
Keyphrases
- boolean functions
- upper bound
- lower bound
- linear functions
- uniform distribution
- relevant variables
- worst case
- upper and lower bounds
- branch and bound
- pseudo boolean functions
- binary decision diagrams
- membership queries
- lower and upper bounds
- branch and bound algorithm
- sample size
- sample complexity
- multi valued
- functional properties
- generalization error
- stack filters
- image enhancement
- bi decomposition
- read once formulas
- bayesian networks