activity
20232026
most citedPosition: Use Sparse Autoencoders to Discover Unknowns

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

collaborators
Showing 2026Show all

5 papers · 1 filter

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.CL2026

Hitting a Moving Target: Test-Time Adaptation for AI Text Detection under Continual Distribution Shift

Kevin Ren, Manish Raghavan, Nikhil Garg

Deployed AI text detection approaches are supervised, relying on training-time access to labeled datasets of both human-written and AI-generated text. This approach is vulnerable t…

cs.CY2026

The Subjectivity of Monoculture

Nathanael Jo, Nikhil Garg, Manish Raghavan

Machine learning models---including large language models (LLMs)---are often said to exhibit monoculture, where outputs agree strikingly often. However, we present two experiments…

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…