← 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 Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization AISTATS 2024
Derandomizing Multi-Distribution Learning NIPS 2024
Improved Sample Complexity Bounds for Diffusion Model Training NIPS 2024
Improved Sample Complexity for Multiclass PAC Learning NIPS 2024
The Many Faces of Optimal Weak-to-Strong Learning NIPS 2024
Identifying Copeland Winners in Dueling Bandits with Indifferences AISTATS 2024
Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning NIPS 2024
Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models NIPS 2024
Clustering Items From Adaptively Collected Inconsistent Feedback AISTATS 2024
Sequential learning of the Pareto front for multi-objective bandits AISTATS 2024
Timing as an Action: Learning When to Observe and Act AISTATS 2024
Achieving $\tilde{O}(1/\epsilon)$ Sample Complexity for Constrained Markov Decision Process NIPS 2024
Consistency of Neural Causal Partial Identification NIPS 2024
Feasible $Q$-Learning for Average Reward Reinforcement Learning AISTATS 2024
Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs NIPS 2024
Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning NIPS 2024
Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces NIPS 2024
Safe and Efficient: A Primal-Dual Method for Offline Convex CMDPs under Partial Data Coverage NIPS 2024
Provably and Practically Efficient Adversarial Imitation Learning with General Function Approximation NIPS 2024
Preference-based Pure Exploration NIPS 2024
Sample Complexity of Interventional Causal Representation Learning NIPS 2024
Get rich quick: exact solutions reveal how unbalanced initializations promote rapid feature learning NIPS 2024
Learning and Transferring Sparse Contextual Bigrams with Linear Transformers NIPS 2024
On the Benefits of Public Representations for Private Transfer Learning under Distribution Shift NIPS 2024
Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms NIPS 2024