More Like this

1. Optimal Information Updating based on Value of Information

   https://doi.org/10.1109/ALLERTON.2019.8919810  

   Singh, Rahul; Kamath, Gopal Krishna; Kumar, P. R. (September 2019, Proceedings of the 57th Annual Allerton Conference on Communication, Control, and Computing)
2. How are information deserts created? A theory of local information landscapes: How Are Information Deserts Created? A Theory of Local Information Landscapes

   https://doi.org/10.1002/asi.24114  

   Lee, Myeong; Butler, Brian S. (February 2019, Journal of the Association for Information Science and Technology)
3. An Operational Characterization of Mutual Information in Algorithmic Information Theory

   https://doi.org/10.1145/3356867  

   Romashchenko, Andrei; Zimand, Marius (September 2019, Journal of the ACM)
4. Computational Techniques for Investigating Information Theoretic Limits of Information Systems

   https://doi.org/10.3390/info12020082  

   Tian, Chao; Plank, James S.; Hurst, Brent; Zhou, Ruida (February 2021, Information)

   null (Ed.)

   Computer-aided methods, based on the entropic linear program framework, have been shown to be effective in assisting the study of information theoretic fundamental limits of information systems. One key element that significantly impacts their computation efficiency and applicability is the reduction of variables, based on problem-specific symmetry and dependence relations. In this work, we propose using the disjoint-set data structure to algorithmically identify the reduction mapping, instead of relying on exhaustive enumeration in the equivalence classification. Based on this reduced linear program, we consider four techniques to investigate the fundamental limits of information systems: (1) computing an outer bound for a given linear combination of information measures and providing the values of information measures at the optimal solution; (2) efficiently computing a polytope tradeoff outer bound between two information quantities; (3) producing a proof (as a weighted sum of known information inequalities) for a computed outer bound; and (4) providing the range for information quantities between which the optimal value does not change, i.e., sensitivity analysis. A toolbox, with an efficient JSON format input frontend, and either Gurobi or Cplex as the linear program solving engine, is implemented and open-sourced. 

   more » « less
5. Dynamics of quantum information

   https://doi.org/10.1038/s42254-019-0090-y  

   Lewis-Swan, R. J.; Safavi-Naini, A.; Kaufman, A. M.; Rey, A. M. (October 2019, Nature Reviews Physics)