Skip to content
conftrace_

pac learning

311 papers

Papers

Cryptographic Hardness of Learning Halfspaces with Massart Noise NeurIPS 2022 Efficient PAC Learning from the Crowd with Pairwise Comparisons ICML 2022 Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits AISTATS 2022 Fairness-Aware PAC Learning from Corrupted Data JMLR 2022 Generalization Bounds for Data-Driven Numerical Linear Algebra COLT 2022 Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks NeurIPS 2022 Instance-optimal PAC Algorithms for Contextual Bandits NeurIPS 2022 Is Out-of-Distribution Detection Learnable? NeurIPS 2022 Markov Abstractions for PAC Reinforcement Learning in Non-Markov Decision Processes IJCAI 2022 Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability ALT 2022 Metric-Fair Active Learning ICML 2022 Monotone Learning COLT 2022 Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes NeurIPS 2022 Near Instance-Optimal PAC Reinforcement Learning for Deterministic MDPs NeurIPS 2022 Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise COLT 2022 Noise Robust Core-stable Coalitions of Hedonic Games ACML 2022 On characterizations of learnability with computable learners COLT 2022 On Learning and Refutation in Noninteractive Local Differential Privacy NeurIPS 2022 On PAC Learning Halfspaces in Non-interactive Local Privacy Model with Public Unlabeled Data ACML 2022 On Robust Multiclass Learnability NeurIPS 2022 PAC Guarantees and Effective Algorithms for Detecting Novel Categories JMLR 2022 PAC Learning of Quantum Measurement Classes : Sample Complexity Bounds and Universal Consistency AISTATS 2022 PAC Mode Estimation using PPR Martingale Confidence Sequences AISTATS 2022 PAC Prediction Sets for Meta-Learning NeurIPS 2022 PAC Prediction Sets Under Covariate Shift ICLR 2022