sample complexity

Learning Erdos-Renyi Random Graphs via Edge Detecting Queries NeurIPS 2019 Learning Rules-First Classifiers AISTATS 2019 Learning Set Functions with Limited Complementarity AAAI 2019 Learning Unfaithful K-separable Gaussian Graphical Models JMLR 2019 Limiting Extrapolation in Linear Approximate Value Iteration NeurIPS 2019 Limits of Private Learning with Access to Public Data NeurIPS 2019 Locally Private Learning without Interaction Requires Separation NeurIPS 2019 Lower Bounds on Adversarial Robustness from Optimal Transport NeurIPS 2019 Maximum Expected Hitting Cost of a Markov Decision Process and Informativeness of Rewards NeurIPS 2019 Max-Sliced Wasserstein Distance and Its Use for GANs CVPR 2019 Minimax Learning of Ergodic Markov Chains ALT 2019 Minimax Optimal Estimation of Approximate Differential Privacy on Neighboring Databases NeurIPS 2019 Model-based RL in Contextual Decision Processes: PAC bounds and Exponential Improvements over Model-free Approaches COLT 2019 Mo' States Mo' Problems: Emergency Stop Mechanisms from Observation NeurIPS 2019 Multiagent Evaluation under Incomplete Information NeurIPS 2019 Multiclass Learning from Contradictions NeurIPS 2019 Nonconvex Low-Rank Tensor Completion from Noisy Data NeurIPS 2019 On Communication Complexity of Classification Problems COLT 2019 On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons NeurIPS 2019 On the Correctness and Sample Complexity of Inverse Reinforcement Learning NeurIPS 2019 On the Hardness of Robust Classification NeurIPS 2019 On the statistical rate of nonlinear recovery in generative models with heavy-tailed data ICML 2019 On the Value of Target Data in Transfer Learning NeurIPS 2019 Open Problem: How fast can a multiclass test set be overfit? COLT 2019 Optimal Best Markovian Arm Identification with Fixed Confidence NeurIPS 2019