Pages that link to "Item:Q2896165"

The following pages link to Regret bounds and minimax policies under partial monitoring (Q2896165):

Displaying 26 items.

• On two continuum armed bandit problems in high dimensions (Q260274) (← links)
• Batched bandit problems (Q282463) (← links)
• The multi-armed bandit problem with covariates (Q355096) (← links)
• Kullback-Leibler upper confidence bounds for optimal sequential allocation (Q366995) (← links)
• Combinatorial bandits (Q439986) (← links)
• The \(K\)-armed dueling bandits problem (Q440003) (← links)
• On Bayesian index policies for sequential resource allocation (Q1750289) (← links)
• Toward a classification of finite partial-monitoring games (Q1939263) (← links)
• Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm (Q2091834) (← links)
• Ballooning multi-armed bandits (Q2238588) (← links)
• Truthful mechanisms with implicit payment computation (Q2796397) (← links)
• Bayesian Incentive-Compatible Bandit Exploration (Q3387959) (← links)
• Technical Note—On the Convexity of Policy Regions in Partially Observed Systems (Q3775355) (← links)
• Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback (Q4596721) (← links)
• Online Learning over a Finite Action Set with Limited Switching (Q4991672) (← links)
• (Q4998901) (← links)
• Optimistic Gittins Indices (Q5060515) (← links)
• Setting Reserve Prices in Second-Price Auctions with Unobserved Bids (Q5060778) (← links)
• Data-Driven Decisions for Problems with an Unspecified Objective Function (Q5137432) (← links)
• Learning Theory (Q5473612) (← links)
• Small-Loss Bounds for Online Learning with Partial Information (Q5868953) (← links)
• Unifying mirror descent and dual averaging (Q6038659) (← links)
• Regret-Optimal Estimation and Control (Q6056064) (← links)
• Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization (Q6183761) (← links)
• A confirmation of a conjecture on Feldman’s two-armed bandit problem (Q6198964) (← links)
• Finding the optimal exploration-exploitation trade-off online through Bayesian risk estimation and minimization (Q6566614) (← links)