arXiv:2406.08269
공식 코드 · Papers with Code
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Making Language Model a Hierarchical Classifier and Generator
TagRouter: Learning Route to LLMs through Tags for Open-Domain Text Generation Tasks
Towards Secure and Private Language Models for Nuclear Power Plants
Specification-based Security Evaluation of Real-World Agents Tool-Calling under Long-Horizon Context Tasks
InstructFLIP: Exploring Unified Vision-Language Model for Face Anti-spoofing
Describe Anything Model for Visual Question Answering on Text-rich Images
토론
이 논문과 연결된 포럼 글이 아직 없습니다.