SOTAVerified

PAC learning

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

Papers

Showing 176200 of 289 papers

TitleStatusHype
On the Hardness of PAC-learning Stabilizer States with Noise0
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification0
From Local Pseudorandom Generators to Hardness of Learning0
The Price is (Probably) Right: Learning Market Equilibria from Samples0
Communication-Aware Collaborative Learning0
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise0
Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models0
Sample-efficient proper PAC learning with approximate differential privacy0
VC Dimension and Distribution-Free Sample-Based Testing0
PAC-Learning for Strategic Classification0
Towards a Combinatorial Characterization of Bounded-Memory Learning0
Efficient PAC Learning from the Crowd with Pairwise Comparisons0
Reducing Adversarially Robust Learning to Non-Robust PAC Learning0
Learning, compression, and leakage: Minimising classification error via meta-universal compression principles0
SLIP: Learning to Predict in Unknown Dynamical Systems with Long-Term MemoryCode0
A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise0
Understanding Boolean Function Learnability on Deep Neural Networks: PAC Learning Meets Neurosymbolic ModelsCode0
Learning from Mixtures of Private and Public Populations0
A Computational Separation between Private Learning and Online Learning0
Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks0
An Optimal Elimination Algorithm for Learning a Best Arm0
Learning Halfspaces with Tsybakov Noise0
List Learning with Attribute Noise0
Faster PAC Learning and Smaller Coresets via Smoothed Analysis0
Probably Approximately Correct Constrained Learning0
Show:102550
← PrevPage 8 of 12Next →

No leaderboard results yet.