I. Sason, и S. Verdú. (2015)cite arxiv:1508.00335Comment: IEEE Trans. on Information Theory, vol. 62, no. 11, pp. 5973--6006, November 2016. This manuscript is identical to the journal paper, apart of some additional material which includes Sections III-C and IV-F, and three technical proofs.
D. Scobee, и S. Sastry. (2019)cite arxiv:1909.05477Comment: Published as a conference paper at the International Conference on Learning Representations (ICLR), 2020 (at https://openreview.net/forum?id=BJliakStvH ).
S. Dughmi. (2009)cite arxiv:0912.0322Comment: This revision corrects an error in definition 2.2, as well as provides additional intuition regarding the definitions of convex closure and concave closure.
J. Brehmer, G. Louppe, J. Pavez, и K. Cranmer. (2018)cite arxiv:1805.12244Comment: Code available at https://github.com/johannbrehmer/simulator-mining-example . v2: Fixed typos. v3: Expanded discussion, added Lotka-Volterra example. v4: Improved clarity.
C. Lyle, P. Castro, и M. Bellemare. (2019)cite arxiv:1901.11084Comment: To appear in the Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence.
S. Chen, E. Dobriban, и J. Lee. (2019)cite arxiv:1907.10905Comment: Changed title. Added results on overparametrized 2-layer nets. Added error bars to experiments. Numerous other minor improvements.
M. Raginsky, и I. Sason. (2012)cite arxiv:1212.4663Comment: Foundations and Trends in Communications and Information Theory, vol. 10, no 1-2, pp. 1-248, 2013. Second edition was published in October 2014. ISBN to printed book: 978-1-60198-906-2.