Amit Sahai
Author directory2026
TaoAnalysisBench: Do Automated Theorem Prover LLMs Generalize Beyond MathLib?
Alexander K Taylor | Junyi Zhang | Ethan Ji | Vigyan Sahai | Haikang Deng | Yuanzhou Chen | Yifan Yuan | Di Wu | Jia-Chen Gu | Kai-Wei Chang | Nanyun Peng | Amit Sahai | Wei Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Alexander K Taylor | Junyi Zhang | Ethan Ji | Vigyan Sahai | Haikang Deng | Yuanzhou Chen | Yifan Yuan | Di Wu | Jia-Chen Gu | Kai-Wei Chang | Nanyun Peng | Amit Sahai | Wei Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Automated theorem proving (ATP) benchmarks largely consist of problems formalized in MathLib, so current ATP training and evaluation are heavily biased toward MathLib’s definitional framework. However, frontier mathematics is often exploratory and prototype-heavy, relying on bespoke constructions that deviate from standard libraries. In this work, we evaluate the robustness of current ATP systems when applied to a novel definitional framework. We introduce TaoAnalysisBench, an undergraduate-level benchmark derived from the exercises and definitional frameworks given in Terence Tao’s Analysis I, which formalizes analysis by constructing core mathematical concepts from scratch, without relying on standard Mathlib definitions, as well as by mixing from-scratch and MathLib constructions. For fair evaluation, we build an agentic pipeline that automatically extracts a compilable, self-contained local environment for each problem. To isolate the effect of definitional frameworks, we additionally translate every problem into a mathematically equivalent Mathlib formulation, yielding paired TaoAnalysisBench-Mathlib statements for direct comparison. While state-of-the-art ATP models perform capably within the MathLib framework, performance drops by an average of 2.18x on the definitionally equivalent Tao formulation. This indicates that the main bottleneck is limited generalization across definitional frameworks rather than task difficulty. TaoAnalysisBench thus highlights a gap between benchmark performance and applicability, and provides a concrete foundation for developing and testing provers better aligned with research mathematics.
2025
Sandcastles in the Storm: Revisiting the (Im)possibility of Strong Watermarking
Fabrice Y Harel-Canada | Boran Erol | Connor Choi | Jason Liu | Gary Jiarui Song | Nanyun Peng | Amit Sahai
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Fabrice Y Harel-Canada | Boran Erol | Connor Choi | Jason Liu | Gary Jiarui Song | Nanyun Peng | Amit Sahai
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Watermarking AI-generated text is critical for combating misuse. Yet recent theoretical work argues that any watermark can be erased via random walk attacks that perturb text while preserving quality. However, such attacks rely on two key assumptions: (1) rapid mixing (watermarks dissolve quickly under perturbations) and (2) reliable quality preservation (automated quality oracles perfectly guide edits). Through large-scale experiments and human-validated assessments, we find mixing is slow: 100% of perturbed texts retain traces of their origin after hundreds of edits, defying rapid mixing. Oracles falter, as state-of-the-art quality detectors misjudge edits (77% accuracy), compounding errors during attacks. Ultimately, attacks underperform: automated walks remove watermarks just 26% of the time – dropping to 10% under human quality review. These findings challenge the inevitability of watermark removal. Instead, practical barriers – slow mixing and imperfect quality control – reveal watermarking to be far more robust than theoretical models suggest. The gap between idealized attacks and real-world feasibility underscores the need for stronger watermarking methods and more realistic attack models.
2024
Measuring Psychological Depth in Language Models
Fabrice Y Harel-Canada | Hanyu Zhou | Sreya Muppalla | Zeynep Senahan Yildiz | Miryung Kim | Amit Sahai | Nanyun Peng
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Fabrice Y Harel-Canada | Hanyu Zhou | Sreya Muppalla | Zeynep Senahan Yildiz | Miryung Kim | Amit Sahai | Nanyun Peng
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Evaluations of creative stories generated by large language models (LLMs) often focus on objective properties of the text, such as its style, coherence, and diversity. While these metrics are indispensable, they do not speak to a story’s subjective, psychological impact from a reader’s perspective. We introduce the Psychological Depth Scale (PDS), a novel framework rooted in literary theory that measures an LLM’s ability to produce authentic and narratively complex stories that provoke emotion, empathy, and engagement. We empirically validate our framework by showing that humans can consistently evaluate stories based on PDS (0.72 Krippendorff’s alpha). We also explore techniques for automating the PDS to easily scale future analyses. GPT-4o, combined with a novel Mixture-of-Personas (MoP) prompting strategy, achieves an average Spearman correlation of 0.51 with human judgment while Llama-3-70B with constrained decoding scores as high as 0.68 for empathy. Finally, we compared the depth of stories authored by both humans and LLMs. Surprisingly, GPT-4 stories either surpassed or were statistically indistinguishable from highly-rated human-written stories sourced from Reddit. By shifting the focus from text to reader, the Psychological Depth Scale is a validated, automated, and systematic means of measuring the capacity of LLMs to connect with humans through the stories they tell.