Overview

Sample complexity quantifies the data or oracle access needed to achieve a specified accuracy and confidence in tasks such as PAC learning, estimation, hypothesis testing, system identification, and generative sampling. Researchers derive upper and lower bounds using tools such as VC and Rademacher complexity, information-theoretic arguments, minimax analysis, and adaptive sampling algorithms. A central theme is how structure—sparsity, low intrinsic dimension, symmetry, smoothness, or prior knowledge—can reduce data needs, while noise, distribution shift, robustness, and limited feedback can raise them. Matching bounds are known in many settings, but guarantees can change sharply with the task, assumptions, and resource being counted, so translating theory to practical data requirements remains an open challenge.

Latest papers

CardsList

110 papers15 papers in the last four weeks, down 21% on the four weeks before. 0.1% of all new papers.

  1. Efficient Support Recovery of Mixtures of Sparse Linear Classifiers with Fewer Measurements

    Sep 26, 2026Xiaxin Li, Arya MazumdarSparse RecoverySample Complexity

  2. Adversarially Robust PAC Learning with Optimal VC Rates

    Sep 21, 2026Steve Hanneke, Amirreza ShaeiriSample ComplexityAdversarial Robustness

  3. Learning CNF Formulas from Uniform Random Solutions: Near-Tight Sample Complexity for Valiant's Algorithm

    Sep 14, 2026Weiming Feng, Yixiao Yu, Yiyao ZhangBoolean Function LearningSample Complexity

  4. Gap Entropy and Almost Instance-Wise Optimal Best-Arm Identification

    Sep 12, 2026Jiarui Yao, Jiaxi Zhao, Xiangxin ZhouBest-Arm IdentificationSample Complexity

  5. Tight Sampling Complexity with Stochastic Gradient Oracles in Fixed Dimensions

    Sep 11, 2026Weiming Ou, Xiao WangSample ComplexityLog-Concave Sampling

  6. Learning to Price with Persuasion

    Aug 17, 2026Maria-Florina Balcan, Tejas Pagare, Karan SinghBayesian PersuasionMechanism Design

  7. Active-Trace Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling

    Aug 13, 2026Yuchen Xin, Zhihua ZhangLangevin DynamicsSample Complexity

  8. The Sample Complexity of Distributionally Robust PAC Learning under Cressie--Read Divergences

    Aug 5, 2026Elad Aigner-Horev, Daniel Rosenberg, Roi WeissSample ComplexityDistributionally Robust Optimization

  9. Sample Complexity of Multicalibration for Multilevel Properties

    Aug 4, 2026Jiuyao Lu, Krishnakumar Balasubramanian, Aleksandr Podkopaev +1Sample ComplexityModel Calibration

  10. Interaction Is Not Necessary for Order-Optimal 1-Bit Mean Estimation

    Aug 3, 2026Jiachen Hu, Han ZhongSample ComplexityMinimax Estimation

  11. Denoising growth complexity: Data geometry and certified schedules for diffusion sampling

    Jul 28, 2026Martin J. WainwrightSample ComplexityDiffusion Sampling

  12. Generalization bounds and sample complexity for remaining useful life prediction from complete degradation trajectories

    Jul 26, 2026Huy Hoang Le, Kim-Anh NguyenRUL EstimationSample Complexity

  13. The Tractability Landscape of Sampling with Inexact Scores

    Jul 21, 2026Anming Gu, Kevin Tian, Hubert Yang +1Sample Complexity

  14. On the Limits of Sampling-Based Reachability: Geometry, Dynamics, and Sample Complexity

    Jul 21, 2026Jixian Liu, Ihab Tabbara, Hussein Sibai +1Reachability AnalysisSample Complexity

  15. From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP

    Jul 13, 2026Michael Rizvi-Martel, Satwik Bhattamishra, Guillaume Rabusseau +1TransformerSample Complexity

  16. Data-Efficient Deep Learning: Empirical Guidelines for Training Set Size Estimation in Inertial Sensor Classification

    Jul 10, 2026Ofir Kruzel, Itzik KlienSample ComplexityLearning Curves

  17. A Hierarchy of Policy Learning Problems

    Jul 3, 2026Hamsa Bastani, Osbert Bastani, Shihan ChenSample ComplexityOffline RL

  18. Sample Complexity of Scientific Discovery: PAC Learnability of Compositional Function Trees

    Jun 28, 2026Şuayp Talha Kocabay, Talha Rüzgar Akkuş, Kerem YalçınSample ComplexityStatistical Learning Theory

  19. Sample complexity of unbalanced entropic OT

    Jun 23, 2026Francisco Andrade, Gabriel Peyré, Clarice PoonSample ComplexityEntropy Regularization

  20. Token Complexity of Certifying Stochastic-Oracle Reliability

    Jun 23, 2026Jie WangSample ComplexityInformation-Theoretic Lower Bounds

  21. Tight L∞L_\infty Sample Complexity for Low-Degree and Sparse Boolean Polynomials

    Jun 15, 2026Jasper van Doornmalen, Mathieu Molina, Victor Verdugo +1Surrogate ModelingBoolean Function Learning

  22. Quantum Occam Learning: Sample-Supported Expressibility for Circuit-Based Quantum Learning

    Jun 10, 2026Jeongho Bang, Kyoungho Cho, Jeongwoo JaeModel SelectionSample Complexity

  23. The Power of Test-Time Training for Approximate Sampling

    Jun 9, 2026Noah Golowich, Ankur Moitra, Dhruv RohatgiSample ComplexityTest-Time Training