Papers › Fluent dreaming for language models

Fluent dreaming for language models

24 Jan 2024arXiv:2402.01702archive 2025-07-28

T. Ben Thompson, Zygimantas Straznickas, Michael Sklar

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

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2402.01702")

Code

Syntology Ran 4 of 9 code samples harvested from 1 repository linked to this paper; 5 have no recorded run. Of those that ran: 4 ran with no contract checked.

By repository: official repository: 9 samples from 1 repository, 4 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

confirm-solutions/dreamy officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 4 ran; 0 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

4ran
5unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from confirm-solutions/dreamy. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

build_pareto_frontier confirm-solutions/dreamy/dreamy/epo.py official repository ran MIT (permissive) · 40b63eccd8c8fa7b · report
check_file_exists confirm-solutions/dreamy/dreamy/experiment.py official repository ran MIT (permissive) · ff0ddb961dafdda8 · report
logit_diff_runner confirm-solutions/dreamy/dreamy/runners.py official repository ran MIT (permissive) · 0a7362a40b17901c · report
viz_simple confirm-solutions/dreamy/dreamy/attribution.py official repository ran MIT (permissive) · 6989b8a8e10f20b8 · report
does_retokenize confirm-solutions/dreamy/dreamy/runners.py official repository unverified MIT (permissive) · c064d28f43a7d9c6 · report
epo confirm-solutions/dreamy/dreamy/epo.py official repository unverified MIT (permissive) · e6c85e40b8e012ea · report
load_model confirm-solutions/dreamy/dreamy/epo.py official repository unverified MIT (permissive) · 70da85a2f1e954b0 · report
resample confirm-solutions/dreamy/dreamy/attribution.py official repository unverified MIT (permissive) · 4df8cbcc21efc651 · report
viz confirm-solutions/dreamy/dreamy/attribution.py official repository unverified MIT (permissive) · 164c2cef2b355a4d · report

Tasks

Adversarial AttackLanguage ModelingLanguage Modelling

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections