conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Sample Complexity

99 papers

Papers per year

2
2
14
4
'10
'15
'20
'25

Papers

Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model ALT 2026
Variance Reduction and Low Sample Complexity in Stochastic Optimization via Proximal Point Method ALT 2026
Sample Complexity of Linear Regression Models for Opinion Formation in Networks AAAI 2025
Learnability of Parameter-Bounded Bayes Nets AAAI 2025
On the Asymptotic Optimality of Confidence Interval Based Algorithms for Fixed Confidence MABs AAAI 2025
Learning Accurate and Interpretable Decision Trees (Extended Abstract) IJCAI 2025
Near-Optimal Distributionally Robust Reinforcement Learning with General $L_p$ Norms NIPS 2024
The Power of Resets in Online Reinforcement Learning NIPS 2024
Preference-based Pure Exploration NIPS 2024
Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning NIPS 2024
Statistical Efficiency of Distributional Temporal Difference Learning NIPS 2024
Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs NIPS 2024
Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms NIPS 2024
Sample Complexity of Interventional Causal Representation Learning NIPS 2024
Improved Sample Complexity for Multiclass PAC Learning NIPS 2024
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random NIPS 2024
Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit NIPS 2024
Worst-Case Offline Reinforcement Learning with Arbitrary Data Support NIPS 2024
Fast Rates for Bandit PAC Multiclass Classification NIPS 2024
Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma NIPS 2024
Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models NIPS 2023
When is Agnostic Reinforcement Learning Statistically Tractable? NIPS 2023
Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms NIPS 2023
KAKURENBO: Adaptively Hiding Samples in Deep Neural Network Training NIPS 2023
Multi-task Representation Learning for Pure Exploration in Bilinear Bandits NIPS 2023