The DOI matches its Crossref record.
Piecewise pseudolikelihood for efficient training of conditional random fields
Open accessAbstract
Discriminative training of graphical models can be expensive if the variables have large cardinality, even if the graphical structure is tractable. In such cases, pseudolikelihood is an attractive alternative, because its running time is linear in the variable cardinality, but on some data its accuracy can be poor. Piecewise training (Sutton & McCallum, 2005) can have better accuracy but does not scale as well in the variable cardinality. In this paper, we introduce piecewise pseudolikelihood, which retains the computational efficiency of pseudolikelihood but can have much better accuracy. On several benchmark NLP data sets, piecewise pseudolikelihood has better accuracy than standard pseudolikelihood, and in many cases nearly equivalent to maximum likelihood, with five to ten times less training time than batch CRF training.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
SMOTE for high-dimensional class-imbalanced data
Blagus, R., & Lusa, L. (2013) · BMC Bioinformatics · doi:10.1186/1471-2105-14-106 · Cited by 1,106
Learning multiple layers of representation
Hinton, G. E. (2007) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2007.09.004 · Cited by 1,011
Image Classification Using Super-Vector Coding of Local Image Descriptors
Zhou, X., Yu, K., Zhang, T., & Huang, T. S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15555-0_11 · Cited by 499
An instance level analysis of data complexity
Smith, M. R., Martinez, T., & Giraud-Carrier, C. (2014) · Machine Learning · doi:10.1007/s10994-013-5422-z · Cited by 436
Conditional random fields for activity recognition
Vail, D. L., Veloso, M. M., & Lafferty, J. D. (2007) · Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems · doi:10.1145/1329125.1329409 · Cited by 357
Metadata
- Authors
- Sutton, C., & McCallum, A.
- Venue
- Proceedings of the 24th international conference on Machine learning
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 863-870
- OpenAlex
- W2161653775
- Cited by
- 163
- References
- 0
- FWCI
- 11.28
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Piecewise pseudolikelihood for efficient training of conditional random fields. https://app.cochat.ai/papers/10.1145/1273496.1273605
- The paper
- Sutton, C., & McCallum, A. (2007). Piecewise pseudolikelihood for efficient training of conditional random fields. Proceedings of the 24th international conference on Machine learning. https://doi.org/10.1145/1273496.1273605
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.