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

421 papers

Latest in Optimal Sample Complexity

Open your feed →
CardsList

  1. Adversarially Robust PAC Learning with Optimal VC Rates

    Sep 21, 2026Steve Hanneke, Amirreza ShaeiriOptimal Sample ComplexityDistributional Learning

  2. Worst-Case Hidden-Vehicle Trajectory Search in Spatiotemporal Occlusion Regions

    Sep 17, 2026Ruichen Tan, Zengxiang Lei, Satish UkkusuriAutonomous DrivingTrajectory Optimization

  3. Revisiting Distributed Sign-Based Variance Reduction

    Sep 16, 2026Wei Jiang, Zechao Li, Lijun ZhangVariance ReductionStochastic Smooth Convex Optimization

  4. Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates

    Sep 16, 2026Yingquan, Wu, Jason CongMaximum Independent SetHypergraphs

  5. Efficient Robust Learning at the Information-Theoretic Limit

    Sep 15, 2026Adam R. Klivans, Konstantinos Stavropoulos, Sergei Tikhonov +1Empirical Risk MinimizationOptimal Sample Complexity

  6. Near-Optimal Nonconvex Matrix Completion

    Sep 15, 2026Jian-Feng Cai, Xiliang Lu, Juntao YouTensor CompletionConvex Optimization

  7. Thin-shell stability of Gaussian cooling: logconcave sampling with sesteric complexity from a cold start

    Sep 14, 2026Yunbum Kook, Santosh S. VempalaNon-Log-ConcaveOptimal Sample Complexity

  8. Solving Finite-sum Coupled Compositional Optimization via Multi-block-Single-probe Estimator

    Sep 14, 2026Wei Jiang, Sifan Yang, Yibo Wang +2Variance ReductionStochastic Optimization

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

    Sep 14, 2026Weiming Feng, Yixiao Yu, Yiyao ZhangOptimal Sample ComplexityNormalizing Flows

  10. Nearly Minimax-Optimal Regret for Linear Contextual Bandits with Arbitrary Adaptive Action Sets

    Sep 14, 2026Tianyuan JinLinear Contextual BanditsBandits

  11. Poisson-Corrector Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling

    Sep 14, 2026Yuchen Xin, Zhihua ZhangLangevin DynamicsLipschitz Constant

  12. Guardrailed Meta-Agent Loops: Stress-Testing Policy Pinning, Budget Bounds, and Crash Recovery

    Sep 14, 2026Qinzhen Ma, Jialin WuAgent LoopStress Testing

  13. Tight Sampling Complexity with stochastic gradient oracles in Fixed Dimensions

    Sep 14, 2026Weiming Ou, Xiao WangNon-Log-ConcaveOptimal Sample Complexity

  14. Scalable Discrete-to-Continuous Channel Simulation for Compression and Privacy

    Sep 14, 2026Joseph Rowan, Buu Phan, Ashish J. KhistiChannelOptimal Sample Complexity

  15. Probabilistic Focal Search: Accelerating Bounded-Suboptimal Search via Lower-Bound Advancement

    Sep 12, 2026Minh Vu Duc, Trung Le Huu, Hà Minh Hoàng +3Search AlgorithmsSalesman Problem

  16. Counterfactual Marginalisation: Framework for Evaluating Robustness to Nuisance Variables

    Sep 12, 2026Yasin Ibrahim, Hermione Warr, Robin J. Evans +1Counterfactual ReasoningCross Validation

  17. When Greedy Sampling Explores: KL-Regularized Contextual Bandits without Eluder-Dimension Dependence

    Sep 11, 2026Zichen Wang, Haoyang Hong, Huazheng WangLinear Contextual BanditsKullback-Leibler Regularization

  18. Relatively Smart II: Tractable or Semi-Supervised Instance-Optimal Learning

    Sep 11, 2026Shaddin Dughmi, Alireza F. PourSemi-Supervised LearningOptimal Sample Complexity

  19. Certifying Lower Bounds for Risk-Sensitive Reinforcement Learning under Adversarial State Perturbations

    Sep 11, 2026Tong Li, Saunak Kumar Panda, Yisha XiangReinforcement Learning With Verifiable RewardCertification

  20. From Protocols to Evidence: Bounded Claims for AI in Service of the Common Good

    Sep 10, 2026Nitesh V. Chawla, Paulo BenantiArtificial Intelligence GovernanceGovernance

  21. High-probability guarantees for linear accessibility in feature superposition

    Sep 10, 2026Enrico VompaFeature LearningConcentration Inequalities

  22. Optimal Low-Rank Quantum State Tomography with Bounded-Sample Joint Measurements

    Sep 9, 2026Ashwin Nayak, Xingyu ZhouN$-Qubit Stabilizer StatesOptimal Sample Complexity

  23. The Sample Complexity of Quantum Entanglement Allocation

    Sep 9, 2026Nathan RollQubitEntanglement

  24. A Sharp Barrier for Consistent Submodular Maximization: Any Improvement over 2-\sqrt{2} Entails Exponential Queries or Linear Recourse

    Sep 9, 2026Shi Fu, Qixin Zhang, Dacheng TaoSubmodular MaximizationWorst-Case

  25. Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks

    Sep 8, 2026Xiaoyu Li, Zhizhou Sha, Jiaojiao Jiang +2Rectified Linear Unit NetworksConcentration Inequalities

  26. High-Magnetization Sampling at Low Temperatures: Ising Models and Bayesian Sparse Linear Regression

    Sep 8, 2026Syamantak Kumar, Purnamrita Sarkar, Kevin Tian +1Two-Dimensional Ising ModelMarkovian Sampling

  27. Non-Adaptive 1-Bit Mean Estimation: Minimax Rates and the Sample-Interval Tradeoff

    Sep 8, 2026Ivan Lau, Jonathan ScarlettOptimal Sample ComplexityEstimators

  28. Distribution-free inference on the number of changepoints

    Sep 8, 2026Rohan Hore, Aaditya RamdasChange-Point DetectionFinite-Sample

  29. Sparse Data Augmentation for Optimization with Provable Guarantees

    Sep 8, 2026Behrooz Tahmasebi, Melanie WeberConvex OptimizationAugmentation

  30. SGD in Multiclass Logistic Regression: Sequential Learning and Scaling Laws

    Sep 7, 2026Konstantinos Christopher Tsiolis, Denny Wu, Christos Thrampoulidis +1Multiclass ClassificationScaling Laws

  31. Common-Witness Certificates and Sharp Feature Bounds for Counterfactual Image Auditing

    Sep 3, 2026Usef Faghihi, Amir SakiVersion WitnessAlgorithm Auditing

  32. Resolution-Aware Experimental Design under Partial Identifiability

    Sep 3, 2026Sofianos Panagiotis FotiasBayesian Experimental DesignIdentifiability

  33. Pooling and Drift in Delayed Bandits

    Sep 1, 2026Melika BaghiMinimaxOptimal Sample Complexity

  34. Minimax bounds for watermarked and masked recursive discrete distribution estimation

    Aug 31, 2026Millen Kanabar, Michael GastparWatermarksSynthetic Samples

  35. Feature Priming in Online Linear Regression: Sparse-Regret Lower Bounds and Tight Coordinatewise Rates

    Aug 18, 2026Huibo Xu, Shi Fu, Qixin Zhang +1Near-Optimal Regret GuaranteesLower Bounds

  36. Improved Regret Analysis for Parallel Gaussian Process Bandit Optimization

    Aug 17, 2026Shion Takeno, Shogo IwazakiGeneralized Linear BanditLinear Regret

  37. Sequence prediction under a lying oracle

    Aug 14, 2026Puspabeethi Samanta, Nikhil Karamchandani, Jayakrishnan NairSharp Joint-Kl Oracle TheorySequential Decision Making

  38. Exponential Convex Calibration Dimension for the Multi-Label Jaccard Measure

    Aug 13, 2026Mingyuan ZhangMulti-Label ClassificationCandidate Label Distributions

  39. General Probabilities of Causation with Causal Knowledge

    Aug 12, 2026Xin Shu, Zhen Lei, Ang LiStructural Causal ModelCausal Reasoning

  40. Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection

    Aug 12, 2026Tadeusz Dziarmaga, Witold Sikora, Łukasz Struski +2Top-KOptimal Sample Complexity

  41. Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity

    Aug 12, 2026Debanjan Dutta, Anish Chakrabarty, Swagatam DasSearch DepthChain-of-Thought Reasoning

  42. Improving TensorSketch Using Complex Random Variables

    Aug 11, 2026Amit Sharma, Mohammad Azhar Khan, Rameshwar Pratap +1Optimal Sample ComplexityKernel Method

  43. A lower bound for stepsize-based acceleration of gradient descent

    Aug 11, 2026Jianhao Ma, Yuxin ChenLarge Step SizesGradient Descent

  44. Logarithmic-Free Moment and Generalization Bounds for Uniformly Stable Algorithms

    Aug 10, 2026Thanh Nguyen-Cung, Binh T. NguyenGeneralization BoundsX-Logsmask

  45. A Tight Lower Bound for Smooth Nonconvex Stochastic Optimization with Bounded Gradient Noise

    Aug 10, 2026Jikai JinStochastic Smooth Convex OptimizationStochastic Optimization

  46. The Cost of Adaptivity: Matching Lower Bounds Across Learning Problems

    Aug 9, 2026Ibne Farabi Shihab, Adria Binte HabibOptimal Sample ComplexityLower Bounds

  47. Kernel Methods for Refined Prophet Inequalities

    Aug 9, 2026Patrick Loiseau, Mathieu Molina, Vianney Perchet +2Concentration InequalitiesWorst-Case

  48. Halpern Iteration Achieves \tilde{\mathcal{O}}(ε^{-1/p}) pth-Order Oracle Complexity for Monotone Variational Inequalities

    Aug 9, 2026Lesi Chen, Xinliang Zhang, Hengyu Wang +3Alternating Direction Method Of MultiplierSharp Joint-Kl Oracle Theory

  49. Optimal Learning Under Tsybakov Noise

    Aug 9, 2026Steve Hanneke, Hongao Wang, Mingyue XuOptimal Sample ComplexityLearning-Augmented Algorithms

  50. Exact Rank and Convex Calibration Dimension Lower Bounds for the Multi-Label F1 Loss

    Aug 9, 2026Mingyuan ZhangMulti-Label ClassificationLow-Rank Factorization

  51. What Irregularity Costs: CUDA C++, Rust, and Triton on a Hash-Blocked GPU Workload

    Aug 8, 2026Petr KorolevCudaSingle Graphics Processing Unit

  52. The Sample Complexity of Policy Learning with Mu-Resets

    Aug 7, 2026Gene LiOptimal PoliciesOptimal Sample Complexity

  53. A Rate Separation for Agnostic Direct Sums

    Aug 7, 2026Mihir More, Aritra Das, Debayan GuptaSingular Learning TheoryOptimal Sample Complexity

  54. Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions

    Aug 6, 2026Yuepeng Yang, Yuxin Chen, Yuejie ChiMarkov Decision ProcessesOptimal Policies

  55. An Optimal Agnostic PAC Algorithm

    Aug 6, 2026Markus Engelund Mathiasen, Jian Qian, Nikita ZhivotovskiyOptimal Sample ComplexitySample Complexity

  56. Optimal Rates for Learning with Monotone Adversaries

    Aug 6, 2026Anay MehrotraOptimal Sample ComplexityEmpirical Risk Minimization

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

    Aug 6, 2026Zonghuan XuTwo-Sample TestingOptimal Sample Complexity

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

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

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

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

  60. Reachability in 3-VAS

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