7519 search results - page 70 / 1504 » Optimizing Generic Functions |
158
Voted
COLT
2010
Springer
15 years 14 days ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
97
Voted
MOR
2006
15 years 2 months ago
2006
We consider optimization problems involving convex risk functions. By employing techniques of convex analysis and optimization theory in vector spaces of measurable functions we d...
123
click to vote
SIGKDD
2002
15 years 2 months ago
2002
Research in secure distributed computation, which was done as part of a larger body of research in the theory of cryptography, has achieved remarkable results. It was shown that n...
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
GECCO
2003
Springer
15 years 7 months ago
2003
Springer