sample complexity

Active Learning Algorithms for Graphical Model Selection AISTATS 2016 Actively Learning Hemimetrics with Applications to Eliciting User Preferences ICML 2016 Adaptive Concentration Inequalities for Sequential Decision Problems NeurIPS 2016 Adaptive Learning with Robust Generalization Guarantees COLT 2016 A Note on the Sample Complexity of the Er-SpUD Algorithm by Spielman, Wang and Wright for Exact Recovery of Sparsely Used Dictionaries JMLR 2016 Anytime Exploration for Multi-armed Bandits using Confidence Information ICML 2016 A PAC RL Algorithm for Episodic POMDPs AISTATS 2016 A Sparse Interactive Model for Matrix Completion with Side Information NeurIPS 2016 Blazing the trails before beating the path: Sample-efficient Monte-Carlo planning NeurIPS 2016 Estimating Diffusion Networks: Recovery Conditions, Sample Complexity and Soft-thresholding Algorithm JMLR 2016 Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back NeurIPS 2016 Group Equivariant Convolutional Networks ICML 2016 High Dimensional Structured Superposition Models NeurIPS 2016 Improper Deep Kernels AISTATS 2016 Improved Learning Complexity in Combinatorial Pure Exploration Bandits AISTATS 2016 Improving PAC Exploration Using the Median Of Means NeurIPS 2016 Interactive Algorithms: from Pool to Stream COLT 2016 L1-regularized Neural Networks are Improperly Learnable in Polynomial Time ICML 2016 Local Minimax Complexity of Stochastic Convex Optimization NeurIPS 2016 Memory, Communication, and Statistical Queries COLT 2016 More Supervision, Less Computation: Statistical-Computational Tradeoffs in Weakly Supervised Learning NeurIPS 2016 Multi-step learning and underlying structure in statistical models NeurIPS 2016 Near-Optimal Smoothing of Structured Conditional Probability Matrices NeurIPS 2016 Noisy Tensor Completion via the Sum-of-Squares Hierarchy COLT 2016 Only H is left: Near-tight Episodic PAC RL NeurIPS 2016