Talk:Error tolerance (PAC learning)

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Articles for creation This article was reviewed by member(s) of WikiProject Articles for creation. The project works to allow users to contribute quality articles and media files to the encyclopedia and track their progress as they are developed. To participate, please visit the project page for more information. This article was accepted from this draft on 21 December 2015 by reviewer SwisterTwister (talk · contribs). Computer science This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks. ??? This article has not yet received a rating on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

What is n in the definition of learnable?

Latest comment: 11 months ago1 comment1 person in discussion

"in a number of calls to the oracle bounded by ${\displaystyle p\left({\frac {1}{\varepsilon }},{\frac {1}{\delta }},n,{\text{size}}(f)\right)}$ " What is ${\displaystyle n}$  here? And how do you measure ${\displaystyle {\text{size}}(f)}$ ? 65.112.8.17 (talk) 18:32, 9 September 2024 (UTC)Reply

Inconsistent number of arguments to p

Latest comment: 11 months ago1 comment1 person in discussion

In the "Definition" subsection of the "Classification Noise" section: "a polynomial ${\displaystyle p(\cdot ,\cdot ,\cdot ,\cdot )}$  such that ... bounded by ${\displaystyle p\left({\frac {1}{1-2\eta _{B}}},{\frac {1}{\varepsilon }},{\frac {1}{\delta }},n,size(f)\right)}$ ". The first <math>p<\math> has four arguments, the second has five. What is correct here? 65.112.8.17 (talk) 18:36, 9 September 2024 (UTC)Reply