← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

PAPRIKA: Private Online False Discovery Rate Control ICML 2021
Quantile Bandits for Best Arms Identification ICML 2021
Incentivized Bandit Learning with Self-Reinforcing User Preferences ICML 2021
On Optimal Robustness to Adversarial Corruption in Online Decision Problems NIPS 2021
Statistical Inference with M-Estimators on Adaptively Collected Data NIPS 2021
Logarithmic Regret in Feature-based Dynamic Pricing NIPS 2021
From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits NIPS 2021
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits NIPS 2021
Matrix games with bandit feedback UAI 2021
Prediction against a limited adversary JMLR 2021
Bandit Learning in Decentralized Matching Markets JMLR 2021
AI for Planning Public Health Interventions IJCAI 2021
Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds COLT 2021
Bootstrapping Battery-free Wireless Networks: Efficient Neighbor Discovery and Synchronization in the Face of Intermittency NSDI 2021
Simple combinatorial algorithms for combinatorial bandits: corruptions and approximations UAI 2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications COLT 2021
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition COLT 2021
Exploration by Optimisation in Partial Monitoring COLT 2020
Dimension-Free Bounds for Chasing Convex Functions COLT 2020
Smooth Contextual Bandits: Bridging the Parametric and Non-differentiable Regret Regimes COLT 2020
Frequency Configuration for Low-Power Wide-Area Networks in a Heartbeat NSDI 2020
Budget-Constrained Bandits over General Cost and Reward Distributions AISTATS 2020
Customizing ML Predictions for Online Algorithms ICML 2020
First-Order Methods for Large-Scale Market Equilibrium Computation NIPS 2020
Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm NIPS 2020