On learnability wih computable learners

MaRDI QIDQ7025155zbMATH OpenFDO

Authors Sushant Agarwal, Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, Ruth Urner

Publication date 19 February 2025

Full work available at URL https://proceedings.mlr.press/v117/agarwal20b.html

zbMATH Keywords

computabilityPAC learningVC-dimension

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A theory of the learnable
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• From average case complexity to improper learning complexity
• scientific article; zbMATH DE number 1391397 (Why is no real title available?)
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Understanding machine learning. From theory to algorithms

Cited in

(1)

• On computable online learning

This page was built for publication: On learnability wih computable learners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025155)