conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

1
16
59
225
69
'05
'10
'15
'20
'25

Papers

Multi-Objective Non-parametric Sequential Prediction NIPS 2017
Multi-Armed Bandits with Metric Movement Costs NIPS 2017
Conservative Contextual Linear Bandits NIPS 2017
A KL-LUCB algorithm for Large-Scale Crowdsourcing NIPS 2017
Position-based Multiple-play Bandit Problem with Unknown Position Bias NIPS 2017
Dynamic Revenue Sharing NIPS 2017
Random Permutation Online Isotonic Regression NIPS 2017
Online to Offline Conversions, Universality and Adaptive Minibatch Sizes NIPS 2017
Influence Maximization with $\varepsilon$-Almost Submodular Threshold Functions NIPS 2017
Improved Dynamic Regret for Non-degenerate Functions NIPS 2017
Welfare Guarantees from Data NIPS 2017
Online Convex Optimization with Stochastic Constraints NIPS 2017
Maxing and Ranking with Few Assumptions NIPS 2017
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe NIPS 2017
Identifying Outlier Arms in Multi-Armed Bandit NIPS 2017
Minimal Exploration in Structured Stochastic Bandits NIPS 2017
A framework for Multi-A(rmed)/B(andit) Testing with Online FDR Control NIPS 2017
Interactive Submodular Bandit NIPS 2017
Balancing information exposure in social networks NIPS 2017
Linear Thompson Sampling Revisited AISTATS 2017
Online Optimization of Smoothed Piecewise Constant Functions AISTATS 2017
Contextual Bandits with Latent Confounders: An NMF Approach AISTATS 2017
Unsupervised Sequential Sensor Acquisition AISTATS 2017
Improved Strongly Adaptive Online Learning using Coin Betting AISTATS 2017
New bounds on the price of bandit feedback for mistake-bounded online multiclass learning ALT 2017