Skip to content
conftrace_

pac learning

311 papers

Papers

Algorithmic Stability and Uniform Generalization NeurIPS 2015 An Almost Optimal PAC Algorithm COLT 2015 A PTAS for Agnostically Learning Halfspaces COLT 2015 Learnability of Influence in Networks NeurIPS 2015 PAC Optimal MDP Planning with Application to Invasive Species Management JMLR 2015 Sample Complexity of Learning Mahalanobis Distance Metrics NeurIPS 2015 Sparse Solutions to Nonnegative Linear Systems and Applications AISTATS 2015 Spectral Norm Regularization of Orthonormal Representations for Graph Transduction NeurIPS 2015 The Sample Complexity of Learning Linear Predictors with the Squared Loss JMLR 2015 Agnostic Bayesian Learning of Ensembles ICML 2014 Learning Shuffle Ideals Under Restricted Distributions NeurIPS 2014 Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing ICML 2014 Optimistic Planning in Markov Decision Processes Using a Generative Model NeurIPS 2014 PAC-inspired Option Discovery in Lifelong Reinforcement Learning ICML 2014 Sample Complexity Bounds on Differentially Private Learning via Communication Complexity COLT 2014 The sample complexity of agnostic learning under deterministic labels COLT 2014 Active and passive learning of linear separators under log-concave distributions COLT 2013 Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NeurIPS 2013 Information Complexity in Bandit Subset Selection COLT 2013 Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching COLT 2013 Learning Using Local Membership Queries COLT 2013 More data speeds up training time in learning halfspaces over sparse vectors NeurIPS 2013 On the Learnability of Shuffle Ideals JMLR 2013 Predictive PAC Learning and Process Decompositions NeurIPS 2013 Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees COLT 2013