activity
20082026
most citedOptimal Algorithms for Testing Closeness of Discrete Distributions

118 citations · 610 across the 55 of their papers we have counts for

collaborators

60 papers

cs.LG2026

Multimodal Unlearning Across Vision, Language, Video, and Audio: Survey of Methods, Datasets, and Benchmarks

Nobin Sarwar, Shubhashis Roy Dipta, Zheyuan Liu +1

With the growing adoption of VLMs, DMs, LLMs, and AFMs, these multimodal foundation models can inadvertently encode sensitive, copyrighted, biased, or unsafe cross-modal associatio…

math.CO2026

Short proofs in combinatorics, probability and number theory II

Boris Alexeev, Moe Putterman, Mehtaab Sawhney +2

We give a quintet of proofs resulting from questions posed by Erdős. These questions concern ordinary lines in planar point sets, sequences with uniformly small exponential sums, $…

math.CO2026

Short proofs in combinatorics and number theory

Boris Alexeev, Moe Putterman, Mehtaab Sawhney +2

We give a triplet of short proofs, each of which answers a question raised by Erdős. The first concerns the small prime factors of , the second concerns whether an ad…

math.CO2026

On infinite sets with no on a line

Moe Putterman, Mehtaab Sawhney, Gregory Valiant

We give a construction of an infinite set of points in such that any subset has a constant density subset with no three points collinear and…

cs.CL2026★ 18 cited

OpenAI GPT-5 System Card

Aaditya Singh, Adam Fry, Adam Perelman +483

This is the system card published alongside the OpenAI GPT-5 launch, August 2025. GPT-5 is a unified system with a smart and fast model that answers most questions, a deeper reason…

cs.CL2025

On the Entropy Calibration of Language Models

Steven Cao, Gregory Valiant, Percy Liang

We study the problem of entropy calibration, which asks whether a language model's entropy over generations matches its log loss on human text. Past work found that models are misc…