Self-Predicting Boolean Functions

Nir Weinberger; Ofer Shayevitz

doi:10.1109/ISIT.2018.8437521

Self-Predicting Boolean Functions

Nir Weinberger, Ofer Shayevitz

School of Electrical Engineering

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A Boolean function g is said to be an optimal predictor for another Boolean function f, if it minimizes the probability that f(X^{n})\neq g(Y^{n}) among all functions, where X^{n} is uniform over the Hamming cube and Y^{n} is obtained from X^{n} by independently flipping each coordinate with probability \delta. This paper is about self-predicting functions, which are those that coincide with their optimal predictor.

Original language	English
Title of host publication	2018 IEEE International Symposium on Information Theory, ISIT 2018
Pages	276-280
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2018.8437521
State	Published - 15 Aug 2018
Event	2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States Duration: 17 Jun 2018 → 22 Jun 2018

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2018-June

Conference

Conference	2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/Territory	United States
City	Vail
Period	17/06/18 → 22/06/18

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2018.8437521

Cite this

@inproceedings{caaa96b1b44c4c9188f402cbb68effda,

title = "Self-Predicting Boolean Functions",

abstract = "A Boolean function g is said to be an optimal predictor for another Boolean function f, if it minimizes the probability that f(X^{n})\neq g(Y^{n}) among all functions, where X^{n} is uniform over the Hamming cube and Y^{n} is obtained from X^{n} by independently flipping each coordinate with probability \delta. This paper is about self-predicting functions, which are those that coincide with their optimal predictor.",

author = "Nir Weinberger and Ofer Shayevitz",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 2018 IEEE International Symposium on Information Theory, ISIT 2018 ; Conference date: 17-06-2018 Through 22-06-2018",

year = "2018",

month = aug,

day = "15",

doi = "10.1109/ISIT.2018.8437521",

language = "الإنجليزيّة",

isbn = "9781538647806",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "276--280",

booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",

}

Weinberger, N & Shayevitz, O 2018, Self-Predicting Boolean Functions. in 2018 IEEE International Symposium on Information Theory, ISIT 2018., 8437521, IEEE International Symposium on Information Theory - Proceedings, vol. 2018-June, pp. 276-280, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17/06/18. https://doi.org/10.1109/ISIT.2018.8437521

TY - GEN

T1 - Self-Predicting Boolean Functions

AU - Weinberger, Nir

AU - Shayevitz, Ofer

PY - 2018/8/15

Y1 - 2018/8/15

N2 - A Boolean function g is said to be an optimal predictor for another Boolean function f, if it minimizes the probability that f(X^{n})\neq g(Y^{n}) among all functions, where X^{n} is uniform over the Hamming cube and Y^{n} is obtained from X^{n} by independently flipping each coordinate with probability \delta. This paper is about self-predicting functions, which are those that coincide with their optimal predictor.

AB - A Boolean function g is said to be an optimal predictor for another Boolean function f, if it minimizes the probability that f(X^{n})\neq g(Y^{n}) among all functions, where X^{n} is uniform over the Hamming cube and Y^{n} is obtained from X^{n} by independently flipping each coordinate with probability \delta. This paper is about self-predicting functions, which are those that coincide with their optimal predictor.

UR - http://www.scopus.com/inward/record.url?scp=85052476866&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2018.8437521

DO - 10.1109/ISIT.2018.8437521

M3 - منشور من مؤتمر

SN - 9781538647806

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 276

EP - 280

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018

Y2 - 17 June 2018 through 22 June 2018

ER -

Self-Predicting Boolean Functions

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this