Exploration & Exploitation Challenge 2011
•Download as PPT, PDF•
0 likes•712 views
Presentation of the Exploration & Exploitation Challenge 2011 (http://explo.cs.ucl.ac.uk/), recap of the phase 1 results and announcement of the phase 2 and final results. Talk given on 2 July 2011 at the 'On‐line Trading of Exploration and Exploitation 2' workshop at the International Conference in Machine Learning.
![Exploration & Exploitation Challenge ,[object Object]](https://image.slidesharecdn.com/challenge-110716025955-phpapp02/85/Exploration-Exploitation-Challenge-2011-1-320.jpg)
![Schedule ,[object Object],[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
More Related Content
Similar to Exploration & Exploitation Challenge 2011
Similar to Exploration & Exploitation Challenge 2011 (20)
More from Louis Dorard
More from Louis Dorard (9)
Recently uploaded
Recently uploaded (20)
Exploration & Exploitation Challenge 2011
- 9. Phase 1 #1 Olivier Nicol INRIA, SequeL 2170 #2 Christophe Salperwyck Orange Labs 2072 #3 Aurélien Garivier CNRS / Telecom ParisTech 2047 #4 Olivier Cappé CNRS / Telecom ParisTech 2031 #5 Jérémie Mary INRIA, SequeL 1987 #6 Tanguy Urvoy Orange Labs 1714 #7 Martin Antenreiter MUL 1669 #8 Ronald Ortner MUL 1644
- 10. Phase 1 #1 INRIA, SequeL 2170 #2 Orange Labs 2072 #3 CNRS / Telecom ParisTech 2047 #4 MUL 1669 Random 1177
- 11. Phase 1
- 12. Phase 1
- 13. Phase 2 #1 INRIA, SequeL 11529 #2 Orange Labs 10419 #3 CNRS / Telecom ParisTech 9990 #4 MUL 8049 Random 5598
- 14. Congratulations!
- 15. Phase 2
- 17. Phase 2 Rank Name Affiliation Total time Score Uplift #1 Olivier Nicol INRIA 3h 40m 11529 106% #2 Christophe Salperwyck Orange 29h 50m 10419 86% #3 Tanguy Urvoy Orange 4h 10179 82% #4 Aurélien Garivier CNRS 1h 17m 9990 78% #5 Martin Antenreiter MUL 20h 8049 44% Random 1h 12m 5598 0%
Editor's Notes
- These are my notes
- Questions -> interrupt me
- The challenge is about finding good algorithms to do that. We can’t evaluate algorithms live, but on offline data (in an online fashion).
- Simulated data that has the characteristics of the actual data that can be observed, but which is such that all options have same CTR.
- Batches: - All visitors in a batch are different and have never been seen before. - There can be several clicks or no click in a batch. - All options might not be represented in a batch. Remarks - Need to learn a mapping from (visitor, option) to reward, and need to optimise the cumulated reward: exploration and exploitation trade-off. - Visitor responses might change through time, making it essential to keep learning their interests. - Because the CTRs for each option are the same, it is necessary to use the visitor features if we want to make better predictions than random
- 2 remarks. First, it’s not sure that Christophe’s algorithm is better than Tanguy’s.