SOTAVerified

PAC learning

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

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 21–30 of 289 papers

TitleStatusHype
Data-Driven Neural Certificate Synthesis—0
Efficient Optimal PAC Learning—0
PAC Learning is just Bipartite Matching (Sort of)—0
Distribution-Specific Agnostic Conditional Classification With Halfspaces—0
Ehrenfeucht-Haussler Rank and Chain of Thought—0
The working principles of model-based GAs fall within the PAC framework: A mathematical theory of problem decomposition—0
A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise—0
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random—0
Identifying Information from Observations with Uncertainty and Novelty—0
A Closer Look at the Learnability of Out-of-Distribution (OOD) Detection—0
Show:102550
← PrevPage 3 of 29Next →

No leaderboard results yet.