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. Explicit integral representations and quantitative bounds for two-layer ReLU networks

    Apr 25, 2026Anthony LeeRectified Linear Unit NetworksRectified Linear Unit

  2. Learning Curves and Benign Overfitting of Spectral Algorithms in Large Dimensions

    Apr 25, 2026Weihao Lu, Qian Lin, Yingcun Xia +1Kernel Ridge RegressionOverfitting

  3. Well-Conditioned Oblivious Perturbations in Linear Space

    Apr 25, 2026Shabarish Chenakkod, Michał Dereziński, Xiaoyu Dong +1Spectral PreconditioningOptimal Sample Complexity

  4. The Exact Replica Threshold for Nonlinear Moments of Quantum States

    Apr 24, 2026Shuai ZengN$-Qubit Stabilizer StatesOptimal Sample Complexity

  5. How Hard Is Continuous Clustering? Lower Bounds from the Existential Theory of the Reals

    Apr 24, 2026Angshul MajumdarImage ClusteringCluster Structure

  6. Pack only the essentials: Adaptive dictionary learning for kernel ridge regression

    Apr 24, 2026Daniele Calandriello, Alessandro Lazaric, Michal ValkoKernel Ridge RegressionLow-Rank Factorization

  7. Logistic Bandits with O~(dT)\tilde{O}(\sqrt{dT}) Regret without Context Diversity Assumptions

    Apr 24, 2026Seoungbin Bae, Dabeen LeeO(T^Β)$ Simultaneous RegretMulti-Armed Bandits

  8. The Sample Complexity of Multicalibration

    Apr 23, 2026Natalie Collina, Jiuyao Lu, Georgy Noarov +1Multicalibration and CalibrationOptimal Sample Complexity

  9. Ultrametric OGP - parametric RDT \emph{symmetric} binary perceptron connection

    Apr 21, 2026Mihailo StojnicUpper BoundsDecision Thresholds

  10. Is Four Enough? Automated Reasoning Approaches and Dual Bounds for Condorcet Dimensions of Elections

    Apr 21, 2026Itai Zilberstein, Ratip Emin Berker, George Li +1Upper BoundsMaximum Independent Set

  11. Lyapunov-Certified Direct Switching Theory for Q-Learning

    Apr 21, 2026Donghwan LeeQ-LearningLyapunov Function

  12. The Cost of Relaxation: Evaluating the Error in Convex Neural Network Verification

    Apr 20, 2026Merkouris Papamichail, Konstantinos Varsos, Giorgos Flouris +1Neural Network VerificationConvex Sets

  13. Beyond Indistinguishability: Measuring Extraction Risk in LLM APIs

    Apr 20, 2026Ruixuan Liu, David Evans, Li XiongIndistinguishabilityUpper Bounds

  14. Horospherical Depth and Busemann Median on Hadamard Manifolds

    Apr 20, 2026Yangdi Jiang, Xiaotian Chang, Cyrus MostajeranMetric SpacesStatistical Manifold

  15. Learning Unanimously Acceptable Lotteries via Queries

    Apr 19, 2026Davin Choo, Paul W. Goldberg, Nicholas TehLotteriesBetting

  16. Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance

    Apr 17, 2026Arda Fazla, Ege C. Kaya, Antesh Upadhyay +1Stochastic Smooth Convex OptimizationStochastic Gradient Descent

  17. Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model

    Apr 17, 2026Jean Tarbouriech, Matteo Pirotta, Michal Valko +1Optimal PoliciesShortest Paths

  18. Towards Universal Convergence of Backward Error in Linear System Solvers

    Apr 17, 2026Michał Dereziński, Yuji Nakatsukasa, Elizaveta RebrovaBackward InductionConvergence

  19. Optimal algorithmic complexity of inference in quantum kernel methods

    Apr 16, 2026Elies Gil-Fuster, Seongwook Shin, Sofiene Jerbi +2Quantum KernelsQuantum Advantage

  20. Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards

    Apr 16, 2026Subhodip Panda, Shubhada AgrawalOptimal Bandit AlgorithmsRegret

  21. Tight Bounds for Learning Polyhedra with a Margin

    Apr 16, 2026Shyamal Patel, Santosh VempalaPolytopesLower Bounds

  22. A Residual-Shell-Based Lower Bound for Ollivier-Ricci Curvature

    Apr 14, 2026Xiang Gu, Huichun Zhang, Jian SunLower BoundsWasserstein Distance

  23. RepUCB: Representation Learning-Based UCB for Heterogeneous Multi-Task Linear Bandits

    Apr 1, 2026Jiabin Lin, Shana MoothedathOptimal Sample Complexity

  24. The Geometry of Efficient Nonconvex Sampling

    Mar 26, 2026Santosh S. Vempala, Andre WibisonoNon-Log-ConcaveFarthest Point Sampling

  25. Asymptotic Learning Curves for Diffusion Models with Random Features Score and Manifold Data

    Mar 24, 2026Anand Jerry George, Nicolas MacrisScore-Based Diffusion ModelLow-Dimensional Structure

  26. Achieving O~(1/ε)\widetilde{O}(1/ε) Sample Complexity for Bilinear Systems Identification under Bounded Noises

    Mar 21, 2026Hongyu Yi, Chenbei Lu, Jing YuSystem IdentificationOptimal Sample Complexity

  27. Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method

    Mar 19, 2026Steffen Dereich, Thang Do, Arnulf JentzenAdamStochastic Smooth Convex Optimization

  28. High-Dimensional Gaussian Mean Estimation under Realizable Contamination

    Mar 17, 2026Ilias Diakonikolas, Daniel M. Kane, Thanasis PittasOptimal Sample ComplexityDensity Ratio Estimation

  29. Algorithms for Deciding the Safety of States in Fully Observable Non-deterministic Problems: Technical Report

    Mar 16, 2026Johannes Schmalz, Chaahat JainSafety ConstraintsWorst-Case

  30. RL unknotter, hard unknots and unknotting number

    Mar 9, 2026Anne Dranowski, Yura Kabkov, Daniel TubbenhauerKnotsDeep Reinforcement Learning

  31. First-Order Softmax Weighted Switching Gradient Method for Distributed Stochastic Minimax Optimization with Stochastic Constraints

    Mar 6, 2026Zhankun Luo, Antesh Upadhyay, Sang Bin Moon +1Stochastic OptimizationFederated Learning

  32. Relatively Smart: A New Approach for Instance-Optimal Learning

    Mar 2, 2026Shaddin Dughmi, Alireza F. PourSemi-Supervised LearningDistributional Learning

  33. A short tour of operator learning theory: Convergence rates, statistical limits, and open questions

    Feb 28, 2026Simone Brugiapaglia, Nicola Rares Franco, Nicholas H. NelsenProbabilistic Operator LearningEmpirical Risk Minimization

  34. Quantum Maximum Likelihood Prediction via Hilbert Space Embeddings

    Feb 20, 2026Sreejith Sreekumar, Nir WeinbergerQuantum Machine LearningLarge Language Model Quantization

  35. Efficient privacy loss accounting for subsampling and random allocation

    Feb 19, 2026Vitaly Feldman, Moshe ShenfeldDifferential PrivacyEfficient Privacy Loss

  36. Separating Oblivious and Adaptive Models of Variable Selection

    Feb 18, 2026Ziyun Chen, Jerry Li, Kevin Tian +1Sparse RecoveryOptimal Sample Complexity

  37. Improved Upper Bounds for Slicing the Hypercube

    Feb 6, 2026Duncan Soiffer, Nathaniel Itty, Christopher D. Rosin +5SlicesUpper Bounds

  38. PCA of probability measures: Sparse and Dense sampling regimes

    Feb 2, 2026Gachon Erell, Jérémie Bigot, Elsa CazellesPrincipal Component AnalysisProbability Measures

  39. Fast Score-Based Sampling via Log-Concave Reductions

    Dec 30, 2025M. J. WainwrightNon-Log-ConcaveOptimal Sample Complexity

  40. Improved Bounds for Private and Robust Alignment

    Dec 29, 2025Wenqian Weng, Yi He, Xingyu ZhouLarge Language Model AlignmentAdversarial Corruption

  41. Efficient Public Verification of Private ML via Regularization

    Dec 3, 2025Zoë Ruha Bell, Anvith Thudi, Olive Franzese-McLaughlin +2Differential PrivacyPrivacy-Utility Trade-Offs

  42. On the Condition Number Dependency in Bilevel Optimization

    Nov 27, 2025Lesi Chen, Jingzhao ZhangBilevel OptimizationConvex Optimization

  43. The Alexander-Hirschowitz theorem for neurovarieties

    Nov 24, 2025A. Massarenti, M. MellaTwo-Layer Neural NetworksIdentifiability

  44. A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs

    Nov 21, 2025Hoang Ta, Jonathan ScarlettExponential Random Graph ModelsGraph Representation Learning

  45. Learning and Testing Convex Functions

    Nov 14, 2025Renato Ferreira Pinto, Cassandra Marcussen, Elchanan Mossel +1Convex SetsOptimal Sample Complexity

  46. Concentration bounds on response-based vector embeddings of black-box generative models

    Nov 11, 2025Aranyak Acharyya, Joshua Agterberg, Youngser Park +1Embedding DimensionGenerative Models

  47. Configuration-Dependent Lower Bounds for Approximation by Shallow ReLUk^k Networks on the Sphere

    Oct 5, 2025Tong Mao, Jinchao XuNeural-Network ApproximationApproximation

  48. Smooth Quasar-Convex Optimization with Constraints

    Oct 2, 2025David Martínez-RubioConvex OptimizationConvex Sets

  49. Actively Learning Halfspaces without Synthetic Data

    Sep 25, 2025Hadley Black, Kasper Green Larsen, Arya Mazumdar +2Optimal Sample ComplexitySynthetic Data

  50. Are Targeted Data Poisoning Attacks as Effective as We Think?

    Sep 8, 2025William Xu, Chenyu Zhang, Yihan Wang +5Data PoisoningPoisoning

  51. The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements

    Sep 1, 2025Youssef Chaabouni, David GamarnikSparse RecoverySparsity

  52. Random Walk Learning and the Pac-Man Attack

    Aug 1, 2025Xingran Chen, Parimal Parag, Rohit Bhagat +2Worst-CaseAdversarial Training

  53. When few labeled target data suffice: a theory of semi-supervised domain adaptation via fine-tuning from multiple adaptive starts

    Jul 19, 2025Wooseok Ha, Yuansi ChenDomain AdaptationTarget Domain

  54. Improved generalization bounds for binary linear classification via isoperimetry

    May 22, 2025Shogo NakakitaGeneralization BoundsConcentration Inequalities

  55. Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysis

    May 18, 2025Zachary Roch, George Atia, Yue WangModel-Free Reinforcement LearningOptimal Policies

  56. Limits of Discrete Energy of Families of Increasing Sets

    Apr 15, 2025Hari Sarang NathanMetric SpacesConcentration Inequalities

  57. Efficient and Stable Multi-Dimensional Kolmogorov-Smirnov Distance

    Apr 15, 2025Peter Matthew Jacobs, Foad Namjoo, Jeff M. PhillipsTwo-Sample TestingOptimal Sample Complexity

  58. Sample Complexity of Linear Quadratic Regulator Without Initial Stability

    Feb 20, 2025Amirreza Neshaei Moghaddam, Alex Olshevsky, Bahman GharesifardLinear Quadratic RegulatorLyapunov Function

  59. The Method of Gaps: Exact Expressions for the Generalization Error of Supervised Learning Algorithms

    Nov 18, 2024Samir M. Perlaza, Xinying ZouGeneralization BoundsSupervised Learning

  60. Breaking the T2/3T^{2/3} Barrier for Sequential Calibration

    Jun 19, 2024Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson +3Multicalibration and CalibrationLoad Forecasting