Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Comment: Transductive PAC-Bayes bounds seen as a generalization of Vapnik-Chervonenkis bounds

From MaRDI portal
Publication:2805722
Jump to:navigation, search

DOI10.1007/978-3-319-21852-6_10zbMATH Open1357.68165OpenAlexW2327935300MaRDI QIDQ2805722FDOQ2805722


Authors: Olivier Catoni Edit this on Wikidata


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_10




Recommendations

  • Comment: The Two Styles of VC Bounds
  • Vapnik-Chervonenkis bounds for generalization
  • Making Vapnik-Chervonenkis bounds accurate
  • scientific article
  • PAC-Bayes bounds for supervised classification


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)


Cites Work

  • Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz


Cited In (1)

  • Making Vapnik-Chervonenkis bounds accurate





This page was built for publication: Comment: Transductive PAC-Bayes bounds seen as a generalization of Vapnik-Chervonenkis bounds

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2805722&oldid=15716143"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 17:45. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki