Skip to content
conftrace_

sample complexity

1,587 papers

Papers

Improved Sample Complexity for Reward-free Reinforcement Learning under Low-rank MDPs ICLR 2023 Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise COLT 2023 Information Theoretic Lower Bounds for Information Theoretic Upper Bounds NeurIPS 2023 Initialization-Dependent Sample Complexity of Linear Predictors and Neural Networks NeurIPS 2023 Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games AISTATS 2023 Joint Edge-Model Sparse Learning is Provably Efficient for Graph Neural Networks ICLR 2023 Jump-Start Reinforcement Learning ICML 2023 Latent Variable Representation for Reinforcement Learning ICLR 2023 Layered State Discovery for Incremental Autonomous Exploration ICML 2023 Learning Distributions over Quantum Measurement Outcomes ICML 2023 Learning Mixtures of Gaussians with Censored Data ICML 2023 Learning Rationalizable Equilibria in Multiplayer Games ICLR 2023 Learning ReLU networks to high uniform accuracy is intractable ICLR 2023 Learning Revenue Maximization Using Posted Prices for Stochastic Strategic Patient Buyers AAAI 2023 Learning Sparse Group Models Through Boolean Relaxation ICLR 2023 Leveraging Offline Data in Online Reinforcement Learning ICML 2023 Linear Convergence of Natural Policy Gradient Methods with Log-Linear Policies ICLR 2023 Linear Reinforcement Learning with Ball Structure Action Space ALT 2023 List and Certificate Complexities in Replicable Learning NeurIPS 2023 Lower Bounds for Learning in Revealing POMDPs ICML 2023 Minimax optimal testing by classification COLT 2023 Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity JMLR 2023 More for Less: Safe Policy Improvement with Stronger Performance Guarantees IJCAI 2023 Multi-Agent Best Arm Identification with Private Communications ICML 2023 Multitask Learning via Shared Features: Algorithms and Hardness COLT 2023