The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A comparison of algorithms for maximum entropy parameter estimation
Open accessAbstract
Conditional maximum entropy (ME) models provide a general purpose machine learning technique which has been successfully applied to fields as diverse as computer vision and econometrics, and which is used for a wide variety of classification problems in natural language processing. However, the flexibility of ME models is not without cost. While parameter estimation for ME models is conceptually straightforward, in practice ME models for typical natural language tasks are very large, and may well contain many thousands of free parameters. In this paper, we consider a number of algorithms for estimating the parameters of ME models, including iterative scaling, gradient ascent, conjugate gradient, and variable metric methods. Sur-prisingly, the standardly used iterative scaling algorithms perform quite poorly in comparison to the others, and for all of the test problems, a limited-memory variable metric algorithm outperformed the other choices.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Benchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
A maximum entropy approach to natural language processing
Berger, A. L., Pietra, V. J. D., & Pietra, S. A. D. (1996) · doi:10.5555/234285.234289 · Cited by 3,065
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
Shewchuk, J. R. (1994) · Cited by 2,173
Efficient Management of Parallelism in Object-Oriented Numerical Software Libraries
Balay, S., Gropp, W. D., McInnes, L. C., & Smith, B. F. (1997) · Modern Software Tools for Scientific Computing · doi:10.1007/978-1-4612-1986-6_8 · Cited by 2,009
Balay, S., Abhyankar, S. G., Adams, M. F., Brown, J., Brune, P., Buschelman, K., Dalcín, L., Dener, A., Eijkhout, Gropp, W., et al. (2019) · Cited by 1,967
Deming, W. E., & Stephan, F. F. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731829 · Cited by 1,537
Generalized Iterative Scaling for Log-Linear Models
Darroch, J. N., & Ratcliff, D. (1972) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177692379 · Cited by 1,206
Inducing features of random fields
Della Pietra, S., Della Pietra, V., & Lafferty, J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.588021 · Cited by 1,036
Maximum entropy models for natural language ambiguity resolution
Ratnaparkhi, A., & Marcus, M. P. (1998) · Scholarly Commons (University of Pennsylvania) · Cited by 422
Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency Tables
Good, I. J. (1963) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704014 · Cited by 392
Algorithms for maximum-likelihood logistic regression
Minka, T. P. (2018) · Figshare · doi:10.1184/r1/6586418 · Cited by 91
Equivalence of Gauss's Principle and Minimum Discrimination Information Estimation of Probabilities
Campbell, L. L. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177696977 · Cited by 55
Cluster Expansions and Iterative Scaling for Maximum Entropy Language Models
Lafferty, J., & Suhm, B. (1996) · Springer eBooks · doi:10.1007/978-94-011-5430-7_23 · Cited by 20
Shallow parsing using noisy and non-stationary training material
Osborne, M. (2002) · Cited by 16
Cited by
A maximum entropy approach to species distribution modeling
Phillips, S. J., Dudík, M., & Schapire, R. E. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015412 · Cited by 2,252
Shallow parsing with conditional random fields
Sha, F., & Pereira, F. (2003) · Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - NAACL '03 · doi:10.3115/1073445.1073473 · Cited by 1,246
McCallum, A., & Li, W. (2003) · Proceedings of the seventh conference on Natural language learning at HLT-NAACL 2003 - · doi:10.3115/1119176.1119206 · Cited by 1,160
Coarse-to-fine n-best parsing and MaxEnt discriminative reranking
Charniak, E., & Johnson, M. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219862 · Cited by 872
Domain Adaptation for Statistical Classifiers
Daume III, H., & Marcu, D. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1872 · Cited by 816
Metadata
- Authors
- Malouf, R.
- Venue
- proceeding of the 6th conference on Natural language learning - COLING-02
- Published
- 2002
- Volume
- 20
- Pages
- 1-7
- OpenAlex
- W2102667697
- Cited by
- 655
- References
- 17
- FWCI
- 28.27
- Type
- conference paper
- Language
- en
- Open access
- gold
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
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.