← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Query-focused Sentence Compression in Linear Time EMNLP 2019
Large-Scale, Metric Structure From Motion for Unordered Light Fields CVPR 2019
Problem-dependent Regret Bounds for Online Learning with Feedback Graphs UAI 2019
Think out of the "Box": Generically-Constrained Asynchronous Composite Optimization and Hedging NIPS 2019
Equal Opportunity in Online Classification with Partial Feedback NIPS 2019
Dying Experts: Efficient Algorithms with Optimal Regret Bounds NIPS 2019
ADDIS: an adaptive discarding algorithm for online FDR control with conservative nulls NIPS 2019
Weighted Linear Bandits for Non-Stationary Environments NIPS 2019
Model Selection for Contextual Bandits NIPS 2019
Combinatorial Bandits with Relative Feedback NIPS 2019
Pure Exploration with Multiple Correct Answers NIPS 2019
Online Forecasting of Total-Variation-bounded Sequences NIPS 2019
Contextual Bandits with Cross-Learning NIPS 2019
Categorized Bandits NIPS 2019
User-Specified Local Differential Privacy in Unconstrained Adaptive Online Learning NIPS 2019
Meta-Descent for Online, Continual Prediction AAAI 2019
Learning Optimal Strategies to Commit To AAAI 2019
Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach AAAI 2019
Cascading Linear Submodular Bandits: Accounting for Position Bias and Diversity in Online Learning to Rank UAI 2019
Perturbed-History Exploration in Stochastic Linear Bandits UAI 2019
Blink: Fast Connectivity Recovery Entirely in the Data Plane NSDI 2019
Achieving a Fairer Future by Changing the Past IJCAI 2019
How to Tame Your Anticipatory Algorithm IJCAI 2019
Profit-driven Task Assignment in Spatial Crowdsourcing IJCAI 2019
Learn Smart with Less: Building Better Online Decision Trees with Fewer Training Examples IJCAI 2019