@inproceedings{17893,
  abstract     = {Strong data processing inequalities (SDPI) are an important object of study in Information Theory and have been well studied for f -divergences. Universal upper and lower bounds have been provided along with several applications, connecting them to impossibility (converse) results, concentration of measure, hypercontractivity, and so on. In this paper, we study Renyi divergence and the corresponding SDPI constant whose behavior seems to deviate from that of ordinary <1>-divergences. In particular, one can find examples showing that the universal upper bound relating its SDPI constant to the one of Total Variation does not hold in general. In this work, we prove, however, that the universal lower bound involving the SDPI constant of the Chi-square divergence does indeed hold. Furthermore, we also provide a characterization of the distribution that achieves the supremum when is equal to 2 and consequently compute the SDPI constant for Renyi divergence of the general binary channel.},
  author       = {Jin, Lifu and Esposito, Amedeo Roberto and Gastpar, Michael},
  booktitle    = {Proceedings of the 2024 IEEE International Symposium on Information Theory},
  isbn         = {9798350382846},
  issn         = {2157-8095},
  location     = {Athens, Greece},
  pages        = {3178--3183},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Properties of the strong data processing constant for Rényi divergence}},
  doi          = {10.1109/ISIT57864.2024.10619367},
  year         = {2024},
}

@inproceedings{17894,
  abstract     = {Sibson's α -mutual information has received renewed attention recently in several contexts: concentration of measure under dependence, statistical learning, hypothesis testing, and estimation theory. In this work, we introduce several variational representations of Sibson's α -mutual information: 1) as a supremum over joint distributions of (a combination of) KL divergences; and 2) as a supremum over functions of opportune expected values. Leveraging them, we produce a variety of novel and known results, including a generalization of transportation-cost inequalities and Fano's inequality.},
  author       = {Esposito, Amedeo Roberto and Gastpar, Michael and Issa, Ibrahim},
  booktitle    = {Proceedings of the 2024 IEEE International Symposium on Information Theory },
  isbn         = {9798350382846},
  issn         = {2157-8095},
  location     = {Athens, Greece},
  pages        = {2110--2115},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Variational characterizations of Sibson's α-mutual information}},
  doi          = {10.1109/ISIT57864.2024.10619378},
  year         = {2024},
}

@inproceedings{17895,
  abstract     = {We propose a concatenated code construction for a class of discrete-alphabet oblivious arbitrarily varying channels (AVCs) with cost constraints. The code has time and space complexity polynomial in the blocklength n . It uses a Reed-Solomon outer code, logarithmic blocklength random inner codes, and stochastic encoding by permuting the codeword before transmission. When the channel satisfies a condition called strong DS-nonsymmetrizability (a modified version of nonsymmetrizability originally due to Dobrushin and Stambler), we show that the code achieves a rate that for a variety of oblivious AVCs (such as classically studied error/erasure channels) match the known capacities.},
  author       = {Dey, B. K. and Jaggi, S. and Langberg, M. and Sarwate, A. D. and Zhang, Yihan},
  booktitle    = {Proceedings of the 2024 IEEE International Symposium on Information Theory },
  isbn         = {9798350382846},
  issn         = {2157-8095},
  location     = {Athens, Greece},
  pages        = {1586--1591},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs}},
  doi          = {10.1109/ISIT57864.2024.10619362},
  year         = {2024},
}