Sequential alternating proximal method for scalable sparse structural SVMs

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2012, Pages 61-70

  Balamurugan, P ^a   Shevade, Shirish ^a   Babu, T Ravindra ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b Education and Research Infosys Ltd   (India)

Author keywords

Alternating proximal method; Structural SVMs

Indexed keywords

BENCHMARK DATASETS; COMPLEX OBJECTS; DUAL FORMULATIONS; ELASTIC NET; FEATURE SPACE; GENERALIZATION PERFORMANCE; HIGH-DIMENSIONAL MODELS; IMAGE SEGMENTS; LARGE DATASETS; MODEL PARAMETERS; PARAMETER VECTORS; PART-OF-SPEECH TAGS; PROXIMAL ALGORITHM; PROXIMAL METHODS; REGULARIZER; SPARSE MODELS; STRUCTURAL SUPPORT; STRUCTURAL SVMS;

DATA MINING; LEARNING ALGORITHMS; SUPPORT VECTOR MACHINES; VECTOR SPACES;

PARAMETER ESTIMATION;

EID: 84874093534     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2012.81     Document Type: Conference Paper

References (23)

1. H. Attouch, J. Bolte, P. Redont and A. Soubeyran. Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's. Journal of Convex Analysis 15 (3), 485-506. 2008.
2. P. Balamurugan, S. Shevade, S. Sundararajan and S. S. Keerthi. A Sequential Dual Method for Structural SVMs. SDM, 2011.
3. L. Bottou. Large-Scale Machine Learning with Stochastic Gradient Descent. COMPSTAT, 2010.
4. P. S. Bradley and O. L. Mangasarian. Feature Selection via concave minimization and support vector machines. ICML, 1998.
5. Brown Corpus. Available at http://nltk.googlecode.com/svn/trunk/nltk- data/index.xml
6. J. Duchi. Matlab code to project onto L1 ball. Available at http://www.cs.berkeley.edu/~jduchi/projects/DuchiShSiCh08/ProjectOntoL1Ball.m
7. 1-Ball for Learning in High Dimensions. ICML, 2008.
8. Z. Hussain and J. Shawe-Taylor. Metric learning analysis. PinView FP7-216529 Project Deliverable Report D3.3, 2011.
9. T. Joachims, T. Finley and C-N. J. Yu. Cutting-Plane training of Structural SVMs. Machine Learning, 77(1):27-59, 2009.
10. T. Lavergne, O. Cappé and F. Yvon. Practical Very Large CRFs. Proceedings of the ACL, pages 504-513, 2010.
11. M. Marcus, B. Santorini and M. A. Marcinkiewicz. Building a Large Annotated Corpus of English. Computational Linguistics, 1993.
12. N. Nguyen and Y. Guo. Comparisons of Sequence-labeling Algorithms and Extensions. ICML, 2007.
13. J. Platt. Fast Training of SVMs using Sequential Minimal Optimization. Advances in Kernel Methods-Support Vector Learning, 1999.
14. E. F. T. K. Sang and S. Buchholz. Introduction to the CoNLL-2000 shared task: Chunking. CoNLL, 2000.
15. B. Taskar, C. Guestrin and D. Koller. Maximum-margin Markov networks. NIPS, 2003.
16. I. Tsochantaridis, T. Joachims, T. Hoffmann and Y. Altun. Large Margin Methods for Structured and Inter-dependent Output Variables. JMLR, 6:1453:1484, 2005.
17. L. Wang (Ed.), Support Vector Machines: Theory and Applications. Springer, 2005.
18. L. Wang, J. Zhu, and H. Zou. The Doubly Regularized Support Vector Machine. Statistica Sinica, 16(2), 589-616, 2006.
19. Z. Wang. Extra-gradient solver for LP. Available at http://www0.cs.ucl. ac.uk/staff/Zhuoran.Wang
20. Z. Wang and J. Shawe-Taylor. Large-Margin Structured Prediction via Linear Programming. AISTATS, 2009.
21. W. Yin. Analysis and Generalizations of the Linearized Bregman Method. SIAM Journal of Imaging Sciences, Vol. 3, No. 4, pp. 856-877. 2010.
22. J. Zhu, E. P. Xing and B. Zhang. Primal Sparse Max-Margin Markov Networks. SIGKDD, 2009.
23. H. Zou and T. Hastie. Regularization and variable selection via the elastic net. J. Roy. Statist. Soc. Ser. B 67, 301-320, 2005.