Online Algorithms

EvolveMT: an Ensemble MT Engine Improving Itself with Usage Only ACL 2023 Experimental Designs for Heteroskedastic Variance NeurIPS 2023 Fairness and Welfare Quantification for Regret in Multi-Armed Bandits AAAI 2023 Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms NeurIPS 2023 Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits NeurIPS 2023 Faster Query Times for Fully Dynamic k-Center Clustering with Outliers NeurIPS 2023 Fast Online Changepoint Detection via Functional Pruning CUSUM Statistics JMLR 2023 Fast Rates in Time-Varying Strongly Monotone Games ICML 2023 Federated Learning for Data Streams AISTATS 2023 Federated Linear Bandits with Finite Adversarial Actions NeurIPS 2023 Federated Online and Bandit Convex Optimization ICML 2023 Finite-time Koopman Identifier: A Unified Batch-online Learning Framework for Joint Learning of Koopman Structure and Parameters JMLR 2023 First- and Second-Order Bounds for Adversarial Linear Contextual Bandits NeurIPS 2023 Follow-the-Perturbed-Leader Achieves Best-of-Both-Worlds for Bandit Problems ALT 2023 Fully Dynamic $k$-Clustering in $\tilde O(k)$ Update Time NeurIPS 2023 Fully Dynamic Online Selection through Online Contention Resolution Schemes AAAI 2023 Fully Online Matching with Stochastic Arrivals and Departures AAAI 2023 Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits AISTATS 2023 Future Aware Pricing and Matching for Sustainable On-Demand Ride Pooling AAAI 2023 Generalized Implicit Follow-The-Regularized-Leader ICML 2023 Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization COLT 2023 Gradient-Variation Bound for Online Convex Optimization with Constraints AAAI 2023 Graph-Aided Online Multi-Kernel Learning JMLR 2023 High-dimensional Contextual Bandit Problem without Sparsity NeurIPS 2023 Hyrax: Fail-in-Place Server Operation in Cloud Platforms OSDI 2023