Optimal Sample Complexity

Follow this field 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

Focused topic

Optimal Sample Complexity

Within Optimal Sample Complexity

210 papersExplore

Focused topic

Sample Complexity

Within Optimal Sample Complexity

62 papersExplore

Focused topic

Lower Bounds

Within Optimal Sample Complexity

51 papersExplore

Focused topic

Upper Bounds

Within Optimal Sample Complexity

48 papersExplore

Focused topic

Concentration Inequalities

Within Optimal Sample Complexity

41 papersExplore

Focused topic

Worst-Case

Within Optimal Sample Complexity

33 papersExplore

Focused topic

New Bounds

Within Optimal Sample Complexity

24 papersExplore

426 papers

Latest in Optimal Sample Complexity

Browse all topics →

Upper Bounds on the Generalization Error of Deep Learning Models via Local Robustness and Stability
Jun 15, 2026Abdul-Rauf Nuhu, Parham M. Kebria, Vahid Hemmati +3Generalization Bounds Upper Bounds
Learning Policy from a Single Trajectory in Average-Reward Markov Decision Process
Jun 15, 2026Jongmin Lee, Ernest K. Ryu, Vaneet AggarwalMarkov Decision Processes Model-Free Reinforcement Learning
Active Learning with Low-Rank Structure for Data Selection
Jun 14, 2026Vincent Cohen-Addad, Sasidhar Kunapuli, Vahab Mirrokni +3Geometry-Aware Uncertainty Coresets Low-Rank Factorization
Can Neural Networks Achieve Optimal Computational-statistical Tradeoff? An Analysis on Single-Index Model
Jun 13, 2026Siyu Chen, Beining Wu, Miao Lu +2Optimal Sample Complexity Two-Layer Neural Networks
Comparison Patrols on Drifting Orders: Certified Rank Maintenance, Evolving Planar Maxima, and Selection under Drifting Fitness
Jun 12, 2026Faruk Alpay, Levent SariogluRanking Order
A Complexity Measure for Active Learning in Multi-group Mean Estimation
Jun 12, 2026Abdellah Aznag, Rachel Cummings, Adam N. ElmachtoubActive Learning Optimal Sample Complexity
Online Convex Optimization with Sublinear Noisy Probes
Jun 12, 2026Simone Di Gregorio, Anupam Gupta, Stefano Leonardi +1O(T^Β)$ Simultaneous Regret Convex Optimization
Free Heavy-Tailed Lunch for Muon: A Theoretical Justification of Empirical Success
Jun 12, 2026Florian Hübler, Thomas Pethick, Suvrit SraSpectral Norm Muon Optimizer
Implicit Variational Rejection Sampling
Jun 12, 2026Jian Xu, Shigui Li, Wei Chen +6Variational Inference Rejection
Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs
Jun 12, 2026Tianhao Wu, Matthew Zurek, Weina Wang +1Markov Decision Processes Sample Complexity
The Program Is Still There: A Conservation Law for Program Discovery
Jun 11, 2026Jorge Miguel SilvaSearch Algorithms Computable
Improved Runtime Bound for the $(μ+ 1)$ EA on BinVal
Jun 11, 2026Joris Belder, Johannes Lengler, Raghu Raman RaviBinary Upper Bounds
A solvable model for unsupervised federated learning
Jun 11, 2026Giovanni Catania, Aurélien Decelle, Gianluca Manzan +2Federated Learning Distributional Learning
Quantum Occam Learning: Sample-Supported Expressibility for Circuit-Based Quantum Learning
Jun 10, 2026Jeongho Bang, Kyoungho Cho, Jeongwoo JaeQuantum Machine Learning Optimal Sample Complexity
Reliable Error Estimation for PINNs: Lower and Upper A Posteriori Bounds
Jun 10, 2026Ismail Huseynov, Arzu Ahmadova, Agamirza BashirovConventional Physics-Informed Neural Networks Boundary Value Problems
Efficient Multinomial Logistic Bandit via Frequent Directions
Jun 10, 2026Linzhe He, Yu-Jie Zhang, Sifan Yang +1Generalized Linear Bandit Semiparametric Framework
Density estimation for Hellinger via minimum-distance estimators: mixtures of Gaussians, log-concave, and more
Jun 9, 2026Spencer Compton, Jerry LiDensity Ratio Estimation Optimal Sample Complexity
The Power of Test-Time Training for Approximate Sampling
Jun 9, 2026Noah Golowich, Ankur Moitra, Dhruv RohatgiOptimal Sample Complexity Inference-Time
Bellman-sufficient Information Complexity
Jun 9, 2026Yunbei XuInformation-Theoretic Limits Optimal Sample Complexity
Efficiently Learning Drifting Halfspaces with Massart Noise
Jun 9, 2026Mingchen Ma, Guyang Cao, Jelena Diakonikolas +1Optimal Sample Complexity Learning-Augmented Algorithms
Robust Regression of General ReLUs with Queries
Jun 9, 2026Ilias Diakonikolas, Daniel M. Kane, Mingchen MaRectified Linear Unit Optimal Sample Complexity
Trainability of IQP Quantum Circuit Born Machines Under Gaussian Initialization
Jun 8, 2026Gennaro De LucaQuantum Machine Learning Quantum Circuit Simulation
Tight Sample Complexity of Transformers
Jun 8, 2026Chenxiao Yang, Nathan Srebro, Zhiyuan LiTransformer Architectures Sample Complexity
Parameter Tuning with Generalization Guarantees for GPU-Accelerated Linear Programming
Jun 7, 2026Siddharth Prasad, Dravyansh SharmaHyperparameter Optimization Primal-Dual Methods
Bridging Multi-Valued Heuristics and Dimensionality Reduction in Multi-Objective Search
Jun 5, 2026Maya Wolff, Ariel Felner, Oren SalzmanShortest Paths Heuristics
The Sharp Phase Transition of Tyler's M-Estimator for Robust Subspace Recovery
Jun 4, 2026Gilad Lerman, Teng ZhangSparse Recovery Estimators
Mitigating the Curse of Dimensionality in Uniform Convergence of Deep Neural Networks via Smooth Activations
Jun 4, 2026Yizhe Ding, Runze Li, Jia Liu +1Rectified Linear Unit Networks Activation Functions
Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization
Jun 3, 2026Dongruo ZhouConvex Optimization Lower Bounds
Provably Reduced Sample Cost in Prior-Guided Hyperparameter Optimization
Jun 3, 2026Leona Hennig, Jasmin Brandt, Lukas Fehring +3Hyperparameter Optimization Optimal Sample Complexity
Measuring Model Robustness via Fisher Information: Spectral Bounds, Theoretical Guarantees, and Practical Algorithms
Jun 3, 2026Chong Zhang, Xiang Li, Jia Wang +2Model Sensitivity Fisher Information
The price of multi-group transductive learning
Jun 3, 2026Noah Bergam, Samuel Deng, Daniel HsuTransductive Active Labeling Multiclass Classification
Policy Gradient for Continuous-Time Robust Markov Decision Processes
Jun 3, 2026Tanya Veeravalli, David M. Bossens, Atsushi NitandaMarkov Decision Processes Policy Gradient
Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds
Jun 1, 2026Phone Thiha Kyaw, Jonathan KellyRiemannian Manifolds Heuristics
A Biconvex Formulation for Stable Transport of Mixture Models with a Unique Solution
Jun 1, 2026Yeganeh Marghi, Kelly Jin, Uygar SümbülOptimal Transport Mixture Models
Query-Limited Community Recovery in Stochastic Block Models
Jun 1, 2026Sabyasachi Basu, Manuj Mukherjee, Lutz Oettershagen +1Optimal Sample Complexity Subgraphs
Provable Data Scaling Law for Meta Learning via Complexity Minimization
Jun 1, 2026Kazuto Fukuchi, Ryuichiro Hataya, Kota MatsuiMeta-Learning Model Pretraining
Near-Optimal Machine Unlearning Utility for Smooth Strongly Convex Losses
Jun 1, 2026Matthew Regehr, Gautam Kamath, Andrew LowyMachine Unlearning Several Approximate Unlearning Strategies
Sample Complexity and Decision-Theoretic Guarantees for Bayesian Model Averaging over Decision Trees with Catalan-Exponential Priors
May 31, 2026Livija Jakaite, Vitaly SchetininDecision Trees Bayesian
Local MixVR: Breaking the Communication-Sample Dependence in Distributed Learning
May 31, 2026Tehila Dahan, Bassel Hamoud, Roie Reshef +2Distributional Learning Mini-Batch Stochastic Gradient Descent
On Finite-sample Concentration of Median of Incomplete U-Statistics
May 30, 2026Nong Minh Hieu, Antoine LedentGeneralized U-Statistics Estimators
A Practical Upper Bound on Selection Bias Effects in Medical Prediction Models
May 30, 2026Kara Liu, Maggie Wang, Russ B. AltmanSelection Bias Model Selection
Auditing Near-Optimal Policies Can Be Exponentially Hard: Conditional Query Lower Bounds via Occupancy Rashomon Capacity
May 29, 2026Ibne Farabi Shihab, Sanjeda Akter, Anuj SharmaAlgorithm Auditing Optimal Policies
Correcting Split Selection in Online Decision Trees via Anytime-Valid Inference
May 29, 2026Salim I. Amoukou, Saumitra Mishra, Manuela VelosoDecision Trees Random Forest
Approximation and learning of anisotropic and mixed smooth functions by deep ReLU neural networks
May 29, 2026Yunfei Yang, Jun FanLogarithmic Sobolev Inequalities Neural-Network Approximation
Improved Distribution Estimation in $\ell_\infty$
May 28, 2026Doron Cohen, Aryeh Kontorovich, Yonatan LivshitzConcentration Inequalities Worst-Case
Universal Multiclass Transductive Online Learning
May 28, 2026Steve Hanneke, Hongao WangTransductive Active Labeling Learning-Augmented Algorithms
On Language Generation in the Limit with Bounded Memory
May 28, 2026Jon Kleinberg, Anay Mehrotra, Amin Saberi +1Infinite-Width Gaussian Limit Worst-Case
Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
May 28, 2026Jingda Wu, Changxiao CaiLow-Dimensional Structure Score-Based Diffusion Model
Open Problem: Separating Geometric and Algorithmic Compression via Cayley-Table Completion
May 28, 2026Dongsung HuhTensor Completion Optimal Sample Complexity
The Interplay Between Interpolation and Aggregation in Regression: Optimal Sample Complexity
May 28, 2026Mikael Møller Høgsgaard, Kasper Green Larsen, Liang-Yu ZouInterpolation Optimal Sample Complexity
The Sample Complexity of Multiclass and Sparse Contextual Bandits
May 28, 2026Liad Erez, Fan Chen, Alon Cohen +4Linear Contextual Bandits Sample Complexity
GDSD: Reinforcement Learning as Guided Denoiser Self-Distillation for Diffusion Language Models
May 28, 2026Xiaohang Tang, Keyue Jiang, Che Liu +4Diffusion Language Models Unsupervised On-Policy Self-Distillation
Principled Algorithms for Optimizing Generalized Metrics in Multi-Label Learning
May 27, 2026Mehryar Mohri, Yutao ZhongMulti-Label Classification Empirical Risk Minimization
Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent
May 27, 2026Guillaume Larue, Louis-Adrien Dufrène, Quentin Lampin +2Two-Layer Neural Networks Neural Network
Variance-Adaptive Optimal Algorithm for Reinforcement Learning with Multinomial Logit Function Approximation
May 27, 2026Wonyoung Kim, Min-Hwan Oh, Garud Iyengar +1Near-Optimal Regret Guarantees Markov Decision Processes
When Seekers Are Hard to Help: Evaluating Emotional Support Dialogue Systems in Worst-Case Interactions
May 27, 2026Jiajie Yang, Yangchun Li, Guanyi Chen +3Emotional Support Particular Emotion-Aware Response
Privately Estimating Monotone Statistics in Polynomial Time
May 27, 2026Gavin Brown, Ephraim Linder, Mahbod Majid +1Optimal Sample Complexity Statistical Inference
Smoothed Score Queries and the Complexity of Sampling
May 26, 2026Jingbo LiuOptimal Sample Complexity
Proper Agnostic Learning of Functions of Halfspaces under Gaussian Marginals
May 26, 2026Sergei Tikhonov, Arsen VasilyanOptimal Sample Complexity Binary Classification
On the Subgaussianity of Quantized Linear Maps: An AI-Assisted Note
May 26, 2026Guangyi Zou, Roman VershyninConcentration Inequalities 3D Gaussian Splatting

Jun 15, 2026 · cs.LGJ/K move · Enter open · S save

Upper Bounds on the Generalization Error of Deep Learning Models via Local Robustness and Stability

Abdul-Rauf Nuhu, Parham M. Kebria, Vahid Hemmati, Mahmoud N. Mahmoud+2

aNorth Carolina Agricultural and Technical State University, Dept. Electrical and Computer Engineering 1601 E Market St., Greensboro, 27411, NC, USA · bUniversity of Alabama, Dept. Computer Science, Tuscaloosa, 35487, AL, USA · cSouthwest Research Institute, San Antonio, 78238, TX, USA

Generalization is a critical property of data-driven models, particularly deep learning models deployed in safety-critical applications. Robustness-based generalization bounds have gained attention as a principled way to link robustness properties to generalization performance, often in a data-dependent manner. However, most existing bounds suffer from vacuousness in practical settings, yielding loose upper bounds that greatly exceed the actual error rates and limiting their usefulness for real-world evaluation. While this issue is often attributed to the uncertainty term, a substantial part of the problem originates from the robustness term itself, particularly for the 0-1 loss. Existing approaches typically treat the robustness term as a global measure, ignoring its variation across different sub-regions of the input space. In this work, we propose a generalization bound that addresses this limitation by scaling the robustness term according to the number of stable and unstable samples within each sub-region. Our bounds incorporate both data- and model-dependent factors while maintaining practical relevance (yielding tighter upper bounds on true error). Experiments on models trained on the ImageNet dataset show that our bounds remain consistently non-vacuous and achieve the tightest estimates among existing methods, closely aligning with empirical performance across a range of robust deep neural networks.

Generalization Bounds Upper Bounds Imagenet

Open paper Ask about it PDF