Pages that link to "Item:Q1060517"
From MaRDI portal
The following pages link to Asymptotically efficient adaptive allocation rules (Q1060517):
Displaying 50 items.
- Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges (Q254442) (← links)
- Algorithm portfolios for noisy optimization (Q276539) (← links)
- Batched bandit problems (Q282463) (← links)
- Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search (Q307787) (← links)
- Infomax strategies for an optimal balance between exploration and exploitation (Q310029) (← links)
- Response-adaptive designs for clinical trials: simultaneous learning from multiple patients (Q320737) (← links)
- Control problems in online advertising and benefits of randomized bidding strategies (Q328167) (← links)
- The multi-armed bandit problem with covariates (Q355096) (← links)
- Kullback-Leibler upper confidence bounds for optimal sequential allocation (Q366995) (← links)
- Exploration and exploitation of scratch games (Q374139) (← links)
- Two-armed bandit problem for parallel data processing systems (Q376114) (← links)
- Adaptive aggregation for reinforcement learning in average reward Markov decision processes (Q378753) (← links)
- Robustness of stochastic bandit policies (Q391739) (← links)
- General time consistent discounting (Q391749) (← links)
- An asymptotically optimal policy for finite support models in the multiarmed bandit problem (Q415624) (← links)
- The \(K\)-armed dueling bandits problem (Q440003) (← links)
- Regret bounds for restless Markov bandits (Q465253) (← links)
- Near-optimal PAC bounds for discounted MDPs (Q465258) (← links)
- Adaptive sensing performance lower bounds for sparse signal detection and support estimation (Q470072) (← links)
- MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
- Analyzing bandit-based adaptive operator selection mechanisms (Q647443) (← links)
- Modeling item-item similarities for personalized recommendations on Yahoo! front page (Q652346) (← links)
- UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem (Q653803) (← links)
- Boundary crossing probabilities for general exponential families (Q722599) (← links)
- An asymptotically optimal strategy for constrained multi-armed bandit problems (Q784789) (← links)
- Nonparametric bandit methods (Q806690) (← links)
- A non-parametric solution to the multi-armed bandit problem with covariates (Q826996) (← links)
- Optimal control with learning on the fly: a toy problem (Q832436) (← links)
- Woodroofe's one-armed bandit problem revisited (Q835072) (← links)
- A perpetual search for talents across overlapping generations: a learning process (Q898767) (← links)
- Online regret bounds for Markov decision processes with deterministic transitions (Q982638) (← links)
- Active learning in heteroscedastic noise (Q982644) (← links)
- Response adaptive designs that incorporate switching costs and constraints (Q997275) (← links)
- Exploration-exploitation tradeoff using variance estimates in multi-armed bandits (Q1017665) (← links)
- Certainty equivalence control with forcing: Revisited (Q1264127) (← links)
- Optimal allocation of simulation experiments in discrete stochastic optimization and approximative algorithms (Q1278957) (← links)
- The time until the final zero crossing of random sums with application to nonparametric bandit theory (Q1335239) (← links)
- Optimal learning and experimentation in bandit problems. (Q1614793) (← links)
- Improving multi-armed bandit algorithms in online pricing settings (Q1644914) (← links)
- Bayesian policy reuse (Q1689554) (← links)
- A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing (Q1690964) (← links)
- An optimal bidimensional multi-armed bandit auction for multi-unit procurement (Q1714944) (← links)
- A unified framework for stochastic optimization (Q1719609) (← links)
- Randomized prediction of individual sequences (Q1733293) (← links)
- On Bayesian index policies for sequential resource allocation (Q1750289) (← links)
- Asymptotically efficient strategies for a stochastic scheduling problem with order constraints. (Q1848847) (← links)
- Randomized allocation with nonparametric estimation for a multi-armed bandit problem with covariates (Q1848931) (← links)
- Regret bounds for sleeping experts and bandits (Q1959599) (← links)
- Clustering in block Markov chains (Q1996780) (← links)
- Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards (Q2006767) (← links)
