Gradient-Based Inference for Networks with Output Constraints


  • Jay Yoon Lee Carnegie Mellon University
  • Sanket Vaibhav Mehta Carnegie Mellon University
  • Michael Wick Oracle Labs
  • Jean-Baptiste Tristan Oracle Labs
  • Jaime Carbonell Carnegie Mellon University



Practitioners apply neural networks to increasingly complex problems in natural language processing, such as syntactic parsing and semantic role labeling that have rich output structures. Many such structured-prediction problems require deterministic constraints on the output values; for example, in sequence-to-sequence syntactic parsing, we require that the sequential outputs encode valid trees. While hidden units might capture such properties, the network is not always able to learn such constraints from the training data alone, and practitioners must then resort to post-processing. In this paper, we present an inference method for neural networks that enforces deterministic constraints on outputs without performing rule-based post-processing or expensive discrete search. Instead, in the spirit of gradient-based training, we enforce constraints with gradient-based inference (GBI): for each input at test-time, we nudge continuous model weights until the network’s unconstrained inference procedure generates an output that satisfies the constraints. We study the efficacy of GBI on three tasks with hard constraints: semantic role labeling, syntactic parsing, and sequence transduction. In each case, the algorithm not only satisfies constraints, but improves accuracy, even when the underlying network is stateof-the-art.




How to Cite

Lee, J. Y., Mehta, S. V., Wick, M., Tristan, J.-B., & Carbonell, J. (2019). Gradient-Based Inference for Networks with Output Constraints. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 4147-4154.



AAAI Technical Track: Machine Learning