Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Nonuniform learnability

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

DOI10.1016/S0022-0000(05)80005-4zbMath0806.68088OpenAlexW2913378067MaRDI QIDQ1329161

Gyora M. Benedek, Alon Itai

Publication date: 13 February 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(05)80005-4


zbMATH Keywords

learning modelnonuniform learning


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)


Related Items

Nonuniform learnability ⋮ VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Learnability with respect to fixed distributions
  • Occam's razor
  • Fast probabilistic algorithms for Hamiltonian circuits and matchings
  • Equivalence of models for polynomial learnability
  • Nonuniform learnability
  • A general lower bound on the number of examples needed for learning
  • Queries and concept learning
  • Deductive learning
  • Learnability and the Vapnik-Chervonenkis dimension
  • A theory of the learnable
  • On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1329161&oldid=13459135"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki