analiza aiqbench
This research addresses the computational bottleneck of gradient-based explanation methods in large language models by comparing architectural component selection against random projection. The study demonstrates that a greedily selected subset of model components more effectively captures training data influence for retrieval tasks while offering superior efficiency over full gradients or projections. This work provides a practical, systematic approach to making instance-level explanations feasible without sacrificing explanatory power.
Select or Project? Evaluating Lower-dimensional Vectors for LLM Training Data Explanations
arXiv:2601.16651v3 Announce Type: replace Abstract: Gradient-based methods for instance-based explanation for large language models (LLMs) are hindered by the immense dimensionality of model gradients. In practice, influence estimation is restricted to a subset of model parameters to make computation tractable, but this subset is often chosen ad hoc and rarely justified by systematic evaluation. This paper investigates if it is better to create low-dimensional representations by selecting a small, architecturally informed subset of model components or by projecting the full gradients into a lower-dimensional space. Using a novel benchmark, we show that a greedily selected subset of components captures the information about training data influence needed for a retrieval task more effectively than either the full gradient or random projection. We further find that this approach is more computationally efficient than random projection, demonstrating that targeted component selection is a practical strategy for making instance-based explanations of large models more computationally feasible.
Abstract:Gradient-based methods for instance-based explanation for large language models (LLMs) are hindered by the immense dimensionality of model gradients. In practice, influence estimation is restricted to a subset of model parameters to make computation tractable, but this subset is often chosen ad hoc and rarely justified by systematic evaluation. This paper investigates if it is better to create low-dimensional representations by selecting a small, architecturally informed subset of model components or by projecting the full gradients into a lower-dimensional space. Using a novel benchmark, we show that a greedily selected subset of components captures the information about training data influence needed for a retrieval task more effectively than either the full gradient or random projection. We further find that this approach is more computationally efficient than random projection, demonstrating that targeted component selection is a practical strategy for making instance-based explanations of large models more computationally feasible.
KONVENS 2026. 9 pages
Computation and Language (cs.CL)
arXiv:2601.16651 [cs.CL]
(or arXiv:2601.16651v3 [cs.CL] for this version)
Text integral sub licența deschisă a publicației · 163 cuvinte
Subiecte conexe
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · 8 oct. 2026

News
Quantum Computing Report · 7 iun. 2026

[AINews] not much happened today
Latent Space · 3 oct. 2026
Granite Embedding Multilingual R2: Open Apache 2.0 Multilingual Embeddings with 32K Context — Best Sub-100M Retrieval Quality
Hugging Face · 14 mai 2026