Error Bounds on a Mixed Entropy Inequality

James Melbourne; Saurav Talukdar; Shreyas Bhaban; Murti V. Salapaka

doi:10.1109/ISIT.2018.8437601

Error Bounds on a Mixed Entropy Inequality

James Melbourne, Saurav Talukdar, Shreyas Bhaban, Murti V. Salapaka

Electrical and Computer Engineering

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

3 Scopus citations

Abstract

Motivated by the entropy computations relevant to the evaluation of decrease in entropy in bit reset operations, the authors investigate the deficit in an entropic inequality involving two independent random variables, one continuous and the other discrete. In the case where the continuous random variable is Gaussian, we derive strong quantitative bounds on the deficit in the inequality. More explicitly it is shown that the decay of the deficit is sub-Gaussian with respect to the reciprocal of the standard deviation of the Gaussian variable. What is more, up to rational terms these results are shown to be sharp.

Original language	English (US)
Title of host publication	2018 IEEE International Symposium on Information Theory, ISIT 2018
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1973-1977
Number of pages	5
ISBN (Print)	9781538647806
DOIs	https://doi.org/10.1109/ISIT.2018.8437601
State	Published - Aug 15 2018
Event	2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States Duration: Jun 17 2018 → Jun 22 2018

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2018-June
ISSN (Print)	2157-8095

Other

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

Bibliographical note

Funding Information:
We would like to thank Prof. Mokshay Madiman, University of Delaware and Prof. Arnab Sen, University of Minnesota for initial discussion about the problem. The authors acknowledge the support of the National Science Foundation for funding the research under Grant No. CMMI-1462862, CNS 1544721 and the first author acknowledges support from NSF Grant No. 1248100

Funding Information:
We would like to thank Prof. Mokshay Madiman, University of Delaware and Prof. Arnab Sen, University of Minnesota for initial discussion about the problem. The authors acknowledge the support of the National Science Foundation for funding the research under Grant No. CMMI-1462862, CNS 1544721 and the first author acknowledges support from NSF Grant No. 1248100. Portions of this article and related results were announced at the March Meeting of the American Physical Society [11], [18].

Publisher Copyright:
© 2018 IEEE.

Access

10.1109/ISIT.2018.8437601

Fingerprint Dive into the research topics of 'Error Bounds on a Mixed Entropy Inequality'. Together they form a unique fingerprint.

Cite this

Melbourne, J., Talukdar, S., Bhaban, S., & Salapaka, M. V. (2018). Error Bounds on a Mixed Entropy Inequality. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (pp. 1973-1977). [8437601] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437601

Error Bounds on a Mixed Entropy Inequality. / Melbourne, James; Talukdar, Saurav; Bhaban, Shreyas; Salapaka, Murti V.

2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 1973-1977 8437601 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June).

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

Melbourne, J, Talukdar, S, Bhaban, S & Salapaka, MV 2018, Error Bounds on a Mixed Entropy Inequality. in 2018 IEEE International Symposium on Information Theory, ISIT 2018., 8437601, IEEE International Symposium on Information Theory - Proceedings, vol. 2018-June, Institute of Electrical and Electronics Engineers Inc., pp. 1973-1977, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 6/17/18. https://doi.org/10.1109/ISIT.2018.8437601

@inproceedings{fa8953653798406a8640ff1e1e163406,

title = "Error Bounds on a Mixed Entropy Inequality",

abstract = "Motivated by the entropy computations relevant to the evaluation of decrease in entropy in bit reset operations, the authors investigate the deficit in an entropic inequality involving two independent random variables, one continuous and the other discrete. In the case where the continuous random variable is Gaussian, we derive strong quantitative bounds on the deficit in the inequality. More explicitly it is shown that the decay of the deficit is sub-Gaussian with respect to the reciprocal of the standard deviation of the Gaussian variable. What is more, up to rational terms these results are shown to be sharp.",

author = "James Melbourne and Saurav Talukdar and Shreyas Bhaban and Salapaka, {Murti V.}",

note = "Funding Information: We would like to thank Prof. Mokshay Madiman, University of Delaware and Prof. Arnab Sen, University of Minnesota for initial discussion about the problem. The authors acknowledge the support of the National Science Foundation for funding the research under Grant No. CMMI-1462862, CNS 1544721 and the first author acknowledges support from NSF Grant No. 1248100 Funding Information: We would like to thank Prof. Mokshay Madiman, University of Delaware and Prof. Arnab Sen, University of Minnesota for initial discussion about the problem. The authors acknowledge the support of the National Science Foundation for funding the research under Grant No. CMMI-1462862, CNS 1544721 and the first author acknowledges support from NSF Grant No. 1248100. Portions of this article and related results were announced at the March Meeting of the American Physical Society [11], [18]. 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.8437601",

language = "English (US)",

isbn = "9781538647806",

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

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1973--1977",

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

}

TY - GEN

T1 - Error Bounds on a Mixed Entropy Inequality

AU - Melbourne, James

AU - Talukdar, Saurav

AU - Bhaban, Shreyas

AU - Salapaka, Murti V.

N1 - Funding Information: We would like to thank Prof. Mokshay Madiman, University of Delaware and Prof. Arnab Sen, University of Minnesota for initial discussion about the problem. The authors acknowledge the support of the National Science Foundation for funding the research under Grant No. CMMI-1462862, CNS 1544721 and the first author acknowledges support from NSF Grant No. 1248100 Funding Information: We would like to thank Prof. Mokshay Madiman, University of Delaware and Prof. Arnab Sen, University of Minnesota for initial discussion about the problem. The authors acknowledge the support of the National Science Foundation for funding the research under Grant No. CMMI-1462862, CNS 1544721 and the first author acknowledges support from NSF Grant No. 1248100. Portions of this article and related results were announced at the March Meeting of the American Physical Society [11], [18]. Publisher Copyright: © 2018 IEEE.

PY - 2018/8/15

Y1 - 2018/8/15

N2 - Motivated by the entropy computations relevant to the evaluation of decrease in entropy in bit reset operations, the authors investigate the deficit in an entropic inequality involving two independent random variables, one continuous and the other discrete. In the case where the continuous random variable is Gaussian, we derive strong quantitative bounds on the deficit in the inequality. More explicitly it is shown that the decay of the deficit is sub-Gaussian with respect to the reciprocal of the standard deviation of the Gaussian variable. What is more, up to rational terms these results are shown to be sharp.

AB - Motivated by the entropy computations relevant to the evaluation of decrease in entropy in bit reset operations, the authors investigate the deficit in an entropic inequality involving two independent random variables, one continuous and the other discrete. In the case where the continuous random variable is Gaussian, we derive strong quantitative bounds on the deficit in the inequality. More explicitly it is shown that the decay of the deficit is sub-Gaussian with respect to the reciprocal of the standard deviation of the Gaussian variable. What is more, up to rational terms these results are shown to be sharp.

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

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

U2 - 10.1109/ISIT.2018.8437601

DO - 10.1109/ISIT.2018.8437601

M3 - Conference contribution

AN - SCOPUS:85052444667

SN - 9781538647806

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1973

EP - 1977

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

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 17 June 2018 through 22 June 2018

ER -

Error Bounds on a Mixed Entropy Inequality

Abstract

Publication series

Other

Bibliographical note

Access

Other files and links

Cite this