A context-conditioned parameter generator turned a document into LoRA weights in a single forward pass, so the document could be read once and then answered from the query alone
AspireAI community · arXiv
LLMs are usually adapted to a task either by putting knowledge in the input context, which keeps it external and re-encodes it on every call, or by fine-tuning, which internalizes it but requires a costly optimization round per task. CLIK maps a context directly to LoRA parameters through a Transformer encoder with cross-attention, requiring no test-time gradient updates, so the knowledge lands in a frozen base model's weights instead of its input. Because the adapter depends only on the context, it is generated once and reused for every query on the same document, amortizing the cost of reading that document. On document question answering it substantially improves over the no-context base model and outperforms existing hypernetwork-based generators, carries over to multi-turn dialogue without multi-turn-specific training, and analysis shows the context-dependent part of the adapter concentrates in a compact, specific substructure. The limitation is that it still trails a base model that reads the context directly, so it trades some accuracy for speed rather than beating it.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.