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. Identifiable but Hard to Estimate: Rotation in Equally Spaced Overcomplete ICA

    Nov 9, 2026Wenjun Xiao, Yinghao Fang, Hanxin Chen +3Independent Component AnalysisSample Complexity

  2. The Price of List Replicability: Tight Bounds for Bias Estimation

    Nov 3, 2026Michael Chen, Atieh Bastan, A. Pavan +1Sample ComplexityInformation-Theoretic Lower Bounds

  3. Calibrated Multiaccuracy: Deterministic and Randomized Sample Complexity

    Nov 2, 2026Jiuyao Lu, Georgy Noarov, Aaron RothSample ComplexityModel Calibration

  4. Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching

    Nov 1, 2026Mudit Gaur, Prashant Trivedi, Shuchin Aeron +3Flow MatchingFlow-Based Generative Modeling

  5. The Structure Gap: When More Data Cannot Replace Structured Reasoning

    Oct 27, 2026Kheer Sagar Patel, Mojtaba SoltanalianStatistical Learning TheorySample Complexity

  6. Reverse-KL Policy Distillation: Statistical Guarantees and Limits

    Oct 22, 2026Haolin Liu, Chen-Yu Wei, Julian ZimmertLanguage Model DistillationKnowledge Distillation

  7. The role of locality and weight sharing in convolutional neural networks

    Oct 21, 2026Francesco Mori, Melanie WeberConvolutional Neural NetworksNeural Network Training Dynamics

  8. Asymmetric Likelihood-Free Hypothesis Testing

    Oct 21, 2026Gunjan Kumar, Yash Pote, Jonathan ScarlettStatistical Hypothesis TestingSample Complexity

  9. The Price of Choice in Selective Prediction

    Oct 21, 2026Daniel Cieślak, Andrzej CzyżewskiSelective PredictionAlgorithmic Auditing

  10. Dimension-Free Scaling Laws for Size Generalization: An Exponential Separation

    Oct 13, 2026Behrooz Tahmasebi, Melanie WeberSample ComplexityStatistical Learning Theory

  11. When More Objectives Make Identification Easier: The Role of Preferences and Feedback

    Oct 13, 2026Bo Xue, Ji Cheng, Yuanyu Wan +1Multi-Armed BanditsBest-Arm Identification

  12. Sparse Dictionary Learning for Measure-Valued Data via Linearized Optimal Transport: Efficient Algorithms and Sample Complexity

    Oct 9, 2026Brendan Mallery, Shuchin Aeron, James MurphyRepresentation LearningSparse Coding

  13. Subspace Uncertainty and Sharp Sampling Thresholds on the Boolean Cube

    Oct 8, 2026Thomas WeinbergerSample ComplexityStatistical Learning Theory

  14. Recovery Guarantees for Posterior Sampling of One-Bit Compressed Sensing

    Oct 8, 2026Jing Ma, Yujia Wu, Zhaoqiang LiuCompressed SensingSample Complexity

  15. Sharp dimensional analysis of midpoint methods for Langevin sampling

    Oct 5, 2026Fan Chen, Sinho Chewi, Jianfeng Lu +1Markov Chain Monte CarloStochastic Differential Equations

  16. Seer: Maximum Likelihood Regression for Learning-Speed Curves

    Oct 2, 2026Carl Myers KadieLearning Curve PredictionLearning Curves

  17. Learning Linear Systems under Heavy-Tailed Noise: A Non-Asymptotic Analysis from A Single Trajectory

    Sep 30, 2026Xiaomian Yang, Sungho ShinStochastic Linear Dynamical SystemsSample Complexity

  18. How Many Samples Are Enough for Learning Across Domains?

    Sep 30, 2026Hong ZhengSample ComplexityDomain Generalization

  19. Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries

    Sep 29, 2026Natsuto Isogai, Satoshi Yoshida, Mio MuraoSample ComplexityQuantum Machine Learning

  20. Counterfactual Probing for Parallel Unmasking with Hidden Forest Structure

    Sep 29, 2026Ryotaro Kawata, Satoshi Hayakawa, Taiji SuzukiSample ComplexityProbabilistic Graphical Models

  21. The Statistical Cost of Causal Discovery with Feedback

    Sep 28, 2026Sunmin Oh, Seungsu Han, Gunwoong ParkSample ComplexityCausal Discovery

  22. The cost of useful natural gradient updates

    Sep 27, 2026Subhransu S. Bhattacharjee, Dylan Campbell, Rahul ShomeSample ComplexityNatural Gradient Methods

  23. Structuring Relations Among Learning Paradigms via Protocol--Objective--Resource Reductions

    Sep 26, 2026Junwei Su, Changjie Wang, Dongyang ChangStatistical Learning TheoryMeta-Learning