summaryrefslogtreecommitdiffstats
path: root/papers
ModeNameSize
-rw-r--r--0408007v1174982logstatsplain
-rw-r--r--Abernethy - An efficient algorithm for bandit linear optimization, 2008.pdf2959246logstatsplain
-rw-r--r--Abernethy, Hazan, Rakhlin - An efficient algorithm for bandit linear optimization.pdf343630logstatsplain
-rw-r--r--An optimal high probability algorithm for the contextual bandit problem, 2010.pdf165877logstatsplain
-rw-r--r--Audibert, Bubeck - Minmax policies for bandit games.pdf538911logstatsplain
-rw-r--r--Audibert, Bubeck - Regret bounds and minimax policies under partial monitoring, 2010.pdf332528logstatsplain
-rw-r--r--Aueur, Cesa, Fischer - Finite-time analysis of the multiarmed bandit problem, 2002.pdf207856logstatsplain
-rw-r--r--Aueur, Cesa, Freund, Schapire - The nonstochastic multiarmed bandit problem, 2002.pdf275770logstatsplain
-rw-r--r--Cesa, Lugosi - Prediction, learning and games, 2006.pdf3706034logstatsplain
-rw-r--r--Cesa, Lugosi, Stoltz - Minimizing regret with label efficient prediction, 2005.pdf375956logstatsplain
-rw-r--r--Freedman - On tail probabilities for martingales, 1972.pdf1476654logstatsplain
-rw-r--r--Massart - Concentration Inequalities and Model Selection, 2003.pdf1584747logstatsplain
-rw-r--r--Stoltz - Incomplete information and internal regret in prediction of individual sequences, 2005.pdf1957541logstatsplain
-rw-r--r--TCS08.pdf449972logstatsplain
-rw-r--r--Zinkevich - Online convex programming and generalized infinitesimal gradient ascent (technical), 2003.pdf266814logstatsplain
-rw-r--r--Zinkevich - Online convex programming and generalized infinitesimal gradient ascent, 2003.pdf228882logstatsplain