conftrace_
← 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

Optimal Multi-Fidelity Best-Arm Identification NIPS 2024
Sample-Efficient Agnostic Boosting NIPS 2024
On the Complexity of Teaching a Family of Linear Behavior Cloning Learners NIPS 2024
Distributional Preference Alignment of LLMs via Optimal Transport NIPS 2024
Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces NIPS 2024
Sample-Efficient Private Learning of Mixtures of Gaussians NIPS 2024
Multi-Reward Best Policy Identification NIPS 2024
Tight Bounds for Learning RUMs from Small Slates NIPS 2024
Oracle-Efficient Differentially Private Learning with Public Data NIPS 2024
Provably and Practically Efficient Adversarial Imitation Learning with General Function Approximation NIPS 2024
Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models NIPS 2024
Transductive Learning is Compact NIPS 2024
Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent NIPS 2024
On $f$-Divergence Principled Domain Adaptation: An Improved Framework NIPS 2024
Breaking the curse of dimensionality in structured density estimation NIPS 2024
Fixed Confidence Best Arm Identification in the Bayesian Setting NIPS 2024
Dimension-free Private Mean Estimation for Anisotropic Distributions NIPS 2024
Worst-Case Offline Reinforcement Learning with Arbitrary Data Support NIPS 2024
The Sample Complexity of Gradient Descent in Stochastic Convex Optimization NIPS 2024
Sample-Efficient Constrained Reinforcement Learning with General Parameterization NIPS 2024
Sample Complexity of Interventional Causal Representation Learning NIPS 2024
The Sample-Communication Complexity Trade-off in Federated Q-Learning NIPS 2024
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random NIPS 2024
Learning and Transferring Sparse Contextual Bigrams with Linear Transformers NIPS 2024
Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning NIPS 2024