The Variational Deficiency Bottleneck

D. Blackwell, “Equivalent comparisons of experiments,” The Annals of Mathematical Statistics , vol. 24, no. 2, pp. 265–272, 1953

1953

Earlier work this paper cites.

L. Le Cam, “Sufficiency and approximate sufficiency,” The Annals of Mathematical Statistics , pp. 1419–1455, 1964

1964

Earlier work this paper cites.

M. Chalk, O. Marre, and G. Tkacik, “Relevant sparse codes with variational information bottleneck,” in Advances in Neural Information Processing Systems , 2016, pp. 1957–1965

1965

Earlier work this paper cites.

H. S. Witsenhausen and A. D. Wyner, “A conditional entropy bound for a pair of discrete random variables,” IEEE Transactions on Information Theory , vol. 21, no. 5, pp. 493–501, 1975

1975

Earlier work this paper cites.

E. Torgersen, Comparison of statistical experiments . Cambridge University Press, 1991, vol. 36

1991

Earlier work this paper cites.

N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” in Proceedings of the 37th Annual Allerton Conference on Communication, Control and Computing , 1999, pp. 368–377

1999

Earlier work this paper cites.

I. Csiszár and F. Matúš, “Information projections revisited,” IEEE Transactions on Information Theory , vol. 49, no. 6, pp. 1474–1490, 2003

2003

Earlier work this paper cites.

R. Gilad-Bachrach, A. Navot, and N. Tishby, “An information theoretic tradeoff between complexity and accuracy,” in Learning Theory and Kernel Machines . Springer, 2003, pp. 595–609

2003

Earlier work this paper cites.

P. Harremoës and N. Tishby, “The information bottleneck revisited or how to choose a good distortion measure,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT) . IEEE, 2007, pp. 566–570

2007

Earlier work this paper cites.

T. Gneiting and A. E. Raftery, “Strictly proper scoring rules, prediction, and estimation,” Journal of the American Statistical Association , vol. 102, no. 477, pp. 359–378, 2007

2007

Earlier work this paper cites.

O. Shamir, S. Sabato, and N. Tishby, “Learning and generalization with the information bottleneck,” in International Conference on Algorithmic Learning Theory . Springer, 2008, pp. 92–107

2008

Earlier work this paper cites.

M. Raginsky, “Shannon meets Blackwell and Le Cam: Channels, codes, and statistical experiments,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT) . IEEE, 2011, pp. 1220–1224

2011

Cited alongside, same era.

T. M. Cover and J. A. Thomas, Elements of information theory . John Wiley & Sons, 2012

2012

Cited alongside, same era.

D. P. Kingma and M. Welling, “Auto-encoding variational Bayes,” arXiv preprint arXiv:1312.6114 , 2013, ICLR 2013

Original

2013

Cited alongside, same era.

M. Harder, C. Salge, and D. Polani, “A bivariate measure of redundant information,” Physical Review E , vol. 87, p. 012130, 2013

2013

Cited alongside, same era.

D. J. Rezende, S. Mohamed, and D. Wierstra, “Stochastic backpropagation and approximate inference in deep generative models,” in Proceedings of the 31st International Conference on Machine Learning , 2014, pp. 1278–1286

A. A. Alemi, I. Fischer, J. V. Dillon, and K. Murphy, “Deep variational information bottleneck,” arXiv preprint arXiv:1612.00410 , 2016, ICLR 2017

Original

2017

Later among the works it cites.

A. Kolchinsky, B. D. Tracey, and D. H. Wolpert, “Nonlinear information bottleneck,” arXiv preprint arXiv:1705.02436 , 2017

Original

2017

Later among the works it cites.

R. Nasser, “On the input-degradedness and input-equivalence between channels,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT) . IEEE, 2017, pp. 2453–2457

2017

Later among the works it cites.

H. Hsu, S. Asoodeh, S. Salamatian, and F. P. Calmon, “Generalizing bottleneck problems,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT) . IEEE, 2018, pp. 531–535

2018

Closest in time.