online learning

Multinomial Logit Bandit with Linear Utility Functions IJCAI 2018 Multiple-Step Greedy Policies in Approximate and Online Reinforcement Learning NeurIPS 2018 Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes NeurIPS 2018 Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018 Online Adaptive Methods, Universality and Acceleration NeurIPS 2018 Online Bootstrap Confidence Intervals for the Stochastic Gradient Descent Estimator JMLR 2018 Online Continuous-Time Tensor Factorization Based on Pairwise Interactive Point Processes IJCAI 2018 Online Convolutional Sparse Coding with Sample-Dependent Dictionary ICML 2018 Online Deep Learning: Learning Deep Neural Networks on the Fly IJCAI 2018 Online Ensemble Multi-kernel Learning Adaptive to Non-stationary and Adversarial Environments AISTATS 2018 Online Heterogeneous Transfer Metric Learning IJCAI 2018 Online Improper Learning with an Approximation Oracle NeurIPS 2018 Online Kernel Selection via Incremental Sketched Kernel Alignment IJCAI 2018 Online Learning of Combinatorial Objects via Extended Formulation ALT 2018 Online Learning of Quantum States NeurIPS 2018 Online learning over a finite action set with limited switching COLT 2018 Online Learning: Sufficient Statistics and the Burkholder Method COLT 2018 Online Learning with Abstention ICML 2018 Online Learning with an Unknown Fairness Metric NeurIPS 2018 Online Learning with Non-Convex Losses and Non-Stationary Regret AISTATS 2018 Online Linear Quadratic Control ICML 2018 Online Reciprocal Recommendation with Theoretical Performance Guarantees NeurIPS 2018 Online Robust Policy Learning in the Presence of Unknown Adversaries NeurIPS 2018 Online Structure Learning for Feed-Forward and Recurrent Sum-Product Networks NeurIPS 2018 On preserving non-discrimination when combining expert advice NeurIPS 2018