메뉴 건너뛰기




Volumn , Issue , 2015, Pages 273-279

An empirical analysis of optimization for max-margin NLP

Author keywords

[No Author keywords available]

Indexed keywords

COREFERENCE; DUAL METHOD; EMPIRICAL ANALYSIS; ONLINE OPTIMIZATION; OPTIMIZATION METHOD; SUBGRADIENT DESCENT;

EID: 84959929945     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.18653/v1/d15-1032     Document Type: Conference Paper
Times cited : (19)

References (34)
  • 5
    • 84860663465 scopus 로고    scopus 로고
    • Hope and fear for discriminative training of statistical translation models
    • April
    • David Chiang. 2012. Hope and fear for discriminative training of statistical translation models. Journal of Machine Learning Research, 13(1):1159-1187, April.
    • (2012) Journal of Machine Learning Research , vol.13 , Issue.1 , pp. 1159-1187
    • Chiang, D.1
  • 6
    • 0000666661 scopus 로고
    • On the shortest arborescence of a directed graph
    • Yoeng-jin Chu and Tseng-hong Liu. 1965. On the shortest arborescence of a directed graph. Science Sinica, pages 1396-1400.
    • (1965) Science Sinica , pp. 1396-1400
    • Chu, Y.-J.1    Liu, T.-H.2
  • 7
    • 50949133940 scopus 로고    scopus 로고
    • Exponentiated gradient algorithms for conditional random fields and max-margin markov networks
    • June
    • Michael Collins, Amir Globerson, Terry Koo, Xavier Carreras, and Peter L. Bartlett. 2008. Exponentiated gradient algorithms for conditional random fields and max-margin markov networks. Journal of Machine Learning Research, 9:1775-1822, June.
    • (2008) Journal of Machine Learning Research , vol.9 , pp. 1775-1822
    • Collins, M.1    Globerson, A.2    Koo, T.3    Carreras, X.4    Bartlett, P.L.5
  • 9
    • 0141496132 scopus 로고    scopus 로고
    • Ultraconservative online algorithms for multiclass problems
    • March
    • Koby Crammer and Yoram Singer. 2003. Ultraconservative online algorithms for multiclass problems. Journal of Machine Learning Research, 3:951-991, March.
    • (2003) Journal of Machine Learning Research , vol.3 , pp. 951-991
    • Crammer, K.1    Singer, Y.2
  • 10
    • 77953779843 scopus 로고    scopus 로고
    • Overview of the TAC 2008 update summarization task
    • Hoa Trang Dang and Karolina Owczarzak. 2008. Overview of the TAC 2008 update summarization task. In Text Analysis Conference.
    • (2008) Text Analysis Conference
    • Dang, H.T.1    Owczarzak, K.2
  • 12
    • 80052250414 scopus 로고    scopus 로고
    • Adaptive subgradient methods for online learning and stochastic optimization
    • July
    • John Duchi, Elad Hazan, and Yoram Singer. 2011. Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 12:2121-2159, July.
    • (2011) Journal of Machine Learning Research , vol.12 , pp. 2121-2159
    • Duchi, J.1    Hazan, E.2    Singer, Y.3
  • 16
    • 84959886197 scopus 로고    scopus 로고
    • Technical report, Carnegie Mellon University, June
    • Chris Dyer. 2013. Notes on AdaGrad. Technical report, Carnegie Mellon University, June.
    • (2013) Notes on AdaGrad
    • Dyer, C.1
  • 18
  • 19
    • 0033281425 scopus 로고    scopus 로고
    • Large margin classification using the perceptron algorithm
    • December
    • Yoav Freund and Robert E. Schapire. 1999. Large margin classification using the perceptron algorithm. Machine Learning, 37(3):277-296, December.
    • (1999) Machine Learning , vol.37 , Issue.3 , pp. 277-296
    • Freund, Y.1    Schapire, R.E.2
  • 23
    • 33646887390 scopus 로고
    • On the limited memory BFGS method for large scale optimization
    • December
    • D. C. Liu and J. Nocedal. 1989. On the limited memory BFGS method for large scale optimization. Mathematical Programming, 45(3):503-528, December.
    • (1989) Mathematical Programming , vol.45 , Issue.3 , pp. 503-528
    • Liu, D.C.1    Nocedal, J.2
  • 24
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The penn treebank
    • Mitchell P. Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. 1993. Building a large annotated corpus of english: the penn treebank. Computational Linguistics, 19(2):313-330.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Marcinkiewicz, M.A.2    Santorini, B.3
  • 27
    • 0003120218 scopus 로고    scopus 로고
    • Fast training of support vector machines using sequential minimal optimization
    • Bernhard Scholkopf, Christopher J. C. Burges, and Alexander J. Smöla, editors, MIT Press
    • John C. Piatt. 1999. Fast training of support vector machines using sequential minimal optimization. In Bernhard Scholkopf, Christopher J. C. Burges, and Alexander J. Smöla, editors, Advances in Kernel Methods, pages 185-208. MIT Press.
    • (1999) Advances in Kernel Methods , pp. 185-208
    • Piatt, J.C.1
  • 30
    • 84873691280 scopus 로고    scopus 로고
    • Synthesis Lectures on Human Language Technologies. Morgan and Claypool
    • Noah A. Smith. 2011. Linguistic Structure Prediction. Synthesis Lectures on Human Language Technologies. Morgan and Claypool.
    • (2011) Linguistic Structure Prediction
    • Smith, N.A.1
  • 34
    • 84905272120 scopus 로고    scopus 로고
    • ADADELTA: An adaptive learning rate method
    • 1212.5701
    • Matthew D. Zeiler. 2012. ADADELTA: an adaptive learning rate method. CoRR, abs/1212.5701.
    • (2012) CoRR
    • Zeiler, M.D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.