online learning

Toward a General Theory of Online Selective Sampling: Trading Off Mistakes and Queries AISTATS 2021 Toward Optimal Solution for the Context-Attentive Bandit Problem IJCAI 2021 Towards Best-of-All-Worlds Online Learning with Feedback Graphs NeurIPS 2021 Towards Reducing Biases in Combining Multiple Experts Online IJCAI 2021 Transfer Learning with Adaptive Online TrAdaBoost for Data Streams ACML 2021 Unifying Online and Counterfactual Learning to Rank: A Novel Counterfactual Estimator that Effectively Utilizes Online Interventions (Extended Abstract) IJCAI 2021 Wandering within a world: Online contextualized few-shot learning ICLR 2021 Wanderlust: Online Continual Object Detection in the Real World ICCV 2021 X2T: Training an X-to-Text Typing Interface with Online Learning from User Feedback ICLR 2021 Zeroth-Order Non-Convex Learning via Hierarchical Dual Averaging ICML 2021 A Bandit Learning Algorithm and Applications to Auction Design NeurIPS 2020 Achieving Fairness in the Stochastic Multi-Armed Bandit Problem AAAI 2020 A Computational Separation between Private Learning and Online Learning NeurIPS 2020 Adapting to Misspecification in Contextual Bandits NeurIPS 2020 Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound WACV 2020 Adaptive Importance Sampling for Finite-Sum Optimization and Sampling with Decreasing Step-Sizes NeurIPS 2020 Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm NeurIPS 2020 An Implicit Form of Krasulina's k-PCA Update without the Orthonormality Constraint AAAI 2020 An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles IJCAI 2020 An Online Semantic-enhanced Dirichlet Model for Short Text Stream Clustering ACL 2020 An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays AISTATS 2020 A PTAS for the Bayesian Thresholding Bandit Problem AISTATS 2020 A Simple Online Algorithm for Competing with Dynamic Comparators UAI 2020 A simpler approach to accelerated optimization: iterative averaging meets optimism ICML 2020 A single algorithm for both restless and rested rotting bandits AISTATS 2020