SOTAVerified

PAC learning

Probably Approximately Correct (PAC) learning analyzes machine learning mathematically using probability bounds.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 251–289 of 289 papers

TitleStatusHype
Superpolynomial Lower Bounds for Decision Tree Learning and Testing—0
Supervising the Transfer of Reasoning Patterns in VQA—0
Symbolic Abstractions From Data: A PAC Learning Approach—0
The Optimal Sample Complexity of PAC Learning—0
The Power of Comparisons for Actively Learning Linear Classifiers—0
The Price is (Probably) Right: Learning Market Equilibria from Samples—0
The Sample Complexity of Multi-Distribution Learning for VC Classes—0
The sample complexity of multi-distribution learning—0
The VC-Dimension of Similarity Hypotheses Spaces—0
The working principles of model-based GAs fall within the PAC framework: A mathematical theory of problem decomposition—0
Learning General Halfspaces with General Massart Noise under the Gaussian Distribution—0
Tight Bounds for Collaborative PAC Learning via Multiplicative Weights—0
Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions—0
Tight Lower Bounds for Locally Differentially Private Selection—0
Towards a combinatorial characterization of bounded memory learning—0
Towards a Combinatorial Characterization of Bounded-Memory Learning—0
Towards a theory of out-of-distribution learning—0
Towards Efficient Contrastive PAC Learning—0
Towards Understanding Multi-Round Large Language Model Reasoning: Approximability, Learnability and Generalizability—0
Tree Learning: Optimal Algorithms and Sample Complexity—0
Unified Algorithms for RL with Decision-Estimation Coefficients: PAC, Reward-Free, Preference-Based Learning, and Beyond—0
User-Level Differential Privacy With Few Examples Per User—0
-fractional Core Stability in Hedonic Games—0
VC Dimension and Distribution-Free Sample-Based Testing—0
Wasserstein Soft Label Propagation on Hypergraphs: Algorithm and Generalization Error Bounds—0
A Characterization of List Learnability—0
Weak Robust Compatibility Between Learning Algorithms and Counterfactual Explanation Generation Algorithms—0
A Characterization of Multiclass Learnability—0
A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability—0
A Closer Look at the Learnability of Out-of-Distribution (OOD) Detection—0
A Complete Characterization of Statistical Query Learning with Applications to Evolvability—0
A Computational Separation between Private Learning and Online Learning—0
Active-learning-based non-intrusive Model Order Reduction—0
Active Learning for Contextual Search with Binary Feedbacks—0
A Distributional-Lifting Theorem for PAC Learning—0
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification—0
Adversarially Robust Learning with Tolerance—0
Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds—0
Adversarial Robustness: What fools you makes you stronger—0
Show:102550
← PrevPage 6 of 6Next →

No leaderboard results yet.