Comment: The Two Styles of VC Bounds

DOI10.1007/978-3-319-21852-6_11zbMATH Open1357.68188OpenAlexW2308567730WikidataQ62046638 ScholiaQ62046638MaRDI QIDQ2805723FDOQ2805723

Authors: Vladimir Vovk 

Publication date: 13 May 2016

Published in: Measures of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21852-6_11

Recommendations

• Rejoinder: Making VC Bounds Accurate
• A note on bounds for VC dimensions
• Boundaries of VP and VNP
• Some new maximum VC classes
• Well-known bound for the VC-dimension made easy
• scientific article; zbMATH DE number 6810192
• On a modification of the VCG mechanism and its optimality
• Making Vapnik-Chervonenkis bounds accurate
• A comment on a result of Vîrgolici

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Making Vapnik-Chervonenkis bounds accurate
• Chervonenkis's recollections
• A paper that created three new fields: Teoriya Veroyatnosteĭ i Ee Primeneniya 16(2), 1971, pp. 264-279
• Sketched history: VC combinatorics, 1826 up to 1975
• Comment: Transductive PAC-Bayes bounds seen as a generalization of Vapnik-Chervonenkis bounds
• In hindsight: Doklady Akademii Nauk SSSR, 181(4), 1968

This page was built for publication: Comment: The Two Styles of VC Bounds

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