Pages that link to "Item:Q5817009"

The following pages link to Some aspects of the sequential design of experiments (Q5817009):

Displaying 50 items.

• Doubly robust policy evaluation and optimization (Q252797) (← links)
• Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges (Q254442) (← links)
• One-armed bandit problem for parallel data processing systems (Q259910) (← links)
• Batched bandit problems (Q282463) (← links)
• Response-adaptive designs for clinical trials: simultaneous learning from multiple patients (Q320737) (← links)
• The multi-armed bandit problem with covariates (Q355096) (← links)
• Kullback-Leibler upper confidence bounds for optimal sequential allocation (Q366995) (← links)
• Robustness of stochastic bandit policies (Q391739) (← links)
• Algorithm portfolio selection as a bandit problem with unbounded losses (Q408989) (← links)
• An asymptotically optimal policy for finite support models in the multiarmed bandit problem (Q415624) (← links)
• The \(K\)-armed dueling bandits problem (Q440003) (← links)
• Learning the Krepsian state: exploration through consumption (Q516973) (← links)
• MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
• Optimal experimental design for a class of bandit problems (Q618180) (← links)
• One optional observation inflates \(\alpha\) by \({100/\sqrt{n}}\) per cent (Q622556) (← links)
• Optimal Bayesian strategies for the infinite-armed Bernoulli bandit (Q643377) (← links)
• A dynamic programming strategy to balance exploration and exploitation in the bandit problem (Q647433) (← links)
• Finding minimax strategy and minimax risk in a random environment (the two-armed bandit problem) (Q664264) (← links)
• A general latent assignment approach for modeling psychological contaminants (Q708243) (← links)
• Boundary crossing probabilities for general exponential families (Q722599) (← links)
• Implementing optimal allocation in clinical trials with multiple endpoints (Q729721) (← links)
• Playing with data -- or how to discourage questionable research practices and stimulate researchers to do things right (Q736416) (← links)
• Functional equations in the theory of dynamic programming. III (Q769691) (← links)
• Sequentielle Versuchs-Pläne (Q774581) (← 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)
• Woodroofe's one-armed bandit problem revisited (Q835072) (← links)
• A new family of covariate-adjusted response adaptive designs and their properties (Q846774) (← links)
• Learning dynamic algorithm portfolios (Q870809) (← links)
• Combining multiple strategies for multiarmed bandit problems and asymptotic optimality (Q892592) (← links)
• Bandit-based Monte-Carlo structure learning of probabilistic logic programs (Q894703) (← links)
• A perpetual search for talents across overlapping generations: a learning process (Q898767) (← links)
• Truthful learning mechanisms for multi-slot sponsored search auctions with externalities (Q899160) (← links)
• Convergence in human decision-making dynamics (Q962172) (← links)
• Sequential monitoring of response-adaptive randomized clinical trials (Q988004) (← links)
• Exploration-exploitation tradeoff using variance estimates in multi-armed bandits (Q1017665) (← links)
• A Bayesian analysis of human decision-making on bandit problems (Q1042313) (← links)
• The N-armed bandit with unimodal structure (Q1054428) (← links)
• Asymptotically efficient adaptive allocation rules (Q1060517) (← links)
• Machine learning for optimal blackjack counting strategies (Q1205466) (← links)
• The apparent conflict between estimation and control - a survey of the two-armed bandit problem (Q1226072) (← links)
• Certainty equivalence control with forcing: Revisited (Q1264127) (← links)
• Small-sample performance of Bernoulli two-armed bandit Bayesian strategies (Q1298932) (← links)
• The time until the final zero crossing of random sums with application to nonparametric bandit theory (Q1335239) (← links)
• Herbert Robbins and sequential analysis (Q1429307) (← links)
• A common value experimentation with multiarmed bandits (Q1720971) (← links)
• Randomized prediction of individual sequences (Q1733293) (← links)
• A hybrid breakout local search and reinforcement learning approach to the vertex separator problem (Q1753627) (← links)
• A note on infinite-armed Bernoulli bandit problems with generalized beta prior distributions (Q1767307) (← links)