gdmarmerola / advanced-bandit-problemsLinks
More about the exploration-exploitation tradeoff with harder bandits
☆24Updated 6 years ago
Alternatives and similar repositories for advanced-bandit-problems
Users that are interested in advanced-bandit-problems are comparing it to the libraries listed below
Sorting:
- Big Data's open seminars: An Interactive Introduction to Reinforcement Learning☆64Updated 4 years ago
- (ICML2020) “Counterfactual Cross-Validation: Stable Model Selection Procedure for Causal Inference Models’’☆31Updated 2 years ago
- Bandit algorithms simulations for online learning☆88Updated 5 years ago
- A lightweight contextual bandit & reinforcement learning library designed to be used in production Python services.☆66Updated 4 years ago
- Multi-Armed Bandit algorithms applied to the MovieLens 20M dataset☆56Updated 4 years ago
- Thompson Sampling Tutorial☆53Updated 6 years ago
- In this notebook several classes of multi-armed bandits are implemented. This includes epsilon greedy, UCB, Linear UCB (Contextual bandit…☆86Updated 4 years ago
- Study NeuralUCB and regret analysis for contextual bandit with neural decision☆95Updated 3 years ago
- Semi-synthetic experiments to test several approaches for off-policy evaluation and optimization of slate recommenders.☆43Updated 7 years ago
- Contextual bandit in python☆114Updated 4 years ago
- Multi-Armed Bandit Algorithms Library (MAB)☆133Updated 2 years ago
- Code associated with the NeurIPS19 paper "Weighted Linear Bandits in Non-Stationary Environments"☆17Updated 5 years ago
- ☆30Updated 5 years ago
- Non-stationary Off-policy Evaluation☆13Updated 6 years ago
- Online Ranking with Multi-Armed-Bandits☆18Updated 3 years ago
- Contextual Bandit Algorithms (+Bandit Algorithms)☆22Updated 5 years ago
- ☆18Updated 4 years ago
- Package for building Market Segmentation Trees, Choice Model Trees, and Isotonic Regression Trees☆17Updated 2 years ago
- (RecSys2020) "Doubly Robust Estimator for Ranking Metrics with Post-Click Conversions"☆24Updated 2 years ago
- Source code for our paper "Pessimistic Decision-Making for Recommender Systems" published at ACM TORS, and RecSys 2021.☆11Updated 2 years ago
- ☆51Updated last year
- working example of a contextual multi-armed bandit☆55Updated 5 years ago
- Implementation of provably Rawlsian fair ML algorithms for contextual bandits.☆14Updated 8 years ago
- Implementation of paper Long-Term Effect Estimation with Surrogate Representation☆12Updated 4 years ago
- Stream Data based News Recommendation - Contextual Bandit Approach☆48Updated 7 years ago
- Counterfactual Evaluation and Learning for Interactive Systems: Foundations, Implementations, and Recent Advances☆12Updated 2 years ago
- ☆15Updated 5 years ago
- ☆17Updated 3 years ago
- https://sites.google.com/cornell.edu/recsys2021tutorial☆55Updated 3 years ago
- Uplifted Contextual Multi-Armed Bandit☆19Updated 3 years ago