Online Algorithms

Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach ICLR 2020 Online Batch Decision-Making with High-Dimensional Covariates AISTATS 2020 Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints AISTATS 2020 Online Convex Optimization in the Random Order Model ICML 2020 Online Convex Optimization Over Erdos-Renyi Random Networks NeurIPS 2020 Online Dense Subgraph Discovery via Blurred-Graph Feedback ICML 2020 Online Evaluation of Audiences for Targeted Advertising via Bandit Experiments AAAI 2020 Online Influence Maximization under Linear Threshold Model NeurIPS 2020 Online Learning for Active Cache Synchronization ICML 2020 Online Learning in Changing Environments IJCAI 2020 Online Learning in Contextual Bandits using Gated Linear Networks NeurIPS 2020 Online learning with dynamics: A minimax perspective NeurIPS 2020 Online Learning with Vector Costs and Bandits with Knapsacks COLT 2020 Online Linear Optimization with Many Hints NeurIPS 2020 Online MAP Inference of Determinantal Point Processes NeurIPS 2020 Online metric algorithms with untrusted predictions ICML 2020 Online mirror descent and dual averaging: keeping pace in the dynamic case ICML 2020 Online Non-Convex Learning: Following the Perturbed Leader is Optimal ALT 2020 Online Non-Convex Optimization with Imperfect Feedback NeurIPS 2020 Online Optimization with Memory and Competitive Control NeurIPS 2020 Online Portfolio Selection with Cardinality Constraint and Transaction Costs based on Contextual Bandit IJCAI 2020 Online Pricing with Offline Data: Phase Transition and Inverse Square Law ICML 2020 Online Second Price Auction with Semi-Bandit Feedback under the Non-Stationary Setting AAAI 2020 Online Sufficient Dimension Reduction Through Sliced Inverse Regression JMLR 2020 On Regret with Multiple Best Arms NeurIPS 2020