Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stochastic variation of the composite likelihood function. We prove the consistency of the estimators, provide formulas for their asymptotic variance and computational complexity, and discuss experimental results in the context of Boltzmann machines and conditional random fields. The theoretical and experimental studies demonstrate the effectiveness of the estimators in achieving a predefined balance between computational complexity and statistical accuracy.
Statistical and Computational Tradeoffs in Stochastic Composite Likelihood
Published 2009 in International Conference on Artificial Intelligence and Statistics
ABSTRACT
PUBLICATION RECORD
- Publication year
2009
- Venue
International Conference on Artificial Intelligence and Statistics
- Publication date
2009-04-15
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-20 of 20 references · Page 1 of 1
CITED BY
Showing 1-17 of 17 citing papers · Page 1 of 1