Functional Bregman divergence

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 1681-1685

  Frigyik, Bela A ^a   Srivastava, Saotosh ^b   Gupta, Maya R ^c  

^a PURDUE UNIVERSITY   (United States)

^b USA   (United States)

^c University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BREG-MAN DIVERGENCES; DISTORTION FUNCTIONS; FINITE NUMBERS; FINITE SETS; INTERNATIONAL SYMPOSIUM; PARAMETERIZED; POSITIVE FUNCTIONS; RELATIVE ENTROPY; SQUARED DIFFERENCES;

CYBERNETICS; ERROR ANALYSIS; INFORMATION THEORY; STANDARDS; TECHNICAL PRESENTATIONS; TURBULENT FLOW; VECTORS;

SET THEORY;

EID: 52349098751     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595274     Document Type: Conference Paper

References (19)

1. B. Taskar, S. Lacoste-Julien, and M. I. Jordan, "Structured prediction, dual extragradient and Bregman projections," Journal of Machine Learning Research, vol. 7, pp. 1627-1653, 2006.
2. N. Murata, T. Takenouchi. T. Kanamori, and S. Eguchi, "Information geometry of U-Boost and Bregman divergence," Neural Computation. vol. 16, pp. 1437-1481. 2004.
3. M. Collins, R. E. Schapire. and Y. Singer, "Logistic regression, AdaBoost and Bregman distances," Machine Learning, vol. 48. pp. 253-285, 2002.
4. J. Kivinen and M. Warmuth, "Relative loss bounds for multidimensional regression problems," Machine Learning, vol. 45, no. 3. pp. 301-329, 2001.
5. J. Lafferty, "Additive models, boosting, and inference for generalized divergences," Proc. of Conf. on Learning Theory (COLT), 1999.
6. S. Srivastava, M. R. Gupta, and B. A. Frigyik, "Bayesian quadratic discriminant analysis," Journal of Machine Learning Research, vol. 8, pp. 1287-1314, 2007.
7. S. Srivastava and M. R. Gupta, "Distribution-based Bayesian minimum expected risk for discriminant analysis," Proc. of the IEEE Intl. Symposium on Information Theory, 2006.
8. L. K. Jones and C. L. Byrne, "General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysis," IEEE Trans. on Information Theory, vol. 36, pp. 23-30, 1990.
9. A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh, "Clustering with Bregman divergences," Journal of Machine Learning Research, vol. 6, pp. 1705-1749, 2005.
10. R. Nock and F. Nielsen, "On weighting clustering," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 28, no. 8, pp. 1223-1235, 2006.
11. G. LeBesenerais, J. Bercher, and G. Demoment, "A new look at entropy for solving linear inverse problems." IEEE Trans. on Information Theory, vol. 45, pp. 1565-1577, 1999.
12. Y. Altun and A. Smola, "Unifying divergence minimization and statistical inference via convex duality," Proc. of Conf. on Learning Theory (COLT). 2006.
13. M. C. Pardo and 1. Vajda, "About distances of discrete distiibutions satisfying the data processing theorem of information theory," IEEE Trans. on Information Theory, vol. 43, no. 4, pp. 1288-1293, 1997.
14. A. Banerjee, X. Guo. and H. Wang, "On the optimality of conditional expectation as a Bregman predictor," IEEE Trans. on Information Theory, vol. 51, no. 7, pp. 2664-2669, 2005.
15. I. Csiszár, "Generalized projections for non-negative functions," Acta Mathematica Hungarica, vol. 68, pp. 161-185, 1995.
16. I. M. Gelfand and S. V. Fomin, Calculus of Variations. USA: Dover, 2000.
17. B. A. Frigyik, S. Srivastava, and M. R. Gupta, "Functional Bregman divergence and Bayesian estimation of distributions," In review for journal publication, available on arXiv and at idl.ee.washington.edu.
18. T. Rockafellar, "Integrals which are convex functionals," Pacific Journal of Mathematics, vol. 24, no. 3, pp. 525-539, 1968.
19. C. H. Edwards, Advanced Calculus of Several Variables. New York: Dover, 1995.