Register | Log in

[Help]

Learn more about the SAGE-Hindawi Access to Research partnership.

CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Online convex optimization in the bandit setting: gradient descent without a gradient

by: Abraham D. Flaxman, Adam T. Kalai, Brendan H. Mcmahan

In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (2005), pp. 385-394.

[Posts]

View FullText article

ACM

Reviews [Write a review of this article]

Find related articles from these CiteULike users

neddimitrov, abie, hrishi

Find related articles with these CiteULike tags

and, approximation, bandit, convex, descent, exploit, explore, game_theory, gradient, online, optimization, perturbation, simultaneous, stochastic, unread

Posting History^NEW

BibTeX record

RIS record

RIS BibTeX RTF/PDF

abie's tags

All tags in abie's library

Filter:

3 achlioptas ad-hoc adversarial albert algorithm algorithms analysis and approximation attachment auction average barabasi bibtex-import bound case coloring communication component convex critical csp decompositions degree deletion descent diameter digraphs distinct distribution drawing dust eigenvalue exploit explore facility factors first-passage free geometric giant gradient graph graphs instances k-sat law location log lower major-breakthrough maximum minimum model network networks np-hard online optimization path percolation pertubed perturbation perturbed power preferential process programming random randomly sat satisfiability scale semi-streaming sensor sequences simultaneous smart smoothed space spanning spectral stage stochastic streaming string structures subsequence subset substring substrings sum threshold tree two vcg

Privacy Statement | Terms & Conditions