Fluent dreaming for language models
Not on the map. Why?
Abstract (arXiv)
Feature visualization, also known as "dreaming", offers insights into vision models by optimizing the inputs to maximize a neuron's activation or other internal component. However, dreaming has not been successfully applied to language models because the input space is discrete. We extend Greedy Coordinate Gradient, a method from the language model adversarial attack literature, to design the Evolutionary Prompt Optimization (EPO) algorithm. EPO optimizes the input prompt to simultaneously maximize the Pareto frontier between a chosen internal feature and prompt fluency, enabling fluent dreaming for language models. We demonstrate dreaming with neurons, output logits and arbitrary directions in activation space. We measure the fluency of the resulting prompts and compare language model dreaming with max-activating dataset examples. Critically, fluent dreaming allows automatically exploring the behavior of model internals in reaction to mildly out-of-distribution prompts. Code for running EPO is available at https://github.com/Confirm-Solutions/dreamy. A companion page demonstrating code usage is at https://confirmlabs.org/posts/dreamy.html
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 15 of its 26 references that are in the map. First posted on arXiv 24 Jan 2024.
Builds on
15 of 26 references.
References · 15
- 2013Intriguing properties of neural networkscited by 5,155
- 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 3,104
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
- 2022Toy Models of Superpositioncited by 971
- 2023Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discoverycited by 336
- 2015Understanding Neural Networks Through Deep Visualizationcited by 334
- 2023Finding Neurons in a Haystack: Case Studies with Sparse Probingcited by 334
- 2023Automatically Auditing Large Language Models via Discrete Optimizationcited by 191
- 2021An Interpretability Illusion for BERTcited by 97
- 2022Gradient-Based Constrained Sampling from Language Modelscited by 64
Built on by
Citing papers per year: 2024: 1; 2025: 3; 2026: 1.
5 papers.
- 2025RL-Obfuscation: Can Language Models Learn to Evade Latent-Space Monitors?cited by 24
- 2024FLRT: Fluent Student-Teacher Redteamingcited by 9
- 2025Patterns and Mechanisms of Contrastive Activation Engineeringcited by 3
- 2025ContextBench: Modifying Contexts for Targeted Latent Activationcited by 0
- 2026ADAPT: Hybrid Prompt Optimization for LLM Feature Visualizationcited by 0
- 2026ADAPT: Hybrid Prompt Optimization for LLM Feature Visualization19 Feb 2026
- 2025RL-Obfuscation: Can Language Models Learn to Evade Latent-Space Monitors?17 Jun 2025
- 2025ContextBench: Modifying Contexts for Targeted Latent Activation15 Jun 2025
- 2025Patterns and Mechanisms of Contrastive Activation Engineering6 May 2025
- 2024FLRT: Fluent Student-Teacher Redteaming24 Jul 2024