Skip to content
conftrace_

online recommendation

8 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (4) recommender system (2) online learning (2) soft intervention (1) nonlinear reward (1) offline policy learning (1) temporal distribution shift (1) optimism-based policy (1) user-agent interaction (1) disposability constraint (1)

Papers

Adversarial Attacks on Adversarial Bandits ICLR 2023 Achieving Counterfactual Fairness for Causal Bandit AAAI 2022 Future gradient descent for adapting the temporal shifting data distribution in online recommendation systems UAI 2022 Adversarial Combinatorial Bandits with General Non-linear Reward Functions ICML 2021 Disposable Linear Bandits for Online Recommendations AAAI 2021 Thompson Sampling Algorithms for Cascading Bandits JMLR 2021 A Model-Based Reinforcement Learning with Adversarial Training for Online Recommendation NeurIPS 2019 Using Contextual Bandits with Behavioral Constraints for Constrained Online Movie Recommendation IJCAI 2018