Pages that link to "Item:Q5959973"

The following pages link to Finite-time analysis of the multiarmed bandit problem (Q5959973):

Displaying 50 items.

• Finite-Time Analysis for the Knowledge-Gradient Policy (Q4610155) (← links)
• Approximations of the Restless Bandit Problem (Q4633023) (← links)
• (Q4633026) (← links)
• (Q4636970) (← links)
• Multi-Armed Bandit for Species Discovery: A Bayesian Nonparametric Approach (Q4690972) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
• Solving two‐armed Bernoulli bandit problems using a Bayesian learning automaton (Q4932958) (← links)
• On Monte-Carlo tree search for deterministic games with alternate moves and complete information (Q4967797) (← links)
• Learning to Optimize via Information-Directed Sampling (Q4969321) (← links)
• On Incomplete Learning and Certainty-Equivalence Control (Q4971399) (← links)
• Bayesian Exploration for Approximate Dynamic Programming (Q4971589) (← links)
• (Q4986381) (← links)
• Competing bandits: learning under competition (Q4993317) (← links)
• Technical Note—A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents (Q4994155) (← links)
• Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach (Q4994160) (← links)
• Matching While Learning (Q4994180) (← links)
• (Q4998863) (← links)
• (Q4998871) (← links)
• (Q4998881) (← links)
• (Q4998901) (← links)
• (Q4999078) (← links)
• A Bandit-Learning Approach to Multifidelity Approximation (Q5022495) (← links)
• Bayesian adaptive bandit-based designs using the Gittins index for multi-armed trials with normally distributed endpoints (Q5035752) (← links)
• (Q5043718) (← links)
• Bounded Regret for Finitely Parameterized Multi-Armed Bandits (Q5050096) (← links)
• (Q5053314) (← links)
• A State Dependent Approach to Resource Allocation Strategies (Q5053624) (← links)
• Nonasymptotic Analysis of Monte Carlo Tree Search (Q5060499) (← links)
• Smooth Contextual Bandits: Bridging the Parametric and Nondifferentiable Regret Regimes (Q5060501) (← links)
• Optimistic Gittins Indices (Q5060515) (← links)
• Setting Reserve Prices in Second-Price Auctions with Unobserved Bids (Q5060778) (← links)
• EXPLORATION–EXPLOITATION POLICIES WITH ALMOST SURE, ARBITRARILY SLOW GROWING ASYMPTOTIC REGRET (Q5070864) (← links)
• MULTI-ARMED BANDITS WITH COVARIATES:THEORY AND APPLICATIONS (Q5072149) (← links)
• Bandit Theory: Applications to Learning Healthcare Systems and Clinical Trials (Q5072150) (← links)
• (Q5072154) (← links)
• Bayesian Exploration: Incentivizing Exploration in Bayesian Games (Q5080666) (← links)
• Integrated Online Learning and Adaptive Control in Queueing Systems with Uncertain Payoffs (Q5080672) (← links)
• Bayesian Brains and the Rényi Divergence (Q5081134) (← links)
• (Q5089307) (← links)
• Infinite Arms Bandit: Optimality via Confidence Bounds (Q5089465) (← links)
• Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution (Q5095159) (← links)
• Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards (Q5113912) (← links)
• Are Humans Bayesian in the Optimization of Black-Box Functions? (Q5122270) (← links)
• MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (Q5129205) (← links)
• Bandits with Global Convex Constraints and Objective (Q5129206) (← links)
• Online Network Revenue Management Using Thompson Sampling (Q5131540) (← links)
• Tractable Sampling Strategies for Ordinal Optimization (Q5131546) (← links)
• Data-Driven Decisions for Problems with an Unspecified Objective Function (Q5137432) (← links)
• A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model (Q5137960) (← links)
• Dynamic Inventory and Price Controls Involving Unknown Demand on Discrete Nonperishable Items (Q5144768) (← links)