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

Online Algorithms

806 papers

Papers per year

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

Papers

Learning Augmented Energy Minimization via Speed Scaling NIPS 2020
Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs NIPS 2020
Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NIPS 2020
Batched Coarse Ranking in Multi-Armed Bandits NIPS 2020
Online Bayesian Persuasion NIPS 2020
Online Multitask Learning with Long-Term Memory NIPS 2020
Comparator-Adaptive Convex Bandits NIPS 2020
Online Learning with Primary and Secondary Losses NIPS 2020
Adaptive Online Estimation of Piecewise Polynomial Trends NIPS 2020
Regret in Online Recommendation Systems NIPS 2020
Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games NIPS 2020
OMuLeT: Online Multi-Lead Time Location Prediction for Hurricane Trajectory Forecasting AAAI 2020
Distance-Based Equilibria in Normal-Form Games AAAI 2020
Stochastic Online Learning with Probabilistic Graph Feedback AAAI 2020
Incentivized Exploration for Multi-Armed Bandits under Reward Drift AAAI 2020
Linear Bandits with Feature Feedback AAAI 2020
Learning to Crawl AAAI 2020
Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interests AAAI 2020
Revisiting Online Quantum State Learning AAAI 2020
Trading-Off Static and Dynamic Regret in Online Least-Squares and Beyond AAAI 2020
Adaptive Double-Exploration Tradeoff for Outlier Detection AAAI 2020
Subsidy Allocations in the Presence of Income Shocks AAAI 2020
Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds AAAI 2020
Simultaneous Translation Policies: From Fixed to Adaptive ACL 2020
Exact Passive-Aggressive Algorithms for Multiclass Classification Using Bandit Feedbacks ACML 2020