新規登録 | ログイン | FAQ      [?] 

タグ: bandit_problem [14 articles]

Recent papers classified by the tag bandit_problem.
  • 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
  • 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
  • Experience-efficient learning in associative bandit problems
    (2006), pp. 889-896.
    by Alexander L Strehl, Chris Mesterharm, Michael L Littman, Haym Hirsh
    posted to learning_theory bandit_problem associative_bandits by bsilverthorn on 2008-10-01 17:11:09 as **
  • 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 *
  • 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
  • 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
  • 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
  • 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
  • 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
  • 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
  • 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 **
  • Extensions of the multiarmed bandit problem: The discounted case
    IEEE Transactions on Automatic Control, Vol. 30, No. 5. (1985), pp. 426-439.
    by Pravin P Varaiya, Jean C Walrand, Cagatay Buyukkoc
    posted to markov_chains bandit_problem by bsilverthorn on 2008-10-15 20:45:59 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
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/tag/bandit_problem

    RIS BibTeX
    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.