Pages that link to "Item:Q1762980"
From MaRDI portal
The following pages link to Reinforcement learning with immediate rewards and linear hypotheses (Q1762980):
Displayed 7 items.
- Regret lower bound and optimal algorithm for high-dimensional contextual linear bandit (Q2074307) (← links)
- New bounds on the price of bandit feedback for mistake-bounded online multiclass learning (Q2290693) (← links)
- Discount Targeting in Online Social Networks Using Backpressure-Based Learning (Q2917229) (← links)
- Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (Q5868941) (← links)
- Multi-armed bandits with censored consumption of resources (Q6097147) (← links)
- Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection (Q6153988) (← links)
- Multi-armed linear bandits with latent biases (Q6198758) (← links)