Papers by Mor Geva
Copied to clipboard
| Challenge: | Existing questions that explicitly describe the process for deriving the answer are often implicit. |
| Approach: | They propose a question answering benchmark where the required reasoning steps are implicit in the question and should be inferred using a strategy. |
| Outcome: | The proposed model is short, topic-diverse, and covers a wide range of strategies. |
Copied to clipboard
| Challenge: | Automated agents powered by large language models are becoming more ingrained into how people seek information . but evaluation benchmarks for LLMs rarely feature natural questions that are time-consuming . a new benchmark, MoNaCo, aims to address this gap by eliciting and manually answering time-wasting questions . |
| Approach: | They propose a benchmark of 1,315 natural and time-consuming questions that require dozens of intermediate steps to solve. |
| Outcome: | MoNaCo benchmarks achieve at least 61.2% F1 in real-world time-consuming questions hampered by low recall and hallucinations . Frontier LLMs evaluated on MoN achieving at least 61% F1, harmed by low memory and halluzinations. |
Copied to clipboard
| Challenge: | Modern language models (LMs) generate inconsistent, non-attributable or factually incorrect text, which hinders their usability. |
| Approach: | They propose a factuality evaluation framework for LMs that is based on cross-examination to detect inconsistencies between LM and examiner. |
| Outcome: | The proposed framework outperforms existing methods and baselines on factual claims on four benchmarks. |
Copied to clipboard
| Challenge: | Prior work on attention heads focused on analyzing their behavior during inference for specific circuits or tasks. |
| Approach: | They propose a framework that maps the functions of attention heads without any model training or inference. |
| Outcome: | The proposed framework infers the functionality of attention heads without any model training or inference. |
Copied to clipboard
| Challenge: | Existing methods for “unlearning” information captured in large language models rely on behavioral tests without monitoring residual knowledge in model parameters. |
| Approach: | They propose a general evaluation methodology that uses vocabulary projections to inspect concepts encoded in model parameters. |
| Outcome: | The proposed method detects changes in parametric traces of unlearned concepts and localizes them in two open-source LLMs. |
Copied to clipboard
| Challenge: | Transformer-based language models (LMs) are opaque and unexplained, causing problems for endusers and developers who wish to debug or fix their behaviour. |
| Approach: | They propose an interactive debugger tool for transformer-based LMs that provides a fine-grained interpretation of the model's internal prediction process and a powerful framework for intervening in LM behavior. |
| Outcome: | The proposed tool provides a fine-grained interpretation of the model's internal prediction construction process, and a powerful framework for intervening in LM behavior. |
Copied to clipboard
| Challenge: | Having only a few workers generate the majority of dataset examples raises concerns about data diversity . |
| Approach: | They perform a series of experiments to investigate annotator biases in recent NLU datasets . they find that models are able to recognize the most productive annotators . |
| Outcome: | The results show that models can recognize the most productive annotators and do not generalize well to examples from annotator that did not contribute to the training set. |
Copied to clipboard
| Challenge: | Using feed-forward layers, we show that the learned patterns are human-interpretable, and that lower layers tend to capture shallow patterns, while upper layers learn more semantic ones. |
| Approach: | They propose that feed-forward layers in transformer-based language models operate as key-value memories where each key correlates with textual patterns in the training examples and each value induces a distribution over the output vocabulary. |
| Outcome: | The proposed model is based on key-value memories with a key-level correlation with the training examples and a distribution over the output vocabulary. |
Copied to clipboard
| Challenge: | Interpretability and analysis (IA) research is a growing subfield within NLP . a criticism of this work is that it lacks actionable insights and therefore has little impact on NLP. |
| Approach: | They propose to quantify the impact of interpretation and analysis research on NLP . they use citation graphs and a survey to find out what is missing in IA research . |
| Outcome: | The proposed study shows that IA research is well-cited outside of IA and central in the NLP citation graph. |
Copied to clipboard
| Challenge: | Large language models (LLMs) can solve complex multi-step problems, but little is known about how these computations are implemented internally. |
| Approach: | They propose a "back-patching" analysis method to solve multi-hop queries . they propose resolving the bridge entity into the bridge and the second hop into the target entity into latent steps. |
| Outcome: | The proposed method solves multi-hop queries that require two information extraction steps . it shows that the later layers lack the necessary knowledge to correctly generate the answer . |
Copied to clipboard
| Challenge: | Existing methods to disentangle individual neurons from multiple high-level concepts are not yet benchmarked. |
| Approach: | They propose a method of Multi-task Distributed Alignment Search that allows to find distributed representations satisfying multiple causal criteria. |
| Outcome: | The proposed method achieves state-of-the-art on the target language model with Llama2-7B . |
Copied to clipboard
| Challenge: | Latent multi-hop reasoning is a problem in Large Language Models that can develop shortcuts by encountering the head entity and answer entity in training sequences. |
| Approach: | They propose desiderata for shortcut-free evaluation of latent multi-hop reasoning ability . they exclude test queries where head and answer entities might have co-appeared . |
| Outcome: | The proposed model can latently recall and compose single-hop facts without shortcuts, but only for certain types of queries. |
Copied to clipboard
| Challenge: | Existing methods for representing factual knowledge in a language model are insufficient. |
| Approach: | They propose a procedure for “crawling” the internal knowledge-base of a language model by expanding a knowledge-graph around it. |
| Outcome: | The proposed method yields high precision graphs (82-92%) while emitting a reasonable number of facts per entity. |
Copied to clipboard
| Challenge: | Existing paradigms for multi-task training involve a shared pre-trained language model and a small, thin network (head) given an input, a target head is the head that is selected for outputting the final prediction. |
| Approach: | They examine the behaviour of non-target heads when given input that belongs to a different task than the one they were trained for. |
| Outcome: | The non-target heads exhibit emergent behaviour, which may explain the target task, or generalize beyond their original task. |
Copied to clipboard
| Challenge: | Recent studies have shown that data collected through crowdsourcing often exhibit various biases that lead to overestimation of model performance. |
| Approach: | They propose to model instruction bias in 14 recent NLU benchmarks by analyzing crowdsourcing instructions and analyzing their results. |
| Outcome: | The proposed model can be over-represented in datasets with a large number of examples, and the results are consistent with previous studies. |
Copied to clipboard
| Challenge: | Understanding natural language questions entails the ability to break down a question into the requisite steps for computing its answer. |
| Approach: | They introduce a Question Decomposition Meaning Representation (QDMR) for questions . they demonstrate that QDMRs can be annotated at scale using a hotpotQA dataset . |
| Outcome: | The proposed model outperforms several natural baselines in the open-domain question answering hotpotQA dataset and can be deterministically converted to a pseudo-SQL formal language. |
Copied to clipboard
| Challenge: | Existing models for numerical reasoning are limited by their flexibility and require specialized architectures to capture high-level skills. |
| Approach: | They propose to inject numerical reasoning skills into pre-trained LMs by generating large amounts of data and training in a multi-task setup. |
| Outcome: | The proposed model performs better on DROP than other models of comparable size while maintaining high performance on standard RC tasks. |
Copied to clipboard
| Challenge: | Recent research shows that pretrained language models are often brittle for complex reasoning tasks. |
| Approach: | They propose to use pre-trained language models to teach machines to reason over texts . they will review recent promising approaches to tackling complex reasoning tasks . |
| Outcome: | This tutorial reviews promising approaches to complex reasoning tasks . it reviews the methods that can be used to augment models with robustness . |
Copied to clipboard
| Challenge: | Reading comprehension models are dominated by recurrent neural networks (RNNs) as documents become longer and questions become complex, sequential reading becomes a significant bottleneck. |
| Approach: | They propose a reading comprehension framework that uses document trees to model an agent that interleaves quick navigation with more expensive answer extraction. |
| Outcome: | The proposed model improves question answering performance compared to existing models and has a strong information-retrieval baseline. |
Copied to clipboard
| Challenge: | Vision-language models excel at extracting and reasoning about information from images, yet their capacity to leverage internal knowledge about specific entities remains underexplored. |
| Approach: | They propose a dataset which allows separating entity recognition and question answering . they hypothesize that this decline arises from limitations in how information flows from image tokens to query tokens. |
| Outcome: | The proposed model performance drops when the entity is presented visually rather than textually. |
Copied to clipboard
| Challenge: | Prior attempts to interpret continuous prompts relied on projecting individual tokens onto the vocabulary space, but this approach yielded arbitrary or contradictory text. |
| Approach: | They propose to project individual prompt tokens onto the model's vocabulary space and interpret each prompt token individually. |
| Outcome: | The proposed method yields accurate task descriptions and is more faithful as task performance increases. |
Copied to clipboard
| Challenge: | Despite their unprecedented capabilities, large language models (LLMs) often output erroneous information, which may lead users to overly rely on their false output. |
| Approach: | They formalize faithful response uncertainty based on the gap between the model’s intrinsic confidence in the assertions it makes and the decisiveness by which they are conveyed. |
| Outcome: | The proposed model is poor at faithfully conveying uncertainty on knowledge-intensive questions. |
Copied to clipboard
| Challenge: | Standard question answering evaluation protocols do not take factual errors into account and compare a predicted answer against answers of a single granularity level. |
| Approach: | They propose a new evaluation setting where a predicted answer is evaluated in terms of accuracy and informativeness against a set of multi-granularity answers. |
| Outcome: | The proposed evaluation setting compares a predicted answer against a set of multi-granularity answers. |
Copied to clipboard
| Challenge: | Existing studies have focused on identifying where factual knowledge is encoded in the network, but little is known about how it is extracted from the model parameters during inference. |
| Approach: | They examine how factual associations are stored and retrieved internally in LMs . they use attention edges to identify critical points where information propagates to the prediction . |
| Outcome: | The proposed model aggregates information about subject and relation to predict the correct attribute . the model “queries” the enriched subject to extract the attribute based on the proposed model . |
Copied to clipboard
| Challenge: | Large language models (LLMs) often respond confidently to questions even when they lack the necessary information, leading to inaccurate responses or hallucinations. |
| Approach: | They propose an approach for identifying a direction in the model’s activation space that captures unanswerability and uses it for classification. |
| Outcome: | The proposed method detects unanswerable questions and generalizes better across datasets than existing prompt-based and classifier-based approaches. |
Copied to clipboard
| Challenge: | Various few-shot tool-usage strategies have been proposed to overcome LMs' shortcomings. |
| Approach: | They propose to augment language models with tools to overcome their shortcomings . they find strong no-tool baselines are competitive to tool-assisted strategies . |
| Outcome: | The proposed strategies outperform those that refine incorrect outputs with tools in knowledge-retrieval tasks, the study finds . the findings suggest few-shot tool integration is still an open challenge . |
Copied to clipboard
| Challenge: | Existing methods for analyzing memorization use definitions that are based on model performance, which changes between models and often also between training runs. |
| Approach: | They propose idioms as inputs that typically trigger memory recall and propose a set of English idiomas to test their methodological framework for probing and characterizing recall of memorized sequences in transformer LMs. |
| Outcome: | The proposed framework compares model behavior on memorized vs. non-memorized inputs across different model sizes and architectures. |
Copied to clipboard
| Challenge: | A prominent challenge for language understanding systems is the ability to answer implicit reasoning questions where the evidence for answering the question is not mentioned explicitly. |
| Approach: | They propose to decouple inference of reasoning steps from execution by evaluating models of implicit relation inference. |
| Outcome: | The proposed model fails on the implicit reasoning QA task, but infers implicit relations . the proposed model is compared with other models that fail on the same task . |
Copied to clipboard
| Challenge: | Recent reasoning models show the ability to reflect, backtrack, and self-validate their reasoning . |
| Approach: | They investigate how well models identify and recover from unhelpful thoughts . they show that models are effective at identifying most unhelpfully thoughts - but struggle to recover from the same thoughts when they are injected into their thinking process . |
| Outcome: | The proposed model can identify unhelpful thoughts but struggle to recover from them . larger models struggle more than smaller models to recover short irrelevant thoughts . |
Copied to clipboard
| Challenge: | Recent literature discusses automatic methods to evaluate reasoning to improve their correctness, but no fine-grained step-level datasets are available to enable thorough evaluation of such verification methods. |
| Approach: | They propose to benchmark automatic verifiers of complex Chain-of-Thought reasoning in open-domain question-answering settings using a dataset that includes comprehensive labels for relevance, attribution to evidence passages, and logical correctness of each reasoning step. |
| Outcome: | The proposed dataset shows that verifiers struggle at verifying reasoning chains, particularly verifying logical correctness and detecting contradictions. |
Copied to clipboard
| Challenge: | Existing datasets for sentence fusion are small and insufficient for training modern neural models. |
| Approach: | They propose a method for automatically-generating fusion examples from raw text . they apply their method to Wikipedia and Sports articles to generate fusion models . |
| Outcome: | The proposed method improves performance on WebSplit when viewed as a sentence fusion task. |
Copied to clipboard
| Challenge: | Standard NLP benchmarks focus on short texts, but long texts are produced in the context of longer discourses. |
| Approach: | They propose a new benchmark that places models in context of long texts that require reasoning over long texts. |
| Outcome: | The proposed task sets are based on a set of long-text datasets and host a live leaderboard to facilitate research on model architecture and pretraining methods. |
Copied to clipboard
| Challenge: | Recent interpretability methods project weights and hidden states obtained from the forward pass to the models’ vocabularies, helping to uncover how information flows within LMs. |
| Approach: | They propose to cast a gradient matrix as a low-rank linear combination of forward and backward passes’ inputs and then to project these gradients into vocabulary items. |
| Outcome: | The proposed method can be cast as a low-rank linear combination of forward and backward passes’ inputs and project these gradients into vocabulary items. |
Copied to clipboard
| Challenge: | Existing methods for erasing concepts from model parameters are either too coarse, shallow or ineffective. |
| Approach: | They propose a framework for precisely erasing entire concepts from model parameters by directly editing directions that encode them in parameter space. |
| Outcome: | The proposed framework reduces errors on the target concept to as low as 7.7% while improving specificity and robustness. |
Copied to clipboard
| Challenge: | Recent efforts in natural language processing (NLP) commonsense reasoning research have produced a number of new datasets and benchmarks. |
| Approach: | They propose a manually-curated, multi-task benchmark that evaluates models' ability to apply commonsense reasoning in the context of six real-world NLP tasks. |
| Outcome: | The proposed benchmark evaluates the ability of models to apply commonsense reasoning in the context of six real-world NLP tasks. |
Copied to clipboard
| Challenge: | Transformer-based language models create hidden representations of inputs at every layer, but only use final-layer representations for prediction. |
| Approach: | They propose a method for casting hidden representations as final representations, bypassing transformer computation in-between. |
| Outcome: | The proposed method produces more accurate predictions from hidden layers across various model scales, architectures, and data distributions. |
Copied to clipboard
| Challenge: | Large language models (LLMs) often make errors when handling simple numerical tasks . a natural hypothesis is that these errors stem from how LLMs represent numbers . |
| Approach: | They propose to examine how LLMs represent numbers with circular representations per digit . they propose to use digit-wise representations to shed light on errors on numerical tasks . |
| Outcome: | The proposed model is internally represented with individual circular representations per-digit in base 10 . the proposed model could be used to analyze numerical mechanisms in large language models . |
Copied to clipboard
| Challenge: | Existing pipelines for describing concepts in large language models (LLMs) rely on activating inputs to generate descriptions that fail to capture the causal effect of a feature on outputs. |
| Approach: | They propose to use inputs that activate features to generate natural language descriptions for concepts represented by large language models (LLMs) . identifying activating inputs is costly, and the mechanistic role of a feature in model behavior is determined by how inputs cause it to activate and how feature activation affects outputs. |
| Outcome: | The proposed methods capture the causal effect of a feature on outputs better than input-centric descriptions, but combine the two leads to the best performance on both input and output evaluations. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) latently perform multi-hop reasoning with complex prompts such as "The mother of the singer of ‘Superstition’ is". |
| Approach: | They examine whether Large Language Models (LLMs) latently perform multi-hop reasoning with complex prompts such as "The mother of the singer of ‘Superstition’ is". |
| Outcome: | The proposed model can latently perform multi-hop reasoning with complex prompts such as "The mother of the singer of ‘Superstition’ is". |
Copied to clipboard
| Challenge: | Existing methods to evaluate knowledge in large language models require querying and evaluating the model's generated responses. |
| Approach: | They ask whether it is possible to estimate how knowledgeable a model is about a subject entity only from its internal computation. |
| Outcome: | The proposed model performs well with QA accuracy and FActScore . it can be leveraged to guide decisions on how to apply further training or augment queries with retrieval. |
Copied to clipboard
| Challenge: | Recent efforts to create challenge benchmarks that test the abilities of natural language understanding models have largely depended on human annotations. |
| Approach: | They propose a framework for automatic reasoning-oriented perturbation of question-answer pairs that decomposes a question into reasoning steps required to answer it and generates new question-anchor pairs. |
| Outcome: | The proposed framework generates evaluation sets for reading comprehension benchmarks and generates examples without human intervention. |
Copied to clipboard
| Challenge: | Adapters are small modules trained on top of a frozen language model to adapt predictions to new target languages. |
| Approach: | They propose to train transformer language adapters on top of a frozen model to adapt predictions to new target languages. |
| Outcome: | The transformer language adapters are trained on top of a frozen model to adapt predictions to new target languages. |
Copied to clipboard
| Challenge: | Existing methods for analyzing LLMs rely on dictionary learning with sparse autoencoders (SAEs) however, SAEs struggle in causal evaluations and lack intrinsic interpretability, as their learning is not explicitly tied to the computations of the model. |
| Approach: | They propose to decompose MLP activations with semi-nonnegative matrix factorization (SNMF) such that the learned features are mapped to their activating inputs, making them directly interpretable. |
| Outcome: | Experiments on Llama 3.1, Gemma 2 and GPT-2 show that SNMF derived features outperform SAEs and a strong supervised baseline on causal steering while aligning with human-interpretable concepts. |
Copied to clipboard
| Challenge: | In-context learning (ICL) is a powerful new learning paradigm for Large Language Models (LLMs). |
| Approach: | They propose to use a model with a prompt and a query to learn a mapping based on two examples to produce the output. |
| Outcome: | The proposed model can learn functions from a simple structure based on a training set and a single task vector calculated from the training set. |
Copied to clipboard
| Challenge: | Understanding Transformer-based models has attracted significant attention . a zero-pass approach is feasible for some parameters, and for two-layer attention networks . |
| Approach: | They propose a theoretical framework where parameters of a trained Transformer are interpreted by projecting them into the embedding space. |
| Outcome: | The proposed framework shows that pre-trained and fine-tuned models can be interpreted in embedding space. |
Copied to clipboard
| Challenge: | Fig. 1 shows how feed-forward network (FFN) layers are utilized to build LMs. |
| Approach: | They reverse-engineer the operation of feed-forward network layers to find out how they work . they show that each update can be decomposed to sub-updates corresponding to single parameter vectors . |
| Outcome: | The proposed model reduces the toxicity of GPT2 by almost 50% and improves computation efficiency with a simple early exit rule, saving 20% of computation on average. |