Skip to content
conftrace_

pac learning

311 papers

Papers

Forming Probably Stable Communities with Limited Interactions AAAI 2019 Hardness of Improper One-Sided Learning of Conjunctions For All Uniformly Falsifiable CSPs ALT 2019 Learning Neural Networks with Two Nonlinear Layers in Polynomial Time COLT 2019 Learning Set Functions with Limited Complementarity AAAI 2019 Locally Private Learning without Interaction Requires Separation NeurIPS 2019 Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin NeurIPS 2019 On the Hardness of Robust Classification NeurIPS 2019 Open Problem: Is Margin Sufficient for Non-Interactive Private Distributed Learning? COLT 2019 Open Problem: Monotonicity of Learning COLT 2019 PAC Battling Bandits in the Plackett-Luce Model ALT 2019 PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits ICML 2019 Private Hypothesis Selection NeurIPS 2019 Simultaneous Private Learning of Multiple Concepts JMLR 2019 VC Classes are Adversarially Robustly Learnable, but Only Improperly COLT 2019 Wasserstein Soft Label Propagation on Hypergraphs: Algorithm and Generalization Error Bounds AAAI 2019 A Direct Sum Result for the Information Complexity of Learning COLT 2018 Discriminative Learning of Prediction Intervals AISTATS 2018 Improved Algorithms for Collaborative PAC Learning NeurIPS 2018 Learning convex polytopes with margin NeurIPS 2018 Learning under p-Tampering Attacks ALT 2018 Markov Decision Processes with Continuous Side Information ALT 2018 Model-Agnostic Private Learning NeurIPS 2018 On Oracle-Efficient PAC RL with Rich Observations NeurIPS 2018 Open Category Detection with PAC Guarantees ICML 2018 Optimal Quantum Sample Complexity of Learning Algorithms JMLR 2018