4 papers
Making Grid Beam Search Less Greedy
Sean Papay, Roman Klinger
A common formalism for constraining the output of autoregressive text generation models involves lexical constraints, words or phrases which are required to occur in the generated…
iPOE: Interpretable Prompt Optimization via Explanations
Jiahui Li, Yarik Menchaca Resendiz, Sean Papay +1
Prompt optimization has often been framed as a discrete search problem to find high-performing and robust instructions for a large language model (LLM). However, the search result…
Are Humans as Brittle as Large Language Models?
Jiahui Li, Sean Papay, Roman Klinger
The output of large language models (LLMs) is unstable, due both to non-determinism of the decoding process as well as to prompt brittleness. While the intrinsic non-determinism of…
Regular-pattern-sensitive CRFs for Distant Label Interactions
Sean Papay, Roman Klinger, Sebastian Pado
While LLMs have grown popular in sequence labeling, linear-chain conditional random fields (CRFs) remain a popular alternative with the ability to directly model interactions betwe…