Online Algorithms

Dueling Bandits with Qualitative Feedback AAAI 2019 Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue AAAI 2019 Dynamic Pricing with Finitely Many Unknown Valuations ALT 2019 Efficient online learning with kernels for adversarial large scale problems NeurIPS 2019 Epsilon-Best-Arm Identification in Pay-Per-Reward Multi-Armed Bandits NeurIPS 2019 Exponential Weights on the Hypercube in Polynomial Time AISTATS 2019 FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms ACL 2019 Learning Multi-Objective Rewards and User Utility Function in Contextual Bandits for Personalized Ranking IJCAI 2019 Learning to Optimize under Non-Stationarity AISTATS 2019 Learning to Screen NeurIPS 2019 Leveraging Experience in Lazy Search RSS 2019 Lifelong Optimization with Low Regret AISTATS 2019 Lipschitz Adaptivity with Multiple Learning Rates in Online Learning COLT 2019 Logarithmic Regret for Online Control NeurIPS 2019 Minimax Online Prediction of Varying Bernoulli Process under Variational Approximation ACML 2019 Multi-Objective Generalized Linear Bandits IJCAI 2019 Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits COLT 2019 Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit AISTATS 2019 No-regret algorithms for online k-submodular maximization AISTATS 2019 Online Influence Maximization with Local Observations ALT 2019 Online Learning from Data Streams with Varying Feature Spaces AAAI 2019 Online Learning to Rank with Features ICML 2019 Online Linear Optimization with Sparsity Constraints ALT 2019 Online Multiclass Boosting with Bandit Feedback AISTATS 2019 Online Non-Additive Path Learning under Full and Partial Information ALT 2019