Fetching the paper…
Reading the bibliography…
Given a pair of random variables $(X,Y)\sim P_{XY}$ and two convex functions $f_1$ and $f_2$, we introduce two bottleneck functionals as the lower and upper boundaries of the two-dimensional convex set that consists of the pairs $\left(I_{f_1}(W; X), I_{f_2}(W; Y)\right)$, where $I_f$ denotes $f$-information and $W$ varies over the set of all discrete random variables satisfying the Markov condition $W \to X \to Y$.
H. G. Eggleston, Convexity . Wiley Online Library, 1966
1966
Earlier work this paper cites.
H. Witsenhausen and A. Wyner, “A conditional entropy bound for a pair of discrete random variables,” vol. 21, no. 5, pp. 493–501, 1975
1975
Earlier work this paper cites.
N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” in Proc. of IEEE Allerton , 2000
2000
Earlier work this paper cites.
N. Slonim and N. Tishby, “Document clustering using word clusters via the information bottleneck method,” in Proc. of ACM SIGIR , 2000
2000
Earlier work this paper cites.
N. Tishby and N. Slonim, “Data clustering by markovian relaxation and the information bottleneck method,” in Proc. of NIPS , 2001
2001
Earlier work this paper cites.
P. Harremoës and N. Tishby, “The information bottleneck revisited or how to choose a good distortion measure,” in Proc. of IEEE ISIT , 2007
2007
Earlier work this paper cites.
A. El Gamal and Y.-H. Kim, Network information theory . Cambridge university press, 2011
2011
Cited alongside, same era.
C. Nair, “Upper concave envelopes and auxiliary random variables,” Int. J. Adv. Eng. Sci. Appl. Math. , vol. 5, no. 1, pp. 12–20, 2013
2013
Cited alongside, same era.
——, “Lecture notes on information theory,” Lecture Notes for ECE563 (UIUC) , vol. 6, pp. 2012–2016, 2014
2014
Cited alongside, same era.
N. Tishby and N. Zaslavsky, “Deep learning and the information bottleneck principle,” in Proc. of IEEE ITW , 2015
2015
Cited alongside, same era.
F. P. Calmon, A. Makhdoumi, and M. Médard, “Fundamental limits of perfect privacy,” in Proc. of IEEE ISIT , 2015
2015
Cited alongside, same era.
A. Makur and L. Zheng, “Bounds between contraction coefficients,” in Proc. of IEEE Allerton , 2015
2015
Later among the works it cites.
Y. Polyanskiy and Y. Wu, “Dissipation of information in channels with input constraints,” vol. 62, no. 1, pp. 35–55, Jan 2016
2016
Later among the works it cites.
2017
Later among the works it cites.
F. P. Calmon, A. Makhdoumi, M. Médard, M. Varia, M. Christiansen, and K. R. Duffy, “Principal inertia components and applications,” vol. 63, no. 9, pp. 5011–5038, 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
F. P. Calmon, Y. Polyanskiy, and Y. Wu, “Strong data processing inequalities in power-constrained gaussian channels,” in Proc. of IEEE ISIT , 2015
2015
Cited alongside, same era.
H. Hsu, S. Asoodeh, S. Salamatian, and F. P. Calmon, “Generalizing bottleneck problems - extended version.” [Online]. Available: https://github.com/HsiangHsu/ISIT-18-Extended-Version
Cited in the paper.
2017
Later among the works it cites.