| { |
| "paper_id": "P02-1002", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T09:30:44.289921Z" |
| }, |
| "title": "Sequential Conditional Generalized Iterative Scaling", |
| "authors": [ |
| { |
| "first": "Joshua", |
| "middle": [], |
| "last": "Goodman", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Microsoft Research One Microsoft Way Redmond", |
| "location": { |
| "postCode": "98052", |
| "region": "WA" |
| } |
| }, |
| "email": "joshuago@microsoft.com" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "We describe a speedup for training conditional maximum entropy models. The algorithm is a simple variation on Generalized Iterative Scaling, but converges roughly an order of magnitude faster, depending on the number of constraints, and the way speed is measured. Rather than attempting to train all model parameters simultaneously, the algorithm trains them sequentially. The algorithm is easy to implement, typically uses only slightly more memory, and will lead to improvements for most maximum entropy problems.", |
| "pdf_parse": { |
| "paper_id": "P02-1002", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "We describe a speedup for training conditional maximum entropy models. The algorithm is a simple variation on Generalized Iterative Scaling, but converges roughly an order of magnitude faster, depending on the number of constraints, and the way speed is measured. Rather than attempting to train all model parameters simultaneously, the algorithm trains them sequentially. The algorithm is easy to implement, typically uses only slightly more memory, and will lead to improvements for most maximum entropy problems.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "Conditional Maximum Entropy models have been used for a variety of natural language tasks, including Language Modeling (Rosenfeld, 1994) , partof-speech tagging, prepositional phrase attachment, and parsing (Ratnaparkhi, 1998) , word selection for machine translation (Berger et al., 1996) , and finding sentence boundaries (Reynar and Ratnaparkhi, 1997) . Unfortunately, although maximum entropy (maxent) models can be applied very generally, the typical training algorithm for maxent, Generalized Iterative Scaling (GIS) (Darroch and Ratcliff, 1972) , can be extremely slow. We have personally used up to a month of computer time to train a single model. There have been several attempts to speed up maxent training (Della Pietra et al., 1997; Wu and Khudanpur, 2000; Goodman, 2001 ). However, as we describe later, each of these has suffered from applicability to a limited number of applications. Darroch and Ratcliff (1972) describe GIS for joint probabilities, and mention a fast variation, which appears to have been missed by the conditional maxent community. We show that this fast variation can also be used for conditional probabilities, and that it is useful for a larger range of problems than traditional speedup techniques. It achieves good speedups for all but the simplest models, and speedups of an order of magnitude or more for typical problems. It has only one disadvantage: when there are many possible output values, the memory needed is prohibitive. By combining this technique with another speedup technique (Goodman, 2001) , this disadvantage can be eliminated.", |
| "cite_spans": [ |
| { |
| "start": 119, |
| "end": 136, |
| "text": "(Rosenfeld, 1994)", |
| "ref_id": "BIBREF15" |
| }, |
| { |
| "start": 207, |
| "end": 226, |
| "text": "(Ratnaparkhi, 1998)", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 268, |
| "end": 289, |
| "text": "(Berger et al., 1996)", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 324, |
| "end": 354, |
| "text": "(Reynar and Ratnaparkhi, 1997)", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 523, |
| "end": 551, |
| "text": "(Darroch and Ratcliff, 1972)", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 718, |
| "end": 745, |
| "text": "(Della Pietra et al., 1997;", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 746, |
| "end": 769, |
| "text": "Wu and Khudanpur, 2000;", |
| "ref_id": "BIBREF16" |
| }, |
| { |
| "start": 770, |
| "end": 783, |
| "text": "Goodman, 2001", |
| "ref_id": "BIBREF8" |
| }, |
| { |
| "start": 901, |
| "end": 928, |
| "text": "Darroch and Ratcliff (1972)", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 1533, |
| "end": 1548, |
| "text": "(Goodman, 2001)", |
| "ref_id": "BIBREF8" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Conditional maxent models are of the form", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "P (y|x) = exp i \u03bb i f i (x, y) y exp i \u03bb i f i (x, y )", |
| "eq_num": "(1)" |
| } |
| ], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "where x is an input vector, y is an output, the f i are the so-called indicator functions or feature values that are true if a particular property of x, y is true, and \u03bb i is a weight for the indicator f i . For instance, if trying to do word sense disambiguation for the word \"bank\", x would be the context around an occurrence of the word; y would be a particular sense, e.g. financial or river; f i (x, y) could be 1 if the context includes the word \"money\" and y is the financial sense; and \u03bb i would be a large positive number. Maxent models have several valuable properties. The most important is constraint satisfaction. For a given f i , we can count how many times f i was observed in the training data, observed[i] = j f i (x j , y j ). For a model P \u03bb with parameters \u03bb, we can see how many times the model predicts that f i would be expected: expected[i] = j,y P \u03bb (y|x j )f i (x j , y). Maxent models have the property that expected[i] = observed [i] for all i. These equalities are called constraints. An additional property is that, of models in the form of Equation 1, the maxent model maximizes the probability of the training data. Yet another property is that maxent models are as close as possible to the uniform distribution, subject to constraint satisfaction.", |
| "cite_spans": [ |
| { |
| "start": 960, |
| "end": 963, |
| "text": "[i]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Maximum entropy models are most commonly learned using GIS, which is actually a very simple algorithm. At each iteration, a step is taken in a direction that increases the likelihood of the training data. The step size is guaranteed to be not too large and not too small: the likelihood of the training data increases at each iteration and eventually converges to the global optimum. Unfortunately, this guarantee comes at a price: GIS takes a step size inversely proportional to the maximum number of active constraints. Maxent models are interesting precisely because of their ability to combine many different kinds of information, so this weakness of GIS means that maxent models are slow to learn precisely when they are most useful.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "We will describe a variation on GIS that works much faster. Rather than learning all parameters of the model simultaneously, we learn them sequentially: one, then the next, etc., and then back to the beginning. The new algorithm converges to the same point as the original one. This sequential learning would not lead to much, if any, improvement, except that we also show how to cache subcomputations. The combination leads to improvements of an order of magnitude or more.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "We begin by describing the classic GIS algorithm. Recall that GIS converges towards a model in which, for each f i , expected[i] = observed [i] . Whenever they are not equal, we can move them closer. One simple idea is to just add log observed[i]/expected[i] to \u03bb i . The problem with this is that it ignores the interaction with other \u03bbs. If updates to other \u03bbs made on the same iteration of GIS have a similar effect, we could easily go too far, and even make things worse. GIS introduces a slowing factor, f # , equal to the largest total value of f i : f # = max j,y i f i (x j , y). Next, GIS computes an update:", |
| "cite_spans": [ |
| { |
| "start": 140, |
| "end": 143, |
| "text": "[i]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "\u03b4 i = log observed[i]/expected[i] f #", |
| "eq_num": "(2)" |
| } |
| ], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "We then add \u03b4 i to \u03bb i . This update provably converges to the global optimum. GIS for joint models was given by Darroch and Ratcliff (1972) ; the conditional version is due to Brown et al. (Unpublished), as described by Rosenfeld (1994) . In practice, we use the pseudocode of Figure 1 . 1 We will write I for the number of training instances, 1 Many published versions of the GIS algorithm require inclusion of a \"slack\" indicator function so that the same number of constraints always applies. In practice it is only necessary that the total of the indicator functions be bounded by f # , not necessarily equal to it. Alternatively, one can see this as including the slack indicator, but fixing the corresponding \u03bb to 0, and expected[0..F ] = 0 for each training instance j for each output y s [j, y] [j,y] for each output y j,y] /z and F for number of indicator functions; we use Y for the number of output classes (values for y). We assume that we keep a data structure listing, for each training instance x j and each value y, the i such that", |
| "cite_spans": [ |
| { |
| "start": 113, |
| "end": 140, |
| "text": "Darroch and Ratcliff (1972)", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 221, |
| "end": 237, |
| "text": "Rosenfeld (1994)", |
| "ref_id": "BIBREF15" |
| }, |
| { |
| "start": 345, |
| "end": 346, |
| "text": "1", |
| "ref_id": null |
| }, |
| { |
| "start": 797, |
| "end": 803, |
| "text": "[j, y]", |
| "ref_id": null |
| }, |
| { |
| "start": 804, |
| "end": 809, |
| "text": "[j,y]", |
| "ref_id": null |
| }, |
| { |
| "start": 828, |
| "end": 832, |
| "text": "j,y]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 278, |
| "end": 286, |
| "text": "Figure 1", |
| "ref_id": "FIGREF0" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": ":= 0 for each i such that f i (x j , y) = 0 s[j, y] += \u03bb i \u00d7 f i (x j , y) z := y e s", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "for each i such that f i (x j , y) = 0 expected[i] += f i (x j , y) \u00d7 e s[", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "for each i \u03b4 i = 1 f # log observed[i] expected[i] \u03bb i + = \u03b4 i", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "f i (x j , y) = 0.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Now we can describe our variation on GIS. Basically, instead of updating all \u03bb's simultaneously, we will loop over each indicator function, and compute an update for that indicator function, in turn. In particular, the first change we make is that we exchange the outer loops over training instances and indicator functions. Notice that in order to do this efficiently, we also need to rearrange our data structures: while we previously assumed that the training data was stored as a sparse matrix of indicator functions with non-zero values for each instance, we now assume that the data is stored as a sparse matrix of instances with non-zero values for each indicator. The size of the two matrices is obviously the same.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The next change we make is to update each \u03bb i near the inner loop, immediately after expected[i] is computed, rather than after expected values for all features have been computed. If we update the features one at a time, then the meaning of f # changes. In the original version of GIS, f # is the largest total of all features. However, f # only needs to be the largest total of all the features being updated, and in not updating it, so that it can be ommitted from any equations; the proofs that GIS improves at each iteration and that there is a global optimum still hold. j,y] j,y] Figure 2: One Iteration of Sequential Conditional Generalized Iterative Scaling (SCGIS) this case, there is only one such feature. Thus, instead of f # , we use max j,y f i (x j , y). In many maxent applications, the f i take on only the values 0 or 1, and thus, typically, max j,y f i (x j , y) = 1. Therefore, instead of slowing by a factor of f # , there may be no slowing at all! We make one last change in order to get a speedup. Rather than recompute for each instance j and each output y, s [j, y] ", |
| "cite_spans": [ |
| { |
| "start": 577, |
| "end": 581, |
| "text": "j,y]", |
| "ref_id": null |
| }, |
| { |
| "start": 582, |
| "end": 586, |
| "text": "j,y]", |
| "ref_id": null |
| }, |
| { |
| "start": 1085, |
| "end": 1091, |
| "text": "[j, y]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "f i (x j , y) = 0 expected + = f i (x j , y) \u00d7 e s[", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "/z[j] \u03b4 i = 1 max j,y f i (x j ,y) log observed[i] expected[i] \u03bb i + = \u03b4 i for each output y for each instance j such that f i (x j , y) = 0 z[j] \u2212 = e s[j,y] s[j, y] += \u03b4 i z[j] += e s[", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "= i \u03bb i \u00d7 f i (x j , y)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": ", and the corresponding normalizing factors z = y e s [j,y] we instead keep these arrays computed as invariants, and incrementally update them whenever a \u03bb i changes. With this important change, we now get a substantial speedup. The code for this transformed algorithm is given in Figure 2 .", |
| "cite_spans": [ |
| { |
| "start": 54, |
| "end": 59, |
| "text": "[j,y]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 281, |
| "end": 289, |
| "text": "Figure 2", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The space of models in the form of Equation 1 is convex, with a single global optimum. Thus, GIS and SCGIS are guaranteed to converge towards the same point. For convergence proofs, see Darroch and Ratcliff (1972) , who prove convergence of the algorithm for joint models.", |
| "cite_spans": [ |
| { |
| "start": 186, |
| "end": 213, |
| "text": "Darroch and Ratcliff (1972)", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Algorithms", |
| "sec_num": "2" |
| }, |
| { |
| "text": "In this section, we analyze the time and space requirements for SCGIS compared to GIS. The space results depend on Y, the number of output classes. When Y is small, SCGIS requires only a small amount more space than GIS. Note that in Section 3, we describe a technique that, when there are many output classes, uses clustering to get both a speedup and to reduce the number of outputs, thus alleviating the space issues.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Typically for GIS, the training data is stored as a sparse matrix of size T of all non-zero indicator functions for each instance j and output y. The transposed matrix used by SCGIS is the same size T .", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "In order to make the relationship between GIS and SCGIS clearer, the algorithms in Figures 1 and 2 are given with some wasted space. For instance, the matrix s [j, y] of sums of \u03bbs only needs to be a simple array s [y] for GIS, but we wrote it as a matrix so that it would have the same meaning in both algorithms. In the space and time analyses, we will assume that such space-wasting techniques are optimized out before coding.", |
| "cite_spans": [ |
| { |
| "start": 160, |
| "end": 166, |
| "text": "[j, y]", |
| "ref_id": null |
| }, |
| { |
| "start": 215, |
| "end": 218, |
| "text": "[y]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Now we can analyze the space and time for GIS. GIS requires the training matrix, of size T , the \u03bbs, of size F , as well as the expected and observed arrays, which are also size F . Thus, GIS requires space O(T + F ). Since T must be at least as large as F (we can eliminate any indicator functions that don't appear in the training data), this is O(T ).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "SCGIS is potentially somewhat larger. SCGIS also needs to store the training data, albeit in a different form, but one that is also of size T . In particular, the matrix is interchanged so that its outermost index is over indicator functions, instead of training data. SCGIS also needs the observed and \u03bb arrays, both of size F , and the array z[j] of size I, and, more importantly, the full array s [j, y] , which is of size IY . In many problems, Y is small -often 2 -and IY is negligible, but in problems like language modeling, Y can be very large (60,000 or more). The overall space for SCGIS, O(T +IY ), is essentially the same as for GIS when Y is small, but much larger when Y is large -but see the optimization described in Section 3. Now, consider the time for each algorithm to execute one iteration. Assume that for every instance and output there is at least one non-zero indicator function, which is true in practice. Notice that for GIS, the top loops end up iterating over all non-zero indicator functions, for each output, for each training instance. In other words, they examine every entry in the training matrix T once, and thus require time T . The bottom loops simply require time F , which is smaller than T . Thus, GIS requires time O(T ).", |
| "cite_spans": [ |
| { |
| "start": 400, |
| "end": 406, |
| "text": "[j, y]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "For SCGIS, the top loops are also over each nonzero entry in the training data, which takes time O(T ). The bottom loops also require time O(T ). Thus, one iteration of SCGIS takes about as long as one iteration of GIS, and in practice in our im-plementation, each SCGIS iteration takes about 1.3 times as long as each GIS iteration. The speedup in SCGIS comes from the step size: the update in GIS is slowed by f # , while the update in SCGIS is not. Thus, we expect SCGIS to converge by up to a factor of f # faster. For many applications, f # can be large.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "The speedup from the larger step size is difficult to analyze rigorously, and it may not be obvious whether the speedup we in fact observe is actually due to the f # improvement or to the caching. Note that without the caching, each iteration of SCGIS would be O(f #) times slower than an iteration of GIS; the caching is certainly a key component. But with the caching, each iteration of SCGIS is still marginally slower than GIS (by a small constant factor). In Section 4, we in fact empirically observe that fewer iterations are required to achieve a given level of convergence, and this reduction is very roughly proportional to f #. Thus, the speedup does appear to be because of the larger step size. However, the exact speedup from the step size depends on many factors, including how correlated features are, and the order in which they are trained.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Although we are not aware of any problems where maxent training data does not fit in main memory, and yet the model can be learned in reasonable time, it is comforting that SCGIS, like GIS, requires sequential, not random, access to the training data. So, if one wanted to train a model using a large amount of data on disk or tape, this could still be done with reasonable efficiency, as long as the s and z arrays, for which we need random access, fit in main memory.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "All of these analyses have assumed that the training data is stored as a precomputed sparse matrix of the non-zero values for f i for each training instance for each output. In some applications, such as language modeling, this is not the case; instead, the f i are computed on the fly. However, with a bit of thought, those data structures also can be rearranged. Chen and Rosenfeld (1999) describe a technique for smoothing maximum entropy that is the best currently known. Maximum entropy models are naturally maximally smooth, in the sense that they are as close as possible to uniform, subject to satisfying the constraints. However, in practice, there may be enough constraints that the models are not nearly smooth enough -they overfit the training data. Chen and Rosenfeld describe a technique whereby a Gaussian prior on the parameters is assumed. The models no longer satisfy the constraints exactly, but work much better on test data. In particular, instead of attempting to maximize the probability of the training data, they maximize a slightly different objective function, the probability of the training data times the prior probability of the model:", |
| "cite_spans": [ |
| { |
| "start": 365, |
| "end": 390, |
| "text": "Chen and Rosenfeld (1999)", |
| "ref_id": "BIBREF4" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "arg max \u03bb J j=1 P \u03bb (y j |x j )P (\u03bb)", |
| "eq_num": "(3)" |
| } |
| ], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "where", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "P (\u03bb) = I i=1 1 \u221a 2\u03c0\u03c3 e \u2212 \u03bb 2 i 2\u03c3 2 .", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "In other words, the probability of the \u03bbs is a simple normal distribution with 0 mean, and a standard deviation of \u03c3.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Chen and Rosenfeld describe a modified update rule in which to find the updates, one solves for \u03b4 i in", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "observed[i] = expected[i] \u00d7 e \u03b4 i f # + \u03bb i + \u03b4 i \u03c3 2", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "SCGIS can be modified in a similar way to use an update rule in which one solves for \u03b4 i in", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "observed[i] = expected[i]\u00d7e \u03b4 i max j,y f i (x j ,y) + \u03bb i + \u03b4 i \u03c3 2", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Time and Space", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Although sequential updating was described for joint probabilities in the original paper on GIS by Darroch and Ratcliff (1972) , GIS with sequential updating for conditional models appears previously unknown. Note that in the NLP community, almost all maxent models have used conditional models (which are typically far more efficient to learn), and none to our knowledge has used this speedup. 2 There appear to be two main reasons this speedup has not been used before for conditional models. One issue is that for joint models, it turns out to be more natural to compute the sums s[x], while for conditional models, it is more natural to compute the \u03bbs and not store the sums s. Storing s is essential for our speedup. Also, one of the first and best known uses of conditional maxent models is for language modeling (Rosenfeld, 1994) , where the number of output classes is the vocabulary size, typically 5,000-60,000 words. For such applications, the array s [j, y] would be of a size at least 5000 times the number of training instances: clearly impractical (but see below for a recently discovered trick). Thus, it is unsurprising that this speedup was forgotten.", |
| "cite_spans": [ |
| { |
| "start": 99, |
| "end": 126, |
| "text": "Darroch and Ratcliff (1972)", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 819, |
| "end": 836, |
| "text": "(Rosenfeld, 1994)", |
| "ref_id": "BIBREF15" |
| }, |
| { |
| "start": 963, |
| "end": 969, |
| "text": "[j, y]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "There have been several previous attempts to speed up maxent modeling. Best known is the work of Della Pietra et al. (1997) , the Improved Iterative Scaling (IIS) algorithm. Instead of treating f # as a constant, we can treat it as a function of x j and y. In particular, let f # (x, y) = i f i (x, y) Then, solve numerically for \u03b4 i in the equation", |
| "cite_spans": [ |
| { |
| "start": 103, |
| "end": 123, |
| "text": "Pietra et al. (1997)", |
| "ref_id": "BIBREF7" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "observed[i] = (4) j,y P \u03bb (y|x j ) \u00d7 f i (x j , y) \u00d7 exp(\u03b4 i f # (x j , y))", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "Notice that in the special case where f # (x, y) is a constant f # , Equation 4 reduces to Equation 2. However, for training instances where f # (x j , y) < f # , the IIS update can take a proportionately larger step. Thus, IIS can lead to speedups when f # (x j , y) is substantially less than f # . It is, however, hard to think of applications where this difference is typically large. We only know of one limited experiment comparing IIS to GIS (Lafferty, 1995) . That experiment showed roughly a factor of 2 speedup. It should be noted that compared to GIS, IIS is much harder to implement efficiently. When solving Equation 4, one uses an algorithm such as Newton's method that repeatedly evaluates the function. Either one must repeatedly cycle through the training data to compute the right hand side of this equation, or one must use tricks such as bucketing by the values of f # (x j , y). The first option is inefficient and the second adds considerably to the complexity of the algorithm. Note that IIS and SCGIS can be combined by using an update rule where one solves for", |
| "cite_spans": [ |
| { |
| "start": 449, |
| "end": 465, |
| "text": "(Lafferty, 1995)", |
| "ref_id": "BIBREF11" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "observed[i] = (5) j,y P \u03bb (x j , y) \u00d7 f i (x j , y) \u00d7 exp(\u03b4 i f i (x j , y))", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "For many model types, the f i take only the values 1 or 0. In this case, Equation 5 reduces to the normal SCGIS update. Brown (1959) describes Iterative Scaling (IS), applied to joint probabilities, and Jelinek (1997, page 235) shows how to apply IS to conditional probabilities. For binary-valued features, without the caching trick, SCGIS is the same as the algorithm described by Jelinek. The advantage of SCGIS over IS is the caching -without which there is no speedup -and because it is a variation on GIS, it can be applied to non-binary valued features. Also, with SCGIS, it is clear how to apply other improvements such as the smoothing technique of Chen and Rosenfeld (1999) .", |
| "cite_spans": [ |
| { |
| "start": 120, |
| "end": 132, |
| "text": "Brown (1959)", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 203, |
| "end": 227, |
| "text": "Jelinek (1997, page 235)", |
| "ref_id": null |
| }, |
| { |
| "start": 658, |
| "end": 683, |
| "text": "Chen and Rosenfeld (1999)", |
| "ref_id": "BIBREF4" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "Several techniques have been developed specifically for speeding up conditional maxent models, especially when Y is large, such as language models, and space precludes a full discussion here. These techniques include unigram caching, cluster expansion (Lafferty et al., 2001; Wu and Khudanpur, 2000) , and word clustering (Goodman, 2001) . Of these, the best appears to be word clustering, which leads to up to a factor of 35 speedup, and which has an additional advantage: it allows the SCGIS speedup to be used when there are a large number of outputs.", |
| "cite_spans": [ |
| { |
| "start": 252, |
| "end": 275, |
| "text": "(Lafferty et al., 2001;", |
| "ref_id": "BIBREF10" |
| }, |
| { |
| "start": 276, |
| "end": 299, |
| "text": "Wu and Khudanpur, 2000)", |
| "ref_id": "BIBREF16" |
| }, |
| { |
| "start": 322, |
| "end": 337, |
| "text": "(Goodman, 2001)", |
| "ref_id": "BIBREF8" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "The word clustering speedup (which can be applied to almost any problem with many outputs, not just words) works as follows. Notice that in both GIS and in SCGIS, there are key loops over all outputs, y. Even with certain optimizations that can be applied, the length of these loops will still be bounded by, and often be proportional to, the number of outputs. We therefore change from a model of the form P (y|x) to modeling P (cluster(y)|x) \u00d7 P (y|x, cluster(y)). Consider a language model in which y is a word, x represents the words preceding y, and the vocabulary size is 10,000 words. Then for a model P (y|x), there are 10,000 outputs. On the other hand, if we create 100 word clusters, each with 100 words per cluster, then for a model P (cluster(y)|x), there are 100 outputs, and for a model P (y|x, cluster(y)) there are also 100 outputs. Thus, instead of training one model with a time proportional to 10,000, we train two models, each with time proportional to 100. Thus, in this example, there is a 50 times speedup. In practice, the speedups are not quite so large, but we do achieve speedups of up to a factor of 35. Although the model form learned is not exactly the same as the original model, the perplexity of the form using two models is actually marginally lower (better) than the perplexity of the form using a single model, so there does not seem to be any disadvantage to using it.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "The word clustering technique can be extended to use multiple levels. For instance, by putting words into superclusters, such as their part of speech, and clusters, such as semantically similar words of a given part of speech, one could use a three level model. In fact, the technique can be extended to up to log 2 Y levels with two outputs per level, meaning that the space requirements are proportional to 2 instead of to the original Y . Since SCGIS works by increasing the step size, and the cluster-based speedup works by increasing the speed of the inner loop (whchi SCGIS shares), we expect that the two techniques would complement each other well, and that the speedups would be nearly multiplicative. Very preliminary language modeling experiments are consistent with this analysis.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "There has been interesting recent unpublished work by Minka (2001) . While this work is very preliminary, and the experimental setting somewhat unrealistic (dense features artificially generated), especially for many natural language tasks, the results are dramatic enough to be worth noting. In particular, Minka found that a version of conjugate gradient descent worked extremely well -much faster than GIS. If the problem domain resembles Minka's, then conjugate gradient descent and related techniques are well worth trying, and it would be interesting to try these techniques for more realistic tasks.", |
| "cite_spans": [ |
| { |
| "start": 54, |
| "end": 66, |
| "text": "Minka (2001)", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "SCGIS turns out to be related to boosting. As shown by Collins et al. (2002) , boosting is in some ways a sequential version of maxent. The single largest difference between our algorithm and Collins'is that we update each feature in order, while Collins' algorithms select a (possibly new) feature to update. That algorithm also require more storage than our algorithm when data is sparse: fast implementations require storage of both the training data matrix (to compute which feature to update) and the transpose of the training data matrix (to perform the update efficiently.)", |
| "cite_spans": [ |
| { |
| "start": 55, |
| "end": 76, |
| "text": "Collins et al. (2002)", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Previous Work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "In this section, we give experimental results, showing that SCGIS converges up to an order of magnitude faster than GIS, or more, depending on the number of non-zero indicator functions, and the method of measuring performance.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental Results", |
| "sec_num": "4" |
| }, |
| { |
| "text": "There are at least three ways in which one could measure performance of a maxent model: the objective function optimized by GIS/SCGIS; the entropy on test data; and the percent correct on test data. The objective function for both SCGIS and GIS when smoothing is Equation 3: the probability of the training data times the probability of the model. The most interesting measure, the percent correct on test data, tends to be noisy.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental Results", |
| "sec_num": "4" |
| }, |
| { |
| "text": "For a test corpus, we chose to use exactly the same training, test, problems, and feature sets used by Banko and Brill (2001) . These problems consisted of trying to guess which of two confusable words, e.g. \"their\" or \"there\", a user intended. Banko and Brill chose this data to be representative of typical machine learning problems, and, by trying it across data sizes and different pairs of words, it exhibits a good deal of different behaviors. Banko and Brill used a standard set of features, including words within a window of 2, part-of-speech tags within a window of 2, pairs of word or tag features, and whether or not a given word occurred within a window of 9. Altogether, they had 55 feature types. That is, there were many thousands of features in the model (depending on the exact model), but at most 55 could be \"true\" for a given training or test instance.", |
| "cite_spans": [ |
| { |
| "start": 103, |
| "end": 125, |
| "text": "Banko and Brill (2001)", |
| "ref_id": "BIBREF0" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental Results", |
| "sec_num": "4" |
| }, |
| { |
| "text": "We examine the performance of SCGIS versus GIS across three different axes. The most important variable is the number of features. In addition to trying Banko and Brill's 55 feature types, we tried using feature sets with 5 feature types (words within a window of 2, plus the \"unigram\" feature) and 15 feature types (words within a window of 2, tags within a window of 2, the unigram, and pairs of words within a window of 2). We also tried not using smoothing, and we tried varying the training data size.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental Results", |
| "sec_num": "4" |
| }, |
| { |
| "text": "In Table 1 , we present a \"typical\" configuration, using 55 feature types, and 10 million words of training, and smoothing with a Gaussian prior. The first two columns show the different confusable words. Each column shows the ratio of how much longer (in terms of elapsed time) it takes GIS to achieve the same results as 10 iterations of SCGIS. An \"XXX\" denotes a case in which GIS did not achieve the performance level of SCGIS within 1000 iterations. (XXXs were not included in averages.) 3 The \"objec\" column shows the ratio of time to achieve the same value of the objective function (Equation 3); the \"ent\" column show the ratio of time to achieve the same test entropy; and the \"cor\" column shows the ratio of time to achieve the same test error rate. For all three measurements, the ratio can be up to a factor of 30, though the average is somewhat lower, and in two cases, GIS converged faster.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 3, |
| "end": 10, |
| "text": "Table 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experimental Results", |
| "sec_num": "4" |
| }, |
| { |
| "text": "In Table 2 we repeat the experiment, but without smoothing. On the objective function -which with no smoothing is just the training entropy -the increase from SCGIS is even larger. Table 2 : Same as baseline, except no smoothing criteria -test entropy and percentage correct -the increase from SCGIS is smaller than it was with smoothing, but still consistently large.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 3, |
| "end": 10, |
| "text": "Table 2", |
| "ref_id": null |
| }, |
| { |
| "start": 181, |
| "end": 188, |
| "text": "Table 2", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experimental Results", |
| "sec_num": "4" |
| }, |
| { |
| "text": "In Tables 3 and 4 , we show results with small and medium feature sets. As can be seen, the speedups with smaller features sets (5 feature types) are less than the speedups with the medium sized feature set (15 feature types), which are smaller than the baseline speedup with 55 features.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 3, |
| "end": 17, |
| "text": "Tables 3 and 4", |
| "ref_id": "TABREF2" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experimental Results", |
| "sec_num": "4" |
| }, |
| { |
| "text": "Notice that across all experiments, there were no cases where GIS converged faster than SCGIS on the objective function; two cases where it coverged faster on test data entropy; and 5 cases where it converged faster on test data correctness. The objective function measure is less noisy than test data entropy, and test data entropy is less noisy than test data error rate: the noisier the data, the more chance of an unexpected result. Thus, one possibility is that these cases are simply due to noise. Similarly, the four cases in which GIS never reached the test data objec ent cor accept except 6.0 4.8 3.7 affect effect 3.6 3.6 1.0 among between 5.8 1.0 0.7 its it's 8.7 5.6 3.3 peace piece 25.2 2.9 XXX principal principle 6.7 18.6 1.0 then than 6.9 6.7 9.6 their there 4.7 4.2 3.6 weather whether 2.2 6.5 7.5 your you're 7.6 3.4 16.8 Average 7.7 5.7 5.2 entropy of SCGIS and the four cases in which GIS never reached the test data error rate of SCGIS might also be attributable to noise. There is an alternative explanation that might be worth exploring. On a different data set, 20 newsgroups, we found that early stopping techniques were helpful, and that GIS and SCGIS benefited differently depending on the exact settings. It is possible that effects similar to the smoothing effect of early stopping played a role in both the XXX cases (in which SCGIS presumably benefited more from the effects) and in the cases where GIS beat SCGIS (in which cases GIS presumably benefited more.) Additional research would be required to determine which explanation -early stopping or noise -is correct, although we suspect both explanations apply in some cases.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental Results", |
| "sec_num": "4" |
| }, |
| { |
| "text": "We also ran experiments that were the same as the baseline experiment, except changing the training data size to 50 million words and to 1 million words. We found that the individual speedups were often different at the different sizes, but did not appear to be overall higher or lower or qualitatively different.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental Results", |
| "sec_num": "4" |
| }, |
| { |
| "text": "There are many reasons that maxent speedups are useful. First, in applications with active learning or parameter optimization or feature set selection, it may be necessary to run many rounds of maxent, making speed essential. There are other fast algorithms, such as Winnow, available, but in our experience, there are some problems where smoothed maxent models are better classifiers than Winnow. Furthermore, many other fast classification algorithms, including Winnow, do not output probabilities, which are useful for precision/recall curves, or when there is a non-equal tradeoff between false positives and false negatives, or when the output of the classifier is used as input to other models. Finally, there are many applications of maxent where huge amounts of data are available, such as for language modeling. Unfortunately, it has previously been very difficult to use maxent models for these types of experiments. For instance, in one language modeling experiment we performed, it took a month to learn a single model. Clearly, for models of this type, any speedup will be very helpful.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Overall, we expect this technique to be widely used. It leads to very significant speedups -up to an order of magnitude or more. It is very easy to implement -other than the need to transpose the training data matrix, and store an extra array, it is no more complex than standard GIS. It can be easily applied to any model type, although it leads to the largest speedups on models with more feature types. Since models with many interacting features are the type for which maxent models are most interesting, this is typical. It requires very few additional resources: unless there are a large number of output classes, it uses about as much space as standard GIS, and when there are a large number of output classes, it can be combined with our clustering speedup technique (Goodman, 2001) to get both additional speedups, and to reduce the space requirements. Thus, there appear to be no real impediments to its use, and it leads to large, broadly applicable gains.", |
| "cite_spans": [ |
| { |
| "start": 775, |
| "end": 790, |
| "text": "(Goodman, 2001)", |
| "ref_id": "BIBREF8" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Berger et al. (1996) use an algorithm that might appear sequential, but an examination of the definition of f # and related work shows that it is not.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "On a 1.7 GHz Pentium IV with 10,000,000 words training, and 5 feature types it took between .006 and .24 seconds per iteration of SCGIS, and between .004 and .18 seconds for GIS. With 55 feature types, it took between .05 and 1.7 seconds for SCGIS and between .03 and 1.2 seconds for GIS. Note that many experiments use much larger datasets or many more feature types; run time scales linearly with training data size.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [ |
| { |
| "text": "Thanks to Ciprian Chelba, Stan Chen, Chris Meek, and the anonymous reviewers for useful comments.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Acknowledgements", |
| "sec_num": null |
| } |
| ], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Mitigating the paucity of data problem", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Banko", |
| "suffix": "" |
| }, |
| { |
| "first": "E", |
| "middle": [], |
| "last": "Brill", |
| "suffix": "" |
| } |
| ], |
| "year": 2001, |
| "venue": "HLT", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "M. Banko and E. Brill. 2001. Mitigating the paucity of data problem. In HLT.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "A maximum entropy approach to natural language processing", |
| "authors": [ |
| { |
| "first": "Adam", |
| "middle": [ |
| "L" |
| ], |
| "last": "Berger", |
| "suffix": "" |
| }, |
| { |
| "first": "Stephen", |
| "middle": [ |
| "A" |
| ], |
| "last": "Della Pietra", |
| "suffix": "" |
| }, |
| { |
| "first": "Vincent", |
| "middle": [ |
| "J Della" |
| ], |
| "last": "Pietra", |
| "suffix": "" |
| } |
| ], |
| "year": 1996, |
| "venue": "Computational Linguistics", |
| "volume": "22", |
| "issue": "1", |
| "pages": "39--71", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Adam L. Berger, Stephen A. Della Pietra, and Vin- cent J. Della Pietra. 1996. A maximum entropy approach to natural language processing. Compu- tational Linguistics, 22(1):39-71.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Unpublished. Translation models using learned features and a generalized Csiszar algorithm", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [], |
| "last": "Brown", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Dellapietra", |
| "suffix": "" |
| }, |
| { |
| "first": "V", |
| "middle": [], |
| "last": "Dellapietra", |
| "suffix": "" |
| }, |
| { |
| "first": "R", |
| "middle": [], |
| "last": "Mercer", |
| "suffix": "" |
| }, |
| { |
| "first": "A", |
| "middle": [], |
| "last": "Nadas", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Roukos", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "P. Brown, S. DellaPietra, V. DellaPietra, R. Mercer, A. Nadas, and S. Roukos. Unpublished. Transla- tion models using learned features and a general- ized Csiszar algorithm. IBM research report.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "A note on approximations to probability distributions", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Brown", |
| "suffix": "" |
| } |
| ], |
| "year": 1959, |
| "venue": "Information and Control", |
| "volume": "2", |
| "issue": "", |
| "pages": "386--392", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "D. Brown. 1959. A note on approximations to prob- ability distributions. Information and Control, 2:386-392.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "A gaussian prior for smoothing maximum entropy models", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [ |
| "F" |
| ], |
| "last": "Chen", |
| "suffix": "" |
| }, |
| { |
| "first": "R", |
| "middle": [], |
| "last": "Rosenfeld", |
| "suffix": "" |
| } |
| ], |
| "year": 1999, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "S.F. Chen and R. Rosenfeld. 1999. A gaussian prior for smoothing maximum entropy models. Tech- nical Report CMU-CS-99-108, Computer Science Department, Carnegie Mellon University.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Logistic regression, adaboost and bregman distances", |
| "authors": [ |
| { |
| "first": "Michael", |
| "middle": [], |
| "last": "Collins", |
| "suffix": "" |
| }, |
| { |
| "first": "Robert", |
| "middle": [ |
| "E" |
| ], |
| "last": "Schapire", |
| "suffix": "" |
| }, |
| { |
| "first": "Yoram", |
| "middle": [], |
| "last": "Singer", |
| "suffix": "" |
| } |
| ], |
| "year": 2002, |
| "venue": "Machine Learning", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Michael Collins, Robert E. Schapire, and Yoram Singer. 2002. Logistic regression, adaboost and bregman distances. Machine Learning, 48.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Generalized iterative scaling for log-linear models", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [ |
| "N" |
| ], |
| "last": "Darroch", |
| "suffix": "" |
| }, |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Ratcliff", |
| "suffix": "" |
| } |
| ], |
| "year": 1972, |
| "venue": "The Annals of Mathematical Statistics", |
| "volume": "43", |
| "issue": "", |
| "pages": "1470--1480", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "J.N. Darroch and D. Ratcliff. 1972. Generalized it- erative scaling for log-linear models. The Annals of Mathematical Statistics, 43:1470-1480.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Inducing features of random fields", |
| "authors": [ |
| { |
| "first": "Vincent", |
| "middle": [ |
| "Della" |
| ], |
| "last": "Stephen Della Pietra", |
| "suffix": "" |
| }, |
| { |
| "first": "John", |
| "middle": [], |
| "last": "Pietra", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Lafferty", |
| "suffix": "" |
| } |
| ], |
| "year": 1997, |
| "venue": "IEEE Transactions on Pattern Analysis and Machine Intelligence", |
| "volume": "19", |
| "issue": "4", |
| "pages": "380--393", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Stephen Della Pietra, Vincent Della Pietra, and John Lafferty. 1997. Inducing features of random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(4):380-393, April.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Classes for fast maximum entropy training", |
| "authors": [ |
| { |
| "first": "Joshua", |
| "middle": [], |
| "last": "Goodman", |
| "suffix": "" |
| } |
| ], |
| "year": 2001, |
| "venue": "ICASSP", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Joshua Goodman. 2001. Classes for fast maximum entropy training. In ICASSP 2001.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Statistical Methods for Speech Recognition", |
| "authors": [ |
| { |
| "first": "Frederick", |
| "middle": [], |
| "last": "Jelinek", |
| "suffix": "" |
| } |
| ], |
| "year": 1997, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Frederick Jelinek. 1997. Statistical Methods for Speech Recognition. MIT Press.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Conditional random fields: Probabilistic models for segmenting and labeling sequence data", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Lafferty", |
| "suffix": "" |
| }, |
| { |
| "first": "F", |
| "middle": [], |
| "last": "Pereira", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Mccallum", |
| "suffix": "" |
| } |
| ], |
| "year": 2001, |
| "venue": "ICML", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "J. Lafferty, F. Pereira, andA. McCallum. 2001. Con- ditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Gibbs-markov models", |
| "authors": [ |
| { |
| "first": "John", |
| "middle": [], |
| "last": "Lafferty", |
| "suffix": "" |
| } |
| ], |
| "year": 1995, |
| "venue": "Computing Science and Statistics: Proceedings of the 27th Symposium on the Interface", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "John Lafferty. 1995. Gibbs-markov models. In Computing Science and Statistics: Proceedings of the 27th Symposium on the Interface.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Algorithms for maximumlikelihood logistic regression", |
| "authors": [ |
| { |
| "first": "Thomas", |
| "middle": [], |
| "last": "Minka", |
| "suffix": "" |
| } |
| ], |
| "year": 2001, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Thomas Minka. 2001. Algorithms for maximum- likelihood logistic regression. Available from http://www-white.media.mit.edu/ tpminka/papers/learning.html.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Maximum Entropy Models for Natural Language Ambiguity Resolution", |
| "authors": [ |
| { |
| "first": "Adwait", |
| "middle": [], |
| "last": "Ratnaparkhi", |
| "suffix": "" |
| } |
| ], |
| "year": 1998, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Adwait Ratnaparkhi. 1998. Maximum Entropy Models for Natural Language Ambiguity Resolu- tion. Ph.D. thesis, University of Pennsylvania.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "A maximum entropy approach to identifying sentence boundaries", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Reynar", |
| "suffix": "" |
| }, |
| { |
| "first": "A", |
| "middle": [], |
| "last": "Ratnaparkhi", |
| "suffix": "" |
| } |
| ], |
| "year": 1997, |
| "venue": "ANLP", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "J. Reynar and A. Ratnaparkhi. 1997. A maximum entropy approach to identifying sentence bound- aries. In ANLP.", |
| "links": null |
| }, |
| "BIBREF15": { |
| "ref_id": "b15", |
| "title": "Adaptive Statistical Language Modeling: A Maximum Entropy Approach", |
| "authors": [ |
| { |
| "first": "Ronald", |
| "middle": [], |
| "last": "Rosenfeld", |
| "suffix": "" |
| } |
| ], |
| "year": 1994, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ronald Rosenfeld. 1994. Adaptive Statistical Lan- guage Modeling: A Maximum Entropy Approach. Ph.D. thesis, Carnegie Mellon University, April.", |
| "links": null |
| }, |
| "BIBREF16": { |
| "ref_id": "b16", |
| "title": "Efficient training methods for maximum entropy language modeling", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Wu", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Khudanpur", |
| "suffix": "" |
| } |
| ], |
| "year": 2000, |
| "venue": "ICSLP", |
| "volume": "3", |
| "issue": "", |
| "pages": "114--117", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "J. Wu and S. Khudanpur. 2000. Efficient training methods for maximum entropy language model- ing. In ICSLP, volume 3, pages 114-117.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "type_str": "figure", |
| "uris": null, |
| "text": "One Iteration of Generalized Iterative Scaling (GIS)", |
| "num": null |
| }, |
| "TABREF2": { |
| "content": "<table><tr><td/><td colspan=\"4\">: Small feature set (5 feature types)</td></tr><tr><td/><td/><td>objec</td><td>ent</td><td>cor</td></tr><tr><td>accept</td><td>except</td><td>10.8</td><td>10.7</td><td>8.3</td></tr><tr><td>affect</td><td>effect</td><td>12.4</td><td>18.3</td><td>6.8</td></tr><tr><td colspan=\"2\">among between</td><td>7.7</td><td>14.3</td><td>9.0</td></tr><tr><td>its</td><td>it's</td><td colspan=\"2\">7.4 XXX</td><td>5.4</td></tr><tr><td>peace</td><td>piece</td><td>14.6</td><td>4.5</td><td>9.4</td></tr><tr><td colspan=\"2\">principal principle</td><td colspan=\"2\">7.3 XXX</td><td>0.0</td></tr><tr><td>then</td><td>than</td><td>6.5</td><td colspan=\"2\">13.7 11.0</td></tr><tr><td>their</td><td>there</td><td>5.9</td><td>11.3</td><td>2.8</td></tr><tr><td colspan=\"2\">weather whether</td><td>10.5</td><td colspan=\"2\">29.3 13.9</td></tr><tr><td>your</td><td>you're</td><td>13.1</td><td>8.1</td><td>9.8</td></tr><tr><td/><td>Average</td><td>9.6</td><td>13.8</td><td>7.6</td></tr></table>", |
| "html": null, |
| "text": "", |
| "type_str": "table", |
| "num": null |
| }, |
| "TABREF3": { |
| "content": "<table/>", |
| "html": null, |
| "text": "Medium feature set (15 feature types)", |
| "type_str": "table", |
| "num": null |
| } |
| } |
| } |
| } |
