SOTAVerified

PAC learning

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

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 231–240 of 289 papers

TitleStatusHype
Revisiting Agnostic PAC Learning—0
Robust learning under clean-label attack—0
Sample Complexity Bounds for Robustly Learning Decision Lists against Evasion Attacks—0
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity—0
Sample-Efficient Learning of Mixtures—0
Sample-efficient proper PAC learning with approximate differential privacy—0
Sample-Optimal PAC Learning of Halfspaces with Malicious Noise—0
Screw Geometry Meets Bandits: Incremental Acquisition of Demonstrations to Generate Manipulation Plans—0
Semi-verified PAC Learning from the Crowd—0
Sequential Mode Estimation with Oracle Queries—0
Show:102550
← PrevPage 24 of 29Next →

No leaderboard results yet.