aiqbench analysis
TLXML introduces a scalable framework that applies influence functions to meta-learning, offering transparent explanations of how specific training tasks impact downstream model adaptation. By reducing computational complexity and handling flat loss landscapes, this research advances the interpretability and trustworthiness of rapidly adapting AI systems.
TLXML: Task-Level Explanation of Meta-Learning via Influence Functions
arXiv:2501.14271v4 Announce Type: replace Abstract: Meta-learning enables models to rapidly adapt to new tasks by leveraging prior experience, but its adaptation mechanisms remain opaque, especially regarding how past training tasks influence future predictions. We introduce TLXML (Task-Level eXplanation of Meta-Learning), a novel framework that extends influence functions to meta-learning settings and provides task-level explanations of adaptation and inference. By reformulating influence functions for the bi-level structure of meta-learning, we quantify the contribution of each meta-training task to the adapted model's behaviour. To ensure scalability, we propose a Gauss-Newton-based approximation that significantly reduces computational complexity from $O(pq^2)$ to $O(pq)$, where $p$ and $q$ denote the numbers of model and meta parameters, respectively. Moreover, we propose generalized influence functions defined using pseudo-inverse Hessian, which are applicable even when the loss landscape has flat directions. Results demonstrate that TLXML effectively ranks training tasks by their influence on downstream performance, offering concise, intuitive explanations aligned with user-level abstraction. This work provides a critical step toward interpretable and trustworthy meta-learning systems.
Abstract:Meta-learning enables models to rapidly adapt to new tasks by leveraging prior experience, but its adaptation mechanisms remain opaque, especially regarding how past training tasks influence future predictions. We introduce TLXML (Task-Level eXplanation of Meta-Learning), a novel framework that extends influence functions to meta-learning settings and provides task-level explanations of adaptation and inference. By reformulating influence functions for the bi-level structure of meta-learning, we quantify the contribution of each meta-training task to the adapted model's behaviour. To ensure scalability, we propose a Gauss-Newton-based approximation that significantly reduces computational complexity from $O(pq^2)$ to $O(pq)$, where $p$ and $q$ denote the numbers of model and meta parameters, respectively. Moreover, we propose generalized influence functions defined using pseudo-inverse Hessian, which are applicable even when the loss landscape has flat directions. Results demonstrate that TLXML effectively ranks training tasks by their influence on downstream performance, offering concise, intuitive explanations aligned with user-level abstraction. This work provides a critical step toward interpretable and trustworthy meta-learning systems.
Machine Learning (cs.LG)
arXiv:2501.14271 [cs.LG]
(or arXiv:2501.14271v4 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2501.14271 Focus to learn more arXiv-issued DOI via DataCite
https://doi.org/10.1007/978-3-032-37664-0_22 Focus to learn more DOI(s) linking to related resources
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 · 263 words
Related coverage

Why do models task game?
AI Alignment Forum · Aug 6, 2026

Deconfusing Corrigibility
AI Alignment Forum · Oct 17, 2026

Reviewing failure modes in science as we prepare for AI researchers
LessWrong · Oct 8, 2026
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · Oct 8, 2026