← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Batched Coarse Ranking in Multi-Armed Bandits NIPS 2020
Regret in Online Recommendation Systems NIPS 2020
Bandit Linear Control NIPS 2020
Exact Passive-Aggressive Algorithms for Multiclass Classification Using Bandit Feedbacks ACML 2020
A PTAS for the Bayesian Thresholding Bandit Problem AISTATS 2020
Stochastic Linear Contextual Bandits with Diverse Contexts AISTATS 2020
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems AISTATS 2020
Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020
Trading-Off Static and Dynamic Regret in Online Least-Squares and Beyond AAAI 2020
Adaptive Double-Exploration Tradeoff for Outlier Detection AAAI 2020
Learning to Crawl AAAI 2020
Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interests AAAI 2020
Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds AAAI 2020
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds NIPS 2020
Adaptive Probing Policies for Shortest Path Routing NIPS 2020
Better Full-Matrix Regret via Parameter-Free Online Learning NIPS 2020
Online Linear Optimization with Many Hints NIPS 2020
Online Influence Maximization with Local Observations ALT 2019
Cleaning up the neighborhood: A full classification for adversarial partial monitoring ALT 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NIPS 2019
Optimizing Discount and Reputation Trade-Offs in E-Commerce Systems: Characterization and Online Learning AAAI 2019
Online Non-Additive Path Learning under Full and Partial Information ALT 2019
Differentially Private Online Submodular Minimization AISTATS 2019
Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue AAAI 2019
Online Learning from Data Streams with Varying Feature Spaces AAAI 2019