← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Online Learning with Transductive Regret NIPS 2017
Nonparametric Online Regression while Learning the Metric NIPS 2017
Online Dynamic Programming NIPS 2017
Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback NIPS 2017
Contextual Bandits with Latent Confounders: An NMF Approach AISTATS 2017
Playing Repeated Network Interdiction Games with Semi-Bandit Feedback IJCAI 2017
Efficient Online Linear Optimization with Approximation Algorithms NIPS 2017
Training Deep Networks without Learning Rates Through Coin Betting NIPS 2017
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation NIPS 2017
Stochastic and Adversarial Online Learning without Hyperparameters NIPS 2017
Regret Analysis for Continuous Dueling Bandit NIPS 2017
Learning with Bandit Feedback in Potential Games NIPS 2017
Countering Feedback Delays in Multi-Agent Learning NIPS 2017
Multi-objective Bandits: Optimizing the Generalized Gini Index ICML 2017
Online Summarization via Submodular and Convex Optimization CVPR 2017
Correlational Dueling Bandits with Application to Clinical Treatment in Large Decision Spaces IJCAI 2017
Optimal and Adaptive Off-policy Evaluation in Contextual Bandits ICML 2017
Context Attentive Bandits: Contextual Bandit with Restricted Context IJCAI 2017
Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads IJCAI 2017
Perishability of Data: Dynamic Pricing under Varying-Coefficient Models JMLR 2017
A KL-LUCB algorithm for Large-Scale Crowdsourcing NIPS 2017
Position-based Multiple-play Bandit Problem with Unknown Position Bias NIPS 2017
No Time to Observe: Adaptive Influence Maximization with Partial Feedback IJCAI 2017
Online Roommate Allocation Problem IJCAI 2017
Revenue Optimization with Approximate Bid Predictions NIPS 2017