Sample-Adaptivity Tradeoff in On-Demand Sampling

NeurIPSSpotlight2025

Authors
Nika Haghtalab, Omar Montasser, Mingda Qiao
Venue
NeurIPS 2025
Track
Spotlight

TL;DR

We study the tradeoff between sample complexity and round complexity in *on-demand sampling*, where the learning algorithm adaptively samples from $k$ distributions over a limited number of rounds…

Opening excerpt from the authors’ abstract. source

Read the paper

Topics

sample complexity

Related NeurIPS papers

← All NeurIPS 2025 Spotlight papers · Browse the whole archive