|| Independence Properties of Generalized Submodular Information Measures
||Himanshu Asnani, Tata Institute of Fundamental Research (TIFR), India; Jeff Bilmes, University of Washington, Seattle, United States; Rishabh Iyer, University of Texas, Dallas, United States|
||D3-S1-T1: Combinatorics & Information Theory
||Wednesday, 14 July, 22:00 - 22:20
||Wednesday, 14 July, 22:20 - 22:40
Recently a class of generalized information measures was defined on sets of items parametrized by submodular functions. In this paper, we propose and study various notions of independence between sets with respect to such information measures, and connections thereof. Since entropy can also be used to parametrize such measures, we derive interesting independence properties for the entropy of sets of random variables. We also study the notion of multi-set independence and its properties. Finally, we present optimization algorithms for obtaining a set that is independent of another given set, and also discuss the implications and applications of combinatorial independence.