Unifying divergence minimization and statistical inference via convex duality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4005 LNAI, Issue , 2006, Pages 139-153

  Altun, Yasemin ^a   Smola, Alex ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; PROBLEM SOLVING; STATISTICAL MECHANICS;

CONVEX DUALITY; ENTROPY ESTIMATION; STATISTICAL INFERENCE; STATISTICAL LEARNING PROBLEMS;

LEARNING ALGORITHMS;

EID: 33746060884     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_13     Document Type: Conference Paper

References (26)

1. Y. Altun, T. Hofmann, and A. J. Smola. Exponential families for conditional random fields. In Uncertainty in Artificial Intelligence UAI, pages 2-9, 2004.
2. K. Borgwardt, A. Gretton, and A.J. Smola. Kernel discrepancy estimation. Technical report, NICTA, Canberra, 2006.
3. J. Borwein and Q.J. Zhu. Techniques of Variational Analysis. Springer, 2005.
4. J. M. Borwein. Semi-infinite programming: How special is it? In A.V. Fiacco and K.O. Kortanek, ed., Semi-Infinite Programming and Applications. Springer, 1983.
5. O. Bousquet, S. Boucheron, and G. Lugosi. Theory of classification: a survey of recent; advances. ESAIM: Probability and Statistics, 2004. submitted.
6. O. Bousquet and A. Elisseeff. Stability and generalization. JMLR, 2:499-526, 2002.
7. S. Chen and R. Rosenfeld. A Gaussian prior for smoothing maximum entropy models. Technical Report CMUCS-99-108, Carnegie Mellon University, 1999.
8. M. Collins, R. E. Schapire, and Y. Singer. Logistic regression, adaboost and bregman distances. In COLT'00, pages 158-169, 2000.
9. C. Cortes and V. Vapnik. Support vector networks. Machine Learning, 20:273-297, 1995.
10. M. Dudik, S. Phillips, and R. E. Schapire. Performance guarantees for regularized maximum entropy density estimation. In Proceedings of COLT'04, 2004.
11. M. Dudik and R.E. Schapire. Maximum entropy distribution estimation with generalized regularization. In COLT, 2006.
12. M. P. Friedlander and M. R. Gupta. On minimizing distortion and relative entropy. IEEE Transactions on Information Theory, 52(1), 2006.
13. J. Kivinen and M. Warmuth. Boosting as entropy projection. In COLT'99, 1999.
14. J. Lafferty. Additive models, boosting, and inference for generalized divergences. In COLT '99, pages 125-133, New York, NY, USA, 1999. ACM Press.
15. Q. V. Le, A. J. Smola, and S. Canu. Heteroscedastic gaussian process regression. In International Conference on Machine Learning ICML 2005, 2005.
16. V.A. Morozov. Methods for solving incorrectly posed problems. Springer, 1984.
17. R. Neal. Priors for infinite networks. Technical report, U. Toronto, 1994.
18. I. Nemenman and W. Bialek. Occam factors and model independent bayesian learning of continuous distributions. Physical Review E, 65(2):6137, 2002.
19. G. Rätsch, S. Mika, and M.K. Warmuth. On the convergence of leveraging. In Advances in Neural Information Processing Systems (NIPS), 2002.
20. R.T. Rockafellar. Convex Analysis. Princeton University Press, 1970.
21. D. L. Ruderman and W. Bialek. Statistics of natural images: Scaling in the woods. Phys Rev. Letters, 1994.
22. B. Schölkopf and A. Smola. Learning with Kernels. MIT Press, 2002.
23. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
24. A. N. Thikhonov and V. Y. Arsenin. Solutions of Ill-Posed Problems. Wiley, 1977.
25. M. J. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Technical Report 649, UC Berkeley, September 2003.
26. T. Zhang. Sequential greedy approximation for certain convex optimization problems. IEEE Transactions on Information Theory, 49(3):682-691, March 2003.