conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

806 papers

Papers per year

6
24
87
21
'10
'15
'20
'25

Papers

An Online Algorithm for Smoothed Regression and LQR Control AISTATS 2019
Rotting bandits are no harder than stochastic ones AISTATS 2019
Dynamic Pricing with Finitely Many Unknown Valuations ALT 2019
Online Non-Additive Path Learning under Full and Partial Information ALT 2019
Cleaning up the neighborhood: A full classification for adversarial partial monitoring ALT 2019
Online Influence Maximization with Local Observations ALT 2019
Online Linear Optimization with Sparsity Constraints ALT 2019
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free COLT 2019
Parameter-Free Online Convex Optimization with Sub-Exponential Noise COLT 2019
Bandit Principal Component Analysis COLT 2019
Predictor-Corrector Policy Optimization ICML 2019
Online Learning to Rank with Features ICML 2019
Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints ICML 2019
Adversarial Online Learning with noise ICML 2019
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously ICML 2019
Multi-Objective Generalized Linear Bandits IJCAI 2019
Learning Multi-Objective Rewards and User Utility Function in Contextual Bandits for Personalized Ranking IJCAI 2019
Delay and Cooperation in Nonstochastic Bandits JMLR 2019
Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamics JMLR 2019
On the optimality of the Hedge algorithm in the stochastic regime JMLR 2019
DESPOT-Alpha: Online POMDP Planning with Large State and Observation Spaces RSS 2019
Leveraging Experience in Lazy Search RSS 2019
Reducing Exploration of Dying Arms in Mortal Bandits UAI 2019
Adaptive Online Learning in Dynamic Environments NIPS 2018
Adversarial Attacks on Stochastic Bandits NIPS 2018