A novel parallel UCT algorithm with linear speedup and negligible performance loss.
-
Updated
Apr 26, 2021 - Python
A novel parallel UCT algorithm with linear speedup and negligible performance loss.
A Bayesian global optimization package for material design | Adaptive Learning | Active Learning
In This repository I made some simple to complex methods in machine learning. Here I try to build template style code.
Offline evaluation of multi-armed bandit algorithms
Optimizing the best Ads using Reinforcement learning Algorithms such as Thompson Sampling and Upper Confidence Bound.
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)
Using SciKit Learn few Deep Learning Rules and Algorithms are implemented
Repository of Online Learning algorithms, including Bandits, UCB, and more.
This repo contains code templates of all the machine learning algorithms that are used, like Regression, Classification, Clustering, etc.
Code for the paper "Truncated LinUCB for Stochastic Linear Bandits"
该仓库包含基于 PyWebIO 的 UCB(上置信界)算法 在线演示,UCB 算法常用于多臂老虎机问题,以优化决策并最大化累积奖励。演示包括自动 UCB 算法模拟和交互式手动策略对比。
Reinforcement learning used in the game of pong
Predicting the best Ad from the given Ads.
LoRa@FIIT algorithms comparison using jupyter notebooks
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.
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."