conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

806 papers

Papers per year

6
24
87
21
'10
'15
'20
'25

Papers

Data driven semi-supervised learning NIPS 2021
Learning-to-learn non-convex piecewise-Lipschitz functions NIPS 2021
Decentralized Learning in Online Queuing Systems NIPS 2021
Dueling Bandits with Team Comparisons NIPS 2021
Efficient Online Estimation of Causal Effects by Deciding What to Observe NIPS 2021
An online passive-aggressive algorithm for difference-of-squares classification NIPS 2021
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization NIPS 2021
Bandits with many optimal arms NIPS 2021
Observation-Free Attacks on Stochastic Bandits NIPS 2021
Bandit Learning with Delayed Impact of Actions NIPS 2021
Bandit Quickest Changepoint Detection NIPS 2021
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent AAAI 2021
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games AAAI 2021
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions AAAI 2021
On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021
Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback AAAI 2021
Reinforcement Learning with Trajectory Feedback AAAI 2021
Regret Bounds for Batched Bandits AAAI 2021
Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits AAAI 2021
Stochastic Graphical Bandits with Adversarial Corruptions AAAI 2021
Federated Multi-Armed Bandits AAAI 2021
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions AAAI 2021
Robust Bandit Learning with Imperfect Context AAAI 2021
Regret Bounds for Online Kernel Selection in Continuous Kernel Space AAAI 2021
Dual-Mandate Patrols: Multi-Armed Bandits for Green Security AAAI 2021