Uploaded November 2023 | Updated September 2026, 4 days ago
Abstract: When trying to gain better visibility into a machine learning model in order to understand and mitigate the associated risks, a potentially valuable source of evidence is: which training examples most contribute to a given behavior? Influence functions aim to answer a counterfactual: how would the model's parameters (and hence its outputs) change if a given sequence were added to the training set? While influence functions have produced insights for small models, they are difficult to scale to large language models (LLMs) due to the difficulty of computing an inverse-Hessian-vector product (IHVP). We introduce efficient approximations that let us scale influence functions up to LLMs with up to 52 billion parameters. We use influence functions to investigate the generalization patterns of LLMs, including the sparsity of the influence patterns, increasing abstraction with scale, math and programming abilities, cross-lingual generalization, and role-playing behavior. Overall, influence functions give us a powerful new tool for studying the generalization properties of LLMs.
Bio: Roger Grosse is an Associate Professor of Computer Science at the University of Toronto and a founding member of the Vector Institute, focusing on machine learning and AI alignment. He is also a Member of Technical Staff on the Alignment Team at Anthropic. Previously, he was a postdoc at the University of Toronto, after having received a PhD at MIT, studying under Bill Freeman and Josh Tenenbaum. He holds or has received a Sloan Research Fellowship, a Canada Research Chair in Deep Learning and AI Alignment, and a Canada CIFAR AI Chair.
Abstract: When trying to gain better visibility into a machine learning model in order to understand and mitigate the associated risks, a potentially valuable source of evidence is: which training examples most contribute to a given behavior? Influence functions aim to answer a counterfactual: how would the model's parameters (and hence its outputs) change if a given sequence were added to the training set? While influence functions have produced insights for small models, they are difficult to scale to large language models (LLMs) due to the difficulty of computing an inverse-Hessian-vector product (IHVP). We introduce efficient approximations that let us scale influence functions up to LLMs with up to 52 billion parameters. We use influence functions to investigate the generalization patterns of LLMs, including the sparsity of the influence patterns, increasing abstraction with scale, math and programming abilities, cross-lingual generalization, and role-playing behavior. Overall, influence functions give us a powerful new tool for studying the generalization properties of LLMs.
Bio: Roger Grosse is an Associate Professor of Computer Science at the University of Toronto and a founding member of the Vector Institute, focusing on machine learning and AI alignment. He is also a Member of Technical Staff on the Alignment Team at Anthropic. Previously, he was a postdoc at the University of Toronto, after having received a PhD at MIT, studying under Bill Freeman and Josh Tenenbaum. He holds or has received a Sloan Research Fellowship, a Canada Research Chair in Deep Learning and AI Alignment, and a Canada CIFAR AI Chair.

![Explaining Answers with Entailment Trees
Explaining Answers with Entailment Trees
Bhavana Dalvi
https://allenai.org/team/bhavanad
Our goal, in the context of open-domain textual question-answering (QA), is to explain answers by showing the line of reasoning from what is known to the answer, rather than simply showing a fragment of textual evidence (a rationale). If this could be done, new opportunities for understanding and debugging the systems reasoning become possible. Our approach is to generate explanations in the form of entailment trees, namely a tree of multipremise entailment steps from facts that are known, through intermediate conclusions, to the hypothesis of interest (namely the question + answer). To train a model with this skill, we created ENTAILMENTBANK, the first dataset to contain multistep entailment trees. Given a hypothesis (question + answer), we define three increasingly difficult explanation tasks: generate a valid entailment tree given (a) all relevant sentences (b) all relevant and some irrelevant sentences, or (c) a corpus. We show that a strong language model can partially solve these tasks, in particular when the relevant sentences are included in the input (e.g., 35% of trees for (a) are perfect), and with indications of generalization to other domains. This work is significant as it provides a new type of dataset (multistep entailments) and baselines, offering a new avenue for the community to generate richer, more systematic explanations. [ Paper published in EMNLP 2021, https://arxiv.org/abs/2104.08661 ] Explaining Answers with Entailment Trees](https://i.ytimg.com/vi/QPSZQYA1RmA/mqdefault.jpg)






![Enhancing Reasoning in Smaller Models through Self-Training
Abstract: Smaller language models can develop robust reasoning capabilities through pre-training, fine-tuning, or knowledge distillation from large language models (LLMs). However, unlike LLMs that employ a diverse array of reasoning strategies, smaller models typically rely on a single dominant approach. This limitation restricts their effectiveness in handling different multi-step reasoning tasks, which require a wide range of strategies in order to solve them. To address this challenge, self-training leverages the model’s own generated data, enabling smaller models to autonomously learn and adapt their reasoning strategies for improved performance across diverse tasks.
I will talk about a self-guided iterative distillation framework (SIKeD [1]), which combines multi-strategy outputs from LLMs with self-generated data from the smaller model to identify the most effective strategy for a given task in an on-policy manner.
Later, I will talk about how this self-training approach can be extended to improve refinement in models, where a model can learn to iteratively refine its output, eventually learning to pick the right strategy in its first attempt (SMART [2]).
[1] https://arxiv.org/abs/2410.18574
[2] https://arxiv.org/abs/2410.16128
Bio: Kumar Shridhar is a final-year Ph.D. candidate at ETH Zürich, Switzerland, under the supervision of Prof. Mrinmaya Sachan from ETH and Dr. Nicholas Monath from Google DeepMind. Prior to his doctoral studies, he spent summers interning at FAIR, Microsoft Research, and Alexa AI, and improving conversational AI at different startups.
His research focuses on advancing the reasoning capabilities of large language models (LLMs) and developing efficient distillation methods to impart these skills to smaller models. Moreover he is also working model alignment, autonomous agents, and model refinement. He is also a member of Swiss AI initiative, where the team is training foundational models across various domains. Enhancing Reasoning in Smaller Models through Self-Training](https://i.ytimg.com/vi/SS59gCT2KKs/mqdefault.jpg)

