A collection of games accompanied by a generalised Monte Carlo Tree Search Artificial Intelligence in combination with Upper Confidence Bounds.
-
Updated
Feb 11, 2019 - Python
A collection of games accompanied by a generalised Monte Carlo Tree Search Artificial Intelligence in combination with Upper Confidence Bounds.
Optimizing the best Ads using Reinforcement learning Algorithms such as Thompson Sampling and Upper Confidence Bound.
Reinforcement learning
We implemented a Monte Carlo Tree Search (MCTS) from scratch and we successfully applied it to Tic-Tac-Toe game.
Checking CTR(Click Thorugh Rate) of an ad using Thompson Sampling (Reinforcement Lrearning)
We compare different policies for the checkers game using reinforcement learning algorithms.
Offline evaluation of multi-armed bandit algorithms
Web visualisation of the k-armed bandit problem
A novel parallel UCT algorithm with linear speedup and negligible performance loss.
In This repository I made some simple to complex methods in machine learning. Here I try to build template style code.
This repo contains code templates of all the machine learning algorithms that are used, like Regression, Classification, Clustering, etc.
Predicting the best Ad from the given Ads.
Code for the paper "Truncated LinUCB for Stochastic Linear Bandits"
Using SciKit Learn few Deep Learning Rules and Algorithms are implemented
LoRa@FIIT algorithms comparison using jupyter notebooks
Reinforcement learning used in the game of pong
A Bayesian global optimization package for material design | Adaptive Learning | Active Learning
Add a description, image, and links to the upper-confidence-bound topic page so that developers can more easily learn about it.
To associate your repository with the upper-confidence-bound topic, visit your repo's landing page and select "manage topics."