403 search results - page 25 / 81 » Sampling Bounds for Stochastic Optimization |
ESA
2008
Springer
13 years 11 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Several theoretical analyses of the dynamics of particle swarms have been offered in the literature over the last decade. Virtually all rely on substantial simplifications, incl...
SDM
2010
SIAM
13 years 11 months ago
2010
SIAM
Many approaches to active learning involve periodically training one classifier and choosing data points with the lowest confidence. An alternative approach is to periodically cho...
SIAMCO
2008
13 years 9 months ago
2008
We introduce a new class of control problems in which the gain depends on the solution of a stochastic differential equation reflected at the boundary of a bounded domain, along d...
COLT
2007
Springer
14 years 4 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...