Research
Note: (α-β) indicates alphabetical ordering
Preprints
LESSER: Post-Training Data Selection with Output-Layer Gradients
MoRE: Scaling Mixture of Experts with Hardware-Aware Low-Rank Routing
Delegating Authorization to Misaligned Agents: Coalitional Alignment and Safe Control
Personalization Aids Pluralistic Alignment Under Competition Best paper award, Workshop on AI for Mechanism Design and Strategic Decision Making, ICLR 2026
Why Do Transformers Fail to Forecast Time Series In-Context? Spotlight presentation, What Can('t) Transformers Do? Workshop, NeurIPS 2025
Weight Clipping for Robust Conformal Inference under Unbounded Covariate Shifts
Conference Papers
2026
Reliable Abstention under Adversarial Injections: Tight Lower Bounds and New Upper Bounds NeurIPS 2026
Narrowing the Collaboration Gap, Probably NeurIPS 2026
Learning When to Stop: Selective Imitation Learning Under Arbitrary Dynamics Shift NeurIPS 2026
Testing Noise Assumptions of Learning Algorithms COLT 2026 Best paper award, Reliable ML Workshop, NeurIPS 2025
Model Agreement via Anchoring COLT 2026
Emergent Alignment via Competition ICML 2026
Less Data, Faster Training: Repeating Smaller Datasets Speeds up Learning via Sampling Biases ICML 2026 Contributed talk, Workshop on Scientific Methods for Understanding Deep Learning, ICLR 2026
Is Code Better than Language for Algorithmic Reasoning? ICML 2026
In Good GRACES: Principled Teacher Selection for Knowledge Distillation ICLR 2026
Collaborative Prediction: Tractable Information Aggregation via Agreement SODA 2026 Spotlight presentation, EC 2025 Workshop on Human-AI CollaborationSpotlight presentation, 2025 TTIC Workshop on Incentives for Collaborative Learning and Data Sharing
2025
Probabilistic Stability Guarantees for Feature Attributions NeurIPS 2025
A Theory of Learning with Autoregressive Chain of Thought COLT 2025
Tractable Agreement Protocols STOC 2025
Conformal Language Model Reasoning with Coherent Factuality ICLR 2025
Progressive Distillation Induces an Implicit Curriculum Oral presentation, ICLR 2025
Logicbreaks: A Framework for Understanding Subversion of Rule-based Inference ICLR 2025
2024
The Evolution of Statistical Induction Heads: In-Context Learning Markov Chains NeurIPS 2024
Tolerant Algorithms for Learning with Arbitrary Covariate Shift Spotlight presentation, NeurIPS 2024
Complexity Matters: Feature Learning in the Presence of Spurious Correlations ICML 2024
2023
Adversarial Resilience in Sequential Prediction via Abstention NeurIPS 2023
Pareto Frontiers in Neural Feature Learning: Data, Compute, Width, and Luck Spotlight presentation, NeurIPS 2023
Exposing Attention Glitches with Flip-Flop Language Modeling Spotlight presentation, NeurIPS 2023
Transformers Learn Shortcuts to Automata Notable top-5% paper, ICLR 2023
2022
Recurrent Convolutional Neural Networks Learn Succinct Learning Algorithms NeurIPS 2022
Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit NeurIPS 2022
Inductive Biases and Variable Creation in Self-Attention Mechanisms ICML 2022
Understanding Contrastive Learning Requires Incorporating Inductive Biases ICML 2022
Anti-Concentrated Confidence Bonuses For Scalable Exploration ICLR 2022
Investigating the Role of Negatives in Contrastive Representation Learning AISTATS 2022
2021
2020
From Boltzmann Machines to Neural Networks and Back Again NeurIPS 2020
Statistical-Query Lower Bounds via Functional Gradients NeurIPS 2020
Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descent ICML 2020
Efficiently Learning Adversarially Robust Halfspaces with Noise ICML 2020
Learning Mixtures of Graphs from Epidemic Cascades ICML 2020
Learning Ising and Potts Models with Latent Variables AISTATS 2020
2019
Time/Accuracy Trade-offs for Learning a ReLU with respect to Gaussian Marginals Spotlight presentation, NeurIPS 2019
Learning Neural Networks with Two Nonlinear Layers in Polynomial Time COLT 2019
2018
Learning One Convolutional Layer with Overlapping Patches Oral presentation, ICML 2018
2017
Eigenvalue Decay Implies Polynomial-Time Learnability for Neural Networks NeurIPS 2017
Reliably Learning the ReLU in Polynomial Time COLT 2017 Oral presentation, Optimization for Machine Learning (OPT-ML) Workshop, NeurIPS 2016