# You can also click the upper-left icon to select videos from the playlist.
source: Institut Henri Poincaré 2016年2月25日
Randall Dougherty (Center for Communications Research) 52:31
Entropy inequalities and linear rank inequalities
Randall Dougherty (Center for Communications Research)
February 16, 2016
Abstract: Entropy inequalities (Shannon and non-Shannon) have been used to obtain bounds on the solutions to a number of problems. When the problems are restricted to the linear case, these bounds can sometimes be improved using linear rank inequalities such as the Ingleton inequality, which hold for entropy vectors coming from linear variables (also known as representable polymatroids) but not necessarily for all entropy vectors. This talk will describe methods for producing linear rank inequalities, or finding counterexamples to putative linear rank inequalities, comparing them to the methods for proving non-Shannon entropy inequalities, and show the differences between known results for the entropy region and for its linear analogue (actually analogues, since one has to divide into cases based on the characteristic of the underlying field).
László Csirmaz (Central European University, Budapest) 1/3 44:10
László Csirmaz (Central European University, Budapest) 3/3 38:01
László Csirmaz (Central European University, Budapest) 2/3 45:56
Arkadev Chattopadhyay (Tata Institute of Fundamental Research) 50:09
Thathatchar.S. Jayram (IBM Almaden) 51:42
Young Han Kim (UCSD) 53:23
Suresh Venkatasubramanian (University of Utah) 1/3 50:27
Suresh Venkatasubramanian (University of Utah) 2/3 43:40
Suresh Venkatasubramanian (University of Utah) 3/3 50:11
John Walsh (Drexel University) 48:46
Salim El Rouayheb (Illinois Institute of Technology) 48:43
Qin Zhang (Indiana University Bloomington) 48:45
Qi Chen (The Chinese University of Hong Kong) 52:00
František Matúš (Institute of Information Theory and Automation) 2/3 51:47
P. Vijay Kumar (Indian Institute of Science, University of Southern California) 42:52
František Matúš (Institute of Information Theory and Automation) 3/3 38:33
František Matúš (Institute of Information Theory and Automation) 1/3 50:39
19 02 16 Fan Cheng (National University of Singapore) 52:44
Raymond Yeung (The Chinese University of Hong Kong) 3/3 31:34
Raymond Yeung (The Chinese University of Hong Kong) 2/3 51:01
Raymond Yeung (The Chinese University of Hong Kong) 1/3 44:59
John Walsh (Drexel University) 49:16
Paul Beame (University of Washington) - 1 57:40
Yuchong Hu (Huazhong University of Science and Technology) 45:26
Paul Beame (University of Washington) - 3 47:03
Paul Beame (University of Washington) - 1 47:25
David Woodruff (IBM Almaden) 52:25
Benjamin Sach (University of Bristol) 47:37
Udi Wieder (VMware Research) 49:06
Terence Chan (University of South Australia) - 3 47:29
Terence Chan (University of South Australia) - 2 47:20
Terence Chan (University of South Australia) - 1 48:34
Mokshay Madiman (University of Delaware) 47:49
Frédérique Oggier (Nanyang Technological University) 44:25
Tarik Kaced (Université de Paris-Est, LACL, UPEC) 44:05
Salman Avestimehr (USC) 49:57
Raphael Clifford (University of Bristol) - 3 39:59
Raphael Clifford (University of Bristol) - 2 50:53
Raphael Clifford (University of Bristol) - 1 40:38
Chao Tian (The University of Tennessee Knoxville) 36:27
Yitong Yin (Nanjing University) 51:36
Søren Riis (Queen Mary University of London) -2B 35:43
Søren Riis (Queen Mary University of London) 40:28
Søren Riis (Queen Mary University of London) 42:28
Babak Hassibi (Caltech) 55:06
Kasper Green Larsen (Aarhus University) - 3 38:59
Nigel Boston (University of Wisconsin) 46:18
Kasper Green Larsen (Aarhus University) - 2 35:33
Kasper Green Larsen (Aarhus University) - 1 40:56
Kenneth Shum (The Chinese University of Hong Kong) 46:01
No comments:
Post a Comment