← Keywords

sample complexity

1158 papers

Explore in graph

Co-occurring keywords

reinforcement learning (4122) pac learning (280) multi-armed bandit (1091) markov decision process (788) learning theory (518) differential privacy (1010) stochastic optimization (1060) neural network (6616) active learning (1295) regret bound (1918)

Papers

On the Role of Noise in the Sample Complexity of Learning Recurrent Neural Networks: Exponential Gaps for Long Sequences NIPS 2023
On the Convergence and Sample Complexity Analysis of Deep Q-Networks with $\epsilon$-Greedy Exploration NIPS 2023
Probabilistic Invariant Learning with Randomized Linear Classifiers NIPS 2023
Stochastic Approximation Approaches to Group Distributionally Robust Optimization NIPS 2023
Score Approximation, Estimation and Distribution Recovery of Diffusion Models on Low-Dimensional Data ICML 2023
Optimal Sample Complexity Bounds for Non-convex Optimization under Kurdyka-Lojasiewicz Condition AISTATS 2023
Information Theoretic Lower Bounds for Information Theoretic Upper Bounds NIPS 2023
Revisiting Fair-PAC Learning and the Axioms of Cardinal Welfare AISTATS 2023
Reward-agnostic Fine-tuning: Provable Statistical Benefits of Hybrid Reinforcement Learning NIPS 2023
On the Role of Entanglement and Statistics in Learning NIPS 2023
Robust Mean Estimation Without Moments for Symmetric Distributions NIPS 2023
The Exact Sample Complexity Gain from Invariances for Kernel Regression NIPS 2023
Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise NIPS 2023
List and Certificate Complexities in Replicable Learning NIPS 2023
A Competitive Algorithm for Agnostic Active Learning NIPS 2023
A Finite Sample Complexity Bound for Distributionally Robust Q-learning AISTATS 2023
Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models NIPS 2023
Promises and Pitfalls of Threshold-based Auto-labeling NIPS 2023
Convergence rates for localized actor-critic in networked Markov potential games UAI 2023
Sample Complexity of Distinguishing Cause from Effect AISTATS 2023
Sample Complexity Bounds for Score-Matching: Causal Discovery and Generative Modeling NIPS 2023
Patch-level Routing in Mixture-of-Experts is Provably Sample-efficient for Convolutional Neural Networks ICML 2023
Provably Sample-Efficient Model-Free Algorithm for MDPs with Peak Constraints JMLR 2023
Replicable Clustering NIPS 2023
An $\varepsilon$-Best-Arm Identification Algorithm for Fixed-Confidence and Beyond NIPS 2023