Kevin Meng

dblp:06/8478 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
6since 2021 · last 2025
0000-0001-7336-5797ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 5 first-author · 5 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Trustworthy machine learning · 44% Language models and text generation · 34% Knowledge representation and reasoning · 23%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

Topics — the 4 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
knowledge editing
1.222023
Mass-Editing Memory in a Transformer · ICLR 2023
Locating and Editing Factual Associations in GPT · NeurIPS 2022
Machine learning › Trustworthy machine learning
interpretability
0.812024
Linearity of Relation Decoding in Transformer Language Models · ICLR 2024
Machine learning › Trustworthy machine learning › interpretability
mechanistic interpretability
0.612022
Locating and Editing Factual Associations in GPT · NeurIPS 2022
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge base
factual knowledge storage
0.212022
Locating and Editing Factual Associations in GPT · NeurIPS 2022

Methods — techniques the papers use, named apart from their topics

reward design analysis · 1.7benchmark checklist · 1.7probing · 0.8linear transformation · 0.8rank-one update · 0.7model editing · 0.7rank-one model editing · 0.6causal intervention · 0.6
YearPublicationVenuePosition
2025 Establishing Best Practices in Building Rigorous Agentic Benchmarks
abstract
Benchmarks are essential for quantitatively tracking progress in AI. As AI agents become increasingly capable, researchers and practitioners have introduced agentic benchmarks to evaluate agents on complex, real-world tasks. These benchmarks typically measure agent capabilities by evaluating task outcomes via specific reward designs. However, we show that many agentic benchmarks have issues in task setup or reward design. For example, SWE-bench-Verified uses insufficient test cases, while $\tau$-bench counts empty responses as successes. Such issues can lead to under- or overestimation of agents’ performance by up to 100% in relative terms. To make agentic evaluation rigorous, we introduce the Agentic Benchmark Checklist (ABC), a set of guidelines that we synthesized from our benchmark-building experience, a survey of best practices, and previously reported issues. When applied to CVE-Bench, a benchmark with a particularly complex evaluation design, ABC reduces performance overestimation by 33%.
Yuxuan Zhu 0003, Tengjun Jin, Yada Pruksachatkun, Andy Zhang, Sasha Cui, Sayash Kapoor, Shayne Longpre, Kevin Meng, Rebecca Weiss, Fazl Barez, Rahul Gupta 0001, Jwala Dhamala, Jacob Merizian, Mario Giulianelli, Harry Coppock, Cozmin Ududec, Antony Kellermann, Jasjeet S. Sekhon, Jacob Steinhardt, Sarah Schwettmann, Arvind Narayanan, Matei Zaharia, Ion Stoica, Percy Liang, Daniel Kang 0001
NeurIPS9
2024 Linearity of Relation Decoding in Transformer Language Models
abstract
Much of the knowledge encoded in transformer language models (LMs) may be expressed in terms of relations: relations between words and their synonyms, entities and their attributes, etc. We show that, for a subset of relations, this computation is well-approximated by a single linear transformation on the subject representation. Linear relation representations may be obtained by constructing a first-order approximation to the LM from a single prompt, and they exist for a variety of factual, commonsense, and linguistic relations. However, we also identify many cases in which LM predictions capture relational knowledge accurately, but this knowledge is not linearly encoded in their representations. Our results thus reveal a simple, interpretable, but heterogeneously deployed knowledge representation strategy in transformer LMs.
Evan Hernandez, Arnab Sen Sharma, Tal Haklay, Kevin Meng, Martin Wattenberg, Jacob Andreas, Yonatan Belinkov, David Bau
ICLR4
2024 Gradient-Based Adversarial Training on Transformer Networks for Detecting Check-Worthy Factual Claims
abstract
This article presents the latest developments to ClaimBuster’s claim-spotting model, which tackles the critical task of identifying check-worthy claims from large streams of information. We introduce the first adversarially regularized, transformer-based claim-spotting model, which achieves state-of-the-art results on several benchmark datasets. In addition to analyzing model performance metrics, we also quantitatively and qualitatively analyze the impact of ClaimBuster’s real-world deployment. Moreover, to help facilitate reproducibility and community engagement, we publicly release our codebase, dataset, data curation platform, API, Google Colab notebooks, and various ClaimBuster-based demo systems, at claimbuster.org .
Kevin Meng, Damian Jimenez, Jacob Daniel Devasier, Sai Sandeep Naraparaju, Fatma Arslan, Daniel Obembe, Chengkai Li 0001
ACM Trans. Intell. Syst. Technol.1
2023 Mass-Editing Memory in a Transformer
Kevin Meng, Arnab Sen Sharma, Alex Andonian, Yonatan Belinkov, David Bau
ICLR1
2022 Evidence of Onset and Sustained Neural Responses to Isolated Phonemes from Intracranial Recordings in a Voice-based Cursor Control Task
Kevin Meng, Seo-Hyun Lee, Farhad Goodarzy, Simon J. Vogrin, Mark J. Cook, Seong-Whan Lee, David B. Grayden
INTERSPEECH1
2022 Locating and Editing Factual Associations in GPT
abstract
We analyze the storage and recall of factual associations in autoregressive transformer language models, finding evidence that these associations correspond to localized, directly-editable computations. We first develop a causal intervention for identifying neuron activations that are decisive in a model's factual predictions. This reveals a distinct set of steps in middle-layer feed-forward modules that mediate factual predictions while processing subject tokens. To test our hypothesis that these computations correspond to factual association recall, we modify feed-forward weights to update specific factual associations using Rank-One Model Editing (ROME). We find that ROME is effective on a standard zero-shot relation extraction (zsRE) model-editing task, comparable to existing methods. To perform a more sensitive evaluation, we also evaluate ROME on a new dataset of counterfactual assertions, on which it simultaneously maintains both specificity and generalization, whereas other methods sacrifice one or another. Our results confirm an important role for mid-layer feed-forward modules in storing factual associations and suggest that direct manipulation of computational mechanisms may be a feasible approach for model editing. The code, dataset, visualizations, and an interactive demo notebook are available in the supplemental materials.
Kevin Meng, David Bau, Alex Andonian, Yonatan Belinkov
NeurIPS1
2019 Through-Wall Pose Imaging in Real-Time with a Many-to-Many Encoder/Decoder Paradigm
abstract
Overcoming the visual barrier and developing "see-through vision" has been one of mankind's long-standing dreams. Unlike visible light, Radio Frequency (RF) signals penetrate opaque obstructions and reflect highly off humans. This paper establishes a deep-learning model that can be trained to reconstruct continuous video of a 15-point human skeleton even through visual occlusion. The training process adopts a student/teacher learning procedure inspired by the Feynman learning technique, in which video frames and RF data are first collected simultaneously using a co-located setup containing an optical camera and an RF antenna array transceiver. Next, the video frames are processed with a computer-vision-based gait analysis "teacher" module to generate ground-truth human skeletons for each frame. Then, the same type of skeleton is predicted from corresponding RF data using a "student" deep-learning model consisting of a Residual Convolutional Neural Network (CNN), Region Proposal Network (RPN), and Recurrent Neural Network with Long-Short Term Memory (LSTM) that 1) extracts spatial features from RF images, 2) detects all people present in a scene, and 3) aggregates information over many time-steps, respectively. The model is shown to both accurately and completely predict the pose of humans behind visual obstruction solely using RF signals. Primary academic contributions include the novel many-to-many imaging methodology, unique integration of RPN and LSTM networks, and original training pipeline.
Kevin Meng
ICMLA1
2018 Vehicle Action Prediction Using Artificial Intelligence
abstract
Each year, car accidents on United States roadways claim tens of thousands of lives and injure millions of others, of which almost half involve a combination of two critical pre-crash events: turning and changing lanes. Advanced Driver Assistance Systems (ADAS) that are currently installed in vehicles provide reactive protections that warn drivers of dangers up to 0.5 seconds ahead of collisions. However, rule of thumb suggests 2 seconds for safety in emergency reactions; many lives could be saved even with a slight improvement to the warning time. This paper develops an innovative two-stage neural network model that predicts drivers' actions before fatal collisions can occur. In a novel procedural flow, data is collected from sensors and devices installed inside and outside the vehicle including two cameras, a Global Positioning System (GPS) module, an Onboard Diagnostics-II (OBD-II) interface, and a gyroscope, preprocessed with a Convolutional Neural Network-based (CNN) computer vision model to extract facial movements and rotation, filtered and selected with the Classification and Regression Tree (CART), and modeled with a Recurrent Neural Network w/ Long Short-Term Memory (RNN-LSTM). Results show that the methodology presented in this paper is superior compared to existing ones.
Kevin Meng
ICMLA1