← Keywords

pac learning

280 papers

Explore in graph

Also known as

PACF PAC

Co-occurring keywords

sample complexity (1158) vc dimension (107) learning theory (518) differential privacy (1010) agnostic learning (76) active learning (1295) online learning (1770) multi-armed bandit (1091) adversarial robustness (1335) reinforcement learning (4122)

Papers

The Sample Complexity of Learning Linear Predictors with the Squared Loss JMLR 2015
A PTAS for Agnostically Learning Halfspaces COLT 2015
Spectral Norm Regularization of Orthonormal Representations for Graph Transduction NIPS 2015
Optimistic Planning in Markov Decision Processes Using a Generative Model NIPS 2014
Agnostic Bayesian Learning of Ensembles ICML 2014
The sample complexity of agnostic learning under deterministic labels COLT 2014
PAC-inspired Option Discovery in Lifelong Reinforcement Learning ICML 2014
Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing ICML 2014
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity COLT 2014
Learning Shuffle Ideals Under Restricted Distributions NIPS 2014
Information Complexity in Bandit Subset Selection COLT 2013
Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching COLT 2013
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NIPS 2013
Active and passive learning of linear separators under log-concave distributions COLT 2013
More data speeds up training time in learning halfspaces over sparse vectors NIPS 2013
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees COLT 2013
On the Learnability of Shuffle Ideals JMLR 2013
Learning Using Local Membership Queries COLT 2013
Predictive PAC Learning and Process Decompositions NIPS 2013
Multi-Instance Learning with Any Hypothesis Class JMLR 2012
Learning Halfspaces with the Zero-One Loss: Time-Accuracy Tradeoffs NIPS 2012
Tight Bounds on Proper Equivalence Query Learning of DNF COLT 2012
Distributed Learning, Communication Complexity and Privacy COLT 2012
New Bounds for Learning Intervals with Implications for Semi-Supervised Learning COLT 2012
Sample Complexity of Composite Likelihood AISTATS 2012