134 search results - page 3 / 27 » On the Complexity of Approximating the VC Dimension |
ATAL
2006
Springer
13 years 9 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
ICML
2007
IEEE
14 years 6 months ago
2007
IEEE
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
VC
1998
13 years 5 months ago
1998
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
ECML
1993
Springer
13 years 9 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...