EE Seminar: Arimoto-Renyi Conditional Entropy and Bayesian Hypothesis Testing
(The talk will be given in English)
Speaker: Prof. Igal Sason
Faculty of Electrical Engineering, Technion, Haifa
Monday, November 6th, 2017
15:00 - 16:00
Room 011, Kitot Bldg., Faculty of Engineering
Arimoto-Renyi Conditional Entropy and Bayesian Hypothesis Testing
This is a joint work with Prof. Sergio Verdu, Princeton University.
Abstract
This talk presents upper and lower bounds on the minimum error probability of Bayesian M-ary hypothesis testing in terms of the Arimoto-R\'enyi conditional entropy of an arbitrary order. The improved tightness of these bounds
over their specialized versions with the Shannon conditional entropy is demonstrated. In particular, in the case where M is finite, we show how to generalize Fano's inequality under both the conventional and list-decision
settings. In the setup of discrete memoryless channels, we analyze the exponentially vanishing decay of the Arimoto-Renyi conditional entropy of the transmitted codeword given the channel output when averaged over a random-coding ensemble.
BIO
Igal Sason received all his degrees in electrical engineering from the Technion--Israel Institute of Technology, Haifa, Israel. He worked for 5 years as a communication engineer in the IDF. After completing his PhD in 2001, he was a scientific collaborator at the School of Computer and Communication Sciences at EPFL, Lausanne, Switzerland. He has been a faculty member in the department of electrical engineering at the Technion for the last 14 years.
