Parallel optimization on the Entropic Cone

Legat, Benoît;Jungers, Raphaël
(2016) 37th WIC Symposium on Information Theory in the Benelux — Location: Université catholique de Louvain, Louvain-la-Neuve, Belgium (19.May.2016)

Files

2016_SITB.pdf
  • Open Access
  • Adobe PDF
  • 361.42 KB
Download

Details

Authors
Abstract
We introduce a parallelizable algorithm for approximate optimization on the entropic cone. We also present the toolbox EntropicCone.jl. Its aim is to improve the computational repoducibility of the recent progress on the approximation of the entropic cone and to make them easily accessible for its many applications. These applications include the capacity region of multi-source network coding, converse theorems for multi-terminal problems of information theory, bounds on the information ratios in secret sharing schemes and conditional independence among subvectors of a random vector.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Legat, B., & Jungers, R. (2016). Parallel optimization on the Entropic Cone. 37th WIC Symposium on Information Theory in the Benelux, Université catholique de Louvain, Louvain-la-Neuve, Belgium. https://hdl.handle.net/2078.5/252112