Learning to rank using gradient descent, Proc. of ICML, 2005. ,
Bandits for taxonomies: A model based approach, Proc. of SIAM SDM, 2007. ,
Active exploration for learning rankings from clickthrough data, Proc. of ACM SIGKDD, 2007. ,
Online learning of assignments, Proc. of NIPS, 2009. ,
Some aspects of the sequential design of experiments, Bulletin of the American Mathematical Society, vol.58, issue.5, pp.527-535, 1952. ,
Bandit Processes and Dynamic Allocation Indices, 1989. ,
Learning diverse rankings with multi-armed bandits, Proc. of ICML, 2008. ,
Interactively optimizing information retrieval systems as a dueling bandits problem, Proc. of ICML, 2009. ,
Linear submodular bandits and their application to diversified retrieval, Proc. of NIPS, 2011. ,
The budgeted maximum coverage problem, Inf. Process. Lett, vol.70, issue.1, pp.39-45, 1999. ,
A fast bandit algorithm for recommendations to users with heterogeneous tastes, Proc. of AAAI, 2013. ,
Correlation robust stochastic optimization, Proc. of ACM SODA, 2010. ,
Ranked bandits in metric spaces: learning optimally diverse rankings over large document collections, Journal of Machine Learning Research, 2013. ,
Regret analysis of stochastic and nonstochastic multi-armed bandit problems, Foundations and Trends in Machine Learning, vol.5, pp.1-122, 2012. ,
The continuum-armed bandit problem, SIAM J. Control and Optimization, vol.33, issue.6, pp.1926-1951, 1995. ,
Multi-armed bandits in metric spaces, Proc. of STOC, 2008. ,
Online optimization in x-armed bandits, Proc. of NIPS, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00329797
Lipschitz bandits: Regret lower bound and optimal algorithms, Proc. of COLT, 2014. ,
Stochastic linear optimization under bandit feedback, Proc. of COLT, 2008. ,
Online convex optimization in the bandit setting: gradient descent without a gradient, Proc. of ACM SODA, 2005. ,
Clustered bandits, 2012. ,
Asymptotically efficient adaptive allocation rules, Advances in Applied Mathematics, vol.6, issue.1, pp.4-6, 1985. ,
Asymptotically efficient adaptive choice of control laws in controlled markov chains, SIAM Journal on Control and Optimization, vol.35, issue.3, pp.715-743, 1997. ,
The KL-UCB algorithm for bounded stochastic bandits and beyond, Proc. of COLT, 2011. ,
Unimodal bandits: Regret lower bounds and optimal algorithms, Proc. of ICML, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01092662