Predicting the best Ad from the given Ads.
-
Updated
May 26, 2022 - Jupyter Notebook
Predicting the best Ad from the given Ads.
Reinforcement learning
Checking CTR(Click Thorugh Rate) of an ad using Thompson Sampling (Reinforcement Lrearning)
A collection of games accompanied by a generalised Monte Carlo Tree Search Artificial Intelligence in combination with Upper Confidence Bounds.
We compare different policies for the checkers game using reinforcement learning algorithms.
Using SciKit Learn few Deep Learning Rules and Algorithms are implemented
This repo contains code templates of all the machine learning algorithms that are used, like Regression, Classification, Clustering, etc.
LoRa@FIIT algorithms comparison using jupyter notebooks
Web visualisation of the k-armed bandit problem
Reinforcement learning used in the game of pong
We implemented a Monte Carlo Tree Search (MCTS) from scratch and we successfully applied it to Tic-Tac-Toe game.
Code for the paper "Truncated LinUCB for Stochastic Linear Bandits"
Offline evaluation of multi-armed bandit algorithms
Optimizing the best Ads using Reinforcement learning Algorithms such as Thompson Sampling and Upper Confidence Bound.
In This repository I made some simple to complex methods in machine learning. Here I try to build template style code.
A Bayesian global optimization package for material design | Adaptive Learning | Active Learning
A novel parallel UCT algorithm with linear speedup and negligible performance loss.
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."