Skip to content
conftrace_

pac learning

311 papers

Papers

Derandomizing Multi-Distribution Learning NeurIPS 2024 Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization Approach AISTATS 2024 Efficiently Learning One-Hidden-Layer ReLU Networks via SchurPolynomials COLT 2024 Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks ICML 2024 Efficient Quantum Agnostic Improper Learning of Decision Trees AISTATS 2024 Fast Rates for Bandit PAC Multiclass Classification NeurIPS 2024 Improved Sample Complexity for Multiclass PAC Learning NeurIPS 2024 Is Efficient PAC Learning Possible with an Oracle That Responds "Yes" or "No"? COLT 2024 Learnability Gaps of Strategic Classification COLT 2024 Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random NeurIPS 2024 Learning the Topology and Behavior of Discrete Dynamical Systems AAAI 2024 List Sample Compression and Uniform Convergence COLT 2024 Low-rank MDPs with Continuous Action Spaces AISTATS 2024 Majority-of-Three: The Simplest Optimal Learner? COLT 2024 On the Computability of Robust PAC Learning COLT 2024 On the Computational Landscape of Replicable Learning NeurIPS 2024 On the Learnability of Out-of-distribution Detection JMLR 2024 Optimistic Rates for Learning from Label Proportions COLT 2024 Private PAC Learning May be Harder than Online Learning ALT 2024 Prospective Learning: Learning for a Dynamic Future NeurIPS 2024 Provable Advantage in Quantum PAC Learning COLT 2024 Reliable Learning of Halfspaces under Gaussian Marginals NeurIPS 2024 SHAP@k: Efficient and Probably Approximately Correct (PAC) Identification of Top-K Features AAAI 2024 Simple online learning with consistent oracle COLT 2024 Smoothed Online Classification can be Harder than Batch Classification NeurIPS 2024