Analyzing constrained LLM through PDFA-learning
<|reference_start|>Analyzing constrained LLM through PDFA-learning: We define a congruence that copes with null next-symbol probabilities that arise when the output of a language model is constrained by some means during text generation. We develop an algorithm for efficiently learning the quotient with respect to this congruence and evaluate it on case studies for analyzing statistical properties of LLM.<|reference_end|>
@article{carrasco2024analyzing,
    title={Analyzing constrained LLM through PDFA-learning},
    author={Mat'ias Carrasco, Franz Mayr, Sergio Yovine, Johny Kidd, Mart'in
  Iturbide, Juan Pedro da Silva, Alejo Garat},
    journal={arXiv preprint arXiv:2406.08269},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.08269},
    primaryClass={cs.FL cs.AI cs.LG}
}