Published in: Dagstuhl Reports, Volume 8, Issue 3 (2018)
Po-Ling Loh, Arya Mazumdar, Dimitris Papailiopoulos, and Rüdiger Urbanke. Coding Theory for Inference, Learning and Optimization (Dagstuhl Seminar 18112). In Dagstuhl Reports, Volume 8, Issue 3, pp. 60-73, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@Article{loh_et_al:DagRep.8.3.60, author = {Loh, Po-Ling and Mazumdar, Arya and Papailiopoulos, Dimitris and Urbanke, R\"{u}diger}, title = {{Coding Theory for Inference, Learning and Optimization (Dagstuhl Seminar 18112)}}, pages = {60--73}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2018}, volume = {8}, number = {3}, editor = {Loh, Po-Ling and Mazumdar, Arya and Papailiopoulos, Dimitris and Urbanke, R\"{u}diger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.3.60}, URN = {urn:nbn:de:0030-drops-92977}, doi = {10.4230/DagRep.8.3.60}, annote = {Keywords: Coding theory, Distributed optimization, Machine learning, Threshold phenomena} }
Published in: LIPIcs, Volume 33, 30th Conference on Computational Complexity (CCC 2015)
Venkatesan Guruswami and Ameya Velingker. An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets. In 30th Conference on Computational Complexity (CCC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 33, pp. 42-57, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{guruswami_et_al:LIPIcs.CCC.2015.42, author = {Guruswami, Venkatesan and Velingker, Ameya}, title = {{An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets}}, booktitle = {30th Conference on Computational Complexity (CCC 2015)}, pages = {42--57}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-81-1}, ISSN = {1868-8969}, year = {2015}, volume = {33}, editor = {Zuckerman, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.42}, URN = {urn:nbn:de:0030-drops-50755}, doi = {10.4230/LIPIcs.CCC.2015.42}, annote = {Keywords: Polar codes, polynomial gap to capacity, entropy sumset inequality, arbitrary alphabets} }
Feedback for Dagstuhl Publishing