Yash Nair
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yash Nair has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Lucas Janson
Harvard University
2 shared publications - Aparna Taneja
Google research
1 shared publication - Kevin Du
Department of Statistics Department of Statistics Department of Statistics Harvard University Stanford University Harvard University
1 shared publication Lucas Janson
Department of Statistics, Stanford University
1 shared publication- Milind Tambe
Harvard University
1 shared publication - Niclas Boehmer
Hasso Plattner Institute University of Potsdam Germany
1 shared publication
Latest Publications
- 4 November 2026
- Published by Taylor & Francis in Journal of the American Statistical Association
- p. 1-60
ACS: An interactive framework for conformal selection
1 IntroductionWe study the problem of identifying promising units from a potentially large pool of candidates—such as selecting drug candidates with high binding affinity to a target among a space ...
- 4 November 2026
- Published by Taylor & Francis in Journal of the American Statistical Association
- p. 1-60
ACS: An interactive framework for conformal selection
1 IntroductionWe study the problem of identifying promising units from a potentially large pool of candidates—such as selecting drug candidates with high binding affinity to a target among a space ...
- 27 July 2026
- Published by Taylor & Francis in Journal of the American Statistical Association
- p. 1-24
Randomization Tests for Adaptively Collected Data
1 Introduction1.1 MotivationRandomization tests form an important methodological framework that enjoys a wide array of uses across statistics, ranging from testing equality of distributions to test...
- 27 July 2026
- Published by Taylor & Francis in Journal of the American Statistical Association
- p. 1-24
Randomization Tests for Adaptively Collected Data
1 Introduction1.1 MotivationRandomization tests form an important methodological framework that enjoys a wide array of uses across statistics, ranging from testing equality of distributions to test...
- Open Access
Bernstein-von Mises for Adaptively Collected Data
Uncertainty quantification (UQ) for adaptively collected data, such as that coming from adaptive experiments, bandits, or reinforcement learning, is necessary for critical elements of data collection such as ensuring safety and conducting after-study inference. The data's adaptivity creates significant challenges for frequentist UQ, yet Bayesian UQ remains the same as if the data were independent and identically distributed (i.i.d.), making it an appealing and commonly used approach. Bayesian UQ requires the (correct) specification of a prior distribution while frequentist UQ does not, but for i.i.d. data the celebrated Bernstein-von Mises theorem shows that as the sample size grows, the prior 'washes out' and Bayesian UQ becomes frequentist-valid, implying that the choice of prior need not be a major impediment to Bayesian UQ as it makes no difference asymptotically. This paper for the first time extends the Bernstein-von Mises theorem to adaptively collected data, proving asymptotic equivalence between Bayesian UQ and Wald-type frequentist UQ in this challenging setting. Our result showing this asymptotic agreement does not require the standard stability condition required by works studying validity of Wald-type frequentist UQ; in cases where stability is satisfied, our results combined with these prior studies of frequentist UQ imply frequentist validity of Bayesian UQ. Counterintuitively however, they also provide a negative result that Bayesian UQ is not asymptotically frequentist valid when stability fails, despite the fact that the prior washes out and Bayesian UQ asymptotically matches standard Wald-type frequentist UQ. We empirically validate our theory (positive and negative) via a range of simulations.
Open AccessBernstein-von Mises for Adaptively Collected Data
Uncertainty quantification (UQ) for adaptively collected data, such as that coming from adaptive experiments, bandits, or reinforcement learning, is necessary for critical elements of data collection such as ensuring safety and conducting after-study inference. The data's adaptivity creates significant challenges for frequentist UQ, yet Bayesian UQ remains the same as if the data were independent and identically distributed (i.i.d.), making it an appealing and commonly used approach. Bayesian UQ requires the (correct) specification of a prior distribution while frequentist UQ does not, but for i.i.d. data the celebrated Bernstein-von Mises theorem shows that as the sample size grows, the prior 'washes out' and Bayesian UQ becomes frequentist-valid, implying that the choice of prior need not be a major impediment to Bayesian UQ as it makes no difference asymptotically. This paper for the first time extends the Bernstein-von Mises theorem to adaptively collected data, proving asymptotic equivalence between Bayesian UQ and Wald-type frequentist UQ in this challenging setting. Our result showing this asymptotic agreement does not require the standard stability condition required by works studying validity of Wald-type frequentist UQ; in cases where stability is satisfied, our results combined with these prior studies of frequentist UQ imply frequentist validity of Bayesian UQ. Counterintuitively however, they also provide a negative result that Bayesian UQ is not asymptotically frequentist valid when stability fails, despite the fact that the prior washes out and Bayesian UQ asymptotically matches standard Wald-type frequentist UQ. We empirically validate our theory (positive and negative) via a range of simulations.
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (27) , 27849-27857
Evaluating Index-based Treatment Allocation in Underresourced Communities
In many applications of AI for Social Impact (e.g., when allocating spots in support programs for underserved communities), resources are scarce and an allocation policy is needed to decide who receives a resource. Before being deployed at scale, a rigorous evaluation of an AI-powered allocation policy is vital. In this paper, we introduce the methods necessary to evaluate index-based allocation policies, which allocate a limited number of resources to those who need them the most. Such policies create dependencies between agents, rendering standard statistical tests invalid and ineffective. Addressing the arising practical and technical challenges, we describe an efficient estimator and methods for drawing valid statistical conclusions. Our extensive experiments validate our methodology in practical settings while also showcasing its statistical power. We conclude by proposing and empirically verifying extensions of our methodology that enable us to reevaluate a past randomized control trial conducted with 10000 beneficiaries for a mHealth program for pregnant women. Our new methodology allows us to draw previously invisible conclusions when comparing two different ML allocation policies.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (27) , 27849-27857
Open AccessEvaluating Index-based Treatment Allocation in Underresourced Communities
In many applications of AI for Social Impact (e.g., when allocating spots in support programs for underserved communities), resources are scarce and an allocation policy is needed to decide who receives a resource. Before being deployed at scale, a rigorous evaluation of an AI-powered allocation policy is vital. In this paper, we introduce the methods necessary to evaluate index-based allocation policies, which allocate a limited number of resources to those who need them the most. Such policies create dependencies between agents, rendering standard statistical tests invalid and ineffective. Addressing the arising practical and technical challenges, we describe an efficient estimator and methods for drawing valid statistical conclusions. Our extensive experiments validate our methodology in practical settings while also showcasing its statistical power. We conclude by proposing and empirically verifying extensions of our methodology that enable us to reevaluate a past randomized control trial conducted with 10000 beneficiaries for a mHealth program for pregnant women. Our new methodology allows us to draw previously invisible conclusions when comparing two different ML allocation policies.