← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Network Embedding under Partial Monitoring for Evolving Networks IJCAI 2019
Online Learning from Capricious Data Streams: A Generative Approach IJCAI 2019
Indirect Trust is Simple to Establish IJCAI 2019
Unifying the Stochastic and the Adversarial Bandits with Knapsack IJCAI 2019
Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging IJCAI 2019
On Computational Complexity of Pickup-and-Delivery Problems with Precedence Constraints or Time Windows IJCAI 2019
Online Prediction of Switching Graph Labelings with Cluster Specialists NIPS 2019
Efficient and Thrifty Voting by Any Means Necessary NIPS 2019
Learning to Correlate in Multi-Player General-Sum Sequential Games NIPS 2019
Learning to Screen NIPS 2019
On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation AAAI 2019
Pareto Optimal Streaming Unsupervised Classification ICML 2019
Online learning with kernel losses ICML 2019
PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits ICML 2019
Decentralized Exploration in Multi-Armed Bandits ICML 2019
Online Meta-Learning ICML 2019
Adaptive Sensor Placement for Continuous Spaces ICML 2019
Stay With Me: Lifetime Maximization Through Heteroscedastic Linear Bandits With Reneging ICML 2019
Natural Analysts in Adaptive Data Analysis ICML 2019
Scalable and Congestion-Aware Routing for Autonomous Mobility-On-Demand Via Frank-Wolfe Optimization RSS 2019
Earliest-Completion Scheduling of Contract Algorithms with End Guarantees IJCAI 2019
Batched Multi-armed Bandits Problem NIPS 2019
Artificial Constraints and Hints for Unbounded Online Learning COLT 2019
On Learning Graphs with Edge-Detecting Queries ALT 2019
Competitive ratio vs regret minimization: achieving the best of both worlds ALT 2019