Some aspects of the sequential design of experiments

Cites work

A Stochastic Approximation Method
scientific article; zbMATH DE number 3045589 (Why is no real title available?)
scientific article; zbMATH DE number 3061365 (Why is no real title available?)
scientific article; zbMATH DE number 3086542 (Why is no real title available?)
Single Sampling and Double Sampling Inspection Tables

Cited in

(only showing first 100 items - show all)

Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
A Bayesian analysis of human decision-making on bandit problems
The N-armed bandit with unimodal structure
Asymptotically efficient adaptive allocation rules
Machine learning for optimal blackjack counting strategies
The apparent conflict between estimation and control - a survey of the two-armed bandit problem
Certainty equivalence control with forcing: Revisited
Small-sample performance of Bernoulli two-armed bandit Bayesian strategies
The time until the final zero crossing of random sums with application to nonparametric bandit theory
Herbert Robbins and sequential analysis
A common value experimentation with multiarmed bandits
Randomized prediction of individual sequences
A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
A note on infinite-armed Bernoulli bandit problems with generalized beta prior distributions
Asymptotically efficient strategies for a stochastic scheduling problem with order constraints.
Randomized allocation with nonparametric estimation for a multi-armed bandit problem with covariates
An adaptive allocation for continuous response using Wilcoxon-Mann-Whitney score
Asymptotic properties of doubly adaptive biased coin designs for multitreatment clinical trials.
Regret bounds for sleeping experts and bandits
Generative adversarial networks are special cases of artificial curiosity (1990) and also closely related to predictability minimization (1991)
Multiclass classification, information, divergence and surrogate risk
Exploration and correlation
Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards
Efficient crowdsourcing of unknown experts using bounded multi-armed bandits
An online algorithm for the risk-aware restless bandit
Stochastic approximation: from statistical origin to big-data, multidisciplinary applications
Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma
Multi-armed bandit with sub-exponential rewards
Gittins' theorem under uncertainty
Two-armed bandit problem and batch version of the mirror descent algorithm
Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm
Matrices -- compensating the loss of anschauung
Online machine learning algorithms to optimize performances of complex wireless communication systems
Bandit and covariate processes, with finite or non-denumerable set of arms
Lipschitzness is all you need to tame off-policy generative adversarial imitation learning
Limits for partial maxima of Gaussian random vectors
Gaussian two-armed bandit and optimization of batch data processing
Concentration bounds for empirical conditional value-at-risk: the unbounded case
A bad arm existence checking problem: how to utilize asymmetric problem structure?
Asymptotically optimal algorithms for budgeted multiple play bandits
Some problems of optimal sampling strategy
On learning and branching: a survey
Pure exploration in finitely-armed and continuous-armed bandits
Strategic learning in teams
Optimal strategies for a class of sequential control problems with precedence relations
Optimal adaptive generalized Pólya urn design for multi-arm clinical trials
Arbitrary side observations in bandit problems
Asymptotic theorems of sequential estimation-adjusted urn models
Psychometric engineering as art
Mechanisms with learning for stochastic multi-armed bandit problems
Doubly robust policy evaluation and optimization
Comparison of two Bernoulli processes by multiple stage sampling using Bayesian decision theory
Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges
New classes of stochastic control processes
One-armed bandit problem for parallel data processing systems
Asymptotic properties of covariate-adjusted response-adaptive designs
An index-based deterministic convergent optimal algorithm for constrained multi-armed bandit problems
Controlling unknown linear dynamics with bounded multiplicative regret
BIAS CALCULATIONS FOR ADAPTIVE URN DESIGNS
Batched bandit problems
D-Wave and predecessors: from simulated to quantum annealing
Signaling games. Dynamics of evolution and learning
RANDOMIZED URN MODELS AND SEQUENTIAL DESIGN
Two-Armed Bandit Strategies that Discount Past and Future
Response-adaptive designs for clinical trials: simultaneous learning from multiple patients
SWITCHING MECHANISMS IN A GENERALIZED INFORMATION SYSTEM
Active online learning in the binary perceptron problem
The role of forgetting in the evolution and learning of language
Randomized Play-the-Leader Rules for Sequential Sampling from Two Populations
Incentivizing exploration with heterogeneous value of money
Tuning Bandit Algorithms in Stochastic Environments
Following the Perturbed Leader to Gamble at Multi-armed Bandits
The multi-armed bandit problem with covariates
Adaptive Incentive-Compatible Sponsored Search Auction
Doubly adaptive biased coin designs with delayed responses
Pure exploration in multi-armed bandits problems
Kullback-Leibler upper confidence bounds for optimal sequential allocation
Robustness of stochastic bandit policies
Algorithm portfolio selection as a bandit problem with unbounded losses
An asymptotically optimal policy for finite support models in the multiarmed bandit problem
An introduction to designh optimality with an overview of the literature
Dynamic allocation policies for the finite horizon one armed bandit problem
Sequential design with applications to the trim-loss problem
GROUP SEQUENTIAL TESTS WITH OUTCOME-DEPENDENT TREATMENT ASSIGNMENT
An analytical approximation and a neural network model for optimal sample size in vendor selection
The \(K\)-armed dueling bandits problem
A class of adaptive designs
Normal bandits of unknown means and variances
Beyond the hazard rate: more perturbation algorithms for adversarial multi-armed bandits
Learning the distribution with largest mean: two bandit frameworks
Efficient adaptive randomization and stopping rules in multi-arm clinical trials for testing a new treatment
Sequential Shortest Path Interdiction with Incomplete Information
Multi-player bandits: the adversarial case
On incomplete learning and certainty-equivalence control
Optimal stopping and worker selection in crowdsourcing: an adaptive sequential probability ratio test framework
Nonasymptotic sequential tests for overlapping hypotheses applied to near-optimal arm identification in bandit models
Preference-based online learning with dueling bandits: a survey
On multi-armed bandit designs for dose-finding trials
Tsallis-INF: an optimal algorithm for stochastic and adversarial bandits
Statistical inference for online decision making via stochastic gradient descent

This page was built for publication: Some aspects of the sequential design of experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5817009)