ACM Home Page
Please provide us with feedback. Feedback
An asymptotic analysis of generative, discriminative, and pseudolikelihood estimators
Full text PdfPdf (314 KB)
Source ICML; Vol. 307 archive
Proceedings of the 25th international conference on Machine learning table of contents
Helsinki, Finland
Pages 584-591  
Year of Publication: 2008
ISBN:978-1-60558-205-4
Authors
Percy Liang  University of California, Berkeley, CA
Michael I. Jordan  University of California, Berkeley, CA
Sponsors
: Yahoo!
: Xerox
IBM : IBM
: NSF
Microsoft Research : Microsoft Research
: Machine Learning Journal/Springer
: Pascal
: University of Helsinki
: Federation of Finnish Learned Societies
: Intel Corporation
: Google
: Helsinki Institute for Information Technology
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 25,   Downloads (12 Months): 67,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1390156.1390230
What is a DOI?

ABSTRACT

Statistical and computational concerns have motivated parameter estimators based on various forms of likelihood, e.g., joint, conditional, and pseudolikelihood. In this paper, we present a unified framework for studying these estimators, which allows us to compare their relative (statistical) efficiencies. Our asymptotic analysis suggests that modeling more of the data tends to reduce variance, but at the cost of being more sensitive to model misspecification. We present experiments validating our analysis.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Besag, J. (1975). The analysis of non-lattice data. The Statistician, 24, 179--195.
 
2
Bouchard, G., & Triggs, B. (2004). The trade-off between generative and discriminative classifiers. International Conference on Computational Statistics (pp. 721--728).
 
3
 
4
 
5
Liang, P., Klein, D., & Jordan, M. I. (2008). Agreement-based learning. Advances in Neural Information Processing Systems (NIPS).
 
6
Lindsay, B. (1988). Composite likelihood methods. Contemporary Mathematics, 80, 221--239.
 
7
McCallum, A., Pal, C., Druck, G., & Wang, X. (2006). Multi-conditional learning: Generative/discriminative training for clustering and classification. Association for the Advancement of Artificial Intelligence (AAAI).
 
8
Ng, A. Y., & Jordan, M. I. (2002). On discriminative vs. generative classifiers: A comparison of logistic regression and naive Bayes. Advances in Neural Information Processing Systems (NIPS).
 
9
Sutton, C., & McCallum, A. (2005). Piecewise training of undirected models. Uncertainty in Artificial Intelligence (UAI).
 
10
van der Vaart, A. W. (1998). Asymptotic Statistics. Cambridge University Press.
 
11
Varin, C. (2008). On composite marginal likelihoods. Advances in Statistical Analysis, 92, 1--28.
 
12
 
13
Wainwright, M., Jaakkola, T., & Willsky, A. (2003). Treereweighted belief propagation algorithms and approximate ML estimation by pseudo-moment matching. Artificial Intelligence and Statistics (AISTATS).
 
14
Wainwright, M., & Jordan, M. I. (2003). Graphical models, exponential families, and variational inference (Technical Report). Department of Statistics, University of California at Berkeley.

Collaborative Colleagues:
Percy Liang: colleagues
Michael I. Jordan: colleagues