upper-confidence-bounds
Here are 32 public repositories matching this topic...
All codes, both created and optimized for best results from the SuperDataScience Course
-
Updated
Nov 5, 2017 - Python
Python implementation of UCB, EXP3 and Epsilon greedy algorithms
-
Updated
Oct 4, 2018 - Python
The easiest way to optimize Facebook Ads using Upper Confidence Bound Algorithm. 💻
-
Updated
Oct 21, 2021 - Python
implement basic and contextual MAB algorithms for recommendation system
-
Updated
Jan 18, 2022 - Jupyter Notebook
Alquerque - a 2 player abstract strategic perfect information traditional board game with computer AI option.
-
Updated
Mar 30, 2018 - JavaScript
The example of using reinforcement learning algorithms in the business, specifically finding what ads to use in our campaign.
-
Updated
Jul 25, 2017 - Jupyter Notebook
Implementation of greedy, E-greedy and Upper Confidence Bound (UCB) algorithm on the Multi-Armed-Bandit problem.
-
Updated
Dec 8, 2022 - Python
A python based ML tool for CRT inspection & optimization
-
Updated
Jan 2, 2018 - Python
UCThello - a board game demonstrator (Othello variant) with computer AI using Monte Carlo Tree Search (MCTS) with UCB (Upper Confidence Bounds) applied to trees (UCT in short)
-
Updated
Jul 10, 2023 - JavaScript
Oware and Ouril - traditional African Mancala games with computer AI using Monte Carlo Tree Search (MCTS) with UCB (Upper Confidence Bounds) applied to trees (UCT in short)
-
Updated
Mar 30, 2018 - HTML
A Comparative Evaluation of Active Learning Methods in Deep Recommendation
-
Updated
Jul 14, 2019 - Jupyter Notebook
A simple implementation of Reinforcement Learning using UCB in python.
-
Updated
Jan 29, 2018 - Python
3 dimensional Four in a Row game with computer AI using Monte Carlo Tree Search (MCTS) with UCB (Upper Confidence Bounds) applied to trees (UCT in short).
-
Updated
Aug 3, 2023 - JavaScript
Code templates for different ML algorithms
-
Updated
Sep 17, 2020 - R
(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" …
-
Updated
Mar 22, 2022 - Jupyter Notebook
An AI agent implemented using Monte Carlo Tree Search (MCTS) using Upper Confidence Bounds (UCT).
-
Updated
Jun 14, 2018 - Python
Implementation of the Upper confidence bounds and Thompson sampling algorithms in R for the multi armed bandit problem
-
Updated
Dec 12, 2019
AI for the game "Connect Four". Available on PyPI.
-
Updated
Mar 14, 2024 - Python
Improve this page
Add a description, image, and links to the upper-confidence-bounds topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the upper-confidence-bounds topic, visit your repo's landing page and select "manage topics."