From fd8e2555137082f0306fcf120afa77c7c6cd7a0e Mon Sep 17 00:00:00 2001 From: Thibaut Horel Date: Sat, 9 Oct 2010 14:28:10 +0200 Subject: Dernière version du rapport. Trop de changements pour êre listés. MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- biblio.bib | 26 +++++++++++++++++--------- 1 file changed, 17 insertions(+), 9 deletions(-) (limited to 'biblio.bib') diff --git a/biblio.bib b/biblio.bib index a8ecc26..437e402 100644 --- a/biblio.bib +++ b/biblio.bib @@ -24,6 +24,23 @@ Learning Theory", month="Juillet", } +@conference{multi, + title="Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback", + author="Alekh Agarwal and Ofer Dekel and Lin Xiao", + booktitle="Proceedings of The 23rd Annual Conference on +Learning Theory", + year="2010", + month="Juillet", + +} + +@conference{conv, + title="Online Convex Optimization in the Bandit Setting: Gradient Descent Without a Gradient", + author="Abie Flaxman and Adam Tauman Kalai and Brendan McMahan", + booktitle="Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms", + year="2005", +} + @unpublished{exp4, title="An Optimal High Probability Algorithm for the Contextual Bandit Problem", @@ -61,15 +78,6 @@ Schapire", year="2002" } -@conference{multi, - title="Optimal Algorithms for Online Convex Optimization with Multi-Point -Bandit Feedback", - author="Alekh Agarwal and Ofer Dekel and Lin Xiao", - booktitle="Proceedings of The 23rd Annual Conference on -Learning Theory", - year="2010" -} - @article{label, title="Minimizing regret with label efficient prediction", author="Cesa-Bianchi, Nicoló and Lugosi, Gàbor and Gilles Stoltz", -- cgit v1.2.3-70-g09d2