{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:29:51Z","timestamp":1780054191286,"version":"3.54.0"},"reference-count":107,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1134\/s0032946020020015","type":"journal-article","created":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T04:02:53Z","timestamp":1594699373000},"page":"103-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Comparison of Contraction Coefficients for f-Divergences"],"prefix":"10.1134","volume":"56","author":[{"given":"A.","family":"Makur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"137","published-online":{"date-parts":[[2020,7,14]]},"reference":[{"key":"4374_CR1","doi-asserted-by":"crossref","unstructured":"Makur, A. and Zheng, L., Bounds between Contraction Coefficients, in Proc. 53rd Annu. Allerton Conf. on Communication, Control, and Computing, Monticello, IL, Sept. 29-Oct. 2, 2015, pp. 1422\u20131429.","DOI":"10.1109\/ALLERTON.2015.7447175"},{"issue":"3","key":"4374_CR2","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1109\/18.669153","volume":"44","author":"E Erkip","year":"1998","unstructured":"Erkip, E. and Cover, T.M., The Efficiency of Investment Information, IEEE Trans. Inform. Theory, 1998, vol. 44, no. 3, pp. 1026\u20131040.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR3","doi-asserted-by":"crossref","unstructured":"Kamath, S. and Anantharam, V., Non-interactive Simulation of Joint Distributions: The Hirschfeld-Gebelein-Renyi Maximal Correlation and the Hypercontractivity Ribbon, in Proc. 50th Annu. Allerton Conf. on Communication, Control, and Computing, Monticello, IL, Oct. 1\u20135, 2012, pp. 1057\u20131064.","DOI":"10.1109\/Allerton.2012.6483335"},{"key":"4374_CR4","doi-asserted-by":"crossref","unstructured":"Anantharam, V., Gohari, A., Kamath, S., and Nair, C., On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality Studied by Erkip and Cover, arXiv:1304.6133 [cs.IT], 2013.","DOI":"10.1109\/ISIT.2014.6875389"},{"key":"4374_CR5","doi-asserted-by":"crossref","unstructured":"Anantharam, V., Gohari, A., Kamath, S., and Nair, C., On Hypercontractivity and the Mutual Information between Boolean Functions, in Proc. 51st Annu. Allerton Conf. on Communication, Control, and Computing, Monticello, IL, Oct. 2\u20134, 2013, pp. 13\u201319.","DOI":"10.1109\/Allerton.2013.6736499"},{"issue":"1","key":"4374_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.2015.2482978","volume":"62","author":"Y Polyanskiy","year":"2016","unstructured":"Polyanskiy, Y. and Wu, Y., Dissipation of Information in Channels with Input Constraints, IEEE Trans. Inform. Theory, 2016, vol. 62, no. 1, pp. 35\u201355.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/978-1-4939-7005-6_7","volume-title":"Convexity and Concentration","author":"Y Polyanskiy","year":"2017","unstructured":"Polyanskiy, Y. and Wu, Y., Strong Data-Processing Inequalities for Channels and Bayesian Networks, Convexity and Concentration, Carlen, E., Madiman, M., and Werner, E.M., Eds., New York: Springer, 2017, pp. 211\u2013249."},{"issue":"6","key":"4374_CR8","doi-asserted-by":"crossref","first-page":"3355","DOI":"10.1109\/TIT.2016.2549542","volume":"62","author":"M Raginsky","year":"2016","unstructured":"Raginsky, M., Strong Data Processing Inequalities and \u03a6-Sobolev Inequalities for Discrete Channels, IEEE Trans. Inform. Theory, 2016, vol. 62, no. 6, pp. 3355\u20133389.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"4374_CR9","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1017\/S0305004100013517","volume":"31","author":"HO Hirschfeld","year":"1935","unstructured":"Hirschfeld, H.O., A Connection between Correlation and Contingency, Math. Proc. Cambridge Philos. Soc., 1935, vol. 31, no. 4, pp. 520\u2013524.","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"6","key":"4374_CR10","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1002\/zamm.19410210604","volume":"21","author":"H Gebelein","year":"1941","unstructured":"Gebelein, H., Das statistische Problem der Korrelation als Variations- und Eigenwertproblem und sein Zusammenhang mit der Ausgleichsrechnung, Z. Angew. Math. Mech., 1941, vol. 21, no. 6, pp. 364\u2013379.","journal-title":"Z. Angew. Math. Mech."},{"issue":"1","key":"4374_CR11","first-page":"52","volume":"121","author":"OV Sarmanov","year":"1958","unstructured":"Sarmanov, O.V., Maximal Correlation Coefficient (Non-symmetric Case), Dokl. Akad. Nauk SSSR, 1958, vol. 121, no. 1, pp. 52\u201355.","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"3\u20134","key":"4374_CR12","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF02024507","volume":"10","author":"A R\u00e9nyi","year":"1959","unstructured":"R\u00e9nyi, A., On Measures of Dependence, Acta Math. Acad. Sci. Hungar., 1959, vol. 10, no. 3\u20134, pp. 441\u2013451.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"issue":"1","key":"4374_CR13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0128010","volume":"28","author":"HS Witsenhausen","year":"1975","unstructured":"Witsenhausen, H.S., On Sequences of Pairs of Dependent Random Variables, SIAM J. Appl. Math., 1975, vol. 28, no. 1, pp. 100\u2013113.","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"4374_CR14","first-page":"72","volume":"1","author":"RL Dobrushin","year":"1956","unstructured":"Dobrushin, R.L., Central Limit Theorem for Nonstationary Markov Chains. I, Teor. Veroyatn. Primen., 1956, vol. 1, no. 1, pp. 72\u201389 [Theory Probab. Appl. (Engl. Transl.), 1956, vol. 1, no. 1, pp. 65\u201380].","journal-title":"Teor. Veroyatn. Primen."},{"issue":"6","key":"4374_CR15","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1214\/aop\/1176995937","volume":"4","author":"R Ahlswede","year":"1976","unstructured":"Ahlswede, R. and Gacs, P., Spreading of Sets in Product Spaces and Hypercontraction of the Markov Operator, Ann. Probab., 1976, vol. 4, no. 6, pp. 925\u2013939.","journal-title":"Ann. Probab."},{"key":"4374_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-32792-4","volume-title":"Non-negative Matrices and Markov Chains","author":"E Seneta","year":"1981","unstructured":"Seneta, E., Non-negative Matrices and Markov Chains, New York: Springer, 1981, 2nd ed.","edition":"2nd ed"},{"key":"4374_CR17","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0024-3795(93)90331-H","volume":"179","author":"JE Cohen","year":"1993","unstructured":"Cohen, J.E., Iwasa, Y., R\u0103u\u0163u, G., Ruskai, M.B., Seneta, E., and Zb\u0103ganu, G., Relative Entropy under Mappings by Stochastic Matrices, Linear Algebra Appl., 1993, vol. 179, pp. 211\u2013235.","journal-title":"Linear Algebra Appl."},{"key":"4374_CR18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0024-3795(94)90428-6","volume":"208","author":"M-D Choi","year":"1994","unstructured":"Choi, M.-D., Ruskai, M.B., and Seneta, E., Equivalence of Certain Entropy Contraction Coefficients, Linear Algebra Appl., 1994, vol. 208\/209, pp. 29\u201336.","journal-title":"Linear Algebra Appl."},{"key":"4374_CR19","volume-title":"Comparisons of Stochastic Matrices with Applications in Information Theory, Statistics, Economics and Population Sciences","author":"JE Cohen","year":"1998","unstructured":"Cohen, J.E., Kemperman, J.H.B., and Zb\u0103ganu, G., Comparisons of Stochastic Matrices with Applications in Information Theory, Statistics, Economics and Population Sciences, Ann Arbor, MI: Birkh\u00e4user, 1998."},{"key":"4374_CR20","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"411","volume-title":"Topics in Information Theory (2nd Colloq., Keszthely, Hungary, 1975)","author":"J K\u00f6rner","year":"1977","unstructured":"K\u00f6rner, J. and Marton, K., Comparison of Two Noisy Channels, in Topics in Information Theory (2nd Colloq., Keszthely, Hungary, 1975), Colloq. Math. Soc. J\u00e1nos Bolyai, vol. 16, Amsterdam: North-Holland, 1977, pp. 411\u2013423."},{"key":"4374_CR21","first-page":"85","volume":"8","author":"I Csisz\u00e1r","year":"1963","unstructured":"Csisz\u00e1r, I., Eine informationstheoretische Ungleichung und ihre Anwendung auf den Beweis der Ergodizit\u00e4t von Markoffschen Ketten, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. Ser. A, 1963, vol. 8, pp. 85\u2013108.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. Ser. A"},{"key":"4374_CR22","first-page":"299","volume":"2","author":"I Csisz\u00e1r","year":"1967","unstructured":"Csisz\u00e1r, I., Information-type Measures of Difference of Probability Distributions and Indirect Observations, Studia Sci. Math. Hungar., 1967, vol. 2, pp. 299\u2013318.","journal-title":"Studia Sci. Math. Hungar."},{"issue":"1","key":"4374_CR23","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.2517-6161.1966.tb00626.x","volume":"28","author":"SM Ali","year":"1966","unstructured":"Ali, S.M. and Silvey, S.D., A General Class of Coefficients of Divergence of One Distribution from Another, J. Roy. Statist. Soc. Ser. B, 1966, vol. 28, no. 1, pp. 131\u2013142.","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"issue":"3","key":"4374_CR24","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1143\/JPSJ.18.328","volume":"18","author":"T Morimoto","year":"1963","unstructured":"Morimoto, T., Markov Processes and the H-Theorem, J. Phys. Soc. Japan, 1963, vol. 18, no. 3, pp. 328\u2013331.","journal-title":"J. Phys. Soc. Japan"},{"key":"4374_CR25","first-page":"267","volume-title":"Proc. 2nd Int. Symp. on Information Theory, Tsaghkadzor, Armenia, USSR, Sept. 2\u20138, 1971","author":"H Akaike","year":"1973","unstructured":"Akaike, H., Information Theory and an Extension of the Maximum Likelihood Principle, Proc. 2nd Int. Symp. on Information Theory, Tsaghkadzor, Armenia, USSR, Sept. 2\u20138, 1971, Petrov, B.N. and Csaki, F., Eds., Budapest, Hungary: Akad. Kiad\u00f3, 1973, pp. 267\u2013281."},{"issue":"3","key":"4374_CR26","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1109\/TIT.1973.1055015","volume":"19","author":"J Ziv","year":"1973","unstructured":"Ziv, J. and Zakai, M., On Functionals Satisfying a Data-Processing Theorem, IEEE Trans. Inform. Theory, 1973, vol. 19, no. 3, pp. 275\u2013283.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR27","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-7091-2730-8_4","volume-title":"Information Theory: New Trends and Open Problems","author":"M Zakai","year":"1975","unstructured":"Zakai, M. and Ziv, J., A Generalization of the Rate-Distortion Theory and Applications, Information Theory: New Trends and Open Problems, Longo, G., Ed., New York: Springer, 1975, pp. 87\u2013123."},{"issue":"10","key":"4374_CR28","doi-asserted-by":"crossref","first-page":"4394","DOI":"10.1109\/TIT.2006.881731","volume":"52","author":"F Liese","year":"2006","unstructured":"Liese, F. and Vajda, I., On Divergences and Informations in Statistics and Information Theory, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 10, pp. 4394\u20134412.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR29","volume-title":"Markov Chains and Mixing Times","author":"DA Levin","year":"2009","unstructured":"Levin, D.A., Peres, Y., and Wilmer, E.L., Markov Chains and Mixing Times, Providence, RI: Amer. Math. Soc., 2009."},{"issue":"1","key":"4374_CR30","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback, S. and Leibler, R.A., On Information and Sufficiency, Ann. Math. Statist., 1951, vol. 22, no. 1, pp. 79\u201386.","journal-title":"Ann. Math. Statist."},{"key":"4374_CR31","first-page":"239","volume-title":"Proc. 1st Berkeley Symp. on Mathematical Statistics and Probability, Berkeley, CA, Aug. 13\u201318, 1945; Jan. 27\u201329, 1946","author":"J Neyman","year":"1949","unstructured":"Neyman, J., Contribution to the Theory of the \u03c72 Test, Proc. 1st Berkeley Symp. on Mathematical Statistics and Probability, Berkeley, CA, Aug. 13\u201318, 1945; Jan. 27\u201329, 1946, Neyman, J., Ed., Berkeley, CA: Univ. of California Press, 1949, pp. 239\u2013273."},{"issue":"1","key":"4374_CR32","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/LSP.2013.2288355","volume":"21","author":"F Nielsen","year":"2014","unstructured":"Nielsen, F. and Nock, R., On the Chi Square and Higher-Order Chi Distances for Approximating f-Divergences, IEEE Signal Process. Lett., 2014, vol. 21, no. 1, pp. 10\u201313.","journal-title":"IEEE Signal Process. Lett."},{"key":"4374_CR33","volume-title":"Convex Statistical Distances","author":"F Liese","year":"1987","unstructured":"Liese, F. and Vajda, I., Convex Statistical Distances, Leipzig: Teubner, 1987."},{"issue":"11","key":"4374_CR34","doi-asserted-by":"crossref","first-page":"5973","DOI":"10.1109\/TIT.2016.2603151","volume":"62","author":"I Sason","year":"2016","unstructured":"Sason, I. and Verd\u0144, S., f-Divergence Inequalities, IEEE Trans. Inform. Theory, 2016, vol. 62, no. 11, pp. 5973\u20136006.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4946-7","volume-title":"Asymptotic Methods in Statistical Decision Theory","author":"L Le Cam","year":"1986","unstructured":"Le Cam, L., Asymptotic Methods in Statistical Decision Theory, New York: Springer, 1986."},{"key":"4374_CR36","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/B978-0-12-274460-0.50023-0","volume-title":"Contributions to Probability: A Collection of Papers Dedicated to Eugene Lukacs","author":"I Vincze","year":"1981","unstructured":"Vincze, I., On the Concept and Measure of Information Contained in an Observation, Contributions to Probability: A Collection of Papers Dedicated to Eugene Lukacs, Gani, J. and Rohatgi, V.K., Eds., New York: Academic, 1981, pp. 207\u2013214."},{"issue":"3","key":"4374_CR37","first-page":"239","volume":"19","author":"L Gy\u00f6rfi","year":"2001","unstructured":"Gy\u00f6rfi, L. and Vajda, I., A Class of Modified Pearson and Neyman Statistics, Statist. Decisions, 2001, vol. 19, no. 3, pp. 239\u2013251.","journal-title":"Statist. Decisions"},{"key":"4374_CR38","volume-title":"Lecture Notes on Information Theory 6.441","author":"Y Polyanskiy","year":"2017","unstructured":"Polyanskiy, Y. and Wu, Y., Lecture Notes on Information Theory 6.441, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 2017."},{"issue":"1\u20134","key":"4374_CR39","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02018661","volume":"2","author":"I Csisz\u00e1r","year":"1972","unstructured":"Csisz\u00e1r, I., A Class of Measures of Informativity of Observation Channels, Period. Math. Hungar., 1972, vol. 2, no. 1\u20134, pp. 191\u2013213.","journal-title":"Period. Math. Hungar."},{"issue":"8","key":"4374_CR40","doi-asserted-by":"crossref","first-page":"5011","DOI":"10.1109\/TIT.2017.2700857","volume":"63","author":"F du Pin Calmon","year":"2017","unstructured":"du Pin Calmon, F., Makhdoumi, A., M\u00e9dard, M., Varia, M., Christiansen, M., and Duffy, K.R., Principal Inertia Components and Applications, IEEE Trans. Inform. Theory, 2017, vol. 63, no. 8, pp. 5011\u20135038.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR41","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M. and Thomas, J.A., Elements of Information Theory, Hoboken, NJ: Wiley, 2006, 2nd ed.","edition":"2nd ed."},{"key":"4374_CR42","doi-asserted-by":"crossref","unstructured":"Borade, S. and Zheng, L., Euclidean Information Theory, in Proc. IEEE Int. Zurich Seminar on Communications, Zurich, Switzerland, Mar. 12\u201314, 2008, pp. 14\u201317.","DOI":"10.1109\/IZS.2008.4497265"},{"key":"4374_CR43","doi-asserted-by":"crossref","unstructured":"Huang, S.-L. and Zheng, L., Linear Information Coupling Problems, in Proc. 2012 IEEE Int. Symp. on Information Theory (ISIT\u20192012), Cambridge, MA, July 1\u20136, 2012, pp. 1029\u20131033.","DOI":"10.1109\/ISIT.2012.6283007"},{"key":"4374_CR44","volume-title":"Methods of Information Geometry","author":"S Amari","year":"2000","unstructured":"Amari, S. and Nagaoka, H., Methods of Information Geometry, Providence, RI: Amer. Math. Soc.; Oxford Univ. Press, 2000."},{"key":"4374_CR45","doi-asserted-by":"crossref","DOI":"10.1561\/9781933019543","volume-title":"Information Theory and Statistics: A Tutorial","author":"I Csisz\u00e1r","year":"2004","unstructured":"Csisz\u00e1r, I. and Shields, P.C., Information Theory and Statistics: A Tutorial, Hanover, MA: Now Publ., 2004."},{"issue":"2","key":"4374_CR46","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/TIT.2011.2169537","volume":"58","author":"AA Gohari","year":"2012","unstructured":"Gohari, A.A. and Anantharam, V., Evaluation of Marton\u2019s Inner Bound for the General Broadcast Channel, IEEE Trans. Inform. Theory, 2012, vol. 58, no. 2, pp. 608\u2013619.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4374_CR47","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TIT.2011.2169536","volume":"58","author":"E Abbe","year":"2012","unstructured":"Abbe, E. and Zheng, L., A Coordinate System for Gaussian Networks, IEEE Trans. Inform. Theory, 2012, vol. 58, no. 2, pp. 721\u2013733.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR48","volume-title":"Master Thesis","author":"A Makur","year":"2015","unstructured":"Makur, A., A Study of Local Approximations in Information Theory, Master Thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 2015."},{"key":"4374_CR49","volume-title":"Matrix Analysis","author":"RA Horn","year":"2013","unstructured":"Horn, R.A. and Johnson, C.R., Matrix Analysis, Cambridge: Cambridge Univ. Press, 2013, 2nd ed.","edition":"2nd ed"},{"key":"4374_CR50","volume-title":"Theory and Applications of Correspondence Analysis","author":"MJ Greenacre","year":"1984","unstructured":"Greenacre, M.J., Theory and Applications of Correspondence Analysis, San Diego, CA: Academic, 1984."},{"issue":"398","key":"4374_CR51","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1080\/01621459.1987.10478446","volume":"82","author":"M Greenacre","year":"1987","unstructured":"Greenacre, M. and Hastie, T., The Geometric Interpretation of Correspondence Analysis, J. Amer. Statist. Assoc., 1987, vol. 82, no. 398, pp. 437\u2013447.","journal-title":"J. Amer. Statist. Assoc."},{"key":"4374_CR52","unstructured":"Hsu, H., Salamatian, S., and Calmon, F.P., Correspondence Analysis Using Neural Networks, in Proc. 22nd Int. Conf. on Artificial Intelligence and Statistics (AISTATS\u20192019), Naha, Japan, Apr. 16\u201318, 2019, pp. 2671\u20132680."},{"issue":"3","key":"4374_CR53","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1214\/aoms\/1177706532","volume":"29","author":"HO Lancaster","year":"1958","unstructured":"Lancaster, H.O., The Structure of Bivariate Distributions, Ann. Math. Statist., 1958, vol. 29, no. 3, pp. 719\u2013736.","journal-title":"Ann. Math. Statist."},{"key":"4374_CR54","volume-title":"The Chi-Squared Distribution","author":"HO Lancaster","year":"1969","unstructured":"Lancaster, H.O., The Chi-Squared Distribution, New York: Wiley, 1969."},{"key":"4374_CR55","doi-asserted-by":"crossref","unstructured":"Makur, A. and Zheng, L., Polynomial Spectral Decomposition of Conditional Expectation Operators, in Proc. 54th Annu. Allerton Conf. on Communication, Control, and Computing, Monticello, IL, Sept. 27\u201330, 2016, pp. 633\u2013640.","DOI":"10.1109\/ALLERTON.2016.7852291"},{"issue":"12","key":"4374_CR56","doi-asserted-by":"crossref","first-page":"7716","DOI":"10.1109\/TIT.2017.2760626","volume":"63","author":"A Makur","year":"2017","unstructured":"Makur, A. and Zheng, L., Polynomial Singular Value Decompositions of a Family of Source-Channel Models, IEEE Trans. Inform. Theory, 2017, vol. 63, no. 12, pp. 7716\u20137728.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"391","key":"4374_CR57","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1080\/01621459.1985.10478157","volume":"80","author":"L Breiman","year":"1985","unstructured":"Breiman, L. and Friedman, J.H., Estimating Optimal Transformations for Multiple Regression and Correlation, J. Amer. Statist. Assoc., 1985, vol. 80, no. 391, pp. 580\u2013598.","journal-title":"J. Amer. Statist. Assoc."},{"key":"4374_CR58","doi-asserted-by":"crossref","unstructured":"Makur, A., Kozynski, F., Huang, S.-L., and Zheng, L., An Efficient Algorithm for Information Decomposition and Extraction, in Proc. 53rd Annu. Allerton Conf. on Communication, Control, and Computing, Monticello, IL, Sept. 29-Oct. 2, 2015, pp. 972\u2013979.","DOI":"10.1109\/ALLERTON.2015.7447113"},{"key":"4374_CR59","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H. and Van Loan, C.F., Matrix Computations, Baltimore, MD: Johns Hopkins Univ. Press, 1996, 3rd ed.","edition":"3rd ed."},{"key":"4374_CR60","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971446","volume-title":"Applied Numerical Linear Algebra","author":"JW Demmel","year":"1997","unstructured":"Demmel, J.W., Applied Numerical Linear Algebra, Philadelphia, PA: SIAM, 1997."},{"key":"4374_CR61","series-title":"ScD Thesis","volume-title":"Information Contraction and Decomposition","author":"A Makur","year":"2019","unstructured":"Makur, A., Information Contraction and Decomposition, ScD Thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 2019."},{"key":"4374_CR62","doi-asserted-by":"crossref","unstructured":"Huang, S.-L., Makur, A., Kozynski, F., and Zheng, L., Efficient Statistics: Extracting Information from IID Observations, in Proc. 52nd Annu. Allerton Conf. on Communication, Control, and Computing, Monticello, IL, Oct. 1\u20133, 2014, pp. 699\u2013706.","DOI":"10.1109\/ALLERTON.2014.7028523"},{"key":"4374_CR63","unstructured":"Huang, S.-L., Makur, A., Wornell, G.W., and Zheng, L., On Universal Features for High-Dimensional Learning and Inference, arXiv:1911.09105 [cs.LG], 2019."},{"issue":"11","key":"4374_CR64","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1080\/14786440109462720","volume":"2","author":"K Pearson","year":"1901","unstructured":"Pearson, K., On Lines and Planes of Closest Fit to Systems of Points in Space, Philos. Mag., 1901, vol. 2, no. 11, pp. 559\u2013572.","journal-title":"Philos. Mag."},{"issue":"6","key":"4374_CR65","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1037\/h0071325","volume":"24","author":"H Hotelling","year":"1933","unstructured":"Hotelling, H., Analysis of a Complex of Statistical Variables into Principal Components, J. Educ. Psychol., 1933, vol. 24, no. 6, pp. 417\u2013441; 498\u2013520.","journal-title":"J. Educ. Psychol."},{"issue":"3\/4","key":"4374_CR66","doi-asserted-by":"crossref","first-page":"321","DOI":"10.2307\/2333955","volume":"28","author":"H Hotelling","year":"1936","unstructured":"Hotelling, H., Relations between Two Sets of Variates, Biometrika, 1936, vol. 28, no. 3\/4, pp. 321\u2013377.","journal-title":"Biometrika"},{"issue":"1","key":"4374_CR67","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.acha.2006.04.006","volume":"21","author":"RR Coifman","year":"2006","unstructured":"Coifman, R.R. and Lafon, S., Diffusion Maps, Appl. Comput. Harmon. Anal., 2006, vol. 21, no. 1, pp. 5\u201330.","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"4374_CR68","doi-asserted-by":"crossref","unstructured":"Asoodeh, S., Diaz, M., Alajaji, F., and Linder, T., Information Extraction under Privacy Constraints, Information, 2016, vol. 7, no. 1, Article no. 15 (37 pp.).","DOI":"10.3390\/info7010015"},{"issue":"3","key":"4374_CR69","doi-asserted-by":"crossref","first-page":"576","DOI":"10.2307\/1426955","volume":"11","author":"E Seneta","year":"1979","unstructured":"Seneta, E., Coefficients of Ergodicity: Structure and Applications, Adv. in Appl. Probab., 1979, vol. 11, no. 3, pp. 576\u2013590.","journal-title":"Adv. in Appl. Probab."},{"issue":"1","key":"4374_CR70","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1137\/090752948","volume":"32","author":"ICF Ipsen","year":"2011","unstructured":"Ipsen, I.C.F. and Selee, T.M., Ergodicity Coefficients Defined by Vector Norms, SIAM J. Matrix Anal. Appl., 2011, vol. 32, no. 1, pp. 153\u2013200.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"4374_CR71","series-title":"PhD Thesis","volume-title":"Stochastic Matrices: Ergodicity Coefficients, and Applications to Ranking","author":"TM Selee","year":"2009","unstructured":"Selee, T.M., Stochastic Matrices: Ergodicity Coefficients, and Applications to Ranking, PhD Thesis, Dept. of Applied Mathematics, North Carolina State Univ., Raleigh, NC, 2009."},{"issue":"4","key":"4374_CR72","first-page":"613","volume":"18","author":"A Kontorovich","year":"2012","unstructured":"Kontorovich, A., Obtaining Measure Concentration from Markov Contraction, Markov Process. Related Fields, 2012, vol. 18, no. 4, pp. 613\u2013638.","journal-title":"Markov Process. Related Fields"},{"key":"4374_CR73","doi-asserted-by":"crossref","unstructured":"Yu, B., Assouad, Fano, and Le Cam, Festschrift for Lucien Le Cam: Research Papers in Probability and Statistics, Pollard, D., Torgersen, E., and Yang, G.L., Eds., New York: Springer, 1997, pp. 423\u2013435.","DOI":"10.1007\/978-1-4612-1880-7_29"},{"issue":"3","key":"4374_CR74","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","volume":"2","author":"CE Shannon","year":"1956","unstructured":"Shannon, C.E., The Zero Error Capacity of a Noisy Channel, IRE Trans. Inform. Theory, 1956, vol. 2, no. 3, pp. 8\u201319.","journal-title":"IRE Trans. Inform. Theory"},{"key":"4374_CR75","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I Csisz\u00e1r","year":"2011","unstructured":"Csisz\u00e1r, I. and K\u00f6rner, J., Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge: Cambridge Univ. Press, 2011, 2nd ed.","edition":"2nd ed."},{"issue":"7","key":"4374_CR76","doi-asserted-by":"crossref","first-page":"2367","DOI":"10.1109\/18.796377","volume":"45","author":"WS Evans","year":"1999","unstructured":"Evans, W.S. and Schulman, L.J., Signal Propagation and Noisy Circuits, IEEE Trans. Inform. Theory, 1999, vol. 45, no. 7, pp. 2367\u20132373.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4374_CR77","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF00533259","volume":"46","author":"S Goldstein","year":"1979","unstructured":"Goldstein, S., Maximal Coupling, Z. Wahrsch. Verw. Gebiete, 1979, vol. 46, no. 2, pp. 193\u2013204.","journal-title":"Z. Wahrsch. Verw. Gebiete"},{"key":"4374_CR78","doi-asserted-by":"crossref","unstructured":"Kim, H., Gao, W., Kannan, S., Oh, S., and Viswanath, P., Discovering Potential Correlations via Hypercontractivity, Entropy, 2017, vol. 19, no. 11, Article no. 586 (32 pp.).","DOI":"10.3390\/e19110586"},{"issue":"11","key":"4374_CR79","doi-asserted-by":"crossref","first-page":"5377","DOI":"10.1109\/TIT.2010.2068710","volume":"56","author":"GL Gilardoni","year":"2010","unstructured":"Gilardoni, G.L., On Pinsker\u2019s and Vajda\u2019s Type Inequalities for Csiszar\u2019s f-Divergences, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 11, pp. 5377\u20135386.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR80","doi-asserted-by":"crossref","unstructured":"Verd\u0144, S., Total Variation Distance and the Distribution of Relative Information, in Proc. 2014 Information Theory and Applications Workshop (ITA\u20192014), San Diego, CA, Feb. 9\u201314, 2014, pp. 1\u20133.","DOI":"10.1109\/ITA.2014.6804281"},{"key":"4374_CR81","unstructured":"Nair, C., An Extremal Inequality Related to Hypercontractivity of Gaussian Random Variables, in Proc. 2014 Information Theory and Applications Workshop (ITA\u20192014), San Diego, CA, Feb. 9\u201314, 2014, pp. 1\u20137."},{"issue":"3","key":"4374_CR82","doi-asserted-by":"crossref","first-page":"1879","DOI":"10.1109\/TIT.2017.2782359","volume":"64","author":"F du Pin Calmon","year":"2018","unstructured":"du Pin Calmon, F., Polyanskiy, Y., and Wu, Y., Strong Data Processing Inequalities for Input Constrained Additive Noise Channels, IEEE Trans. Inform. Theory, 2018, vol. 64, no. 3, pp. 1879\u20131892.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"4374_CR83","doi-asserted-by":"crossref","first-page":"5704","DOI":"10.1109\/TIT.2018.2839743","volume":"64","author":"A Makur","year":"2018","unstructured":"Makur, A. and Polyanskiy, Y., Comparison of Channels: Criteria for Domination by a Symmetric Channel, IEEE Trans. Inform. Theory, 2018, vol. 64, no. 8, pp. 5704\u20135725.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4374_CR84","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/18.556128","volume":"43","author":"M van Dijk","year":"1997","unstructured":"van Dijk, M., On a Special Class of Broadcast Channels with Confidential Messages, IEEE Trans. Inform. Theory, 1997, vol. 43, no. 2, pp. 712\u2013714.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR85","doi-asserted-by":"crossref","unstructured":"Makur, A. and Polyanskiy, Y., Less Noisy Domination by Symmetric Channels, in Proc. 2017 IEEE Int. Symp. on Information Theory (ISIT\u20192017), Aachen, Germany, June 25\u201330, 2017, pp. 2463\u20132467.","DOI":"10.1109\/ISIT.2017.8006972"},{"key":"4374_CR86","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1090\/conm\/529\/10428","volume-title":"Entropy and the Quantum","author":"E Carlen","year":"2010","unstructured":"Carlen, E., Trace Inequalities and Quantum Entropy: An Introductory Course, Entropy and the Quantum, Sims, R. and Ueltschi, D., Eds., Providence, RI: Amer. Math. Soc., 2010, pp. 73\u2013140."},{"key":"4374_CR87","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R Bhatia","year":"1997","unstructured":"Bhatia, R., Matrix Analysis, New York: Springer, 1997."},{"issue":"10","key":"4374_CR88","doi-asserted-by":"crossref","first-page":"5446","DOI":"10.1109\/TIT.2016.2584625","volume":"62","author":"A Samorodnitsky","year":"2016","unstructured":"Samorodnitsky, A., On the Entropy of a Noisy Function, IEEE Trans. Inform. Theory, 2016, vol. 62, no. 10, pp. 5446\u20135464.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR89","doi-asserted-by":"crossref","unstructured":"Kumar, G.R. and Courtade, T.A., Which Boolean Functions Are Most Informative?, in Proc. 2013 IEEE Int. Symp. on Information Theory (ISIT\u20192013), Istanbul, Turkey, July 7\u201312, 2013, pp. 226\u2013230.","DOI":"10.1109\/ISIT.2013.6620221"},{"key":"4374_CR90","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139030687","volume-title":"Network Information Theory","author":"A El Gamal","year":"2011","unstructured":"El Gamal, A. and Kim, Y.-H., Network Information Theory, New York: Cambridge Univ. Press, 2011."},{"issue":"5","key":"4374_CR91","doi-asserted-by":"crossref","first-page":"1836","DOI":"10.1109\/TIT.2005.846407","volume":"51","author":"E Ordentlich","year":"2005","unstructured":"Ordentlich, E. and Weinberger, M.J., A Distribution Dependent Refinement of Pinsker\u2019s Inequality, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 5, pp. 1836\u20131840.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR92","volume-title":"CCIT Report","author":"I Sason","year":"2014","unstructured":"Sason, I., Bounds on f-Divergences and Related Distances, CCIT Report, Dept. of Electrical Engineering, Technion \u2014 Israel Inst. of Technology, Haifa, Israel, 2014, no. 859."},{"issue":"6","key":"4374_CR93","doi-asserted-by":"crossref","first-page":"3230","DOI":"10.1109\/TIT.2011.2137353","volume":"57","author":"P Harremo\u00f6es","year":"2011","unstructured":"Harremo\u00f6es, P. and Vajda, I., On Pairs of f-Divergences and Their Joint Range, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 6, pp. 3230\u20133235.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"4374_CR94","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/TIT.2003.811927","volume":"49","author":"AA Fedotov","year":"2003","unstructured":"Fedotov, A.A., Harremo\u00ebs, P., and Tops\u00f8e, F., Refinements of Pinsker\u2019s Inequality, IEEE Trans. Inform. Theory, 2003, vol. 49, no. 6, pp. 1491\u20131498.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR95","series-title":"PhD Thesis","volume-title":"Methods for Quantifying Rates of Convergence for Random Walks on Groups","author":"FE Su","year":"1995","unstructured":"Su, F.E., Methods for Quantifying Rates of Convergence for Random Walks on Groups, PhD Thesis, Dept. of Mathematics, Harvard Univ., Cambridge, MA, 1995."},{"issue":"2","key":"4374_CR96","first-page":"97","volume":"17","author":"SS Dragomir","year":"2001","unstructured":"Dragomir, S.S. and Glu\u0161\u010devi\u0107, V., Some Inequalities for the Kullback-Leibler and \u03c72-Distances in Information Theory and Applications, Tamsui Oxf. J. Math. Sci., 2001, vol. 17, no. 2, pp. 97\u2013111.","journal-title":"Tamsui Oxf. J. Math. Sci."},{"key":"4374_CR97","doi-asserted-by":"crossref","unstructured":"Sason, I., Tight Bounds for Symmetric Divergence Measures and a New Inequality Relating f-Divergences, in Proc. 2015 IEEE Information Theory Workshop (ITW\u20192015), Jerusalem, Israel, Apr. 26-May 1, 2015, pp. 1\u20135.","DOI":"10.1109\/ITW.2015.7133079"},{"issue":"3","key":"4374_CR98","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1111\/j.1751-5823.2002.tb00178.x","volume":"70","author":"AL Gibbs","year":"2002","unstructured":"Gibbs, A.L. and Su, F.E., On Choosing and Bounding Probability Metrics, Int. Stat. Rev., 2002, vol. 70, no. 3, pp. 419\u2013435.","journal-title":"Int. Stat. Rev."},{"issue":"3","key":"4374_CR99","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1109\/TIT.2005.864431","volume":"52","author":"I Csisz\u00e1r","year":"2006","unstructured":"Csisz\u00e1r, I. and Talata, Z., Context Tree Estimation for Not Necessarily Finite Memory Processes, via BIC and MDL, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 3, pp. 1007\u20131016.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR100","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S. and Vandenberghe, L., Convex Optimization, New York: Cambridge Univ. Press, 2004."},{"key":"4374_CR101","volume-title":"Information Theory","author":"RB Ash","year":"1965","unstructured":"Ash, R.B., Information Theory, New York: Wiley, 1965."},{"issue":"6","key":"4374_CR102","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1109\/18.104312","volume":"37","author":"A Dembo","year":"1991","unstructured":"Dembo, A., Cover, T.M., and Thomas, J.A., Information Theoretic Inequalities, IEEE Trans. Inform. Theory, 1991, vol. 37, no. 6, pp. 1501\u20131518.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"4374_CR103","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.4236\/am.2013.47146","volume":"4","author":"Y-C Li","year":"2013","unstructured":"Li, Y.-C. and Yeh, C.-C., Some Equivalent Forms of Bernoulli\u2019s Inequality: A Survey, Appl. Math., 2013, vol. 4, no. 7, pp. 1070\u20131093.","journal-title":"Appl. Math."},{"key":"4374_CR104","doi-asserted-by":"crossref","unstructured":"Sutter, D. and Renes, J.M., Universal Polar Codes for More Capable and Less Noisy Channels and Sources, in Proc. 2014 IEEE Int. Symp. on Information Theory (ISIT\u20192014), Honolulu, HI, June 29-July 4, 2014, pp. 1461\u20131465.","DOI":"10.1109\/ISIT.2014.6875075"},{"issue":"1","key":"4374_CR105","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/s00022-003-1687-x","volume":"78","author":"V Rako\u010devi\u0107","year":"2003","unstructured":"Rako\u010devi\u0107, V. and Wimmer, H.K., A Variational Characterization of Canonical Angles between Subspaces, J. Geom., 2003, vol. 78, no. 1, pp. 122\u2013124.","journal-title":"J. Geom."},{"issue":"1","key":"4374_CR106","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TIT.2010.2090211","volume":"57","author":"W Kang","year":"2011","unstructured":"Kang, W. and Ulukus, S., A New Data Processing Inequality and Its Applications in Distributed Source and Channel Coding, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 1, pp. 56\u201369.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4374_CR107","first-page":"1705","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I.S., and Ghosh, J., Clustering with Bregman Divergences, J. Mach. Learn. Res., 2005, vol. 6, pp. 1705\u20131749.","journal-title":"J. Mach. Learn. Res."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020020015.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946020020015","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020020015.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:42:38Z","timestamp":1775011358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946020020015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":107,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4374"],"URL":"https:\/\/doi.org\/10.1134\/s0032946020020015","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4]]},"assertion":[{"value":"17 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}