Name
Abstract | ||
|---|---|---|
We consider the online path learning problem in a graph with non-additive gains/losses. Various settings of full information, semi-bandit, and full bandit are explored. We give an efficient implementation of EXP3 algorithm for the full bandit setting with any (non-additive) gain. Then, focusing on the large family of non-additive count-based gains, we construct an intermediate graph which has equivalent gains that are additive. By operating on this intermediate graph, we are able to use algorithms like Component Hedge and ComBand for the first time for non-additive gains. Finally, we apply our methods to the important application of ensemble structured prediction. |
Year | Venue | Field |
|---|---|---|
2018 | algorithmic learning theory | Graph,Mathematical optimization,Structured prediction,Mathematics |
DocType | Volume | Citations |
Journal | abs/1804.06518 | 0 |
PageRank | References | Authors |
0.34 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Corinna Cortes | 1 | 6574 | 1120.50 |
| Vitaly Kuznetsov | 2 | 68 | 9.33 |
| Mehryar Mohri | 3 | 0 | 0.34 |
| Holakou Rahmanian | 4 | 0 | 0.68 |
| Manfred K. Warmuth | 5 | 6105 | 1975.48 |