online algorithm

Simple and Optimal Greedy Online Contention Resolution Schemes NeurIPS 2022 Sliding-Seeking Control: Model-Free Optimization with Safety Constraints L4DC 2022 Solving Multi-Arm Bandit Using a Few Bits of Communication AISTATS 2022 Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints ICML 2022 The Secretary Problem with Competing Employers on Random Edge Arrivals AAAI 2022 Universal and data-adaptive algorithms for model selection in linear contextual bandits ICML 2022 Universal and Tight Online Algorithms for Generalized-Mean Welfare AAAI 2022 Adaptive Discretization for Adversarial Lipschitz Bandits COLT 2021 A Gang of Adversarial Bandits NeurIPS 2021 An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints NeurIPS 2021 A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits AISTATS 2021 A Regression Approach to Learning-Augmented Online Algorithms NeurIPS 2021 Asynchronous Distributed Learning : Adapting to Gradient Delays without Prior Knowledge ICML 2021 Bandit Learning with Delayed Impact of Actions NeurIPS 2021 Bandits with Knapsacks beyond the Worst Case NeurIPS 2021 Black-Box Control for Linear Dynamical Systems COLT 2021 Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback AAAI 2021 Competitive Analysis for Two-Level Ski-Rental Problem AAAI 2021 Consistent k-Median: Simpler, Better and Robust AISTATS 2021 DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits AAAI 2021 Data-driven Competitive Algorithms for Online Knapsack and Set Cover AAAI 2021 Dynamic Balancing for Model Selection in Bandits and RL ICML 2021 Dynamic Tensor Rematerialization ICLR 2021 Efficient Algorithms for Stochastic Repeated Second-price Auctions ALT 2021 Fair and Efficient Online Allocations with Normalized Valuations AAAI 2021