Co-occurring keywords · papers mentioning both
Papers
Pitfalls of Learning a Reward Function Online
IJCAI 2020
Policy Improvement via Imitation of Multiple Oracles
NeurIPS 2020
Prediction with Corrupted Expert Advice
NeurIPS 2020
Projective Quadratic Regression for Online Learning
AAAI 2020
Provable Online CP/PARAFAC Decomposition of a Structured Tensor via Dictionary Learning
NeurIPS 2020
Provably Efficient Model-based Policy Adaptation
ICML 2020
Real-Time Optimisation for Online Learning in Auctions
ICML 2020
Recursive Least-Squares Estimator-Aided Online Learning for Visual Tracking
CVPR 2020
Regret in Online Recommendation Systems
NeurIPS 2020
Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound
ICML 2020
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits
NeurIPS 2020
Revisiting Online Quantum State Learning
AAAI 2020
RL-Duet: Online Music Accompaniment Generation Using Deep Reinforcement Learning
AAAI 2020
Root-n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank
COLT 2020
Safe Linear Stochastic Bandits
AAAI 2020
Smoothed Analysis of Online and Differentially Private Learning
NeurIPS 2020
Soft Multicopter Control Using Neural Dynamics Identification
CoRL 2020
Spectral bandits
JMLR 2020
Speeding up Very Fast Decision Tree with Low Computational Cost
IJCAI 2020
SPSTracker: Sub-Peak Suppression of Response Map for Robust Object Tracking
AAAI 2020
Stable Reinforcement Learning with Unbounded State Space
L4DC 2020
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes
NeurIPS 2020
Stochastic Online Learning with Probabilistic Graph Feedback
AAAI 2020
Submodular Bandit Problem Under Multiple Constraints
UAI 2020
Taking a hint: How to leverage loss predictors in contextual bandits?
COLT 2020