Регистрация | Вход в службу | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

bsilverthorn bandit_problem [21 articles]

Recent papers added to bsilverthorn library classified by the tag bandit_problem. You can also see everyone's bandit_problem.
  • From External to Internal Regret
    The Journal of Machine Learning Research, Vol. 8 (2007), pp. 1307-1324.
    by Avrim Blum, Yishay Mansour
    posted to bandit_problem internal_regret by bsilverthorn on 2008-03-19 15:56:19 as **
  • notes Using Confidence Bounds for Exploitation-Exploration Trade-offs
    The Journal of Machine Learning Research, Vol. 3 (2003), pp. 397-422.
    by Peter Auer
    posted to adaptive_adversarial bandit_problem confidence_bounds exploitation_exploration by bsilverthorn on 2008-03-19 14:46:09 as read
  • The Nonstochastic Multiarmed Bandit Problem
    SIAM Journal on Computing, Vol. 32, No. 1. (2002), pp. 48-77.
    by Peter Auer, Nicolò C Bianchi, Yoav Freund, Robert E Schapire
    posted to bandit_problem survey worst_case by bsilverthorn on 2008-03-17 16:33:15 as **
  • Using upper confidence bounds for online learning
    Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on (2000), pp. 270-279.
    by Peter Auer
    posted to adversarial bandit_problem confidence_bounds online_learning by bsilverthorn on 2008-03-14 03:11:15 as read
  • Robbing the bandit: less regret in online geometric optimization against an adaptive adversary
    (2006), pp. 937-943.
    by Varsha Dani, Thomas P Hayes
    posted to adversarial bandit_problem online_algorithms by bsilverthorn on 2008-03-14 03:08:26 as read along with 1 person gagliol
  • How to Beat the Adaptive Multi-Armed Bandit
    Arxiv preprint cs.DS/0602053 (2006)
    by Varsha Dani, Thomas P Hayes
    posted to adversarial bandit_problem by bsilverthorn on 2008-03-14 03:02:13 as read
  • On Following the Perturbed Leader in the Bandit Setting
    Algorithmic Learning Theory (2005), pp. 371-385.
    by Jussi Kujala, Tapio Elomaa
    posted to bandit_problem perturbed_leader by bsilverthorn on 2008-03-13 16:09:23 as read
  • Adaptive Treatment Allocation and the Multi-Armed Bandit Problem
    The Annals of Statistics, Vol. 15, No. 3. (1987), pp. 1091-1114.
    by Tze L Lai
    posted to bandit_problem classic treatment_allocation by bsilverthorn on 2008-03-12 17:34:13 as read
  • Finite-time Analysis of the Multiarmed Bandit Problem
    Machine Learning, Vol. 47, No. 2. (1 May 2002), pp. 235-256.
    by Peter Auer, Nicolò Cesa-Bianchi, Paul Fischer
    posted to bandit_problem finite_time by bsilverthorn on 2008-03-12 17:30:52 as *
  • An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem
    (2006)
    by Matthew J Streeter, Stephen F Smith
    posted to bandit_problem extreme_values max_bandit by bsilverthorn on 2008-03-12 16:13:36 as read
  • A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
    Principles and Practice of Constraint Programming - CP 2006 (2006), pp. 560-574.
    by Matthew J Streeter, Stephen F Smith
    posted to bandit_problem max_bandit by bsilverthorn on 2008-03-12 15:58:37 as read
  • The Max K-Armed Bandit: A New Model for Exploration Applied to Search Heuristic Selection
    (2005)
    by Vincent Cicirello, Stephen Smith
    posted to algorithm_portfolios bandit_problem extreme_values heuristic_search max_bandit by bsilverthorn on 2008-03-12 15:53:02 as read
  • Multi-Armed Bandits in Metric Spaces
    (May 2008)
    by Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
    posted to bandit_problem online_algorithms by bsilverthorn on 2008-03-11 23:14:20 as **
  • Adaptive Routing with End-to-End Feedback: Distributed Learning and Geometric Approaches
    (2004), pp. 45-53.
    by Baruch Awerbuch, Robert D Kleinberg
    posted to adaptive_routing bandit_problem linear_optimization online_algorithms partial_information perturbed_leader by bsilverthorn on 2008-03-11 23:09:41 as read
  • Following the Perturbed Leader to Gamble at Multi-armed Bandits
    Algorithmic Learning Theory (2007), pp. 166-180.
    by Jussi Kujala, Tapio Elomaa
    posted to adversarial bandit_problem partial_information perturbed_leader by bsilverthorn on 2008-03-11 21:31:26 as read
  • Gambling in a rigged casino: the adversarial multi-armed bandit problem
    (1995), pp. 322-331.
    by Peter Auer, Nicolò C Bianchi, Yoav Freund, Robert E Schapire
    posted to adversarial bandit_problem partial_information by bsilverthorn on 2008-03-08 21:57:06 as read
  • Master Algorithms for Active Experts Problems based on Increasing Loss Values
    Arxiv preprint cs.LG/0502067 (2005)
    by Jan Poland, Marcus Hutter
    posted to active_experts bandit_problem best_expert by bsilverthorn on 2008-03-08 21:27:17 as **
  • Learning Restart Strategies
    Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07) (2007), pp. 792-797.
    by Matteo Gagliolo, Jurgen Schmidhuber
    posted to algorithm_selection bandit_problem restart_strategies by bsilverthorn on 2008-01-30 16:35:25 as read
  • Online Selection, Adaptation, and Hybridization of Algorithms
    (November 2006)
    by Matthew J Streeter
    posted to algorithm_portfolios algorithm_selection bandit_problem hybrid_algorithms by bsilverthorn on 2008-01-21 20:43:00 as **
  • Bandit Algorithms for Tree Search
    (13 Mar 2007)
    by Pierre-Arnaud Coquelin, Rémi Munos
    posted to bandit_problem tree_search by bsilverthorn on 2007-11-13 20:34:03 as *** along with 1 person sato-ryu
  • Bandit based Monte-Carlo Planning
    European Conference on Machine Learning (2006), pp. 282-293.
    by Levente Kocsis, Csaba Szepesvari
    posted to bandit_problem monte_carlo planning tree_search uct by bsilverthorn on 2007-11-13 20:32:01 as read
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/bsilverthorn/tag/bandit_problem

    RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.