Quantifying accuracy of learning via sample width
In a recent paper, the authors introduced the notion of sample width for binary classifiers defined on the set of real numbers. It was shown that the performance of such classifiers could be quantified in terms of this sample width. This paper considers how to adapt the idea of sample width so that it can be applied in cases where the classifiers are defined on some finite metric space. We discuss how to employ a greedy set-covering heuristic to bound generalization error. Then, by relating the learning problem to one involving certain graph-theoretic parameters, we obtain generalization error bounds that depend on the sample width and on measures of `density' of the underlying metric space.
Abstract Wind is one of the fastest-growing renewable sources of electricity. As with most renewables, the economic viability relies on public subsidies. Even among renewables, the economic evaluation of wind projects is particularly challenging due to the unpredictability of the energy source, wind, and the high sensitivity of the project profitability to changes in a number of parameters. This makes the uncertainty analysis an important topic of research in the wind power sector. This study presents a method of combining two uncertainty analysis methods, sensitivity study and the Monte Carlo method, together with a technical and economic model of a wind farm, in an effort to improve the understanding of the practical effects of the uncertainties, and how they affect the financial risks of wind projects.