← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits AAAI 2020
Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory AAAI 2020
The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits AISTATS 2020
Safe Linear Stochastic Bandits AAAI 2020
MAP Inference for Customized Determinantal Point Processes via Maximum Inner Product Search AISTATS 2020
Improving Online Rent-or-Buy Algorithms with Sequential Decision Making and ML Predictions NIPS 2020
Online metric algorithms with untrusted predictions ICML 2020
What You See May Not Be What You Get: UCB Bandit Algorithms Robust to $\varepsilon$-Contamination UAI 2020
End-to-End Transition-Based Online Dialogue Disentanglement IJCAI 2020
Trade the System Efficiency for the Income Equality of Drivers in Rideshare IJCAI 2020
Non-Stochastic Control with Bandit Feedback NIPS 2020
High-Dimensional Sparse Linear Bandits NIPS 2020
Bounding Regret in Empirical Games AAAI 2020
Exploration Through Reward Biasing: Reward-Biased Maximum Likelihood Estimation for Stochastic Multi-Armed Bandits ICML 2020
Online Portfolio Selection with Cardinality Constraint and Transaction Costs based on Contextual Bandit IJCAI 2020
A Multiarmed Bandit Based Incentive Mechanism for a Subset Selection of Customers for Demand Response in Smart Grids AAAI 2020
Improper Learning for Non-Stochastic Control COLT 2020
Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack AAAI 2020
Improved Algorithms for Conservative Exploration in Bandits AAAI 2020
Optimizing Discrete Spaces via Expensive Evaluations: A Learning to Search Framework AAAI 2020
Path Planning Problems with Side Observations—When Colonels Play Hide-and-Seek AAAI 2020
No-regret Learning in Price Competitions under Consumer Reference Effects NIPS 2020
Contextual Games: Multi-Agent Learning with Side Information NIPS 2020
Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games NIPS 2020
SLIP: Learning to predict in unknown dynamical systems with long-term memory NIPS 2020