Fetching the paper…
Reading the bibliography…
This paper develops systematic approaches to obtain $f$-divergence inequalities, dealing with pairs of probability measures defined on arbitrary alphabets.
A. Bhattacharyya, “On some analogoues of the amount of information and their use in statistical estimation,” Sankhyā: The Indian Journal of Statistics
1946
Earlier work this paper cites.
H. Jefrreys, “An invariant form for the prior probability in estimation problems,” Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences
1946
Earlier work this paper cites.
S. Kullback and R. A. Leibler, “On information and sufficiency,” Annals of Mathematical Statistics
1951
Earlier work this paper cites.
W. Hoeffding and J. Wolfowitz, “Distinguishability of sets of distributions,” Annals of Mathematical Statistics
1958
Earlier work this paper cites.
M. S. Pinsker, Information and Information Stability of Random Variables and Random Processes
1960
Earlier work this paper cites.
A. Rényi, “On measures of entropy and information,” Proceedings of the 4th Berekely Symposium on Probability Theory and Mathematical Statistics
1961
Earlier work this paper cites.
M. H. DeGroot, “Uncertainty, information and sequential experiments,” Annals of Mathematical Statistics
1962
Earlier work this paper cites.
I. Csiszár, “Eine Informationstheoretische Ungleichung und ihre Anwendung auf den Bewis der Ergodizität von Markhoffschen Ketten,” Publ. Math. Inst. Hungar. Acad. Sci
1963
Earlier work this paper cites.
S. M. Ali and S. D. Silvey, “A general class of coefficients of divergence of one distribution from another,” Journal of the Royal Statistics Society
1966
Earlier work this paper cites.
I. Csiszár, “A note on Jensen’s inequality,” Studia Scientiarum Mathematicarum Hungarica
1966
Earlier work this paper cites.
I. Csiszár, “Information-type measures of difference of probability distributions and indirect observations,” Studia Scientiarum Mathematicarum Hungarica
1967
Earlier work this paper cites.
I. Csiszár, “On topological properties of f f -divergences,” Studia Scientiarum Mathematicarum Hungarica
1967
Earlier work this paper cites.
T. Kailath, “The divergence and Bhattacharyya distance measures in signal selection,” IEEE Trans. on Communication Technology
1967
Earlier work this paper cites.
S. Kullback, “A lower bound for discrimination information in terms of variation,” IEEE Trans. on Information Theory
1967
Earlier work this paper cites.
J. H. B. Kemperman, “On the optimal rate of transmitting information,” Annals Mathematical Statistics , vol. 40, pp. 2156–2177, Dec. 1969
1969
Earlier work this paper cites.
I. Vajda, “Note on discrimination information and variation,” IEEE Trans. on Information Theory
1970
Earlier work this paper cites.
I. Csiszár, “A class of measures of informativity of observation channels,” Periodica Mathematicarum Hungarica
1972
Earlier work this paper cites.
I. Vajda, “On f f -divergence and singularity of probability measures,” Periodica Mathematica Hungarica
1972
Earlier work this paper cites.
L. Le Cam, “Convergence of estimates under dimensionality restrictions,” The Annals of Statistics , vol. 1, no. 1, pp. 38–53, Jan. 1973
1973
Earlier work this paper cites.
I. Csiszár, “I-divergence geometry of probability distributions and minimization problems,” Annals of Probability
1975
Earlier work this paper cites.
M. Zakai and J. Ziv, “A generalization of the rate-distortion theory and applications,” Information Theory - New Trends and Open Problems
1975
Earlier work this paper cites.
R. Ahlswede and P. Gács, “Spreading of sets in product spaces and hypercontraction of the Markov operator,” The Annals of Probability , vol. 4, no. 6, pp. 925–939, 1976
1976
Earlier work this paper cites.
J. Bretagnolle and C. Huber, “Estimation des densités: risque minimax,” Probability Theory and Related Fields
1979
Earlier work this paper cites.
I. Vincze, “On the concept and measure of information contained in an observation,” in Contributions to Probability
1981
Earlier work this paper cites.
A. Barron, “Entropy and the central limit theorem,” Annals of Probability
1986
Earlier work this paper cites.
L. Le Cam, Asymptotic Methods in Statistical Decision Theory
1986
Earlier work this paper cites.
F. Liese and I. Vajda, Convex Statistical Distances
1987
Earlier work this paper cites.
T. R. C. Read and N. A. C. Cressie, Goodness of Fit Statistics for Discrete Multivariate Data
1988
Earlier work this paper cites.
R. D. Reiss, Approximate Distributions of Order Statistics with Applications to Non-Parametric Statistics
1989
Earlier work this paper cites.
I. Vajda, Theory of Statistical Inference and Information
1989
Earlier work this paper cites.
L. Le Cam and G. L. Yang, Asymptotics in Statistics: Some Basic Concepts
1990
Earlier work this paper cites.
A. Barron, “Information theory and martingales,” presented at the 1991 IEEE International Symposium on Information Theory
1991
Earlier work this paper cites.
J. Lin, “Divergence measures based on the Shannon entropy,” IEEE Trans. on Information Theory
1991
Earlier work this paper cites.
F. Österreicher and I. Vajda, “Statistical information and discrimination,” IEEE Trans. on Information Theory
1993
Earlier work this paper cites.
F. E. Su, Methods for Quantifying Rates of Convergence for Random Walks on Groups
1995
Earlier work this paper cites.
W. H. Wong and X. Shen, “Probability inequalities for likelihood ratios and convergence rates of sieve MLES,” The Annals of Statistics , vol. 23, no. 2, pp. 339–362, Apr. 1995
1995
Earlier work this paper cites.
R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey and D. E. Knuth, “On the Lambert W function,” Advances in Computational Mathematics
1996
Earlier work this paper cites.
P. Diaconis and L. Saloff-Coste, “Logarithmic Sobolev inequalities for finite Markov chains,” Annals of Applied Probability
1996
Cited alongside, same era.
K. Marton, “A measure concentration inequality for contracting Markov chains,” Geometric and Functional Analysis
1996
Cited alongside, same era.
Y. Steinberg and S. Verdú, “Simulation of random processes and rate-distortion theory,” IEEE Trans. on Information Theory
1996
Cited alongside, same era.
D. Haussler and M. Opper, “Mutual information, metric entropy and cumulative relative entropy risk,” Annals of Statistics
1997
Cited alongside, same era.
L. Birgé and P. Massart, “Minimum contrast estimators on sieves: exponential bounds and rates of convergence,” Bernoulli
1998
Cited alongside, same era.
A. Basu, H. Shioya and C. Park, “Statistical Inference: The Minimum Distance Approach,” Chapman & Hall/ CRC Monographs on Statistics and Applied Probability
2011
Later among the works it cites.
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems
2011
Later among the works it cites.
M. Gil, “On Rényi divergence measures for continuous alphabet sources,” Master’s thesis, Queen’s University, Canada, Aug. 2011
2011
Later among the works it cites.
A. Guntuboyina, “Lower bounds for the minimax risk using f f -divergences and applications,” IEEE Trans. on Information Theory
2011
Later among the works it cites.
P. Harremoës and I. Vajda, “On pairs of f f -divergences and their joint range,’ IEEE Trans. on Information Theory
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. E. Cohen, J. H. B. Kemperman and G. Zbăganu, Comparisons of Stochastic Matrices with Applications in Information Theory, Statistics, Economics and Population
1998
Cited alongside, same era.
V. N. Vapnik, Statistical Learning Theory
1998
Cited alongside, same era.
S. S. Dragomir, “Upper and lower bounds for Csiszár f f -divergence in terms of the Kullback-Leibler distance and applications,” Inequalities for Csiszár f-Divergence in Information Theory, RGMIA Monographs
2000
Cited alongside, same era.
S. S. Dragomir, “An upper bound for the Csiszár f f -divergence in terms of the variational distance and applications,” Inequalities for Csiszár f-Divergence in Information Theory, RGMIA Monographs
2000
Cited alongside, same era.
P. M. Samson, “Concentration of measure inequalities for Markov chains and ϕ \phi -mixing processes,” Annals of Probability
2000
Cited alongside, same era.
F. Topsøe, “Some inequalities for information divergence and related measures of discrimination,” IEEE Trans. on Information Theory
2000
Cited alongside, same era.
S. S. Dragomir and V. Glušc̆ević, “Some inequalities for the Kullback-Leibler and χ 2 \chi^{2} -distances in information theory and applications,” Tamsui Oxford Journal of Mathematical Sciences
2001
Cited alongside, same era.
M. D. Reid and R. C. Williamson, “Information, divergence and risk for binary experiments,” Journal of Machine Learning Research
2011
Later among the works it cites.
O. Shayevitz, “On Rényi measures and hypothesis testing,” Proceedings of the 2011 IEEE International Symposium on Information Theory
2011
Later among the works it cites.
K. M. R. Audenaert, “On the asymmetry of the relative entropy,” Journal of Mathematical Physics
2013
Later among the works it cites.
S. Boucheron, G. Lugosi, and P. Massart, Concentration Inequalities: A Nonasymptotic Theory of Independence
2013
Later among the works it cites.
M. Gil, F. Alajaji and T. Linder, “Rényi divergence measures for commonly used univariate continuous distributions,” Information Sciences
2013
Later among the works it cites.
K. Marton, “Distance-divergence inequalities,” Proceedings of the 2013 IEEE International Symposium on Information Theory
2013
Later among the works it cites.
I. Sason, “Entropy bounds for discrete random variables via maximal coupling,” IEEE Trans. on Information Theory
2013
Later among the works it cites.
M. Tomamichel and V. Y. F. Tan, “A tight upper bound for the third-order asymptotics for most discrete memoryless channels,” IEEE Trans. on Information Theory
2013
Later among the works it cites.
D. Berend, P. Harremoës and A. Kontorovich, “Minimum KL-divergence on complements of L 1 L_{1} balls,” IEEE Trans. on Information Theory
2014
Later among the works it cites.
2014
Later among the works it cites.
C. D. Charalambous, I. Tzortzis, S. Loyka and T. Charalambous, “Extremum problems with total variation distance and their applications,” IEEE Trans. on Automatic Control
2014
Later among the works it cites.
T. van Erven and P. Harremoës, “Rényi divergence and Kullback-Leibler divergence,” IEEE Trans. on Information Theory
2014
Later among the works it cites.
A. Guntuboyina, S. Saha and G. Schiebinger, “Sharp inequalities for f f -divergences,” IEEE Trans. on Information Theory
2014
Later among the works it cites.
M. Raginsky and I. Sason, “Concentration of measure inequalities in information theory, communications and coding,” Foundations and Trends in Communications and Information Theory , vol. 10, no. 1-2, pp. 1–250, 2013. (2nd edition, 2014)
2014
Later among the works it cites.
S. Verdú, “Total variation distance and the distribution of the relative information,” Proceedings of the 2014 Information Theory and Applications Workshop
2014
Later among the works it cites.
2015
Closest in time.
V. Kostina and S. Verdú, “Channels with cost constraints: strong converse and dispersion,” IEEE Trans. on Information Theory
2015
Closest in time.
M. Krajc̆i, C. F. Liu, L. Mikes̆ and S. M. Moser, “Performance analysis of Fano coding,” Proceedings of the IEEE 2015 International Symposium on Information Theory
2015
Closest in time.
2015
Closest in time.
J. Liu, P. Cuff and S. Verdú, “Resolvability in E γ E_{\gamma} with applications to lossy compression and wiretap channels,” Proceedings of the 2015 IEEE International Symposium on Information Theory
2015
Closest in time.
J. Liu, P. Cuff and S. Verdú, “One-shot mutual covering lemma and Marton’s inner bound with a common message,” Proceedings of the 2015 IEEE International Symposium on Information Theory
2015
Closest in time.
G. Lu and B. Li, “A class of new metrics based on triangular discrimination,” Information
2015
Closest in time.
2015
Closest in time.
M. Raginsky and I. Sason, “Concentration of measure inequalities and their communication and information-theoretic applications,” IEEE Information Theory Society Newsletter , vol. 65, no. 4, pp. 24–34, Dec. 2015
2015
Closest in time.
I. Sason, “Tight bounds on symmetric divergence measures and a refined bound for lossless source coding,” IEEE Trans. on Information Theory
2015
Closest in time.
2015
Closest in time.
S. L. Fong and V. Y. F. Tan, “Strong converse theorems for classes of multimessage multicast networks: A Rényi divergence approach,” IEEE Trans. on Information Theory
2016
Closest in time.
M. A. Kumar and I. Sason, “Projection theorems for the Rényi divergence on α \alpha -convex sets,” IEEE Trans. on Information Theory
2016
Closest in time.
Y. Polyanskiy and Y. Wu, “Dissipation of information in channels with input constraints,” to appear in the IEEE Trans. on Information Theory
2016
Closest in time.
M. Raginsky, “Strong data processing inequalities and Φ \Phi -Sobolev inequalities for discrete channels,” IEEE Trans. on Information Theory
2016
Closest in time.
I. Sason, “On the Rényi divergence, joint range of relative entropies, and a channel coding theorem,” IEEE Trans. on Information Theory
2016
Closest in time.
I. Sason and S. Verdú, “ f f -divergence inequalities,” IEEE Trans. on Information Theory
2016
Closest in time.