sample complexity

Adaptive Double-Exploration Tradeoff for Outlier Detection AAAI 2020 A Finite-Time Analysis of Two Time-Scale Actor-Critic Methods NeurIPS 2020 Agnostic Q-learning with Function Approximation in Deterministic Systems: Near-Optimal Bounds on Approximation Error and Sample Complexity NeurIPS 2020 Algebraic and Analytic Approaches for Parameter Learning in Mixture Models ALT 2020 A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices NeurIPS 2020 A Nearly Optimal Variant of the Perceptron Algorithm for the Uniform Distribution on the Unit Sphere COLT 2020 An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits NeurIPS 2020 An Improved Analysis of (Variance-Reduced) Policy Gradient and Natural Policy Gradient Methods NeurIPS 2020 An Optimal Elimination Algorithm for Learning a Best Arm NeurIPS 2020 A Sample Complexity Separation between Non-Convex and Convex Meta-Learning ICML 2020 A Stochastic Derivative-Free Optimization Method with Importance Sampling: Theory and Learning to Control AAAI 2020 AsyncQVI: Asynchronous-Parallel Q-Value Iteration for Discounted Markov Decision Processes with Near-Optimal Sample Complexity AISTATS 2020 Bessel Smoothing and Multi-Distribution Property Estimation COLT 2020 Best Arm Identification in Spectral Bandits IJCAI 2020 Best-item Learning in Random Utility Models with Subset Choices AISTATS 2020 Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles ICML 2020 Biased Stochastic First-Order Methods for Conditional Stochastic Optimization and Applications in Meta Learning NeurIPS 2020 Bounding Regret in Empirical Games AAAI 2020 Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model NeurIPS 2020 Closure Properties for Private Classification and Online Prediction COLT 2020 Collaborative Exploration in Stochastic Multi-Player Bandits ACML 2020 Combinatorial Pure Exploration for Dueling Bandit ICML 2020 Control Frequency Adaptation via Action Persistence in Batch Reinforcement Learning ICML 2020 Convex Programming for Estimation in Nonlinear Recurrent Models JMLR 2020 Count-Based Exploration with the Successor Representation AAAI 2020