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

Measures of complexity in the theory of machine learning

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

DOI10.1007/978-3-319-21852-6_13zbMATH Open1357.68166OpenAlexW2298079413MaRDI QIDQ2805725FDOQ2805725


Authors: A. Ya. Chervonenkis 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_13




Recommendations

  • VC dimension, fat-shattering dimension, Rademacher averages, and their applications
  • scientific article; zbMATH DE number 2051904
  • New approaches to statistical learning theory
  • On learnability, complexity and stability
  • scientific article; zbMATH DE number 4068049


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)



Cited In (2)

  • Theory and Applications of Models of Computation
  • On the Concept of Compositional Complexity





This page was built for publication: Measures of complexity in the theory of machine learning

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2805725&oldid=15716150"
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