← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Learning Multi-Objective Rewards and User Utility Function in Contextual Bandits for Personalized Ranking IJCAI 2019
Dynamic Pricing with Finitely Many Unknown Valuations ALT 2019
Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints ICML 2019
Online Learning to Rank with Features ICML 2019
Online Multiclass Boosting with Bandit Feedback AISTATS 2019
An Optimal Algorithm for Stochastic and Adversarial Bandits AISTATS 2019
Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit AISTATS 2019
Learning to Optimize under Non-Stationarity AISTATS 2019
Conservative Exploration using Interleaving AISTATS 2019
Top Feasible Arm Identification AISTATS 2019
Lifelong Optimization with Low Regret AISTATS 2019
On the optimality of the Hedge algorithm in the stochastic regime JMLR 2019
Delay and Cooperation in Nonstochastic Bandits JMLR 2019
Rotting bandits are no harder than stochastic ones AISTATS 2019
An Online Algorithm for Smoothed Regression and LQR Control AISTATS 2019
No-regret algorithms for online $k$-submodular maximization AISTATS 2019
Multi-Objective Generalized Linear Bandits IJCAI 2019
Parameter-Free Online Convex Optimization with Sub-Exponential Noise COLT 2019
Bandit Principal Component Analysis COLT 2019
Predictor-Corrector Policy Optimization ICML 2019
Learning to Screen NIPS 2019
Batched Multi-armed Bandits Problem NIPS 2019
Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamics JMLR 2019
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free COLT 2019
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously ICML 2019