DSPy Assertions: Computational Constraints for Self-Refining LM Pipelines // Arnav Singhvi // Talk

// Abstract
Chaining language model (LM) calls as composable modules is fueling a powerful way of programming. However, ensuring that LMs adhere to important constraints remains a key challenge, one often addressed with heuristic “prompt engineering”. We introduce LM Assertions, a new programming construct for expressing computational constraints that LMs should satisfy. We integrate our constructs into the recent DSPy programming model for LMs, and present new strategies that allow DSPy to compile programs with arbitrary LM Assertions into systems …

abstract challenge computational constraints construct dspy engineering however key language language model lms modules pipelines programming prompt talk