sample complexity

On the Sample Complexity of Learning Infinite-horizon Discounted Linear Kernel MDPs ICML 2022 On the Sample Complexity of Stability Constrained Imitation Learning L4DC 2022 On the Sample Complexity of Stabilizing LTI Systems on a Single Trajectory NeurIPS 2022 Optimal Algorithms for Stochastic Multi-Level Compositional Optimization ICML 2022 Optimal Efficiency-Envy Trade-Off via Optimal Transport NeurIPS 2022 Optimal estimation of Gaussian DAG models AISTATS 2022 Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise COLT 2022 Optimal Weak to Strong Learning NeurIPS 2022 PAC-Bayesian domain adaptation bounds for multiclass learners UAI 2022 PAC Learning of Quantum Measurement Classes : Sample Complexity Bounds and Universal Consistency AISTATS 2022 PER-ETD: A Polynomially Efficient Emphatic Temporal Difference Learning Method ICLR 2022 Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity ICML 2022 Policy Gradient Method For Robust Reinforcement Learning ICML 2022 Policy Optimization with Linear Temporal Logic Constraints NeurIPS 2022 Private and polynomial time algorithms for learning Gaussians and beyond COLT 2022 Private High-Dimensional Hypothesis Testing COLT 2022 Probabilistically Robust Learning: Balancing Average and Worst-case Performance ICML 2022 Provable Adaptation across Multiway Domains via Representation Learning ICLR 2022 Provable Lifelong Learning of Representations AISTATS 2022 Provable Reinforcement Learning with a Short-Term Memory ICML 2022 Provably Efficient Offline Multi-agent Reinforcement Learning via Strategy-wise Bonus NeurIPS 2022 Provably Filtering Exogenous Distractors using Multistep Inverse Dynamics ICLR 2022 Provably sample-efficient RL with side information about latent dynamics NeurIPS 2022 Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes ICML 2022 Robust Sparse Mean Estimation via Sum of Squares COLT 2022