Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with multi-armed-bandits
Search options questions only
not deleted
user 12656
For questions related to the multi-armed bandit (MAB) problem, in which a fixed limited set of resources must be allocated between competing (alternative) choices in a way that maximizes their expected gain, when each choice's properties are only partially known at the time of allocation.
2
votes
1
answer
89
views
Programming a bandit to optimize donations
I'm developing a multi-armed bandit which learns the best information to display to persuade someone to donate to charity.
Suppose I have treatments A, B, C, D (which are each one paragraph of text). …
- 153
1
vote
1
answer
574
views
Why is it useful in some applications to use features that are shared by all arms?
In Li et al. (2010)'s highly cited paper, they talk about LinUCB with hybrid linear models in Section 3.2.
They motivate this by saying
In many applications including ours, it is helpful to use featu …
- 153
1
vote
1
answer
354
views
How can I incorporate domain knowledge to choose actions in the case of large action spaces ...
Suppose one is using a multi-armed bandit, and one has relatively few "pulls" (i.e. timesteps) relative to the action set. For example, maybe there are 200 timesteps and 100 possible actions.
However, …
- 153