pac learning

PAC-learning in the presence of adversaries NeurIPS 2018 Policy and Value Transfer in Lifelong Reinforcement Learning ICML 2018 Privacy-preserving Prediction COLT 2018 Probably Approximately Metric-Fair Learning ICML 2018 State Abstractions for Lifelong Reinforcement Learning ICML 2018 The Limits of Maxing, Ranking, and Preference Learning ICML 2018 Collaborative PAC Learning NeurIPS 2017 Efficient PAC Learning from the Crowd COLT 2017 Learning Hedonic Games IJCAI 2017 Maxing and Ranking with Few Assumptions NeurIPS 2017 On Learning vs. Refutation COLT 2017 On the Complexity of Learning from Label Proportions IJCAI 2017 Optimal learning via local entropies and sample compression COLT 2017 PAC Learning Depth-3 AC^0 Circuits of Bounded Top Fanin ALT 2017 Predicting with Distributions COLT 2017 Tight Bounds on ℓ_1 Approximation and Learning of Self-Bounding Functions ALT 2017 Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning NeurIPS 2017 Adaptive Learning with Robust Generalization Guarantees COLT 2016 A PAC RL Algorithm for Episodic POMDPs AISTATS 2016 Hardness of Online Sleeping Combinatorial Optimization Problems NeurIPS 2016 Only H is left: Near-tight Episodic PAC RL NeurIPS 2016 PAC learning of Probabilistic Automaton based on the Method of Moments ICML 2016 PAC Lower Bounds and Efficient Algorithms for The Max K-Armed Bandit Problem ICML 2016 Supervised learning through the lens of compression NeurIPS 2016 The Optimal Sample Complexity of PAC Learning JMLR 2016