Research Explorer
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
About
Methodology
← 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
Statistical Optimal Transport posed as Learning Kernel Embedding
NIPS 2020
Efficient Learning of Discrete Graphical Models
NIPS 2020
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction
NIPS 2020
Sample complexity and effective dimension for regression on manifolds
NIPS 2020
Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms
NIPS 2020
Limits on Testing Structural Changes in Ising Models
NIPS 2020
Optimal Prediction of the Number of Unseen Species with Multiplicity
NIPS 2020
Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning
NIPS 2020
Learning Sums of Independent Random Variables with Sparse Collective Support
JMLR 2020
Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret
NIPS 2020
Sample-Efficient Reinforcement Learning of Undercomplete POMDPs
NIPS 2020
On Reward-Free Reinforcement Learning with Linear Function Approximation
NIPS 2020
Active Model Estimation in Markov Decision Processes
UAI 2020
Collaborative Exploration in Stochastic Multi-Player Bandits
ACML 2020
A Finite-Time Analysis of Two Time-Scale Actor-Critic Methods
NIPS 2020
Error Bounds of Imitating Policies and Environments
NIPS 2020
PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learning
NIPS 2020
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
NIPS 2020
Sample Efficient Reinforcement Learning via Low-Rank Matrix Estimation
NIPS 2020
Improved Sample Complexity for Incremental Autonomous Exploration in MDPs
NIPS 2020
Is Long Horizon RL More Difficult Than Short Horizon RL?
NIPS 2020
Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension
NIPS 2020
A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices
NIPS 2020
Functional Regularization for Representation Learning: A Unified Theoretical Perspective
NIPS 2020
SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm
NIPS 2020
<
1
…
30
31
32
…
47
>