Optimal Sample Complexity

Ask about this field

Recent momentum

emerging

0 papers in the last 28 days · 0.0% of indexed attention

Twelve weeks of publication activity for this topic as it is defined today.

Weekly history

Recent digests

What was published in this field, kept on the site without email delivery.

Period ending 2026-09-21

13 new papers

A weekly snapshot of new work published in Optimal Sample Complexity.

Period ending 2026-09-14

13 new papers

A weekly snapshot of new work published in Optimal Sample Complexity.

Period ending 2026-09-07

6 new papers

A weekly snapshot of new work published in Optimal Sample Complexity.

Inside this field

Focused directions

426 papers

Latest in Optimal Sample Complexity

Browse all topics →
CardsList

  1. Hypothesis Testing with Conditional Queries: Learnability and the Value of Interaction

    Aug 6, 2026Zonghuan XuTwo-Sample TestingOptimal Sample Complexity

  2. Stability of Ranking-dependent Pair-wise Comparison Patterns in the Analytic Hierarchy Process

    Aug 6, 2026Vitaliy Tsyganok, Sergii Kadenko, Oleh AndriichukComparisonWorst-Case

  3. ABC: Numerical Data Collection under Local Differential Privacy without Prior Knowledge

    Aug 6, 2026Incheol Baek, Hyungbin Kim, Yon Dohn ChungDifferential PrivacyData Collection

  4. Reachability in 3-VAS

    Aug 5, 2026Łukasz Kamiński, Sławomir LasotaReachabilityNp-Hard

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

    Aug 5, 2026Elad Aigner-Horev, Daniel Rosenberg, Roi WeissOptimal Sample ComplexityDistributional Learning

  6. Sample Complexity of Multicalibration for Multilevel Properties

    Aug 4, 2026Jiuyao Lu, Krishnakumar Balasubramanian, Aleksandr Podkopaev +1Multicalibration and CalibrationOptimal Sample Complexity

  7. Separating quantum circuits from classical LLMs

    Aug 4, 2026Srinivasan Arunachalam, Arkopal Dutt, Hari Krovi +1Quantum Circuit SimulationLarge Language Model Quantization

  8. Quality Control Algorithms for Pattern Counting

    Aug 4, 2026Cassandra Marcussen, Ronitt Rubinfeld, Madhu SudanWorst-CaseRandom

  9. Tight Worst-Case Bounds for the Smallest Eigenvalue of ReLU NTK Gram Matrices

    Aug 4, 2026Zhao SongLargest EigenvalueRectified Linear Unit

  10. The Condition-Number Barrier in Sparse Least Squares

    Aug 3, 2026Honghao Lin, Vahab Mirrokni, David P. WoodruffConvex OptimizationLeast Squares

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

    Aug 3, 2026Jiachen Hu, Han ZhongOptimal Sample ComplexityEstimators

  12. Wasserstein mixing time of the unadjusted Langevin algorithm

    Aug 3, 2026Francesco Pedrotti, Peter A. WhalleyLangevin DynamicsWasserstein Distance

  13. Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds

    Aug 3, 2026Deeparnab Chakrabarty, Aditi Dudeja, David SaulpicPartitioningOptimal Sample Complexity

  14. Sharp Root Anti-Concentration via Projective Incidence and Ordered Root Laws

    Aug 3, 2026Zijun Wang, Yuchen Miao, Yifan Hu +1Concentration InequalitiesO(T^Β)$ Simultaneous Regret

  15. Dense Language Generation Made Simple: Deterministic, Randomized, and Multi-Order Algorithms

    Aug 2, 2026Ziyi Cai, Shuangping Li, Yiheng Shen +2Lower BoundsDeterministic

  16. Active Regression for Single-Index Models with Unknown Link Functions

    Aug 2, 2026Chansophea Wathanak In, Yi Li, Wai Ming Tai +1Active LearningRegularization Techniques

  17. Factorized AdaBoost.MH Achieves the Same Convergence Rate as AdaBoost.MH

    Aug 2, 2026Xin Zou, Jingyuan XuBinary ClassificationDecision Trees

  18. Using Lower-Bound Representations for Trajectory Similarity Learning

    Aug 2, 2026Liwei Deng, Haotian Meng, Yupu Zhang +4Trajectory PredictionDistance

  19. UOT-IR: Structured Routing of High-Polyphony Symbolic Music into Fixed-Budget Representations

    Aug 1, 2026Ziyue Kang, Nan Nan, Chenhao Lin +1Sheet MusicContext Compression

  20. Fairness Auditing: Lower Bounds on Company Manipulation

    Aug 1, 2026Rachit Verma, Padala Manisha, Sujit GujarFairness AuditsAlgorithm Auditing

  21. Sample Efficient Hierarchical Reinforcement Learning via Best Policy Identification

    Jul 31, 2026Anders Jonsson, Emilie Kaufmann, Gianmarco Tedeschi +1Hierarchical Reinforcement LearningOptimal Sample Complexity

  22. Mining Verdict Boundaries for Neural Network Verification

    Jul 31, 2026Jiawei Ren, Guanqin Zhang, Zhenya Zhang +1Neural Network VerificationUpper Bounds

  23. Fast Rates for Swap-Agnostic Learning of Proper Losses

    Jul 30, 2026Princewill OkoroaforLearning-Augmented AlgorithmsOptimal Sample Complexity

  24. Hypergradient-based Bilevel Reinforcement Learning with Improved Sample Complexity

    Jul 30, 2026Naman Saxena, Mudit Gaur, Vaneet AggarwalEntropy Regularized Reinforcement LearningOptimal Sample Complexity

  25. Windowed thinning and query complexity for the bouncy particle and Zigzag samplers

    Jul 30, 2026Jianfeng Lu, Yinchen LuoMarkovian SamplingSample Complexity

  26. Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection

    Jul 30, 2026Arunan JLow-Rank AdaptationEmpirical Risk Minimization

  27. Field Codes for Distributed Coupling Samplers and Certified Empirical Transport

    Jul 29, 2026Hung Mai, Hai Nguyen, Luong Doan +4Optimal TransportSamplers

  28. Actions Have Consequences: Detecting Outcome Performativity using Intervention Testing

    Jul 29, 2026Brandon Gower-Winter, Georg KremplOutcomeClinical Prediction

  29. Tight Generalization Bound for AdaBoost

    Jul 29, 2026Mikael Møller HøgsgaardGeneralization BoundsUpper Bounds

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

    Jul 28, 2026Martin J. WainwrightDiffusion SamplingOptimal Sample Complexity

  31. Variance-Reduced Conditional Gradient Methods under Markovian Sampling for Nonconvex Composite Optimization

    Jul 28, 2026Zhaojun PengStochastic Smooth Convex OptimizationConvex Optimization

  32. Learning Distributions from Multiple Data Providers

    Jul 27, 2026Jon Kleinberg, Amin Saberi, Xizhi Tan +1Distributional LearningOptimal Sample Complexity

  33. Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSD

    Jul 27, 2026Jose Cribeiro-Ramallo, Florian Kalinke, Zoltán SzabóMaximum Mean DiscrepancyKernel Hilbert Spaces

  34. Adaptive Data Admission and Retention for Streaming Federated Learning

    Jul 27, 2026Zhuoyi Zhao, Ben LiangFederated LearningLearning-Augmented Algorithms

  35. Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set

    Jul 26, 2026Heyang Zhao, Tianyuan Jin, Weixin Wang +3Linear BanditsVariance Reduction

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

    Jul 26, 2026Huy Hoang Le, Kim-Anh NguyenUseful Life PredictionGeneralization Bounds

  37. Local Regularization Does Not Characterize Multiclass PAC Learnability

    Jul 26, 2026Eric HouMulticlass ClassificationSingular Learning Theory

  38. Exact values and exact upper bounds for families of integers with arithmetic progression intersections (Erdős Problem #272)

    Jul 25, 2026Zhanfu YangUpper BoundsConjecture

  39. An Explicit Counterexample to Stanley's Rankwise Lower-Bound Conjecture for Differential Posets

    Jul 25, 2026Xinan Dai, Wenhao Deng, Yingdong Shi +2ConjectureLower Bounds

  40. Efficient Learning of Truncated Boolean Product Distributions: Influence to the Rescue

    Jul 24, 2026Rohan Chauhan, Ioannis PanageasOptimal Sample ComplexityDistributional Learning

  41. Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs

    Jul 24, 2026Akira KitaokaMixed-Integer ProgrammingOptimal Sample Complexity

  42. Encoding orders and trees in real-valued functions

    Jul 23, 2026G Conant, C TerryUpper BoundsOrder Matters

  43. Improved lower bounds for the Shannon capacity of odd cycles

    Jul 23, 2026Nathaniel Itty, Christopher D. Rosin, Chase Carstensen +1Maximum Independent SetLower Bounds

  44. Shallower ReLU Network Representations via Exact Linear Algebra

    Jul 22, 2026Kilian Rueß, Gennadiy Averkov, Florestan Brunck +7Rectified Linear Unit NetworksUpper Bounds

  45. Sound Probabilistic Safety Bounds for Large Language Models

    Jul 22, 2026Mahdi Nazeri, Anne-Kathrin Schmuck, Sadegh Soudjani +1Large Language Model SafetyHarms

  46. On Optimization Complexity of Second-Order Certified Unlearning

    Jul 22, 2026Nikita Doikov, Anastasia KoloskovaSeveral Approximate Unlearning StrategiesMachine Unlearning

  47. Fundamental limits of distributed multiclass classification from simple binary decisions

    Jul 21, 2026Ioannis Papageorgiou, Srinivas Nomula, Ayalvadi Ganesh +2Multiclass ClassificationBinary Classification

  48. The Price of Hidden Curvature: An Ω~(d5/4T)\widetildeΩ (d^{5/4} \sqrt{T}) Lower Bound for Bandit Convex Optimization

    Jul 21, 2026Nived RajaramanO(T^Β)$ Simultaneous RegretConvex Optimization

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

    Jul 21, 2026Jixian Liu, Ihab Tabbara, Hussein Sibai +1ReachabilityHamilton-Jacobi Reachability

  50. Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory

    Jul 21, 2026Michael Menart, Aleksandar Nikolov, Ohad ShamirConvex OptimizationLower Bounds

  51. Mixing-Free and Signal-Optimal Learning of Gaussian Graphical Models from Glauber Dynamics

    Jul 20, 2026Vignesh Tirukkonda, Gautam DasarathyGibbs MeasuresGraph Representation Learning

  52. Concentration and Mean-Square Bounds for Contractive Stochastic Approximation: A Unified Elementary Approach

    Jul 20, 2026Siddharth ChandakStochastic ApproximationConcentration Inequalities

  53. Lookahead Branching for Neural Network Verification

    Jul 19, 2026Liam Davis, Duo Zhou, Huan Zhang +3Neural Network VerificationFormal Verification

  54. Tight Sample Bounds for Renyi and Min-Entropy Estimation

    Jul 18, 2026Arman Adibi, Piotr KrystaOptimal Sample ComplexityEntropy-Regularized Equilibrium Selection

  55. Testing Distributions Against Bounded Distinguishers

    Jul 17, 2026Mark Bun, Rathin Desai, Renato Ferreira PintoIndistinguishabilityOptimal Sample Complexity

  56. Publicly-Verifiable Certificates for Statistical Algorithms

    Jul 17, 2026Michael Ngo, Michael P. KimZero-Knowledge ProofsCertificates

  57. Beyond the d2.5d^{2.5}-mixing bound for Dikin walks on polytopes

    Jul 15, 2026Yunbum KookPolytopesOptimal Sample Complexity

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

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

  59. Efficient Online Proportional Sampling with Applications to Smoothed Online Learning

    Jul 13, 2026Amirmahdi Mirfakhar, Maria-Florina Balcan, Hedyeh BeyhaghiLearning-Augmented AlgorithmsOptimal Sample Complexity

  60. Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)

    Jul 12, 2026Haricharan Balasundaram, Karthick Krishna Mahendran, Rahul VazeConvex OptimizationO(T^Β)$ Simultaneous Regret