Average-case information complexity of learning

MaRDI QIDQ7034380zbMATH OpenFDO

Authors Ido Nachum, Amir Yehudayoff

Publication date 31 January 2025

Full work available at URL https://proceedings.mlr.press/v98/nachum19a.html

zbMATH Keywords

information theorylearning theory

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• Algorithmic stability for adaptive data analysis
• Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
• Elements of Information Theory
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Learners that use little information
• Max-information, differential privacy, and post-selection hypothesis testing
• Modeling by shortest data description
• Network information theory
• Occam's razor
• Preserving statistical validity in adaptive data analysis (extended abstract)
• Private empirical risk minimization: efficient algorithms and tight error bounds
• Sample Compression Schemes for VC Classes
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Theory of Cryptography
• Understanding machine learning. From theory to algorithms
• Zur Theorie der Gesellschaftsspiele.

Cited in

(1)

• Generalization bounds: perspectives from information theory and PAC-Bayes

This page was built for publication: Average-case information complexity of learning

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