A scalable modular convex solver for regularized risk minimization

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2007, Pages 727-736

  Teo, Choon Hui ^a   Smola, Alex ^a,b   Vishwanathan, S V N ^a   Le, Quoc Viet ^a  

^a CSIRO   (Australia)

^b MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

Author keywords

Algorithms; Convexity; Optimization

Indexed keywords

ALGORITHMS; CLUSTER ANALYSIS; FUNCTIONAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; REGRESSION ANALYSIS;

CONDITIONAL RANDOM FIELDS (CRF); CONVEXITY; LOGISTIC REGRESSION;

LEARNING SYSTEMS;

EID: 36849059715     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281270     Document Type: Conference Paper

References (43)

1. G. Bakir, T. Hofmann, B. Schölkopf, A. Smola, B. Taskar, and S. V. N. Vishwanathan. Predicting Structured Data. MIT Press, Cambridge, Massachusetts, 2007.
2. S. Balay, K. Buschelman, V. Eijkhout, W. D. Gropp, D. Kaushik, M. G. Knepley, L. C. Mclnnes, B. F. Smith, and H. Zhang. PBTSc users manual. Technical Report ANL-95/11, Argonne National Laboratory, 2006.
3. O. B. Barndorff-Nielsen. Information and Exponential Families in Statistical Theory. John Wiley and Sons, New York, 1978.
4. K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optim. Methods Softw., 1:23-34, 1992.
5. S. Benson, L. Curfman-McInnes, J. Moré, and J. Sarich. TAO user manual. Technical Report ANL/MCS-TM-242, Argonne National Laboratory, 2004.
6. R. Byrd, P. Lu, J. Nocedal, and C. Zhu. A limited memory algorithm for bound constrained optimization. SIAM Journal on Scientific Computing, 16(5):1190-1208, 1995.
7. L. Cai and T. Hofmann. Hierarchical document categorization with support vector machines. In Proc. of ACM conference on info. and knowledge mgmt., pages 78-87, New York, NY, USA, 2004. ACM Press.
8. B. Candes and T. Tao. Decoding by linear programming. IEEE Trans. Info Theory, 51(12):4203-4215, 2005.
9. C. Chang and C. Lin. LIBSVM: a library for support vector machines, 2001.
10. O. Chapelle. Training a support vector machine in the primal. Technical Report TR. 147, Max Planck Institute for Biological Cybernetics, 2006.
11. C. Chu, S. Kim, Y. A. Lin, Y. Y. Yu, G. Bradski, A. Ng, and K. Olukotun. Map-reduce for machine learning on multicore. In NIPS 19, 2007.
12. C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, , and M. Zhu. Tools for Privacy Preserving Distributed Data Mining. AGM SIGKDD Explorations, 4(2), December 2002.
13. M. Collins, R. B. Schapire, and Y. Singer. Logistic regression, AdaBoost and Bregman distances. In COLT, pages 158-169. Morgan Kaufmann, San Francisco, 2000.
14. R. Cowell, A. David, S. Lauritzen, and D. Spiegelhalter. Probabilistic Networks and Expert Sytems. Springer, New York, 1999.
15. K. Crammer and Y. Singer. Online ranking by projecting. Neural Computation, 17(1):145-175, 2005.
16. N. A. C. Cressie. Statistics for Spatial Data. John Wiley and Sons, New York, 1993.
17. L. Fahrmeir and G. Tutz. Multivariate Statistical Modelling Based on Generalized Linear Models. Springer, 1994.
18. S. Fine and K. Scheinberg. Efficient SVM training using low-rank kernel representation. Technical report, IBM Watson Research Center, New York, 2000.
19. S. Fine and K. Scheinberg. Efficient SVM training using low-rank kernel representations. JMLR, 2001.
20. C. Gentile and M. K. Warmuth. Linear hinge loss and average margin. In NIPS 11, pages 225-231, Cambridge, MA, 1999.
21. R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. In A. J. Smola, P. L. Bartlett, B. Schölkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 115-132, Cambridge, MA, 2000. MIT Press.
22. J. Hiriart-Urruty and C. Lemaréchal. Convex Analysis and Minimization Algorithms, I and II. 305 and 306. Springer-Verlag, 1993.
23. T. Joachims. Making large-scale SVM learning practical. In B. Schölkopf, C. J. C. Burges, and A. J. Smola, editors, Advances in Kernel Methods - Support Vector Learning, pages 169-184, Cambridge, MA, 1999. MIT Press.
24. T. Joachims. A support vector method for multivariate performance measures. In ICML, pages 377-384, San Francisco, California, 2005. Morgan Kaufmann Publishers.
25. T. Joachims. Training linear SVMs in linear time. In KDD, 2006.
26. S. S. Keerthi and D. DeCoste. A modified finite Newton method for fast solution of large scale linear SVMs. JMLR, 6:341-361, 2005.
27. R. Koenker. Quantile Regression. Cambridge University Press, 2005.
28. J. D. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic modeling for segmenting and labeling sequence data. In ICML, volume 18, pages 282-289, 2001.
29. Q. Le and A. Smola. Direct optimization of ranking measures. JMLR, 2007. submitted.
30. O. L. Mangasarian. Linear and nonlinear separation of patterns by linear programming. Oper. Res., 13:444-452, 1965.
31. K.-R. Müller, A. J. Smola, G. Rätsch, B. Schölkopf, J. Kohlmorgen, and V. Vapnik. Predicting time series with support vector machines. In ICANN'97, pages 999-1004, 1997.
32. B. Schölkopf, J. Platt, J. Shawe-Taylor, A. J. Smola, and R. C. Williamson. Estimating the support of a high-dimensional distribution. TR 87, Microsoft Research, Redmond, WA, 1999.
33. B. Schölkopf, J. Platt, J. Shawe-Taylor, A. J. Smola, and R. C. Williamson. Estimating the support of a high-dimensional distribution. Neural Comput., 13(7):1443-1471, 2001.
34. F. Sha and F. Pereira. Shallow parsing with conditional random fields. In Proceedings of HLT-NAACL, pages 213-220, 2003.
35. S. Shalev-Shwartz and Y. Singer. Online learning meets optimization in the dual. In COLT, 2006. extended version.
36. V. Sindhwani and S. Keerthi. Large scale semi-supervised linear svms. In SIGIR '06, pages 477-484, New York, NY, USA, 2006. ACM Press.
37. I. Takeuchi, Q. Le, T. Sears, and A. Smola. Nonparametric quantile estimation. JMLR, 2006.
38. B. Taskar, C. Guestrin, and D. Koller. Max-margin Markov networks. In NIPS, pages 25-32, 2004.
39. R. Tibshirani. Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B Stat. Methodol., 58:267-288, 1996.
40. I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. JMLR, 6:1453-1484, 2005.
41. V. Vapnik, S. Golowich, and A. J. Smola. Support vector method for function approximation, regression estimation, and signal processing. In NIPS, pages 281-287, 1997.
42. S. V. N. Vishwanathan and A. J. Smola. Fast kernels for string and tree matching. In NIPS, pages 569-576, 2003.
43. C. K. I. Williams. Prediction with Gaussian processes: From linear regression to linear prediction and beyond. In M. I. Jordan, editor, Learning and Inference in Graphical Models, pages 599-621. Kluwer Academic, 1998.