329 search results - page 42 / 66 » Probably Approximately Correct Learning |
EATCS
1998
13 years 8 months ago
1998
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
MP
2002
13 years 8 months ago
2002
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...
DIS
2007
Springer
14 years 2 months ago
2007
Springer
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
NIPS
2000
13 years 10 months ago
2000
We describe a neurally-inspired, unsupervised learning algorithm that builds a non-linear generative model for pairs of face images from the same individual. Individuals are then ...