The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Learning structural SVMs with latent variables
Abstract
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application problems, with an optimization problem that can be solved efficiently using Concave-Convex Programming. The generality and performance of the approach is demonstrated through three applications including motiffinding, noun-phrase coreference resolution, and optimizing precision at k in information retrieval.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Optimizing search engines using clickthrough data
Joachims, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775067 · Cited by 3,873
Self-citationA discriminatively trained, multiscale, deformable part model
Felzenszwalb, P., McAllester, D., & Ramanan, D. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587597 · Cited by 2,867
Learning to rank: from pairwise approach to listwise approach
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273513 · Cited by 1,960 · cited 3×
“We also essentially tie with ListNet(Caoetal., 2007), oneofthebestoverall ranking method in the LETOR 3.0 benchmark.”
MethodInfluentialAdvances in Large-Margin Classifiers
(2000) · The MIT Press eBooks · doi:10.7551/mitpress/1113.001.0001 · Cited by 1,869
Detecting Subtle Sequence Signals: a Gibbs Sampling Strategy for Multiple Alignment
Lawrence, C. E., Altschul, S. F., Boguski, M. S., Liu, J. S., Neuwald, A. F., & Wootton, J. C. (1993) · Science · doi:10.1126/science.8211139 · Cited by 1,807
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
Yuille, A. L., & Rangarajan, A. (2003) · Neural Computation · doi:10.1162/08997660360581958 · Cited by 1,151
Cited by
Practical Bayesian Optimization of Machine Learning Algorithms
Snoek, J., Larochelle, H., & Adams, R. P. (2012) · arXiv · doi:10.48550/arxiv.1206.2944 · Cited by 6,691
Variations and extension of the convex–concave procedure
Lipp, T., & Boyd, S. (2016) · Optimization and Engineering · doi:10.1007/s11081-015-9294-x · Cited by 744
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
An Introduction to Conditional Random Fields
Sutton, C., & McCallum, A. (2012) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000013 · Cited by 564
Supervised Machine Learning for Population Genetics: A New Paradigm
Schrider, D. R., & Kern, A. D. (2018) · Trends in Genetics · doi:10.1016/j.tig.2017.12.005 · Cited by 453
Sentiment Analysis: Mining Opinions, Sentiments, and Emotions
Liu, B. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108639286 · Cited by 362
Learning latent temporal structure for complex event detection
Tang, K., Fei-Fei, L., & Koller, D. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247808 · Cited by 355
DC programming and DCA: thirty years of developments
Le Thi, H. A., & Pham Dinh, T. (2018) · Mathematical Programming · doi:10.1007/s10107-018-1235-y · Cited by 348
Top-down visual saliency via joint CRF and dictionary learning
Yang, J., & Yang, M.-H. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247940 · Cited by 320
Discriminative Latent Models for Recognizing Contextual Group Activities
Lan, T., Wang, Y., Yang, W., Robinovitch, S. N., & Mori, G. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.228 · Cited by 297
Weakly Supervised Object Localization and Detection: A Survey
Zhang, D., Han, J., Cheng, G., & Yang, M.-H. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3074313 · Cited by 277
Latent hierarchical structural learning for object detection
Zhu, L., Chen, Y., Yuille, A., & Freeman, W. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540096 · Cited by 252
Non-maximum Suppression for Object Detection by Passing Messages Between Windows
Rothe, R., Guillaumin, M., & Van Gool, L. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-16865-4_19 · Cited by 218
Gan, C., Li, Y., Li, H., Sun, C., & Gong, B. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.201 · Cited by 116
“This is not surprising since latent variables hardly match semantic interpretations due to the lack of explicit training signals; similar observations exist in other studies, e.g., object detection [8], video recognition [11] and text processing [49].”
BackgroundTowards Unified Object Detection and Semantic Segmentation
Dong, J., Chen, Q., Yan, S., & Yuille, A. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10602-1_20 · Cited by 70
Sung, J., Jin, S. H., & Saxena, A. (2018) · Springer Proceedings in Advanced Robotics · doi:10.1007/978-3-319-60916-4_40 · Cited by 52
“Borrowing from Sturm et al. [50], we encode joint type, center of the joint, and axis of the joint as the latent variable h ∈ H in Latent SSVM [62].”
BackgroundInfluentialLearning to Recognize Human Activities Using Soft Labels
Hu, N., Englebienne, G., Lou, Z., & Krose, B. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2621761 · Cited by 29
Metadata
- Authors
- Yu, C.-N. J., & Joachims, T.
- Venue
- Proceedings of the 26th Annual International Conference on Machine Learning
- Publisher
- ACM
- Published
- 2009-06-14
- Pages
- 1169-1176
- OpenAlex
- W2147196093
- Cited by
- 610
- References
- 23
- FWCI
- 31.26
- 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.