aiqbench analysis
This research introduces a dual representation of influence functions that improves computational efficiency by scaling with dataset size rather than model size, specifically targeting scenarios where models are significantly larger than their training data. While restricted to linearizable models, this method offers a viable alternative for estimating parameter changes and loss variations when standard influence function calculations become infeasible due to massive model dimensions.
A Dual Representation of Influence Functions for Linearizable Models
arXiv:2605.11239v2 Announce Type: replace Abstract: In this paper, we present a dual representation of influence functions, whose computational complexity scales with dataset size rather than model size. Both analytically and experimentally, we show that this representation can be an efficient alternative to the original influence functions for estimating changes in parameters, model outputs and loss due to data point removal, when model size is large relative to dataset size, or when evaluating the original influence functions in parameter space is infeasible. The dual representation, however, is limited to linearizable models, which are models whose behavior can be approximated by their linearizations throughout training, and requires materializing a matrix, whose size grows with the product of model output dimension and dataset size.
Abstract:In this paper, we present a dual representation of influence functions, whose computational complexity scales with dataset size rather than model size. Both analytically and experimentally, we show that this representation can be an efficient alternative to the original influence functions for estimating changes in parameters, model outputs and loss due to data point removal, when model size is large relative to dataset size, or when evaluating the original influence functions in parameter space is infeasible. The dual representation, however, is limited to linearizable models, which are models whose behavior can be approximated by their linearizations throughout training, and requires materializing a matrix, whose size grows with the product of model output dimension and dataset size.
Machine Learning (cs.LG); Machine Learning (stat.ML)
arXiv:2605.11239 [cs.LG]
(or arXiv:2605.11239v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2605.11239 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 211 words
Related coverage

New theory ranks the complexity of quantum system simulations
Quantum Zeitgeist · Oct 13, 2026
SpecCloak: Probing Harmful Code Generation through Engineering Specifications
arXiv · Oct 15, 2026
Dual Attention Residuals
arXiv · Jul 22, 2026
SP-GCRL: Influence Maximization on Incomplete Social Graphs
arXiv · Jun 17, 2026