Training structural SVMs when exact inference is intractable
The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications require make exact training intractable. This leads to a need for approximate training methods. Unfortunately, knowledge about how to perform efficient and effective approximate training is limited. Focusing on structural SVMs, we provide and explore algorithms for two different classes of approximate training algorithms, which we call undergenerating (e.g., greedy) and overgenerating (e.g., relaxations) algorithms. We provide a theoretical and empirical analysis of both types of approximate trained structural SVMs, focusing on fully connected pairwise Markov random fields. We find that models trained with overgenerating methods have theoretic advantages over undergenerating methods, are empirically robust relative to their undergenerating brethren, and relaxed trained models favor non-fractional predictions from relaxed predictors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
(1988) · Cited by 16,582
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Boykov, Y., & Kolmogorov, V. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.60 · Cited by 4,577
RCV1: A New Benchmark Collection for Text Categorization Research
Lewis, D., Yang, Y., Rose, T. G., & Li, F. (2004) · Goldsmiths (University of London) · doi:10.5555/1005332.1005345 · Cited by 2,503
Learning multi-label scene classification
Boutell, M. R., Luo, J., Shen, X., & Brown, C. M. (2004) · Pattern Recognition · doi:10.1016/j.patcog.2004.03.009 · Cited by 2,296
Large Margin Methods for Structured and Interdependent Output Variables
Tsochantaridis, I., Joachims, T., Hofmann, T., & Altün, Y. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1088722 · Cited by 2,225
Self-citationCollins, M. (2002) · Proceedings of the ACL-02 conference on Empirical methods in natural language processing - EMNLP '02 · doi:10.3115/1118693.1118694 · Cited by 1,862
A Kernel Method for Multi-Labelled Classification
Elisseeff, A., & Weston, J. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0092 · Cited by 1,342
Support vector machine learning for interdependent and structured output spaces
Tsochantaridis, I., Hofmann, T., Joachims, T., & Altun, Y. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015341 · Cited by 1,243
Self-citationTaskar, B., Guestrin, C., & Koller, D. (2003) · Cited by 1,206
Multiscale conditional random fields for image labeling
He, X., Zemel, R. S., & Carreira-Perpinan, M. A. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315232 · Cited by 828
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
A support vector method for multivariate performance measures
Joachims, T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102399 · Cited by 786
Self-citationThe challenge problem for automated detection of 101 semantic concepts in multimedia
Snoek, C. G. M., Worring, M., van Gemert, J. C., Geusebroek, J.-M., & Smeulders, A. W. M. (2006) · Proceedings of the 14th ACM international conference on Multimedia · doi:10.1145/1180639.1180727 · Cited by 620
Hidden Markov support vector machines
Altün, Y., Tsochantaridis, I., & Hofmann, T. (2003) · Cited by 458
Minimizing Nonsubmodular Functions with Graph Cuts-A Review
Kolmogorov, V., & Rother, C. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1031 · Cited by 362
Discriminative Learning of Markov Random Fields for Segmentation of 3D Scan Data
Anguelov, D., Taskar, B., Chatalbashev, V., Koller, D., Gupta, D., Heitz, G., & Ng, A. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.133 · Cited by 356
Roof duality, complementation and persistency in quadratic 0–1 optimization
Hammer, P. L., Hansen, P., & Simeone, B. (1984) · Mathematical Programming · doi:10.1007/bf02612354 · Cited by 316
Accelerated training of conditional random fields with stochastic gradient methods
Vishwanathan, S. V. N., Schraudolph, N. N., Schmidt, M. W., & Murphy, K. P. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143966 · Cited by 278
Supervised clustering with support vector machines
Finley, T., & Joachims, T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102379 · Cited by 212
Self-citationDiscriminative Fields for Modeling Spatial Dependencies in Natural Images
Kumar, S., & Hebert, M. (2018) · Figshare · doi:10.1184/r1/6554576 · Cited by 196
First-Order Probabilistic Models for Coreference Resolution
Culotta, A., Wick, M., & McCallum, A. (2007) · North American Chapter of the Association for Computational Linguistics · Cited by 179
Integer linear programming inference for conditional random fields
Roth, D., & Yih, W.-T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102444 · Cited by 179
Hierarchical classification: combining Bayes with SVM
Cesa‐Bianchi, N., Gentile, C., & Zaniboni, L. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143867 · Cited by 178
Support Vector Training of Protein Alignment Models
Yu, C.-N. J., Joachims, T., Elber, R., & Pillardy, J. (2008) · Journal of Computational Biology · doi:10.1089/cmb.2007.0152 · Cited by 38
Self-citation
Cited by
Articulated pose estimation with flexible mixtures-of-parts
Yang, Y., & Ramanan, D. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995741 · Cited by 990
Learning human activities and object affordances from RGB-D videos
Koppula, H. S., Gupta, R., & Saxena, A. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913478446 · Cited by 683
Associative hierarchical CRFs for object class image segmentation
Ladicky, L., Russell, C., Kohli, P., & Torr, P. H. S. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459248 · Cited by 596
Caetano, T. S., McAuley, J. J., Cheng, L., Le, Q. V., & Smola, A. J. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.28 · Cited by 383
Predicting Program Properties from "Big Code"
Raychev, V., Vechev, M., & Krause, A. (2015) · Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2676726.2677009 · Cited by 296
Metadata
- Authors
- Finley, T., & Joachims, T.
- Venue
- Proceedings of the 25th international conference on Machine learning - ICML '08
- Publisher
- ACM Press
- Published
- 2008
- Pages
- 304-311
- OpenAlex
- W2092423930
- Cited by
- 260
- References
- 26
- FWCI
- 19.85
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.