Co-occurring keywords · papers mentioning both
Papers
Competing Bandits in Matching Markets via Super Stability
ICML 2025
ICL-Bandit: Relevance Labeling in Advertisement Recommendation Systems via LLM
EMNLP 2025
Improved Regret Bounds for Online Fair Division with Bandit Learning
AAAI 2025
Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
ICML 2025
On the Hardness of Bandit Learning
COLT 2025
Fast Rates for Bandit PAC Multiclass Classification
NeurIPS 2024
Improved Analysis for Bandit Learning in Matching Markets
NeurIPS 2024
Responsible Bandit Learning via Privacy-Protected Mean-Volatility Utility
AAAI 2024
Two-sided Competing Matching Recommendation Markets With Quota and Complementary Preferences Constraints
ICML 2024
Exponential Smoothing for Off-Policy Learning
ICML 2023
Multi-Action Dialog Policy Learning from Logged User Feedback
AAAI 2023
Quantifying the Cost of Learning in Queueing Systems
NeurIPS 2023
Scalable and Robust Self-Learning for Skill Routing in Large-Scale Conversational AI Systems
NAACL 2022
Bandit Learning in Decentralized Matching Markets
JMLR 2021
Matroids, Matchings, and Fairness
AISTATS 2019
Bandit Learning in Concave N-Person Games
NeurIPS 2018
Can Neural Machine Translation be Improved with User Feedback?
NAACL 2018
Reliability and Learnability of Human Bandit Feedback for Sequence-to-Sequence Reinforcement Learning
ACL 2018
Bandit Structured Prediction for Neural Sequence-to-Sequence Learning
ACL 2017
Crowd Learning: Improving Online Decision Making Using Crowdsourced Data
IJCAI 2017
Reinforcement Learning for Bandit Neural Machine Translation with Simulated Human Feedback
EMNLP 2017
The price of bandit information in multiclass online classification
COLT 2013