sample complexity

Improving Sample Complexity Bounds for (Natural) Actor-Critic Algorithms NeurIPS 2020 Information Theoretic Optimal Learning of Gaussian Graphical Models COLT 2020 Is Long Horizon RL More Difficult Than Short Horizon RL? NeurIPS 2020 Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning? NeurIPS 2020 Kinematic State Abstraction and Provably Efficient Rich-Observation Reinforcement Learning ICML 2020 Learning Gaussian Graphical Models via Multiplicative Weights AISTATS 2020 Learning in Gated Neural Networks AISTATS 2020 Learning Mixtures of Graphs from Epidemic Cascades ICML 2020 Learning nonlinear dynamical systems from a single trajectory L4DC 2020 Learning Opinions in Social Networks ICML 2020 Learning Polynomials in Few Relevant Dimensions COLT 2020 Learning Restricted Boltzmann Machines with Sparse Latent Variables NeurIPS 2020 Learning Sums of Independent Random Variables with Sparse Collective Support JMLR 2020 Learning the Globally Optimal Distributed LQ Regulator L4DC 2020 Learning the Linear Quadratic Regulator from Nonlinear Observations NeurIPS 2020 Learning the model-free linear quadratic regulator via random search L4DC 2020 Learning to Guide Random Search ICLR 2020 Learning Utilities and Equilibria in Non-Truthful Auctions NeurIPS 2020 Learning with Good Feature Representations in Bandits and in RL with a Generative Model ICML 2020 Limits on Testing Structural Changes in Ising Models NeurIPS 2020 Linear-Sample Learning of Low-Rank Distributions NeurIPS 2020 Locally Private Hypothesis Selection COLT 2020 Meta-learning for Mixed Linear Regression ICML 2020 Minimax Bounds for Structured Prediction Based on Factor Graphs AISTATS 2020 Minimax Testing of Identity to a Reference Ergodic Markov Chain AISTATS 2020