Co-occurring keywords · papers mentioning both
Papers
Online Boosting with Bandit Feedback
ALT 2021
Online learning in MDPs with linear function approximation and bandit feedback.
NeurIPS 2021
Online Markov Decision Processes with Aggregate Bandit Feedback
COLT 2021
On the Rate of Convergence of Regularized Learning in Games: From Bandits and Uncertainty to Optimism and Beyond
NeurIPS 2021
Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization
ICML 2021
Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games
NeurIPS 2021
Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information
COLT 2021
Cost-Effective Incentive Allocation via Structured Counterfactual Inference
AAAI 2020
Exact Passive-Aggressive Algorithms for Multiclass Classification Using Bandit Feedbacks
ACML 2020
Learning Adversarial Markov Decision Processes with Bandit Feedback and Unknown Transition
ICML 2020
Online Dense Subgraph Discovery via Blurred-Graph Feedback
ICML 2020
Online Learning with Vector Costs and Bandits with Knapsacks
COLT 2020
Optimistic Policy Optimization with Bandit Feedback
ICML 2020
Adversarial Online Learning with noise
ICML 2019
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case
ICML 2019
Bandit Principal Component Analysis
COLT 2019
Bayesian Counterfactual Risk Minimization
ICML 2019
Differentially Private Online Submodular Minimization
AISTATS 2019
Efficient Counterfactual Learning from Bandit Feedback
AAAI 2019
Exponential Weights on the Hypercube in Polynomial Time
AISTATS 2019
No-Regret Learning in Unknown Games with Correlated Payoffs
NeurIPS 2019
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback
NeurIPS 2019
Online Multiclass Boosting with Bandit Feedback
AISTATS 2019
Online Stochastic Shortest Path with Bandit Feedback and Unknown Transition Function
NeurIPS 2019
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback
NeurIPS 2019