sample complexity

Robust learning under clean-label attack COLT 2021 Sample Complexity Bounds for Active Ranking from Multi-wise Comparisons NeurIPS 2021 Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model ALT 2021 Sample Complexity Bounds for Two Timescale Value-based Reinforcement Learning Algorithms AISTATS 2021 Sample Complexity of Linear Quadratic Gaussian (LQG) Control for Output Feedback Systems L4DC 2021 Sample Complexity of Policy Gradient Finding Second-Order Stationary Points AAAI 2021 Sample Complexity of Robust Linear Classification on Separated Data ICML 2021 Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond NeurIPS 2021 Sample Efficient Decentralized Stochastic Frank-Wolfe Methods for Continuous DR-Submodular Maximization IJCAI 2021 Sample Efficient Detection and Classification of Adversarial Attacks via Self-Supervised Embeddings ICCV 2021 Sample-Efficient L0-L2 Constrained Structure Learning of Sparse Ising Models AAAI 2021 Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model NeurIPS 2021 Sample Efficient Reinforcement Learning In Continuous State Spaces: A Perspective Beyond Linearity ICML 2021 Sample-Optimal PAC Learning of Halfspaces with Malicious Noise ICML 2021 Sequential Algorithms for Testing Closeness of Distributions NeurIPS 2021 SGA: A Robust Algorithm for Partial Recovery of Tree-Structured Graphical Models with Noisy Samples ICML 2021 SGD: The Role of Implicit Regularization, Batch-size and Multiple-epochs NeurIPS 2021 Smooth Convex Optimization Using Sub-Zeroth-Order Oracles AAAI 2021 State-Wise Adaptive Discounting from Experience (SADE): A Novel Discounting Scheme for Reinforcement Learning (Student Abstract) AAAI 2021 Statistically and Computationally Efficient Linear Meta-representation Learning NeurIPS 2021 Statistical Query Lower Bounds for Tensor PCA JMLR 2021 STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning NeurIPS 2021 Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning NeurIPS 2021 Task-Optimal Exploration in Linear Dynamical Systems ICML 2021 Teaching via Best-Case Counterexamples in the Learning-with-Equivalence-Queries Paradigm NeurIPS 2021