Pages that link to "Item:Q5959973"
From MaRDI portal
The following pages link to Finite-time analysis of the multiarmed bandit problem (Q5959973):
Displaying 50 items.
- Adaptive Matching for Expert Systems with Uncertain Task Types (Q5144772) (← links)
- Nonstationary Bandits with Habituation and Recovery Dynamics (Q5144777) (← links)
- Optimal Online Learning for Nonlinear Belief Models Using Discrete Priors (Q5144779) (← links)
- Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
- Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds (Q5144789) (← links)
- Algorithms for recursive delegation (Q5145458) (← links)
- An Approximation Approach for Response-Adaptive Clinical Trial Design (Q5148171) (← links)
- (Q5149240) (← links)
- Quality-Diversity Optimization: A Novel Branch of Stochastic Optimization (Q5153499) (← links)
- (Q5159459) (← links)
- A linear response bandit problem (Q5168867) (← links)
- Explore First, Exploit Next: The True Shape of Regret in Bandit Problems (Q5219722) (← links)
- Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity (Q5219731) (← links)
- Learning‐based iterative modular adaptive control for nonlinear systems (Q5222720) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution (Q5244873) (← links)
- Learning to Optimize via Posterior Sampling (Q5247618) (← links)
- Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science (Q5254790) (← links)
- Adaptive Policies for Sequential Sampling under Incomplete Information and a Cost Constraint (Q5261007) (← links)
- Sequential Design for Ranking Response Surfaces (Q5269860) (← links)
- ASYMPTOTICALLY OPTIMAL MULTI-ARMED BANDIT POLICIES UNDER A COST CONSTRAINT (Q5358116) (← links)
- Bandit-Based Task Assignment for Heterogeneous Crowdsourcing (Q5380349) (← links)
- Per-Round Knapsack-Constrained Linear Submodular Bandits (Q5380603) (← links)
- Convergence rate of a simulated annealing algorithm with noisy observations (Q5381109) (← links)
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (Q5396763) (← links)
- Structural Statistical Software Testing with Active Learning in a Graph (Q5452080) (← links)
- Uncertainty in learning, choice, and visual fixation (Q5854809) (← links)
- Robust sequential design for piecewise-stationary multi-armed bandit problem in the presence of outliers (Q5880072) (← links)
- Functional Sequential Treatment Allocation (Q5881136) (← links)
- Distributed Bayesian: A Continuous Distributed Constraint Optimization Problem Solver (Q5881805) (← links)
- Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits (Q5890034) (← links)
- Randomized allocation with arm elimination in a bandit problem with covariates (Q5965323) (← links)
- Daisee: Adaptive importance sampling by balancing exploration and exploitation (Q6049796) (← links)
- Multi-armed bandits with censored consumption of resources (Q6097147) (← links)
- Dealing with expert bias in collective decision-making (Q6103665) (← links)
- Spatial state-action features for general games (Q6108764) (← links)
- Convergence rate analysis for optimal computing budget allocation algorithms (Q6110297) (← links)
- On the use of Wasserstein distance in the distributional analysis of human decision making under uncertainty (Q6113067) (← links)
- A tractable online learning algorithm for the multinomial logit contextual bandit (Q6113379) (← links)
- Adaptive operator selection with reinforcement learning (Q6139514) (← links)
- Transfer learning of recurrent neural network‐based plasticity models (Q6148497) (← links)
- AI-driven liquidity provision in OTC financial markets (Q6158383) (← links)
- Temporal logic explanations for dynamic decision systems using anchors and Monte Carlo tree search (Q6161477) (← links)
- Empirical Gittins index strategies with \(\varepsilon\)-explorations for multi-armed bandit problems (Q6167036) (← links)
- A combinatorial multi-armed bandit approach to correlation clustering (Q6170402) (← links)
- Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization (Q6183761) (← links)
- Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers (Q6188509) (← links)
- Adaptive multimeme algorithm for flexible job shop scheduling problem (Q6191213) (← links)
- Simulation-based search (Q6198646) (← links)
- Multi-armed linear bandits with latent biases (Q6198758) (← links)
