Deep Dominance - How to Properly Compare Deep Neural Models
暂无分享,去创建一个
[1] B. L. Welch. The generalisation of student's problems when several different population variances are involved. , 1947, Biometrika.
[2] H. B. Mann,et al. On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other , 1947 .
[3] Sabine Buchholz,et al. Introduction to the CoNLL-2000 Shared Task Chunking , 2000, CoNLL/LLL.
[4] Beatrice Santorini,et al. Building a Large Annotated Corpus of English: The Penn Treebank , 1993, CL.
[5] Erik F. Tjong Kim Sang,et al. Introduction to the CoNLL-2003 Shared Task: Language-Independent Named Entity Recognition , 2003, CoNLL.
[6] Iryna Gurevych,et al. Why Comparing Single Performance Scores Does Not Allow to Draw Conclusions About Machine Learning Approaches , 2018, ArXiv.
[7] Jürgen Schmidhuber,et al. Long Short-Term Memory , 1997, Neural Computation.
[8] Eduard H. Hovy,et al. End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRF , 2016, ACL.
[9] Iryna Gurevych,et al. Optimal Hyperparameters for Deep LSTM-Networks for Sequence Labeling Tasks , 2017, ArXiv.
[10] Ian W McKeague,et al. Empirical likelihood-based tests for stochastic ordering. , 2013, Bernoulli : official journal of the Bernoulli Society for Mathematical Statistics and Probability.
[11] J. A. Cuesta-Albertos,et al. Models for the Assessment of Treatment Improvement: The Ideal and the Feasible , 2016, 1612.01291.
[12] Surya Ganguli,et al. Identifying and attacking the saddle point problem in high-dimensional non-convex optimization , 2014, NIPS.
[13] James Pustejovsky,et al. SemEval-2013 Task 1: TempEval-3: Evaluating Time Expressions, Events, and Temporal Relations , 2013, *SEMEVAL.
[14] Iryna Gurevych,et al. Reporting Score Distributions Makes a Difference: Performance Study of LSTM-networks for Sequence Tagging , 2017, EMNLP.
[15] J. A. Cuesta-Albertos,et al. An Optimal Transportation Approach for Assessing Almost Stochastic Order , 2017, 1705.01788.
[16] Rotem Dror,et al. The Hitchhiker’s Guide to Testing Statistical Significance in Natural Language Processing , 2018, ACL.
[17] Oren Etzioni,et al. Named Entity Recognition in Tweets: An Experimental Study , 2011, EMNLP.
[18] Welch Bl. THE GENERALIZATION OF ‘STUDENT'S’ PROBLEM WHEN SEVERAL DIFFERENT POPULATION VARLANCES ARE INVOLVED , 1947 .
[19] Kuldip K. Paliwal,et al. Bidirectional recurrent neural networks , 1997, IEEE Trans. Signal Process..
[20] Christopher D. Manning,et al. Efficient, Feature-based, Conditional Random Field Parsing , 2008, ACL.
[21] Douglas A. Wolfe,et al. A Distribution-Free Test for Stochastic Ordering , 1976 .
[22] Yoshua Bengio,et al. Understanding the difficulty of training deep feedforward neural networks , 2010, AISTATS.
[23] Timothy Dozat,et al. Deep Biaffine Attention for Neural Dependency Parsing , 2016, ICLR.
[24] Rotem Dror,et al. Replicability Analysis for Natural Language Processing: Testing Significance with Multiple Datasets , 2017, TACL.
[25] Lukasz Kaiser,et al. Attention is All you Need , 2017, NIPS.
[26] Dan Klein,et al. Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network , 2003, NAACL.
[27] Jimmy Ba,et al. Adam: A Method for Stochastic Optimization , 2014, ICLR.
[28] Nitish Srivastava,et al. Dropout: a simple way to prevent neural networks from overfitting , 2014, J. Mach. Learn. Res..
[29] Steven Bethard,et al. A Survey on Recent Advances in Named Entity Recognition from Deep Learning models , 2018, COLING.
[30] Guillaume Lample,et al. Neural Architectures for Named Entity Recognition , 2016, NAACL.
[31] Ari Rappoport,et al. A Transition-Based Directed Acyclic Graph Parser for UCCA , 2017, ACL.
[32] E. Lehmann. Ordered Families of Distributions , 1955 .