← 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

A general sample complexity analysis of vanilla policy gradient AISTATS 2022
Efficient Decentralized Stochastic Gradient Descent Method for Nonconvex Finite-Sum Optimization Problems AAAI 2022
A Fast Algorithm for PAC Combinatorial Pure Exploration AAAI 2022
Active Structure Learning of Bayesian Networks in an Observational Setting JMLR 2022
Towards Bridging Sample Complexity and Model Capacity AAAI 2022
A Single-Timescale Method for Stochastic Bilevel Optimization AISTATS 2022
Improved Generalization Bounds for Adversarially Robust Learning JMLR 2022
Sharp Constants in Uniformity Testing via the Huber Statistic COLT 2022
Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits AISTATS 2022
Private High-Dimensional Hypothesis Testing COLT 2022
Non-asymptotic and Accurate Learning of Nonlinear Dynamical Systems JMLR 2022
An Improper Estimator with Optimal Excess Risk in Misspecified Density Estimation and Logistic Regression JMLR 2022
Exact Learning of Preference Structure: Single-peaked Preferences and Beyond ICML 2022
The Sample Complexity of One-Hidden-Layer Neural Networks NIPS 2022
A Near-Optimal Primal-Dual Method for Off-Policy Learning in CMDP NIPS 2022
Neural Networks can Learn Representations with Gradient Descent COLT 2022
On the Role of Channel Capacity in Learning Gaussian Mixture Models COLT 2022
Lie Point Symmetry Data Augmentation for Neural PDE Solvers ICML 2022
Exact Gap between Generalization Error and Uniform Convergence in Random Feature Models ICML 2021
A theory of high dimensional regression with arbitrary correlations between input features and target functions: sample complexity, multiple descent curves and a hierarchy of phase transitions ICML 2021
Sample Complexity Bounds for Active Ranking from Multi-wise Comparisons NIPS 2021
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification NIPS 2021
Faster Matchings via Learned Duals NIPS 2021
Fast active learning for pure exploration in reinforcement learning ICML 2021
Adaptive Sampling for Best Policy Identification in Markov Decision Processes ICML 2021