activity
20242026
most citedPosition: Use Sparse Autoencoders to Discover Unknowns

2 citations · 2 across the 4 of their papers we have counts for

collaborators

6 papers

cs.CY2026

Personalized Recommendations Without Inducing Congestion: Mitigating Disparities in the NYC High School Match

Erica Chiang, Kenny Peng, Rebecca Lichtenstein +7

Algorithmic recommendations can help participants navigate large matching markets. For example, recommendations for school and college choices may reduce information frictions and…

cs.AI2026

A Testable Theory of Atomic Features

Kenny Peng, Jon Kleinberg, Nikhil Garg

We develop and test a theory of language model representations in which there exist atomic features. Our main theoretical insight is that in such a model, sparse dictionaries (e.g.…

cs.LG2026

How Many Features Can a Language Model Store Under the Linear Representation Hypothesis?

Nikhil Garg, Jon Kleinberg, Kenny Peng

We introduce a mathematical framework for the linear representation hypothesis (LRH), which asserts that intermediate layers of language models store features linearly. We separate…

cs.LG2025★ 2 cited

Position: Use Sparse Autoencoders to Discover Unknowns

Kenny Peng, Rajiv Movva, Jon Kleinberg +2

While sparse autoencoders (SAEs) have generated significant excitement, a series of negative results have added to skepticism about their usefulness. Here, we establish a conceptua…

cs.CL2025

Sparse Autoencoders for Hypothesis Generation

Rajiv Movva, Kenny Peng, Nikhil Garg +2

We describe HypotheSAEs, a general method to hypothesize interpretable relationships between text data (e.g., headlines) and a target variable (e.g., clicks). HypotheSAEs has three…

cs.AI2024

A No Free Lunch Theorem for Human-AI Collaboration

Kenny Peng, Nikhil Garg, Jon Kleinberg

The gold standard in human-AI collaboration is complementarity -- when combined performance exceeds both the human and algorithm alone. We investigate this challenge in binary clas…