Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

TCS
1998

favoriteEmaildiscussreport

103views Theoretical Computer Science» more TCS 1998»

Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory

13 years 10 months ago

Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory

Download www.dicom.uninsubria.it

Bruno Apolloni, Claudio Gentile

Real-time Traffic

TCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» Bounds on the Sample Complexity for Private Learning and Private Data Release

» Lower Bounds on the Sample Complexity of Exploration in the Multiarmed Bandit Problem

» Sample Complexity of RealCoded Evolutionary Algorithms

» Efficient Learning Algorithms Yield Circuit Lower Bounds

» PAC Analogues of Perceptron and Winnow via Boosting the Margin

» PAC Learning with Nasty Noise

» Sample Complexity of Composite Likelihood

» Efficient Selection of Multiple Bandit Arms Theory and Practice

» PAC modelfree reinforcement learning

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TCS
Authors	Bruno Apolloni, Claudio Gentile

Comments (0)