Sciweavers

40 search results - page 2 / 8
» Random Descent
Sort
View
EOR
2000
77views more  EOR 2000»
13 years 9 months ago
Training the random neural network using quasi-Newton methods
Training in the random neural network (RNN) is generally speci
Aristidis Likas, Andreas Stafylopatis
ICCV
2009
IEEE
15 years 2 months ago
Higher-Order Gradient Descent by Fusion-Move Graph Cut
Markov Random Field is now ubiquitous in many formulations of various vision problems. Recently, optimization of higher-order potentials became practical using higherorder graph...
Hiroshi Ishikawa
ACSW
2004
13 years 11 months ago
Applying Online Gradient Descent Search to Genetic Programming for Object Recognition
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
William D. Smart, Mengjie Zhang
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 9 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
ICANN
2007
Springer
14 years 1 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel