TLXML: Task-Level Explanation of Meta-Learning via Influence Functions
Not on the map. Why?
Abstract (arXiv)
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(pq2) 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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 44 of its 64 references that are in the map. First posted on arXiv 24 Jan 2025.
Builds on
44 of 64 references.
References · 44
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2020Gradient Surgery for Multi-Task Learningcited by 1,210
- 2020Meta-Learning in Neural Networks: A Surveycited by 944
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 816
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 762
- 2018Taskonomy: Disentangling Task Transfer Learningcited by 631
- 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 599
32 more
- 2019Certified Data Removal from Machine Learning Modelscited by 512
- 2014New insights and perspectives on the natural gradient methodcited by 435
- 2018TADAM: Task dependent adaptive metric for improved few-shot learningcited by 408
- 2023Studying Large Language Model Generalization with Influence Functionscited by 311
- 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
- 2020Influence Functions in Deep Learning Are Fragilecited by 247
- 2019Task2Vec: Task Embedding for Meta-Learningcited by 197
- 2020Mixed-Privacy Forgetting in Deep Networkscited by 158
- 2019On the Accuracy of Influence Functions for Measuring Group Effectscited by 146
- 2020Explaining Black Box Predictions and Unveiling Data Artifacts through Influence Functionscited by 144
- 2021Open Domain Generalization with Domain-Augmented Meta-Learningcited by 115
- 2016Learning feed-forward one-shot learnerscited by 93
- 2019Detecting Adversarial Samples Using Influence Functions and Nearest Neighborscited by 72
- 2020learn2learn: A Library for Meta-Learning Researchcited by 69
- 2022Post hoc Explanations may be Ineffective for Detecting Unknown Spurious Correlationcited by 59
- 2022HyperTransformer: Model Generation for Supervised and Semi-Supervised Few-Shot Learningcited by 55
- 2018Interpreting Black Box Predictions using Fisher Kernelscited by 48
- 2020Cautious Adaptation For Reinforcement Learning in Safety-Critical Settingscited by 42
- 2020Data Augmentation for Meta-Learningcited by 38
- 2020Discriminative Jackknife: Quantifying Uncertainty in Deep Learning via Higher-Order Influence Functionscited by 34
- 2019A Principled Approach for Learning Task Similarity in Multitask Learningcited by 32
- 2020Model-based Adversarial Meta-Reinforcement Learningcited by 32
- 2024Machine Unlearning: Taxonomy, Metrics, Applications, Challenges, and Prospectscited by 28
- 2023Constraint-Conditioned Policy Optimization for Versatile Safe Reinforcement Learningcited by 17
- 2021On sensitivity of meta-learning to support datacited by 15
- 2024A CMDP-within-online framework for Meta-Safe Reinforcement Learningcited by 12
- 2020Yet Meta Learning Can Adapt Fast, It Can Also Break Easilycited by 9
- 2021Task Affinity with Maximum Bipartite Matching in Few-Shot Learningcited by 8
- 2020Towards explainable meta-learningcited by 4
- 2021Improved Robustness and Safety for Pre-Adaptation of Meta Reinforcement Learning with Prior Regularizationcited by 4
- 2022Towards Cross Domain Generalization of Hamiltonian Representation via Meta Learningcited by 3
- 2024Function Class Learning with Genetic Programming: Towards Explainable Meta Learning for Tumor Growth Functionalscited by 2
Built on by
Not cited yet.