Chun-Nam John Yu
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.
- Bailey, T., & Elkan, C. (1995). Unsupervised Learning of Multiple Motifs in Biopolymers Using Expectation Maximization. Machine Learning, 21, 51--80. Google Scholar
Digital Library
- Cao, Z., Qin, T., Liu, T., Tsai, M., & Li, H. (2007). Learning to rank: from pairwise approach to listwise approach. Proc. of the Int. Conf. on Mach. Learn. (pp. 129--136). Google ScholarDigital Library
- Chapelle, O., Do, C., Le, Q., Smola, A., & Teo, C. (2008). Tighter bounds for structured estimation. Adv. in Neural Inf. Process. Syst. (pp. 281--288).Google Scholar
- Collobert, R., Sinz, F., Weston, J., & Bottou, L. (2006). Trading convexity for scalability. Proc. of the Int. Conf. on Mach. Learn. (pp. 201--208). Google ScholarDigital Library
- Felzenszwalb, P., McAllester, D., & Ramanan, D. (2008). A Discriminatively Trained, Multiscale, Deformable Part Model. Proc. Computer Vision and Pattern Recognition Conf. (pp. 1--8).Google ScholarCross Ref
- Finley, T., & Joachims, T. (2005). Supervised clustering with support vector machines. Proc. of the Int. Conf. on Mach. Learn. (p. 217). Google ScholarDigital Library
- Herbrich, R., Graepel, T., & Obermayer, K. (2000). Large margin rank boundaries for ordinal regression. In Advances in large margin classifiers, chapter 7, 115--132. MIT Press.Google Scholar
- Joachims, T. (2002). Optimizing search engines using clickthrough data. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining (pp. 133--142). Google ScholarDigital Library
- Joachims, T., Finley, T., & Yu, C. (To appear). Cutting-plane training of structural SVMs. Machine Learning. Google ScholarDigital Library
- Kiwiel, K. (1990). Proximity control in bundle methods for convex nondifferentiable minimization. Mathematical Programming, 46, 105--122. Google ScholarDigital Library
- Liu, T., Xu, J., Qin, T., Xiong, W., & Li, H. (2007). LETOR: Benchmark dataset for research on learning to rank for information retrieval. SIGIR Workshop on Learning to Rank for Information Retrieval.Google ScholarCross Ref
- Ng, P., & Keich, U. (2008). GIMSAN: a Gibbs motif finder with significance analysis. Bioinformatics, 24, 2256. Google ScholarDigital Library
- Ng, V., & Cardie, C. (2002). Improving machine learning approaches to coreference resolution. Proc. of Assoc. for Computational Linguistics (p. 104). Google ScholarDigital Library
- Petrov, S., & Klein, D. (2007). Discriminative Log-Linear Grammars with Latent Variables. Adv. in Neural Inf. Process. Syst. (p. 1153).Google Scholar
- Smola, A., Vishwanathan, S., & Hofmann, T. (2005). Kernel methods for missing variables. Proc. of the Int. Conf. on Artif. Intell. and Stat. (p. 325).Google Scholar
- Taskar, B., Guestrin, C., & Koller, D. (2003). Max-margin Markov networks. Adv. in Neural Inf. Process. Syst. (p. 51).Google Scholar
- Tsochantaridis, I., Hofmann, T., Joachims, T., & Altun, Y. (2004). Support vector machine learning for interdependent and structured output spaces. Proc. of the Int. Conf. on Mach. Learn. (p. 104). Google ScholarDigital Library
- Vilain, M., Burger, J., Aberdeen, J., Connolly, D., & Hirschman, L. (1995). A model-theoretic coreference scoring scheme. Proceedings of the 6th conference on Message understanding (pp. 45--52). Google ScholarDigital Library
- Wang, S., Quattoni, A., Morency, L., Demirdjian, D., & Darrell, T. (2006). Hidden Conditional Random Fields for Gesture Recognition. Proc. Computer Vision and Pattern Recognition Conf. (p. 1521). Google ScholarDigital Library
- Wang, Y., & Mori, G. (2008). Max-margin hidden conditional random fields for human action recognition (Technical Report TR 2008--21). School of Computing Science, Simon Fraser University.Google Scholar
- Yuille, A., & Rangarajan, A. (2003). The Concave-Convex Procedure. Neural Computation, 15, 915. Google ScholarDigital Library
- Zien, A., Brefeld, U., & Scheffer, T. (2007). Trans-ductive support vector machines for structured variables. Proc. of the Int. Conf. on Mach. Learn. (pp. 1183--1190). Google ScholarDigital Library
Index Terms
- Learning structural SVMs with latent variables
Recommendations
Latent Dirichlet learning for document summarization
ICASSP '09: Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal ProcessingAutomatic summarization is developed to extract the representative contents or sentences from a large corpus of documents. This paper presents a new hierarchical representation of words, sentences and documents in a corpus, and infers the Dirichlet ...
Structural topic model for latent topical structure analysis
HLT '11: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1Topic models have been successfully applied to many document analysis tasks to discover topics embedded in text. However, existing topic models generally cannot capture the latent topical structures in documents. Since languages are intrinsically ...
Fine granular aspect analysis using latent structural models
ACL '12: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 2In this paper, we present a structural learning model for joint sentiment classification and aspect analysis of text at various levels of granularity. Our model aims to identify highly informative sentences that are aspect-specific in online custom ...
Comments