← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Online convex optimization for cumulative constraints NIPS 2018
Differential Privacy for Growing Databases NIPS 2018
Robust Subspace Approximation in a Stream NIPS 2018
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy ICML 2018
Anytime Focal Search with Applications IJCAI 2018
Causal Bandits with Propagating Inference ICML 2018
Online Adaptive Methods, Universality and Acceleration NIPS 2018
Efficient online algorithms for fast-rate regret bounds under sparsity NIPS 2018
Scalar Posterior Sampling with Applications NIPS 2018
An Information-Theoretic Analysis for Thompson Sampling with Many Actions NIPS 2018
Acceleration through Optimistic No-Regret Dynamics NIPS 2018
TopRank: A practical algorithm for online stochastic ranking NIPS 2018
Community Exploration: From Offline Optimization to Online Learning NIPS 2018
Online Learning of Quantum States NIPS 2018
On preserving non-discrimination when combining expert advice NIPS 2018
Optimal Bidding Strategy for Brand Advertising IJCAI 2018
Enhancing the Accuracy and Fairness of Human Decision Making NIPS 2018
Contextual bandits with surrogate losses: Margin bounds and efficient algorithms NIPS 2018
Online Learning with an Unknown Fairness Metric NIPS 2018
Adaptive Online Learning in Dynamic Environments NIPS 2018
Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence ALT 2018
{Multi-Player Bandits Revisited} ALT 2018
Sparsity, variance and curvature in multi-armed bandits ALT 2018
Bandit Regret Scaling with the Effective Loss Range ALT 2018
A Better Resource Allocation Algorithm with Semi-Bandit Feedback ALT 2018