Skip to content
conftrace_

sample complexity

1,587 papers

Papers

Efficient Bayesian network structure learning via local Markov boundary search NeurIPS 2021 Efficient Coreset Constructions via Sensitivity Sampling ACML 2021 Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization AISTATS 2021 Efficient Reinforcement Learning in Factored MDPs with Application to Constrained RL ICLR 2021 Empirical or Invariant Risk Minimization? A Sample Complexity Perspective ICLR 2021 Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited ALT 2021 Estimating Smooth GLM in Non-interactive Local Differential Privacy Model with Public Unlabeled Data ALT 2021 Exact Gap between Generalization Error and Uniform Convergence in Random Feature Models ICML 2021 Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamics ICML 2021 Exponential Separation between Two Learning Models and Adversarial Robustness NeurIPS 2021 Fast active learning for pure exploration in reinforcement learning ICML 2021 Faster Matchings via Learned Duals NeurIPS 2021 Fast Pure Exploration via Frank-Wolfe NeurIPS 2021 From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021 Generalization Bounds for Stochastic Saddle Point Problems AISTATS 2021 Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora’s Problem COLT 2021 Greedy-GQ with Variance Reduction: Finite-time Analysis and Improved Complexity ICLR 2021 Identification of the Generalized Condorcet Winner in Multi-dueling Bandits NeurIPS 2021 Incentive-Aware PAC Learning AAAI 2021 Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates NeurIPS 2021 Inverse Reinforcement Learning in a Continuous State Space with Formal Guarantees NeurIPS 2021 Is Reinforcement Learning More Difficult Than Bandits? A Near-optimal Algorithm Escaping the Curse of Horizon COLT 2021 Learning and Testing Irreducible Markov Chains via the k-Cover Time ALT 2021 Learning-based Support Estimation in Sublinear Time ICLR 2021 Learning Complexity of Simulated Annealing AISTATS 2021