SOTAVerified

PAC learning

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

Papers

Showing 76100 of 289 papers

TitleStatusHype
Collaborative Learning with Different Labeling Functions0
Transductive Learning Is Compact0
The sample complexity of multi-distribution learning0
-fractional Core Stability in Hedonic Games0
Information-theoretic generalization bounds for learning from quantum data0
Low-Rank MDPs with Continuous Action Spaces0
A PAC Learning Algorithm for LTL and Omega-regular Objectives in MDPs0
PAC Learning Linear Thresholds from Label Proportions0
Overview of AdaBoost : Reconciling its views to better understand its dynamics0
Distributional PAC-Learning from Nisan's Natural Proofs0
Inference for Gaussian Processes with Matern Covariogram on Compact Riemannian Manifolds0
Inference for Gaussian Processes with Matern Covariogram on Compact Riemannian Manifolds0
User-Level Differential Privacy With Few Examples Per User0
Provable learning of quantum states with graphical models0
Computing the Vapnik Chervonenkis Dimension for Non-Discrete Settings0
Efficiently Learning One-Hidden-Layer ReLU Networks via Schur Polynomials0
The Sample Complexity of Multi-Distribution Learning for VC Classes0
Optimal Learners for Realizable Regression: PAC Learning and Online Learning0
Multiclass Boosting: Simple and Intuitive Weak Learning Criteria0
Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise0
Learnability with PAC Semantics for Multi-agent Beliefs0
On the Role of Entanglement and Statistics in Learning0
Agnostic Multi-Group Active Learning0
Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise0
On the Role of Noise in the Sample Complexity of Learning Recurrent Neural Networks: Exponential Gaps for Long Sequences0
Show:102550
← PrevPage 4 of 12Next →

No leaderboard results yet.