-
Updated
Jan 21, 2022 - Python
multi-armed-bandit
Here are 116 public repositories matching this topic...
Implementing Deep Reinforcement Learning Algorithms
-
Updated
Nov 15, 2020 - Jupyter Notebook
The repository contains codes for RL (e.g., Q-Learning, Monte Carlo, …) in the form of Python files.
-
Updated
Sep 12, 2023 - Jupyter Notebook
Reinforcement learning
-
Updated
Jan 9, 2023 - Jupyter Notebook
Repository tugas akhir tentang Multi-Armed Bandit
-
Updated
May 9, 2024 - Jupyter Notebook
-
Updated
Nov 12, 2019 - Python
This repository contains an End to End Real time 🕰️ Machine Learning Pipeline to predict star ⭐️ rating of product reviews. This project uses AWS Sagemaker, Kinesis, Lambda, S3, Redshift, Athena, and Step functions. Deployment of multiple models for AB testing and Bandit testing is also included.
-
Updated
Nov 24, 2023 - Jupyter Notebook
The Multi-armed bandit problem is one of the classical reinforcements learning problems that describe the friction between the agent's exploration and exploitation.
-
Updated
Sep 22, 2020 - Python
Compared Non-stationary Multi-armed Bandits in Single-Agent to Multi-Agents Scenarios- Distributed Optimization and Learning(DOL) Course Project
-
Updated
Sep 14, 2022 - Jupyter Notebook
A Novel Multi-Arm Bandit Optimization Implementation using reinforcement learning in Python for selecting Notifications.
-
Updated
Apr 26, 2024 - Python
My silver medal winning entry in Kaggle's 2020 Christmas Competition
-
Updated
Feb 23, 2021 - Jupyter Notebook
This is a project to build a multi armed bandit from scratch based on the Kaggle Christmas 2020 Competition.
-
Updated
Aug 7, 2023 - Jupyter Notebook
Reinforcement learning techniques applied to solve pricing problems in e-commerce applications. Final project for "Online learning applications" course (2021-2022)
-
Updated
Oct 30, 2022 - Jupyter Notebook
🦾🤖 Visual and interactive simulator of multi-armed bandit problem.
-
Updated
May 7, 2024 - JavaScript
In probability theory, the multi-armed bandit problem is a problem in which a fixed limited set of resources must be allocated between competing (alternative) choices in a way that maximizes their expected gain, when each choice's properties are only partially known at the time of allocation, and may become better understood as time passes or by…
-
Updated
Jun 1, 2018 - Jupyter Notebook
Prof. Jungmin So - spring '23
-
Updated
Dec 13, 2023 - Python
Experiments for paper "Bayesian Linear Bandits for Large-Scale Recommender Systems"
-
Updated
Apr 18, 2024 - Jupyter Notebook
A simple multi-armed bandit for Go.
-
Updated
Apr 7, 2020 - Go
Modeling a 1-armed bandit with pystan.
-
Updated
Sep 9, 2020 - Jupyter Notebook
Improve this page
Add a description, image, and links to the multi-armed-bandit topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the multi-armed-bandit topic, visit your repo's landing page and select "manage topics."