134 search results - page 12 / 27 » Local Minimax Learning of Approximately Polynomial Functions |
NIPS
2007
13 years 9 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
NIPS
1996
13 years 8 months ago
1996
Optimal Brain Damage (OBD) is a method for reducing the number of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid app...
PAMI
2010
13 years 2 months ago
2010
Abstract--This paper presents local spline regression for semisupervised classification. The core idea in our approach is to introduce splines developed in Sobolev space to map the...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...