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.
  ☆15Updated last year
• rjagerman / wsdm2019-nonstationary
  Non-stationary Off-policy Evaluation
  ☆13Updated 6 years ago
• VowpalWabbit / coba
  Contextual bandit benchmarking
  ☆50Updated 2 months ago
• HarrieO / 2022-doubly-robust-LTR
  ☆9Updated 2 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
• mesuvash / pyrec
  ☆10Updated 9 years ago
• VowpalWabbit / estimators
  Estimators to perform off-policy evaluation
  ☆13Updated 11 months ago
• matejbalog / gumbel-relatives
  Code to reproduce experiments appearing in the academic paper Lost Relatives of the Gumbel Trick
  ☆17Updated 8 years ago
• RobRomijnders / bandit
  Implementation of Counterfactual risk minimization
  ☆26Updated 8 years ago
• felixyu / pSVM
  proportion-SVM (pSVM, $\propto$SVM) for learning with label proportions
  ☆21Updated 12 years ago
• yoch / svmloader
  a very fast parser for sparse matrix at libsvm format
  ☆10Updated 7 years ago
• hpclab / LtR-Tutorial
  Efficiency/Effectiveness Trade-offs in Learning to Rank
  ☆12Updated 6 years ago
• nd7141 / recsystutorial
  ☆16Updated 4 years ago
• jtcho / FairMachineLearning
  Implementation of provably Rawlsian fair ML algorithms for contextual bandits.
  ☆14Updated 8 years ago
• fated / libcp
  LibCP -- A Library for Conformal Prediction
  ☆12Updated 10 years ago
• vveitch / causal-embeddings
  Code for "Using Embeddings to Correct for Unobserved Confounding"
  ☆10Updated 6 years ago
• adith387 / slates_semisynth_expts
  Semi-synthetic experiments to test several approaches for off-policy evaluation and optimization of slate recommenders.
  ☆43Updated 7 years ago
• abietti / cb_bakeoff
  scripts for evaluation of contextual bandit algorithms
  ☆45Updated 5 years ago
• franrruiz / p-emb
  Exponential family embeddings (Poisson or Bernoulli) for discrete data
  ☆32Updated 6 years ago
• MilkaLichtblau / BA_Laura
  Fair Benchmarks
  ☆10Updated 6 years ago
• daturkel / sd_bandits
  ☆14Updated 4 years ago
• Philip-Bachman / Sequential-Generation
  Generative models and other stuff too, maybe, perhaps even probably
  ☆16Updated 9 years ago
• maciejkula / binge
  Recommendation models that use binary rather than floating point operations at prediction time.
  ☆21Updated 7 years ago
• rgiordan / CovariancesRobustnessVBPaper
  ☆12Updated 2 years ago
• achab / nphc
  NPHC
  ☆17Updated 4 years ago
• olivierjeunen / EARS-recsys-2021
  Source code for our paper "Top-K Contextual Bandits with Equity of Exposure" published at RecSys 2021.
  ☆16Updated 4 years ago
• QingyaoAi / Explainable-Product-Search-with-a-Dynamic-Relation-Embedding-Model
  ☆21Updated 3 years ago
• Networks-Learning / tpprl
  Code and data for "Deep Reinforcement Learning of Marked Temporal Point Processes", NeurIPS 2018
  ☆80Updated 6 years ago
• rjagerman / sigir2020
  Accelerated Confergence for Counterfactual Learning to Rank
  ☆17Updated 3 years ago
• YRussac / WeightedLinearBandits
  Code associated with the NeurIPS19 paper "Weighted Linear Bandits in Non-Stationary Environments"
  ☆17Updated 5 years ago