Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"stochastic bandit"”.

  1. Particle Thompson sampling

    … is an effective Bayesian heuristic for solving stochastic bandit problems. But it is hard to implement in practice due to the intractability of maintaining a continuous posterior distribution. Particle Thompson sampling (PTS) is an approximation of Thompson sampling based on the simple idea of …

    uiuc Repository record for Particle Thompson sampling (opens in a new tab)

  2. Robust sequential decision-making on networks

    … algorithms for two specific settings of the stochastic multi-armed bandit problem. The first setting considers the problem where rewards are drawn from a family of extremely heavy-tailed distributions known as a-stable distributions. For this setting, I extended an existing upper confidence …

    mit Repository record for Robust sequential decision-making on networks (opens in a new tab)

  3. A NEW ZEROTH-ORDER ORACLE FOR DISTRIBUTED AND NON-STATIONARY LEARNING

    … function has Lipschitz gradient. Then, for stochastic bandit optimization problems, we show that ZO with one-point residual feedback achieves the same convergence rate as that of two-point scheme with uncontrollable data samples.</p><p>Next, we apply the proposed one-point residual-feedback …

    duke Repository record for A NEW ZEROTH-ORDER ORACLE FOR DISTRIBUTED AND NON-STATIONARY LEARNING (opens in a new tab)