Exponentiated Gradient LINUCB for Contextual Multi-Armed Bandits

Reading time: 1 minute
...

📝 Original Info

  • Title: Exponentiated Gradient LINUCB for Contextual Multi-Armed Bandits
  • ArXiv ID: 1305.2415
  • Date: 2013-05-14
  • Authors: Researchers from original ArXiv paper

📝 Abstract

We present Exponentiated Gradient LINUCB, an algorithm for con-textual multi-armed bandits. This algorithm uses Exponentiated Gradient to find the optimal exploration of the LINUCB. Within a deliberately designed offline simulation framework we conduct evaluations with real online event log data. The experimental results demonstrate that our algorithm outperforms surveyed algorithms.

💡 Deep Analysis

Deep Dive into Exponentiated Gradient LINUCB for Contextual Multi-Armed Bandits.

We present Exponentiated Gradient LINUCB, an algorithm for con-textual multi-armed bandits. This algorithm uses Exponentiated Gradient to find the optimal exploration of the LINUCB. Within a deliberately designed offline simulation framework we conduct evaluations with real online event log data. The experimental results demonstrate that our algorithm outperforms surveyed algorithms.

📄 Full Content

We present Exponentiated Gradient LINUCB, an algorithm for con-textual multi-armed bandits. This algorithm uses Exponentiated Gradient to find the optimal exploration of the LINUCB. Within a deliberately designed offline simulation framework we conduct evaluations with real online event log data. The experimental results demonstrate that our algorithm outperforms surveyed algorithms.

Reference

This content is AI-processed based on ArXiv data.

Start searching

Enter keywords to search articles

↑↓
ESC
⌘K Shortcut