Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
86
search results - page 18 / 18
»
Estimation and Approximation Bounds for Gradient-Based Reinf...
Sort
relevance
views
votes
recent
update
View
thumb
title
127
click to vote
CORR
2004
Springer
103
views
Education
»
more
CORR 2004
»
Online convex optimization in the bandit setting: gradient descent without a gradient
15 years 3 months ago
Download
www.cs.cmu.edu
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...
claim paper
Read More »
« Prev
« First
page 18 / 18
Last »
Next »