Skip to content
conftrace_

sample complexity

1,587 papers

Papers

A Characterization of Semi-Supervised Adversarially Robust PAC Learnability NeurIPS 2022 Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach AAAI 2022 Active approximately metric-fair learning UAI 2022 Active Exploration for Inverse Reinforcement Learning NeurIPS 2022 Active Learning for Nonlinear System Identification with Guarantees JMLR 2022 Active learning with label comparisons UAI 2022 Active Ranking without Strong Stochastic Transitivity NeurIPS 2022 Active Structure Learning of Bayesian Networks in an Observational Setting JMLR 2022 Adaptive Oracle-Efficient Online Learning NeurIPS 2022 Adversarially Robust Learning: A Generic Minimax Optimal Learner and Characterization NeurIPS 2022 Adversarially Robust Stability Certificates can be Sample-Efficient L4DC 2022 A Fast Algorithm for PAC Combinatorial Pure Exploration AAAI 2022 A Few Expert Queries Suffices for Sample-Efficient RL with Resets and Linear Value Approximation NeurIPS 2022 A general sample complexity analysis of vanilla policy gradient AISTATS 2022 A Natural Actor-Critic Framework for Zero-Sum Markov Games ICML 2022 A Near-Optimal Primal-Dual Method for Off-Policy Learning in CMDP NeurIPS 2022 An Improper Estimator with Optimal Excess Risk in Misspecified Density Estimation and Logistic Regression JMLR 2022 An Information-Theoretic Framework for Deep Learning NeurIPS 2022 A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits AISTATS 2022 Approximate Function Evaluation via Multi-Armed Bandits AISTATS 2022 Approximate Top-m Arm Identification with Heterogeneous Reward Variances AISTATS 2022 Approximation and Learning with Deep Convolutional Models: a Kernel Perspective ICLR 2022 A Simple Reward-free Approach to Constrained Reinforcement Learning ICML 2022 A Single-Timescale Method for Stochastic Bilevel Optimization AISTATS 2022 A Theory of PAC Learnability under Transformation Invariances NeurIPS 2022