255 search results - page 10 / 51 » Generalized Boosting Algorithms for Convex Optimization |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
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...
MOR
2006
13 years 8 months ago
2006
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Classifiers are often used to detect miscreant activities. We study how an adversary can efficiently query a classifier to elicit information that allows the adversary to evade de...
FAW
2010
Springer
13 years 9 months ago
2010
Springer
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
NIPS
2008
13 years 10 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...