Pages that link to "Item:Q2074307"
From MaRDI portal
The following pages link to Regret lower bound and optimal algorithm for high-dimensional contextual linear bandit (Q2074307):
Displaying 6 items.
- Improved regret for zeroth-order adversarial bandit convex optimisation (Q2035748) (← links)
- Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems (Q4974598) (← links)
- Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering (Q5001785) (← links)
- Bounded Regret for Finitely Parameterized Multi-Armed Bandits (Q5050096) (← links)
- Regret bounds for Narendra-Shapiro bandit algorithms (Q5086451) (← links)
- Interior-Point Methods for Full-Information and Bandit Online Learning (Q5271795) (← links)