Alternatives and similar repositories for RobinHood-NeurIPS-2019

Users that are interested in RobinHood-NeurIPS-2019 are comparing it to the libraries listed below

• jfinkels / birkhoff
  Birkhoff decomposition for doubly stochastic matrices.
  ☆14Updated 2 years ago
• rjagerman / wsdm2019-nonstationary
  Non-stationary Off-policy Evaluation
  ☆13Updated 7 years ago
• RobRomijnders / bandit
  Implementation of Counterfactual risk minimization
  ☆26Updated 8 years ago
• olivierjeunen / dual-bandit-kdd-2020
  Source code for our paper "Joint Policy-Value Learning for Recommendation" published at KDD 2020.
  ☆23Updated 2 years ago
• VowpalWabbit / estimators
  Estimators to perform off-policy evaluation
  ☆13Updated last year
• MilkaLichtblau / BA_Laura
  Fair Benchmarks
  ☆10Updated 6 years ago
• matejbalog / gumbel-relatives
  Code to reproduce experiments appearing in the academic paper Lost Relatives of the Gumbel Trick
  ☆17Updated 8 years ago
• abietti / cb_bakeoff
  scripts for evaluation of contextual bandit algorithms
  ☆45Updated 5 years ago
• mesuvash / pyrec
  ☆10Updated 9 years ago
• vveitch / causal-embeddings
  Code for "Using Embeddings to Correct for Unobserved Confounding"
  ☆10Updated 6 years ago
• fated / libcp
  LibCP -- A Library for Conformal Prediction
  ☆13Updated 10 years ago
• Philip-Bachman / Sequential-Generation
  Generative models and other stuff too, maybe, perhaps even probably
  ☆16Updated 10 years ago
• jtcho / FairMachineLearning
  Implementation of provably Rawlsian fair ML algorithms for contextual bandits.
  ☆14Updated 8 years ago
• yoch / svmloader
  a very fast parser for sparse matrix at libsvm format
  ☆10Updated 8 years ago
• nd7141 / recsystutorial
  ☆16Updated 5 years ago
• Networks-Learning / tpprl
  Code and data for "Deep Reinforcement Learning of Marked Temporal Point Processes", NeurIPS 2018
  ☆81Updated 6 years ago
• gpleiss / equalized_odds_and_calibration
  Code and data for the experiments in "On Fairness and Calibration"
  ☆51Updated 3 years ago
• rjagerman / sigir2020
  Accelerated Confergence for Counterfactual Learning to Rank
  ☆17Updated 3 years ago
• hpclab / LtR-Tutorial
  Efficiency/Effectiveness Trade-offs in Learning to Rank
  ☆12Updated 7 years ago
• crowdAI / crowdai-criteo-ad-placement-challenge-starter-kit
  Starter kit for getting started in the NIPS 2017 Criteo Ad Placement Challenge
  ☆18Updated 8 years ago
• maciejkula / binge
  Recommendation models that use binary rather than floating point operations at prediction time.
  ☆21Updated 8 years ago
• blei-lab / zero-inflated-embedding
  Code for the icml paper "zero inflated exponential family embedding"
  ☆29Updated 8 years ago
• VowpalWabbit / coba
  Contextual bandit benchmarking
  ☆53Updated 6 months ago
• franrruiz / p-emb
  Exponential family embeddings (Poisson or Bernoulli) for discrete data
  ☆32Updated 6 years ago
• adith387 / slates_semisynth_expts
  Semi-synthetic experiments to test several approaches for off-policy evaluation and optimization of slate recommenders.
  ☆43Updated 8 years ago
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆10Updated 9 years ago
• daturkel / sd_bandits
  ☆15Updated 5 years ago
• QingyaoAi / Explainable-Product-Search-with-a-Dynamic-Relation-Embedding-Model
  ☆21Updated 4 years ago
• akshaykr / oracle_cb
  Experimentation for oracle based contextual bandit algorithms.
  ☆33Updated 3 years ago
• gamboviol / miptree
  maximum inner product tree
  ☆26Updated 12 years ago