Demystifying optimized prompts in language models

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Melamed, Rimon, McCabe, Lucas H., Huang, H. Howie
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912567909154816
author Melamed, Rimon
McCabe, Lucas H.
Huang, H. Howie
author_facet Melamed, Rimon
McCabe, Lucas H.
Huang, H. Howie
contents Modern language models (LMs) are not robust to out-of-distribution inputs. Machine generated (``optimized'') prompts can be used to modulate LM outputs and induce specific behaviors while appearing completely uninterpretable. In this work, we investigate the composition of optimized prompts, as well as the mechanisms by which LMs parse and build predictions from optimized prompts. We find that optimized prompts primarily consist of punctuation and noun tokens which are more rare in the training data. Internally, optimized prompts are clearly distinguishable from natural language counterparts based on sparse subsets of the model's activations. Across various families of instruction-tuned models, optimized prompts follow a similar path in how their representations form through the network.
format Preprint
id arxiv_https___arxiv_org_abs_2505_02273
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Demystifying optimized prompts in language models
Melamed, Rimon
McCabe, Lucas H.
Huang, H. Howie
Computation and Language
Modern language models (LMs) are not robust to out-of-distribution inputs. Machine generated (``optimized'') prompts can be used to modulate LM outputs and induce specific behaviors while appearing completely uninterpretable. In this work, we investigate the composition of optimized prompts, as well as the mechanisms by which LMs parse and build predictions from optimized prompts. We find that optimized prompts primarily consist of punctuation and noun tokens which are more rare in the training data. Internally, optimized prompts are clearly distinguishable from natural language counterparts based on sparse subsets of the model's activations. Across various families of instruction-tuned models, optimized prompts follow a similar path in how their representations form through the network.
title Demystifying optimized prompts in language models
topic Computation and Language
url https://arxiv.org/abs/2505.02273