← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback NIPS 2019
Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints NIPS 2019
Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration NIPS 2019
Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms NIPS 2019
Combining Online Learning Guarantees COLT 2019
On-Line Learning of Linear Dynamical Systems: Exponential Forgetting in Kalman Filters AAAI 2019
Profiles, Proxies, and Assumptions: Decentralized, Communications-Resilient Planning, Allocation, and Scheduling AAAI 2019
GSLAM: A General SLAM Framework and Benchmark ICCV 2019
Low-Rank Bandit Methods for High-Dimensional Dynamic Pricing NIPS 2019
Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes NIPS 2019
Equipping Experts/Bandits with Long-term Memory NIPS 2019
Robust Frequent Directions with Application in Online Learning JMLR 2019
Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing JMLR 2019
On the optimality of the Hedge algorithm in the stochastic regime JMLR 2019
Dynamic Pricing in High-dimensions JMLR 2019
Projection Free Online Learning over Smooth Sets AISTATS 2019
MaxHedge: Maximizing a Maximum Online AISTATS 2019
Regularized Contextual Bandits AISTATS 2019
Consistent Online Optimization: Convex and Submodular AISTATS 2019
Online learning with feedback graphs and switching costs AISTATS 2019
Online Algorithm for Unsupervised Sensor Selection AISTATS 2019
Best of many worlds: Robust model selection for online supervised learning AISTATS 2019
Online Learning in Kernelized Markov Decision Processes AISTATS 2019
Finding the bandit in a graph: Sequential search-and-stop AISTATS 2019
Improvisation through Physical Understanding: Using Novel Objects As Tools with Visual Foresight RSS 2019