A method includes training a neural network having parameters on training data, in which the neural network receives an input state and processes the input state to generate a respective score for each decision in a set of decisions. The method includes receiving training data including training text sequences and, for each training text sequence, a corresponding gold decision sequence. The method includes training the neural network on the training data to determine trained values of parameters of the neural network. Training the neural network includes for each training text sequence: maintaining a beam of candidate decision sequences for the training text sequence, updating each candidate decision sequence by adding one decision at a time, determining that a gold candidate decision sequence matching a prefix of the gold decision sequence has dropped out of the beam, and in response, performing an iteration of gradient descent to optimize an objective function.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method of training a neural network having parameters on training data, wherein the neural network is configured to receive an input state and process the input state to generate a respective score for each decision in a set of decisions, and wherein the method comprises: receiving first training data, the first training data comprising a plurality of training text sequences and, for each training text sequence, a corresponding gold decision sequence; and training the neural network on the first training data to determine trained values of the parameters of the neural network from first values of the parameters of the neural network, comprising, for each training text sequence in the first training data: maintaining a beam of a predetermined number of candidate predicted decision sequences for the training text sequence; updating each candidate predicted decision sequence in the beam by adding one decision at a time to each candidate predicted decision sequence using scores generated by the neural network in accordance with current values of the parameters of the neural network; determining, after each time that a decision has been added to each of the candidate predicted decision sequences, that a gold candidate predicted decision sequence matching a prefix of the gold decision sequence corresponding to the training text sequence has dropped out of the beam; and in response to determining that the gold candidate predicted decision sequence has dropped out of the beam, performing an iteration of gradient descent to optimize an objective function that depends on the gold candidate predicted decision sequence and on the candidate predicted sequences currently in the beam. 2. The method of claim 1, further comprising: receiving second training data, the second training data comprising a plurality of training text sequences and, for each training text sequence, a corresponding gold decision sequence; and pre-training the neural network on the second training data to determine the first values of the parameters of the neural network from initial values of the parameters of the neural network by optimizing an objective function that depends on, for each training text sequence, scores generated by the neural network for decisions in the gold decision sequence corresponding to the training text sequence and on a local normalization for the scores generated for the decisions in the gold decision sequence. 3. The method of claim 1, wherein the neural network is a globally normalized neural network. 4. The method of claim 1, wherein the set of decisions is a set of possible parse elements of a dependency parse, and wherein the gold decision sequence is a dependency parse of the corresponding training text sequence. 5. The method of claim 1, wherein the set of decisions is a set of possible part of speech tags, and wherein the gold decision sequence is a sequence that includes a respective part of speech tag for each word in the corresponding training text sequence. 6. The method of claim 1, wherein the set of decisions includes a keep label indicating that the word should be included in a compressed representation of the input text sequence and a drop label indicating that the word should not be included in the compressed representation, and wherein the gold decision sequence is a sequence that includes a respective keep label or drop label for each word in the corresponding training text sequence. 7. The method of claim 1, further comprising: if the gold candidate predicted decision sequence has not dropped out of the beam after the candidate predicted sequences have been finalized, performing an iteration of gradient descent to optimize an objective function that depends on the gold decision sequence and on the finalized candidate predicted sequences. 8. One or more computer-readable storage media encoded with instructions that, when executed by one or more computers, cause the one or more computers to perform operations to train a neural network having parameters on training data, wherein the neural network is configured to receive an input state and process the input state to generate a respective score for each decision in a set of decisions, and wherein the operations comprise: receiving first training data, the first training data comprising a plurality of training text sequences and, for each training text sequence, a corresponding gold decision sequence; and training the neural network on the first training data to determine trained values of the parameters of the neural network from first values of the parameters of the neural network, comprising, for each training text sequence in the first training data: maintaining a beam of a predetermined number of candidate predicted decision sequences for the training text sequence; updating each candidate predicted decision sequence in the beam by adding one decision at a time to each candidate predicted decision sequence using scores generated by the neural network in accordance with current values of the parameters of the neural network; determining, after each time that a decision has been added to each of the candidate predicted decision sequences, that a gold candidate predicted decision sequence matching a prefix of the gold decision sequence corresponding to the training text sequence has dropped out of the beam; and in response to determining that the gold candidate predicted decision sequence has dropped out of the beam, performing an iteration of gradient descent to optimize an objective function that depends on the gold candidate predicted decision sequence and on the candidate predicted sequences currently in the beam. 9. The one or more computer-readable storage media of claim 8, wherein the operations further comprising: receiving second training data, the second training data comprising a plurality of training text sequences and, for each training text sequence, a corresponding gold decision sequence; and pre-training the neural network on the second training data to determine the first values of the parameters of the neural network from initial values of the parameters of the neural network by optimizing an objective function that depends on, for each training text sequence, scores generated by the neural network for decisions in the gold decision sequence corresponding to the training text sequence and on a local normalization for the scores generated for the decisions in the gold decision sequence. 10. The one or more computer-readable storage media of claim 8, wherein the neural network is a globally normalized neural network. 11. The one or more computer readable storage media of claim 8, wherein the set of decisions is a set of possible parse elements of a dependency parse, and wherein the gold decision sequence is a dependency parse of the corresponding training text sequence. 12. The one or more computer readable storage media of claim 8, wherein the set of decisions is a set of possible part of speech tags, and wherein the gold decision sequence is a sequence that includes a respective part of speech tag for each word in the corresponding training text sequence. 13. The one or more computer readable storage media of claim 8, wherein the set of decisions includes a keep label indicating that the word should be included in a compressed representation of the input text sequence and a drop label indicating that the word should not be included in the compressed representation, and wherein the gold decision sequence is a sequence that includes a respective keep label or drop label for each word in the corresponding training text sequence. 14. The one or more computer readable storage media of claim 8, wherein the operations further comprising: if the gold candidate predicted decision sequence has not dropped out of the beam after the candidate predicted sequences have been finalized, performing an iteration of gradient descent to optimize an objective function that depends on the gold decision sequence and on the finalized candidate predicted sequences. 15. A system for generating a decision sequence for an input text sequence, the decision sequence comprising a plurality of output decisions, and the system comprising: a neural network configured to: receive an input state, and process the input state to generate a respective score for each decision in a set of decisions; and a subsystem configured to: maintain a beam of a predetermined number of candidate decision sequences for the input text sequence; for each output decision in the decision sequence: for each candidate decision sequence currently in the beam: provide a state representing the candidate decision sequence as input to the neural network and obtain from the neural network a respective score for each of a plurality of new candidate decision sequences, each new candidate decision sequence having a respective allowed decision from a set of allowed decisions added to the current candidate decision sequence, update the beam to include only a predetermined number of new candidate decision sequences with highest scores according to the scores obtained from the neural network; for each new candidate decision sequence in the updated beam, generate a respective state representing the new candidate decision sequence; and after the last output decision in the decision sequence, select from the candidate decision sequences in the beam a candidate decision sequence with a highest score as the decision sequence for the input text sequence. 16. The system of claim 15, wherein the set of decisions is a set of possible parse elements of a dependency parse, and wherein the decision sequence is a dependency parse of the text sequence. 17. The system of claim 15, wherein the set of decisions is a set of possible part of speech tags, and wherein the decision sequence is a sequence that includes a respective part of speech tag for each word in the text sequence. 18. The system of claim 15, wherein the set of decisions includes a keep label indicating that a word should be included in a compressed representation of the input text sequence and a drop label indicating that the word should not be included in the compressed representation, and wherein the decision sequence is a sequence that includes a respective keep label or drop label for each word in the text sequence.