Online Learning

Stochastic Online Learning with Probabilistic Graph Feedback AAAI 2020 Streaming k-Submodular Maximization under Noise subject to Size Constraint ICML 2020 Submodular Bandit Problem Under Multiple Constraints UAI 2020 Vector Autoregressive Weighting Reversion Strategy for Online Portfolio Selection IJCAI 2020 What You See May Not Be What You Get: UCB Bandit Algorithms Robust to ε-Contamination UAI 2020 Winnowing with Gradient Descent COLT 2020 An Information-Theoretic Approach to Minimax Regret in Partial Monitoring COLT 2019 Approximations of the Restless Bandit Problem JMLR 2019 A Theory of Selective Prediction COLT 2019 Balanced Linear Contextual Bandits AAAI 2019 Batched Multi-armed Bandits Problem NeurIPS 2019 Be Greedy: How Chromatic Number meets Regret Minimization in Graph Bandits UAI 2019 Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NeurIPS 2019 Blocking Bandits NeurIPS 2019 BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback UAI 2019 Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model IJCAI 2019 Censored Semi-Bandits: A Framework for Resource Allocation with Censored Feedback NeurIPS 2019 Cogra: Concept-Drift-Aware Stochastic Gradient Descent for Time-Series Forecasting AAAI 2019 Collective Online Learning of Gaussian Processes in Massive Multi-Agent Systems AAAI 2019 Combinatorial Bandits with Relative Feedback NeurIPS 2019 Confidence Weighted Multitask Learning AAAI 2019 Contextual Bandits with Cross-Learning NeurIPS 2019 Dueling Bandits with Qualitative Feedback AAAI 2019 Dying Experts: Efficient Algorithms with Optimal Regret Bounds NeurIPS 2019 Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue AAAI 2019