Skip to content
conftrace_

online algorithm

481 papers

Papers

Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions NeurIPS 2022 Non-stationary Bandits with Knapsacks NeurIPS 2022 Nonstationary Dual Averaging and Online Fair Allocation NeurIPS 2022 No Weighted-Regret Learning in Adversarial Bandits with Delays JMLR 2022 One-Pass Algorithms for MAP Inference of Nonsymmetric Determinantal Point Processes ICML 2022 Online Active Regression ICML 2022 Online Algorithms for the Santa Claus Problem NeurIPS 2022 Online Algorithms with Multiple Predictions ICML 2022 Online Approval Committee Elections IJCAI 2022 Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model NeurIPS 2022 Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond NeurIPS 2022 Online Elicitation of Necessarily Optimal Matchings AAAI 2022 Online Facility Location with Predictions ICLR 2022 Online Page Migration with ML Advice AISTATS 2022 Online Search with Best-Price and Query-Based Predictions AAAI 2022 Online Task Assignment Problems with Reusable Resources AAAI 2022 On-the-fly adaptation of patrolling strategies in changing environments UAI 2022 Optimal Dynamic Regret in LQR Control NeurIPS 2022 (Optimal) Online Bipartite Matching with Degree Information NeurIPS 2022 Optimal Sampling Gaps for Adaptive Submodular Maximization AAAI 2022 Product Ranking for Revenue Maximization with Multiple Purchases NeurIPS 2022 Real-Time Driver-Request Assignment in Ridesourcing AAAI 2022 Residual-Based Sampling for Online Outlier-Robust PCA ICML 2022 Robustification of Online Graph Exploration Methods AAAI 2022 Scheduling with Untrusted Predictions IJCAI 2022