Fetching the paper…
Reading the bibliography…
In this paper, some general properties of Shannon information measures are investigated over sets of probability distributions with restricted marginals.
C. E. Shannon, A mathematical theory of communication, Bell Syst. Tech. J. 27 (1948) 379–423 and 623–656
1948
Earlier work this paper cites.
C. E. Shannon, Some topics in information theory, in: Proc. Int. Cong. Math. 2 (1950) 262
1950
Earlier work this paper cites.
E. T. Jaynes, Information theory and statistical mechanics, Phys. Rev. 106 (1957) 620–630 and 108 (1957) 171–190
1957
Earlier work this paper cites.
A. Rényi, On measures of dependence, Acta Math. Acad. Sci. Hungar. 10 (1959) 441–451
1959
Earlier work this paper cites.
A. Rényi, On measures of entropy and information, in: Proc. 4th Berkeley Sympos. Math. Statist. and Prob., 1961, vol. I, Berkeley, CA: Univ. California Press, pp. 547–561
1961
Earlier work this paper cites.
C. B. Bell, Mutual information and maximal correlation as measures of dependence, Ann. Math. Statist. 33 (1962) 587–595
1962
Earlier work this paper cites.
M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman and Co., 1979
1979
Earlier work this paper cites.
I. Csiszár, J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press, Inc., 1981
1981
Earlier work this paper cites.
S. Watanabe, Pattern recognition as a quest for minimum entropy, Pattern Recognit. 13 (1981) 381–387
1981
Earlier work this paper cites.
O. L. Mangasarian, T. H. Shiau, A variable-complexity norm maximization problem, SIAM J. Algebr. Discrete Meth. 7 (1986) 455–461
1986
Earlier work this paper cites.
J. N. Kapur, Maximum-Entropy Models in Science and Engineering, New Delhi, India: Wiley, 1989
1989
Earlier work this paper cites.
H. L. Bodlaender, P. Gritzmann, V. Klee, J. Van Leeuwen, Computational complexity of norm-maximization, Combinatorica 10 (1990) 203–225
1990
Earlier work this paper cites.
G. E. Bredon, Topology and Geometry, Springer-Verlag, 1993
1993
Earlier work this paper cites.
R. Battiti, Using mutual information for selecting features in supervised neural net learning, IEEE Trans. Neural Netw. 5 (1994) 537–550
1994
Earlier work this paper cites.
C. H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Reading, MA, 1994
1994
Earlier work this paper cites.
J. N. Kapur, G. Baciu, H. K. Kesavan, The MinMax information measure, Int. J. Syst. Sci. 26 (1995) 1–12
1995
Earlier work this paper cites.
L. Rüschendorf, B. Schweizer, M. D. Taylor (Eds.), Distributions with Fixed Marginals and Related Topics, Lecture Notes - Monograph Series, Institute of Mathematical Statistics, 1996
1996
Cited alongside, same era.
R. K. Sundaram, A First Course in Optimization Theory, Cambridge University Press, 1996
1996
Cited alongside, same era.
C. H. Bennett, P. Gács, M. Li, P. M. B. Vitányi, W. H. Zurek, Information distance, IEEE Trans. Inf. Theory 44 (1998) 1407–1423
1998
Cited alongside, same era.
1998
Cited alongside, same era.
J. Bergin, On the continuity of correspondences on sets of measures with restricted marginals, Econom. Theory 13 (1999) 471–481
1999
Cited alongside, same era.
P. Harremoës, Information topologies with applications, In: I. Csiszár, G. O. H. Katona, G. Tardos (Eds.), Entropy, Search, Complexity, Springer, 2007, pp. 113–150
2007
Later among the works it cites.
X. He, L. Deng, W. Chou, Discriminative learning in sequential pattern recognition, IEEE Signal Process. Mag. 25 (2008) 14–36
2008
Later among the works it cites.
D. A. Levin, Y. Peres, E. L. Wilmer, Markov Chains and Mixing Times, American Mathematical Society, 2008
2008
Later among the works it cites.
S.-W. Ho, R. W. Yeung, On the discontinuity of the Shannon information measures, IEEE Trans. Inf. Theory 55 (2009) 5362–5374
2009
Later among the works it cites.
K. Etessami, M. Yannakakis, On the complexity of Nash equilibria and other fixed points, SIAM J. Comput. 39 (2010) 2531–2597
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. Thorison, Coupling, Stationarity, and Regeneration, Springer, 2000
2000
Cited alongside, same era.
P. Harremoës, F. Topsøe, Maximum entropy fundamentals, Entropy 3 (2001) 191–226
2001
Cited alongside, same era.
F. Topsøe, Basic concepts, identities and inequalities – the toolkit of Information theory, Entropy 3 (2001) 162–190
2001
Cited alongside, same era.
N. Ay, An information-geometric approach to a theory of pragmatic structuring, Ann. Probab. 30 (2002) 416–436
2002
Cited alongside, same era.
F. Matúš, N. Ay, On maximization of the information divergence from an exponential family, in: Proc. WUPES’03, Prague, Czech Republic, 2003, pp. 199–205
2003
Cited alongside, same era.
Y. Y. Yao, Information-theoretic measures for knowledge discovery and data mining, in: Karmeshu (Ed.), Entropy Measures, Maximum Entropy Principle and Emerging Applications, Springer, 2003, pp. 115–136
2003
Cited alongside, same era.
I. Csiszár, P. Shields, Information theory and statistics: A tutorial, Found. Trends Commun. Inf. Theory 1 (2004) 417–528
2004
Cited alongside, same era.
S.-W. Ho, S. Verdú, On the interplay between conditional entropy and error probability, IEEE Trans. Inf. Theory 56 (2010) 5930–5942
2010
Later among the works it cites.
S.-W. Ho, R. W. Yeung, The interplay between entropy and variational distance, IEEE Trans. Inf. Theory 56 (2010) 5906–5929
2010
Later among the works it cites.
R. M. Gray, Entropy and Information Theory, 2nd ed., Springer, 2011
2011
Later among the works it cites.
D. Ge, X. Jiang, Y. Ye, A note on the complexity of L p L_{p} minimization, Math. Program. Ser. B 129 (2011) 285–299
2011
Later among the works it cites.
J. Rauh, Finding the maximizers of the information divergence from an exponential family, IEEE Trans. Inf. Theory 57 (2011) 3236–3247
2011
Later among the works it cites.
J. Rauh, Finding the maximizers of the information divergence from an exponential family, PhD Thesis, University of Leipzig, 2011
2011
Later among the works it cites.
J. Cardinal, S. Fiorini, G. Joret, Minimum entropy combinatorial optimization problems, Theory Comput. Syst. 51 (2012) 4–21
2012
Later among the works it cites.
M. Kovačević, I. Stanojević, V. Šenk, On the hardness of entropy minimization and related problems, in: Proc. IEEE Inform. Theory Workshop (ITW), Lausanne, Switzerland, 2012, pp. 512–516
2012
Later among the works it cites.
M. Vidyasagar, A metric between probability distributions on finite sets of different cardinalities and applications to order reduction, IEEE Trans. Aut. Control 57 (2012) 2464–2477
2012
Later among the works it cites.
I. Sason, Entropy bounds for discrete random variables via maximal coupling, IEEE Trans. Inf. Theory 59 (2013) 7118–7131
2013
Closest in time.