REINFORCEMENT LEARNING : Which contains information about the ads they clicked at each visit (amongst 10 ads). Our Task is to find the most viewed ad i.e ad having the highest distribution of the viewers in Minimum number of Rounds and Resources. Here I have used "Upper Confidence Bound" and "Thompson Sampling" models.
-
Notifications
You must be signed in to change notification settings - Fork 1
(REINFORCEMENT LEARNING) : We are given a dataset that contains information about the ads clicked by the visitors at each visit to a webpage (amongst 10 different ads). Our Task is to find the most viewed ad i.e ad having the highest distribution of the viewers in Minimum number of Rounds and Resources. Here I have used "Upper Confidence Bound" …
naman-dhammi/Ads_Optimisation
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
(REINFORCEMENT LEARNING) : We are given a dataset that contains information about the ads clicked by the visitors at each visit to a webpage (amongst 10 different ads). Our Task is to find the most viewed ad i.e ad having the highest distribution of the viewers in Minimum number of Rounds and Resources. Here I have used "Upper Confidence Bound" …
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published