52 search results - page 4 / 11 » A comparison of tight generalization error bounds |
89
Voted
TIT
2010
14 years 5 months ago
2010
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bou...
NIPS
2004
15 years 13 days ago
2004
In the context of binary classification, we define disagreement as a measure of how often two independently-trained models differ in their classification of unlabeled data. We exp...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
ISSTA
2010
ACM
15 years 1 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
TCS
2011
14 years 6 months ago
2011
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...